Prime avoidance lemma

If an ideal is contained in a finite union of prime ideals, then it is contained in one of them.
Prime avoidance lemma

Let RR be a . The prime avoidance lemma is a basic tool for producing elements outside finitely many prime ideals (and is used constantly in arguments about , localizations, and dimension theory).

Statement

Let I,a1,,anI,\mathfrak a_1,\dots,\mathfrak a_n be ideals of RR. Assume that a2,,an\mathfrak a_2,\dots,\mathfrak a_n are prime ideals (no hypothesis on a1\mathfrak a_1). If

Ia1a2an, I \subseteq \mathfrak a_1 \cup \mathfrak a_2 \cup \cdots \cup \mathfrak a_n,

then IajI \subseteq \mathfrak a_j for some j{1,,n}j\in\{1,\dots,n\}.

A common special case (often the only one needed) is:

If p1,,pn\mathfrak p_1,\dots,\mathfrak p_n are prime ideals and

>Ip1pn,> > I \subseteq \mathfrak p_1\cup\cdots\cup \mathfrak p_n, >

then IpiI\subseteq \mathfrak p_i for some ii.

Equivalently (and often how it is used): if II is an ideal not contained in any of the prime ideals p1,,pn\mathfrak p_1,\dots,\mathfrak p_n, then there exists an element xIx\in I such that xp1pnx\notin \mathfrak p_1\cup\cdots\cup \mathfrak p_n.

This “element-choosing” form underlies many constructions, for example when passing to a to avoid certain primes or when proving facts about basic open sets in .

Examples

  1. In Z\mathbb Z.
    Take R=ZR=\mathbb Z, I=(6)I=(6), and p1=(2)\mathfrak p_1=(2), p2=(3)\mathfrak p_2=(3) (both prime ideals). Then

    (6)(2)(3) (6)\subseteq (2)\cup(3)

    because every multiple of 66 is divisible by 22 (and also by 33). Prime avoidance correctly concludes that (6)(2)(6)\subseteq (2) or (6)(3)(6)\subseteq (3) (in fact both hold).

  2. Choosing an element outside a finite union.
    In R=k[x,y]R=k[x,y] over a field kk, let p1=(x)\mathfrak p_1=(x) and p2=(y)\mathfrak p_2=(y), both prime. The ideal I=(x,y)I=(x,y) is not contained in p1\mathfrak p_1 and is not contained in p2\mathfrak p_2. Prime avoidance therefore guarantees an element of II outside p1p2\mathfrak p_1\cup\mathfrak p_2; concretely, x+y(x,y)x+y\in (x,y) but x+y(x)x+y\notin (x) and x+y(y)x+y\notin (y).

  3. Why finiteness matters (failure for infinite unions).
    Let R=k[x1,x2,]R=k[x_1,x_2,\dots] be a polynomial ring in infinitely many variables over a field kk, and let

    I=(x1,x2,). I=(x_1,x_2,\dots).

    For each nn, the ideal pn=(x1,,xn)\mathfrak p_n=(x_1,\dots,x_n) is prime. Every element of II involves only finitely many variables, so it belongs to pn\mathfrak p_n for some nn, hence

    In1pn. I \subseteq \bigcup_{n\ge 1}\mathfrak p_n.

    But II is not contained in any single pn\mathfrak p_n (since xn+1Ix_{n+1}\in I but xn+1pnx_{n+1}\notin \mathfrak p_n). This shows the lemma is genuinely a finite-union phenomenon.