Prime avoidance lemma
Let be a commutative ring . The prime avoidance lemma is a basic tool for producing elements outside finitely many prime ideals (and is used constantly in arguments about Spec(R) , localizations, and dimension theory).
Statement
Let be ideals of . Assume that are prime ideals (no hypothesis on ). If
then for some .
A common special case (often the only one needed) is:
If are prime ideals and
then for some .
Equivalently (and often how it is used): if is an ideal not contained in any of the prime ideals , then there exists an element such that .
This “element-choosing” form underlies many constructions, for example when passing to a localization to avoid certain primes or when proving facts about basic open sets in the Zariski topology .
Examples
In .
Take , , and , (both prime ideals). Thenbecause every multiple of is divisible by (and also by ). Prime avoidance correctly concludes that or (in fact both hold).
Choosing an element outside a finite union.
In over a field , let and , both prime. The ideal is not contained in and is not contained in . Prime avoidance therefore guarantees an element of outside ; concretely, but and .Why finiteness matters (failure for infinite unions).
Let be a polynomial ring in infinitely many variables over a field , and letFor each , the ideal is prime. Every element of involves only finitely many variables, so it belongs to for some , hence
But is not contained in any single (since but ). This shows the lemma is genuinely a finite-union phenomenon.