Hilbert's Nullstellensatz

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).

Formulation

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[X_1,\dots ,X_n]$ and let $I$ be an ideal in this ring. The algebraic set $\mathrm{V}(I)$ defined by this ideal consists of all $n$-tuples $𝐱=(x_1,\dots ,x_n)$ in $K^n$ such that $f(𝐱)=0$ for all $f$ in Template:Awrap Hilbert's Nullstellensatz states that if p is some polynomial in $k[X_1,\dots ,X_n]$ that vanishes on the algebraic set $\mathrm{V}(I)$, i.e. $p(𝐱)=0$ for all $𝐱$ in $\mathrm{V}(I)$, then there exists a natural number $r$ such that $p^r$ is in $I$.

An immediate corollary is the weak Nullstellensatz: The ideal $I\subseteq k[X_1,\dots ,X_n]$ contains 1 if and only if the polynomials in $I$ do not have any common zeros in Kⁿ. Specializing to the case $k=K=ℂ,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 deg P ≠ 0. For this reason, the (weak) Nullstellensatz has been referred to as a generalization of the fundamental theorem of algebra for multivariable polynomials. The weak Nullstellensatz may also be formulated as follows: if I is a proper ideal in $k[X_1,\dots ,X_n],$ then V(I) cannot be empty, i.e. there exists a common zero for all the polynomials in the ideal in every algebraically closed extension of k. 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 (X² + 1) in $ℝ[X]$ do not have a common zero in $ℝ.$

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

$\text{I}(\text{V}(J))=\sqrt{J}$

for every ideal J. Here, $\sqrt{J}$ denotes the radical of J and I(U) is the ideal of all polynomials that vanish on the set U.

In this way, taking $k=K$ we obtain an order-reversing bijective correspondence between the algebraic sets in Kⁿ and the radical ideals of $K[X_1,\dots ,X_n].$ 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 a point $P=(a_1,\dots ,a_n)\in K^n$. Then $I(P)=(X_1-a_1,\dots ,X_n-a_n)$. More generally,

$\sqrt{I}=\bigcap _{(a_1,\dots ,a_n)\in V(I)}(X_1-a_1,\dots ,X_n-a_n).$

Conversely, every maximal ideal of the polynomial ring $K[X_1,\dots ,X_n]$ (note that $K$ is algebraically closed) is of the form $(X_1-a_1,\dots ,X_n-a_n)$ for some $a_1,\dots ,a_n\in K$.

As another example, an algebraic subset W in Kⁿ is irreducible (in the Zariski topology) if and only if $I(W)$ is a prime ideal.

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 Template:Math or Template:Math 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 Template:Math, then it is a finite field extension of Template:Math (that is, it is also finitely generated as a vector space).

Here is a sketch of a proof using this lemma.

Let $A=k[t_1,\dots ,t_n]$ (k algebraically closed field), I an ideal of A, and V the common zeros of I in $k^n$. Clearly, $\sqrt{I}\subseteq I(V)$. Let $f\in ̸\sqrt{I}$. Then $f\in ̸𝔭$ for some prime ideal $𝔭\supseteq I$ in A. Let $R=(A/𝔭)[f^{-1}]$ and $𝔪$ a maximal ideal in $R$. By Zariski's lemma, $R/𝔪$ is a finite extension of k; thus, is k since k is algebraically closed. Let $x_i$ be the images of $t_i$ under the natural map $A\to k$ passing through $R$. It follows that $x=(x_1,\dots ,x_n)\in V$ and $f(x)\ne 0$.

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 $p_1,\dots ,p_n,$ a linear change of variables allows to suppose that $p_1$ is monic in the first variable Template:Mvar. Then, one introduces $n-1$ new variables $u_2,\dots ,u_n,$ and one considers the resultant

$R={\mathrm{Res}}_x(p_1,u_2{p}_2+\cdots +u_n{p}_n).$

As Template:Mvar is in the ideal generated by $p_1,\dots ,p_n,$ the same is true for the coefficients in Template:Mvar of the monomials in $u_2,\dots ,u_n.$ So, if Template:Math is in the ideal generated by these coefficients, it is also in the ideal generated by $p_1,\dots ,p_n.$ On the other hand, if these coefficients have a common zero, this zero can be extended to a common zero of $p_1,\dots ,p_n,$ 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 Template:Math if and only if its reduced Gröbner basis (for any monomial ordering) is Template:Math.
• 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 Template:Math. 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[t_1,\cdots ,t_n]/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 $𝔫\subseteq S$ is a maximal ideal, then $𝔪:=𝔫\cap R$ is a maximal ideal of $R$, and $S/𝔫$ is a finite extension of $R/𝔪$.

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 $\mathrm{S}\mathrm{p}\mathrm{e}\mathrm{c}R\to \mathrm{S}\mathrm{p}\mathrm{e}\mathrm{c}k$ admits a section étale-locally (equivalently, after base change along $\mathrm{S}\mathrm{p}\mathrm{e}\mathrm{c}L\to \mathrm{S}\mathrm{p}\mathrm{e}\mathrm{c}k$ for some finite field extension $L/k$). In this vein, one has the following theorem:

Any faithfully flat morphism of schemes $f:Y\to X$ locally of finite presentation admits a quasi-section, in the sense that there exists a faithfully flat and locally quasi-finite morphism $g:X^{\prime }\to X$ locally of finite presentation such that the base change $f^{\prime }:Y{\times }_X{X}^{\prime }\to X^{\prime }$ of $f$ along $g$ admits a section. Moreover, if $X$ is quasi-compact (resp. quasi-compact and quasi-separated), then one may take $X^{\prime }$ to be affine (resp. $X^{\prime }$ affine and $g$ quasi-finite), and if $f$ is smooth surjective, then one may take $g$ to be étale.

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

Let $\kappa$ be an infinite cardinal and let $K$ be an algebraically closed field whose transcendence degree over its prime subfield is strictly greater than $\kappa$. Then for any set $S$ of cardinality $\kappa$, the polynomial ring $A=K[x_i{]}_{i\in S}$ satisfies the Nullstellensatz, i.e., for any ideal $J\subset A$ we have that $\sqrt{J}=\text{I}(\text{V}(J))$.

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 Template:Math; we have Template:Math in the strong version, Template:Math in the weak form. This means the existence or the non-existence of polynomials Template:Math such that Template:Math. The usual proofs of the Nullstellensatz are not constructive, non-effective, in the sense that they do not give any way to compute the Template:Math.

It is thus a rather natural question to ask if there is an effective way to compute the Template:Math (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 Template:Math: 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 Template:Math. 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 Template:Math 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. 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:

Let Template:Math be polynomials in Template:Math variables, of total degree Template:Math. If there exist polynomials Template:Math such that Template:Math, then they can be chosen such that

$\mathrm{deg}(f_i{g}_i)\le \max (d_s,3)\prod _{j=1}^{\min (n,s)-1}\max (d_j,3).$

This bound is optimal if all the degrees are greater than 2.

If Template:Mvar is the maximum of the degrees of the Template:Math, this bound may be simplified to

$\max (3,d{)}^{\min (n,s)}.$

An improvement due to M. Sombra is

$\mathrm{deg}(f_i{g}_i)\le 2d_s\prod _{j=1}^{\min (n,s)-1}{d}_j.$

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[t_0,\dots ,t_n].$ The homogeneous ideal,

$R_{+}=\underset{d⩾1}{⨁}{R}_d$

is called the maximal homogeneous ideal (see also irrelevant ideal). As in the affine case, we let: for a subset $S\subseteq {\mathbb{P}}^n$ and a homogeneous ideal I of R,

$\begin{array}{cc}{\mathrm{I}}_{{\mathbb{P}}^n}(S)& =\{f\in R_{+}\mid f=0\text{ on }S\},\\ {\mathrm{V}}_{{\mathbb{P}}^n}(I)& =\{x\in {\mathbb{P}}^n\mid f(x)=0\text{ for all }f\in I\}.\end{array}$

By $f=0\text{ on }S$ we mean: for every homogeneous coordinates $(a_0:\cdots :a_n)$ of a point of S we have $f(a_0,\dots ,a_n)=0$. This implies that the homogeneous components of f are also zero on S and thus that ${\mathrm{I}}_{{\mathbb{P}}^n}(S)$ is a homogeneous ideal. Equivalently, ${\mathrm{I}}_{{\mathbb{P}}^n}(S)$ is the homogeneous ideal generated by homogeneous polynomials f that vanish on S. Now, for any homogeneous ideal $I\subseteq R_{+}$, by the usual Nullstellensatz, we have:

$\sqrt{I}={\mathrm{I}}_{{\mathbb{P}}^n}({\mathrm{V}}_{{\mathbb{P}}^n}(I)),$

and so, like in the affine case, we have:

There exists an order-reversing one-to-one correspondence between proper homogeneous radical ideals of R and subsets of ${\mathbb{P}}^n$ of the form ${\mathrm{V}}_{{\mathbb{P}}^n}(I).$ The correspondence is given by ${\mathrm{I}}_{{\mathbb{P}}^n}$ and ${\mathrm{V}}_{{\mathbb{P}}^n}.$

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 $U\subseteq {ℂ}^n,$ 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\in {𝒪}_{{ℂ}^n,0}$ is a germ represented by a holomorphic function $\tilde{f}:U\to ℂ$, then let $V_0(f)$ be the equivalence class of the set

$\{z\in U\mid \tilde{f}(z)=0\},$

where two subsets $X,Y\subseteq {ℂ}^n$ are considered equivalent if $X\cap U=Y\cap U$ for some neighborhood U of 0. Note $V_0(f)$ is independent of a choice of the representative $\tilde{f}.$ For each ideal $I\subseteq {𝒪}_{{ℂ}^n,0},$ let $V_0(I)$ denote $V_0(f_1)\cap \dots \cap V_0(f_r)$ for some generators $f_1,\dots ,f_r$ of I. It is well-defined; i.e., is independent of a choice of the generators.

For each subset $X\subseteq {ℂ}^n$, let

$I_0(X)=\{f\in {𝒪}_{{ℂ}^n,0}\mid V_0(f)\supset X\}.$

It is easy to see that $I_0(X)$ is an ideal of ${𝒪}_{{ℂ}^n,0}$ and that $I_0(X)=I_0(Y)$ if $X\sim Y$ in the sense discussed above.

The analytic Nullstellensatz then states: for each ideal $I\subseteq {𝒪}_{{ℂ}^n,0}$,

$\sqrt{I}=I_0(V_0(I))$

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

See also

• Artin–Tate lemma
• Combinatorial Nullstellensatz
• Differential Nullstellensatz
• Real radical
• Restricted power series#Tate algebra, an analog of Hilbert's Nullstellensatz holds for Tate algebras.
• Stengle's Positivstellensatz
• Weierstrass Nullstellensatz

References

• Template:Cite journal
• Template:Cite book
• Template:Cite book
• Template:Hartshorne AG
• Template:Cite journal
• Template:Cite book
• Template:Cite book
• Template:Cite book