Prime Avoidance Lemma

An ideal contained in a finite union of (mostly) prime ideals must lie in one of them.
Prime Avoidance Lemma

Statement

Let RR be a commutative ring and let I,J1,,JnI, J_1,\dots,J_n be of RR. Assume that J2,,JnJ_2,\dots,J_n are . If

IJ1J2Jn, I \subseteq J_1 \,\cup\, J_2 \,\cup\, \cdots \,\cup\, J_n,

then IJkI \subseteq J_k for some k{1,,n}k\in\{1,\dots,n\}.

Equivalently (the “avoidance” form): if I⊈JiI\not\subseteq J_i for every ii, then there exists an element

xIwithxi=1nJi. x\in I \quad\text{with}\quad x\notin \bigcup_{i=1}^n J_i.

This lemma is frequently used to choose elements that avoid finitely many primes, e.g. when forming a or proving existence of “good” elements in a .

Examples

  1. Avoiding two coordinate primes.
    Let R=k[x,y]R=k[x,y], J1=(x)J_1=(x), J2=(y)J_2=(y). Both are prime.
    Take I=(x,y)I=(x,y). Then I⊈(x)I\not\subseteq (x) and I⊈(y)I\not\subseteq (y). Prime avoidance guarantees some f(x,y)f\in (x,y) is in neither (x)(x) nor (y)(y).
    Concretely, f=x+y(x,y)f=x+y\in (x,y), and x+y(x)x+y\notin (x), x+y(y)x+y\notin (y).

  2. Why “finite union” matters (failure for infinite unions).
    Let R=k[x1,x2,x3,]R=k[x_1,x_2,x_3,\dots] (infinitely many variables) and I=(x1,x2,x3,)I=(x_1,x_2,x_3,\dots).
    For each n1n\ge 1, set Pn=(x1,,xn)P_n=(x_1,\dots,x_n). Each PnP_n is prime, and

    I=n1Pn I=\bigcup_{n\ge 1} P_n

    because any polynomial in II involves only finitely many variables.
    But I⊈PnI\not\subseteq P_n for any fixed nn (since xn+1IPnx_{n+1}\in I\setminus P_n).
    So prime avoidance can fail for infinite unions.

  3. Picking a non-nilpotent element.
    If RR has finitely many minimal prime ideals P1,,PrP_1,\dots,P_r and an ideal II is not contained in any PiP_i, then prime avoidance yields xIiPix\in I\setminus \bigcup_i P_i.
    In particular, xx is not contained in every prime ideal, so xx is not nilpotent (compare ).