Ma · Mathematics

Proof of the Weak Hilbert Nullstellensatz

Published By the 9to5Science editorial team

At a glance

  1. 1. Choose a maximal ideal

    Start with a maximal ideal in the polynomial ring over an algebraically closed field.

  2. 2. Pass to the quotient

    The quotient by a maximal ideal is a field generated as a k-algebra by the coordinate classes.

  3. 3. Apply Zariski's lemma

    A field finitely generated as a k-algebra is a finite algebraic extension of k.

  4. 4. Identify the point

    Algebraic closedness makes the quotient k, so each coordinate class is a scalar.

The weak Hilbert Nullstellensatz identifies the maximal ideals of a polynomial ring over an algebraically closed field. It says that these ideals are exactly the ideals of polynomials that vanish at individual points. The proof reduces the claim to Zariski’s lemma about fields that are finitely generated as algebras.

Throughout, let kk be an algebraically closed field and let R=k[x1,…,xn]R=k[x_1,\ldots,x_n]. Rings are assumed commutative and have an identity.

The statement

For every maximal ideal m\mathfrak m of RR, there are scalars a1,…,an∈ka_1,\ldots,a_n\in k such that

m=(x1−a1,…,xn−an).\mathfrak m=(x_1-a_1,\ldots,x_n-a_n).

Conversely, every ideal of this form is maximal: evaluating a polynomial at (a1,…,an)(a_1,\ldots,a_n) gives a surjective ring homomorphism R→kR\to k whose kernel is that ideal, so its quotient is the field kk.

A related formulation is that every proper ideal I⊊RI\subsetneq R has a common zero in knk^n. Indeed, a proper ideal is contained in a maximal ideal, and the maximal-ideal statement supplies a point where every element of that maximal ideal—and therefore every element of II—vanishes.

The key lemma: Zariski’s lemma

Lemma. If a field LL is finitely generated as a kk-algebra, then LL is a finite algebraic extension of kk.

Here “finitely generated as a kk-algebra” means that L=k[b1,…,bm]L=k[b_1,\ldots,b_m] for finitely many elements bib_i. This is stronger than saying that LL is finitely generated as a field extension; the distinction matters.

To prove the lemma, choose a largest algebraically independent subset of the generators, say b1,…,brb_1,\ldots,b_r. The remaining generators are algebraic over K=k(b1,…,br)K=k(b_1,\ldots,b_r). Since there are only finitely many of them, they generate a finite extension of KK as a field.

Suppose, for a contradiction, that r>0r>0. Each remaining generator satisfies a monic polynomial over KK. The coefficients of these finitely many equations are rational functions in b1,…,brb_1,\ldots,b_r. Choose a nonzero polynomial f∈k[b1,…,br]f\in k[b_1,\ldots,b_r] that clears all their denominators, and set

A=k[b1,…,br,1/f].A=k[b_1,\ldots,b_r,1/f].

Each remaining generator is then integral over AA. Also, because LL is a field and f≠0f\ne 0, the element 1/f1/f belongs to LL. Thus L=A[br+1,…,bm]L=A[b_{r+1},\ldots,b_m] is integral over AA.

If a field is integral over a subring, that subring must itself be a field. In fact, for any nonzero a∈Aa\in A, its inverse in LL is integral over AA. A monic equation for a−1a^{-1}, multiplied by a suitable power of aa, expresses a−1a^{-1} as an element of AA.

But AA is not a field when r>0r>0. To see this, regard ff as a polynomial in b1b_1 over the field k(b2,…,br)k(b_2,\ldots,b_r) (interpreted as kk if r=1r=1). Since kk is infinite, choose c∈kc\in k that is not a root of this nonzero polynomial. Then q(b1)=b1−cq(b_1)=b_1-c is irreducible in k[b1]k[b_1] and does not divide ff. It remains a nonunit after localizing at ff: no power of ff is divisible by q(b1)q(b_1). This contradicts that AA is a field. Therefore r=0r=0, so all the generators are algebraic over kk. Finitely many algebraic generators give a finite algebraic extension, proving the lemma.

Proof of the weak Nullstellensatz

Let m\mathfrak m be a maximal ideal of RR, and form the quotient

L=R/m.L=R/\mathfrak m.

Because m\mathfrak m is maximal, LL is a field. It is generated as a kk-algebra by the residue classes xˉ1,…,xˉn\bar x_1,\ldots,\bar x_n of the variables. Zariski’s lemma therefore says that LL is a finite algebraic extension of kk.

Since kk is algebraically closed, it has no proper algebraic field extensions. Hence L=kL=k. In particular, each coordinate class xˉi\bar x_i is equal to some scalar ai∈ka_i\in k. This means xi−ai∈mx_i-a_i\in\mathfrak m for each ii, so

(x1−a1,…,xn−an)⊆m.(x_1-a_1,\ldots,x_n-a_n)\subseteq\mathfrak m.

The ideal on the left is maximal, since its quotient is kk. A maximal ideal cannot be properly contained in another proper ideal, so equality follows. This proves the theorem.

A concrete example

Take R=C[x,y]R=\mathbb C[x,y] and m=(x−2,y+1)\mathfrak m=(x-2,y+1). The quotient sends xx to 22 and yy to −1-1, giving

C[x,y]/m≅C.\mathbb C[x,y]/\mathfrak m\cong\mathbb C.

Thus m\mathfrak m is maximal and corresponds to the point (2,−1)(2,-1). Every polynomial in m\mathfrak m vanishes at that point. For example, x2+xy−2yx^2+xy-2y has value 4−2+2=44-2+2=4 there, so it does not belong to this ideal. This check illustrates the criterion: membership in this maximal ideal requires evaluation to be zero. By contrast, x+y−1x+y-1 does belong, because its value there is 2−1−1=02-1-1=0.

Common mistakes

  • Using algebraic closedness too early. The quotient by a maximal ideal is first shown to be a finitely generated field extension. Zariski’s lemma makes it algebraic; only then does algebraic closedness force it to equal kk.
  • Confusing algebra generation with field generation. The lemma applies to a field that is finitely generated as a ring over kk, not merely as a field extension.
  • Claiming every proper ideal is maximal. The theorem classifies maximal ideals. A general proper ideal need not be maximal; it is contained in at least one maximal ideal.
  • Dropping the field hypothesis. For a field kk that is not algebraically closed, maximal ideals can have quotients that are proper finite algebraic extensions of kk. The algebraically closed assumption is what ensures the quotient is exactly kk.

References

  1. Introduction to Commutative Algebra — Michael Atiyah and Ian G. Macdonald
  2. Ideals, Varieties, and Algorithms — David A. Cox, John Little, and Donal O'Shea

Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.