Prime avoidance lemma
ProvedFamousTheorems.prime_avoidance_7bPrime avoidance. Let be a commutative ring, an ideal and ideals of , all prime except possibly two of them. If , then for some .
Prime avoidance is used constantly in commutative algebra. Typical applications are the existence of an element of an ideal outside finitely many primes, and so of regular elements, systems of parameters and generic linear forms. It enters the proofs of Krull's height theorem and of the existence of maximal regular sequences.
Formalization note. Mathlib's Ideal.subset_union_prime. The ideals are indexed by a finite set , and the two indices are the ones that need not be prime. The statement is an equivalence, the converse direction being trivial.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem prime_avoidance_7b {ι R : Type*} [CommRing R] {s : Finset ι} {f : ι → Ideal R} (a b : ι)
(hp : ∀ i ∈ s, i ≠ a → i ≠ b → (f i).IsPrime) {I : Ideal R} :
((I : Set R) ⊆ ⋃ i ∈ (s : Set ι), (f i : Set R)) ↔ ∃ i ∈ s, I ≤ f i := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Ideal.subset_union_prime`. Proof here reduces to that Mathlib result.