Hilbert's Nullstellensatz

From Wikipedia, the free encyclopedia
(Redirected from Nullstellensatz)
Jump to navigation Jump to search

Template:Short description In mathematics, Hilbert's Nullstellensatz (German for "theorem of zeros", or more literally, "zero-locus-theorem") is a theorem that establishes a fundamental relationship between geometry and algebra. This relationship is the basis of algebraic geometry. It relates algebraic sets to ideals in polynomial rings over algebraically closed fields. This relationship was discovered by David Hilbert, who proved the Nullstellensatz in his second major paper on invariant theory in 1893 (following his seminal 1890 paper in which he proved Hilbert's basis theorem).

Formulations

Let k be a field (such as the rational numbers) and K be an algebraically closed field extension of k (such as the complex numbers). Consider the polynomial ring k[X1,,Xn] and let J be an ideal in this ring. The algebraic set V(J) defined by this ideal consists of all n-tuples a=(a1,,an) in Kn such that f(a)=0 for all fJ. Hilbert's Nullstellensatz states that if p is a polynomial in k[X1,,Xn] that vanishes on the algebraic set V(J), i.e., p(a)=0 for all aV(J), then there exists a natural number r such that prJ.[1]

With the notation common in algebraic geometry, the Nullstellensatz can be formulated as

I(V(J))=J

for every ideal J in K[X1,...,Xn] with K algebraically closed. Here, J denotes the radical of J (pJ if and only if r, prJ), I(U) is the vanishing ideal of U (the set of polynomials that vanish at the points in U), and V(J) is the zero locus of J (the set of points at which the polynomials in J vanish). The assertion that I(V(J))J is equivalent to the first formulation above with k = K algebraically closed, while the opposite inclusion is a straightforward consequence of the definitions.

An immediate corollary is the weak Nullstellensatz: If J is a proper ideal in k[X1,,Xn], then V(J) is nonempty, i.e., for every algebraically closed extension Kk, there exists a common zero in Kn for all the polynomials in the ideal J. This is the reason for the name of the theorem, the full version of which can be proved easily from the 'weak' form using the Rabinowitsch trick. The assumption of considering common zeros in an algebraically closed field is essential here; for example, the elements of the proper ideal (X2+1) in [X] do not have a common zero in .

In its most elementary formulation, the weak Nullstellensatz asserts the following: Given a family of polynomials P1,...,PmK[X1,...,Xn] (K algebraically closed), only two mutually exclusive scenarios are possible: (1) There are polynomials Q1,...,QmK[X1,...,Xn] such that P1Q1++PmQm=1 (here, 1 represents the constant polynomial 1K[X1,...,Xn]). (2) There exists a solution a=(a1,...,an)Kn to the system of simultaneous equations P1(a)==Pm(a)=0.[2] Specializing to the case of a single polynomial when K= and n=1, one immediately recovers a restatement of the fundamental theorem of algebra: A polynomial P in [X] has a root in if and only if degP0. For this reason, the (weak) Nullstellensatz applied to K= can be thought of as a generalization of the fundamental theorem of algebra to systems of multivariable polynomial equations.[3]

Taking K to be algebraically closed, the Nullstellensatz establishes an order-reversing bijective correspondence between the algebraic sets in Kn and the radical ideals of K[X1,,Xn]. In fact, more generally, one has a Galois connection between subsets of the space and subsets of the algebra, where "Zariski closure" and "radical of the ideal generated" are the closure operators.

As a particular example, consider an algebraic set consisting of a single point a=(a1,,an)Kn. Then I({a})=(X1a1,,Xnan) is a maximal ideal. Conversely, every maximal ideal of the polynomial ring K[X1,,Xn] (note that K is algebraically closed) is of the form (X1a1,,Xnan) for some a1,,anK. This characterization of maximal ideals of polynomial rings over algebraically closed fields is another common formulation of the weak Nullstellensatz. As another example of this correspondence and a consequence of the Nullstellensatz, one can show that an algebraic subset W in Kn is irreducible (in the Zariski topology) if and only if I(W) is a prime ideal.

More generally, for any ideal J in K[X1,...,Xn],

J=𝔪J𝔪=(a1,,an)V(J)(X1a1,,Xnan),

where the first intersection is taken over maximal ideals 𝔪K[X1,...,Xn]. This relationship is yet another common formulation of the Nullstellensatz. (The first equality actually holds for ideals in any Jacobson ring, including any finitely generated algebra over a field, while the second equality holds for algebraically closed K.)

Proofs

There are many known proofs of the theorem. Some are non-constructive, such as the first one. Others are constructive, as based on algorithms for expressing 1Script error: No such module "Check for unknown parameters". or prScript error: No such module "Check for unknown parameters". as a linear combination of the generators of the ideal.

Using Zariski's lemma

Zariski's lemma asserts that if a field is finitely generated as an associative algebra over a field K, then it is a finite field extension of K (that is, it is also finitely generated as a vector space). If K is an algebraically closed field and 𝔪 is a maximal ideal of the ring of polynomials K[X1,,Xn], then Zariski's lemma implies that K[X1,,Xn]/𝔪 is a finite field extension of K, and thus, by algebraic closure, must be K. From this, it follows that there is an a=(a1,,an)Kn such that Xiai𝔪 for i=1,,n. In other words,

𝔪𝔪a=(X1a1,,Xnan)

for some a=(a1,,an)Kn. But 𝔪a is clearly maximal, so 𝔪=𝔪a. This is the weak Nullstellensatz: every maximal ideal of K[X1,,Xn] for algebraically closed K is of the form 𝔪a=(X1a1,,Xnan) for some a=(a1,,an)Kn. Because of this close relationship, some texts refer to Zariski's lemma as the weak Nullstellensatz or as the 'algebraic version' of the weak Nullstellensatz.[4][5]

The full Nullstellensatz can also be proved directly from Zariski's lemma without employing the Rabinowitsch trick. Here is a sketch of a proof using this lemma.[6]

Let A=K[X1,,Xn] for algebraically closed field K, and let J be an ideal of A and V=V(J) be the common zeros of J in Kn. Clearly, JI(V), where I(V) is the ideal of polynomials in A vanishing on V. To show the opposite inclusion, let f∉J. Then f∉𝔭 for some prime ideal 𝔭J in A. Let R=(A/𝔭)[1/f¯], where f¯is the image of f under the natural map AA/𝔭, and 𝔪 be a maximal ideal in R. By Zariski's lemma, R/𝔪 is a finite extension of K, and thus, is K since K is algebraically closed. Let xi be the images of Xi under the natural map AA/𝔭RR/𝔪K. It follows that, by construction, x=(x1,,xn)V but f(x)0, so fI(V).

Using resultants

The following constructive proof of the weak form is one of the oldest proofs (the strong form results from the Rabinowitsch trick, which is also constructive).

The resultant of two polynomials depending on a variable Template:Mvar and other variables is a polynomial in the other variables that is in the ideal generated by the two polynomials, and has the following properties: if one of the polynomials is monic in Template:Mvar, every zero (in the other variables) of the resultant may be extended into a common zero of the two polynomials.

The proof is as follows.

If the ideal is principal, generated by a non-constant polynomial Template:Mvar that depends on Template:Mvar, one chooses arbitrary values for the other variables. The fundamental theorem of algebra asserts that this choice can be extended to a zero of Template:Mvar.

In the case of several polynomials p1,,pn, a linear change of variables allows to suppose that p1 is monic in the first variable Template:Mvar. Then, one introduces n1 new variables u2,,un, and one considers the resultant

R=Resx(p1,u2p2++unpn).

As Template:Mvar is in the ideal generated by p1,,pn, the same is true for the coefficients in Template:Mvar of the monomials in u2,,un. So, if 1Script error: No such module "Check for unknown parameters". is in the ideal generated by these coefficients, it is also in the ideal generated by p1,,pn. On the other hand, if these coefficients have a common zero, this zero can be extended to a common zero of p1,,pn, by the above property of the resultant.

This proves the weak Nullstellensatz by induction on the number of variables.

Using Gröbner bases

A Gröbner basis is an algorithmic concept that was introduced in 1973 by Bruno Buchberger. It is presently fundamental in computational geometry. A Gröbner basis is a special generating set of an ideal from which most properties of the ideal can easily be extracted. Those that are related to the Nullstellensatz are the following:

  • An ideal contains 1Script error: No such module "Check for unknown parameters". if and only if its reduced Gröbner basis (for any monomial ordering) is 1Script error: No such module "Check for unknown parameters"..
  • The number of the common zeros of the polynomials in a Gröbner basis is strongly related to the number of monomials that are irreducibles by the basis. Namely, the number of common zeros is infinite if and only if the same is true for the irreducible monomials; if the two numbers are finite, the number of irreducible monomials equals the numbers of zeros (in an algebraically closed field), counted with multiplicities.
  • With a lexicographic monomial order, the common zeros can be computed by solving iteratively univariate polynomials (this is not used in practice since one knows better algorithms).
  • Strong Nullstellensatz: a power of Template:Mvar belongs to an ideal Template:Mvar if and only the saturation of Template:Mvar by Template:Mvar produces the Gröbner basis 1Script error: No such module "Check for unknown parameters".. Thus, the strong Nullstellensatz results almost immediately from the definition of the saturation.

Generalizations

The Nullstellensatz is subsumed by a systematic development of the theory of Jacobson rings, which are those rings in which every radical ideal is an intersection of maximal ideals. Given Zariski's lemma, proving the Nullstellensatz amounts to showing that if k is a field, then every finitely generated k-algebra R (necessarily of the form R=k[t1,,tn]/I) is Jacobson. More generally, one has the following theorem:

Let R be a Jacobson ring. If S is a finitely generated R-algebra, then S is a Jacobson ring. Furthermore, if 𝔫S is a maximal ideal, then 𝔪:=𝔫R is a maximal ideal of R, and S/𝔫 is a finite extension of R/𝔪.[7]

Other generalizations proceed from viewing the Nullstellensatz in scheme-theoretic terms as saying that for any field k and nonzero finitely generated k-algebra R, the morphism SpecRSpeck admits a section étale-locally (equivalently, after base change along SpecLSpeck for some finite field extension L/k). In this vein, one has the following theorem:

Any faithfully flat morphism of schemes f:YX locally of finite presentation admits a quasi-section, in the sense that there exists a faithfully flat and locally quasi-finite morphism g:XX locally of finite presentation such that the base change f:Y×XXX of f along g admits a section.[8] Moreover, if X is quasi-compact (resp. quasi-compact and quasi-separated), then one may take X to be affine (resp. X affine and g quasi-finite), and if f is smooth surjective, then one may take g to be étale.[9]

Serge Lang gave an extension of the Nullstellensatz to the case of infinitely many generators:

Let κ be an infinite cardinal and let K be an algebraically closed field whose transcendence degree over its prime subfield is strictly greater than κ. Then for any set S of cardinality κ, the polynomial ring A=K[xi]iS satisfies the Nullstellensatz, i.e., for any ideal JA we have that J=I(V(J)).[10]

Effective Nullstellensatz

In all of its variants, Hilbert's Nullstellensatz asserts that some polynomial Template:Mvar belongs or not to an ideal generated, say, by f1, ..., fkScript error: No such module "Check for unknown parameters".; we have g = f rScript error: No such module "Check for unknown parameters". in the strong version, g = 1Script error: No such module "Check for unknown parameters". in the weak form. This means the existence or the non-existence of polynomials g1, ..., gkScript error: No such module "Check for unknown parameters". such that g = f1g1 + ... + fkgkScript error: No such module "Check for unknown parameters".. The usual proofs of the Nullstellensatz are not constructive, non-effective, in the sense that they do not give any way to compute the giScript error: No such module "Check for unknown parameters"..

It is thus a rather natural question to ask if there is an effective way to compute the giScript error: No such module "Check for unknown parameters". (and the exponent Template:Mvar in the strong form) or to prove that they do not exist. To solve this problem, it suffices to provide an upper bound on the total degree of the giScript error: No such module "Check for unknown parameters".: such a bound reduces the problem to a finite system of linear equations that may be solved by usual linear algebra techniques. Any such upper bound is called an effective Nullstellensatz.

A related problem is the ideal membership problem, which consists in testing if a polynomial belongs to an ideal. For this problem also, a solution is provided by an upper bound on the degree of the giScript error: No such module "Check for unknown parameters".. A general solution of the ideal membership problem provides an effective Nullstellensatz, at least for the weak form.

In 1925, Grete Hermann gave an upper bound for ideal membership problem that is doubly exponential in the number of variables. In 1982 Mayr and Meyer gave an example where the giScript error: No such module "Check for unknown parameters". have a degree that is at least double exponential, showing that every general upper bound for the ideal membership problem is doubly exponential in the number of variables.

Since most mathematicians at the time assumed the effective Nullstellensatz was at least as hard as ideal membership, few mathematicians sought a bound better than double-exponential. In 1987, however, W. Dale Brownawell gave an upper bound for the effective Nullstellensatz that is simply exponential in the number of variables.[11] Brownawell's proof relied on analytic techniques valid only in characteristic 0, but, one year later, János Kollár gave a purely algebraic proof, valid in any characteristic, of a slightly better bound.

In the case of the weak Nullstellensatz, Kollár's bound is the following:[12]

Let f1, ..., fsScript error: No such module "Check for unknown parameters". be polynomials in n ≥ 2Script error: No such module "Check for unknown parameters". variables, of total degree d1 ≥ ... ≥ dsScript error: No such module "Check for unknown parameters".. If there exist polynomials giScript error: No such module "Check for unknown parameters". such that f1g1 + ... + fsgs = 1Script error: No such module "Check for unknown parameters"., then they can be chosen such that
deg(figi)max(ds,3)j=1min(n,s)1max(dj,3).
This bound is optimal if all the degrees are greater than 2.

If Template:Mvar is the maximum of the degrees of the fiScript error: No such module "Check for unknown parameters"., this bound may be simplified to

max(3,d)min(n,s).

An improvement due to M. Sombra is[13]

deg(figi)2dsj=1min(n,s)1dj.

His bound improves Kollár's as soon as at least two of the degrees that are involved are lower than 3.

Projective Nullstellensatz

We can formulate a certain correspondence between homogeneous ideals of polynomials and algebraic subsets of a projective space, called the projective Nullstellensatz, that is analogous to the affine one. To do that, we introduce some notations. Let R=k[t0,,tn]. The homogeneous ideal,

R+=d1Rd

is called the maximal homogeneous ideal (see also irrelevant ideal). As in the affine case, we let: for a subset Sn and a homogeneous ideal I of R,

In(S)={fR+f=0 on S},Vn(I)={xnf(x)=0 for all fI}.

By f=0 on S we mean: for every homogeneous coordinates (a0::an) of a point of S we have f(a0,,an)=0. This implies that the homogeneous components of f are also zero on S and thus that In(S) is a homogeneous ideal. Equivalently, In(S) is the homogeneous ideal generated by homogeneous polynomials f that vanish on S. Now, for any homogeneous ideal IR+, by the usual Nullstellensatz, we have:

I=In(Vn(I)),

and so, like in the affine case, we have:[14]

There exists an order-reversing one-to-one correspondence between proper homogeneous radical ideals of R and subsets of n of the form Vn(I). The correspondence is given by In and Vn.

Analytic Nullstellensatz (Rückert’s Nullstellensatz)

The Nullstellensatz also holds for the germs of holomorphic functions at a point of complex n-space n. Precisely, for each open subset Un, let 𝒪n(U) denote the ring of holomorphic functions on U; then 𝒪n is a sheaf on n. The stalk 𝒪n,0 at, say, the origin can be shown to be a Noetherian local ring that is a unique factorization domain.

If f𝒪n,0 is a germ represented by a holomorphic function f~:U, then let V0(f) be the equivalence class of the set

{zUf~(z)=0},

where two subsets X,Yn are considered equivalent if XU=YU for some neighborhood U of 0. Note V0(f) is independent of a choice of the representative f~. For each ideal I𝒪n,0, let V0(I) denote V0(f1)V0(fr) for some generators f1,,fr of I. It is well-defined; i.e., is independent of a choice of the generators.

For each subset Xn, let

I0(X)={f𝒪n,0V0(f)X}.

It is easy to see that I0(X) is an ideal of 𝒪n,0 and that I0(X)=I0(Y) if XY in the sense discussed above.

The analytic Nullstellensatz then states:[15] for each ideal I𝒪n,0,

I=I0(V0(I))

where the left-hand side is the radical of I.

Formal Nullstellensatz

In classical algebraic geometry, the zero locus ('variety') operation (V) is applied to subsets of the ring of polynomials over an algebraically closed field, while the vanishing ideal operation (I) is applied to subsets of affine n-space, whose points are in one-to-one correspondence with the maximal ideals of the polynomial ring by the weak Nullstellensatz (see above). In scheme theory, V and I are generalized and redefined so that they could be applied to subsets of arbitrary commutative (unital) rings and their prime spectra, respectively. In particular, for any commutative ring A, its set of prime ideals (prime spectrum) Spec A, and subsets SA and XSpec A, we set

𝕍(S)={𝔭Spec A𝔭S} and 𝕀(X)=𝔭X𝔭.

Then for any ideal JA, a formal analogue of Hilbert's Nullstellensatz holds:

𝕀(𝕍(J))=𝔭𝕍(J)𝔭=𝔭Spec A, 𝔭J𝔭=J,

where the last equality follows from a standard property of prime ideals from commutative algebra.[16] In analogy to zero loci in the classical theory, the 𝕍(S) are used to define the closed sets in the Zariski topology of Spec A.[5]

See also

Notes

<templatestyles src="Reflist/styles.css" />

  1. Script error: No such module "Footnotes"..
  2. Script error: No such module "citation/CS1".
  3. Script error: No such module "citation/CS1".
  4. Script error: No such module "citation/CS1".
  5. a b Script error: No such module "citation/CS1".
  6. Script error: No such module "Footnotes"., Exercise 7.14.
  7. Script error: No such module "citation/CS1".
  8. EGA §IV.17.16.2.
  9. EGA §IV.17.16.3(ii).
  10. Script error: No such module "Citation/CS1".
  11. Script error: No such module "citation/CS1".
  12. Script error: No such module "citation/CS1".
  13. Script error: No such module "citation/CS1".
  14. This formulation comes from Milne, Algebraic geometry [1] and differs from Script error: No such module "Footnotes".
  15. Script error: No such module "Footnotes".
  16. Script error: No such module "citation/CS1".

Script error: No such module "Check for unknown parameters".

References

  • Script error: No such module "Citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Template:Hartshorne AG
  • Script error: No such module "Citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".