HOME

TheInfoList



OR:

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 Geometry (; ) is, with arithmetic, one of the oldest branches of mathematics. It is concerned with properties of space such as the distance, shape, size, and relative position of figures. A mathematician who works in the field of geometry is ...
and
algebra Algebra () is one of the broad areas of mathematics. Roughly speaking, algebra is the study of mathematical symbols and the rules for manipulating these symbols in formulas; it is a unifying thread of almost all of mathematics. Elementary ...
. This relationship is the basis of algebraic geometry. It relates
algebraic set Algebraic may refer to any subject related to algebra in mathematics and related branches like algebraic number theory and algebraic topology. The word algebra itself has several meanings. Algebraic may also refer to: * Algebraic data type, a data ...
s to ideals in
polynomial ring In mathematics, especially in the field of algebra, a polynomial ring or polynomial algebra is a ring (which is also a commutative algebra) formed from the set of polynomials in one or more indeterminates (traditionally also called variables ...
s over algebraically closed fields. This relationship was discovered by David Hilbert, who proved the Nullstellensatz in his second major paper on
invariant theory Invariant theory is a branch of abstract algebra dealing with actions of groups on algebraic varieties, such as vector spaces, from the point of view of their effect on functions. Classically, the theory dealt with the question of explicit descri ...
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 number In mathematics, a rational number is a number that can be expressed as the quotient or fraction of two integers, a numerator and a non-zero denominator . For example, is a rational number, as is every integer (e.g. ). The set of all rat ...
s) and ''K'' be an algebraically closed field extension (such as the
complex number In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted , called the imaginary unit and satisfying the equation i^= -1; every complex number can be expressed in the fo ...
s). Consider the
polynomial ring In mathematics, especially in the field of algebra, a polynomial ring or polynomial algebra is a ring (which is also a commutative algebra) formed from the set of polynomials in one or more indeterminates (traditionally also called variables ...
k _1, \ldots, X_n/math> and let ''I'' be an
ideal Ideal may refer to: Philosophy * Ideal (ethics), values that one actively pursues as goals * Platonic ideal, a philosophical idea of trueness of form, associated with Plato Mathematics * Ideal (ring theory), special subsets of a ring considere ...
in this ring. The
algebraic set Algebraic may refer to any subject related to algebra in mathematics and related branches like algebraic number theory and algebraic topology. The word algebra itself has several meanings. Algebraic may also refer to: * Algebraic data type, a data ...
V(''I'') defined by this ideal consists of all ''n''-tuples x = (''x''1,...,''x''''n'') in ''Kn'' such that ''f''(x) = 0 for all ''f'' in ''I''. Hilbert's Nullstellensatz states that if ''p'' is some polynomial in k _1, \ldots, X_n/math> that vanishes on the algebraic set V(''I''), i.e. ''p''(x) = 0 for all x in ''V''(''I''), then there exists a
natural number In mathematics, the natural numbers are those numbers used for counting (as in "there are ''six'' coins on the table") and ordering (as in "this is the ''third'' largest city in the country"). Numbers used for counting are called ''cardinal ...
''r'' such that ''p''''r'' is in ''I''. An immediate corollary is the ''weak Nullstellensatz'': The ideal I \subset k _1, \ldots, X_n/math> contains 1 if and only if the polynomials in ''I'' do not have any common zeros in ''Kn''. It may also be formulated as follows: if ''I'' is a proper ideal in k _1, \ldots, X_n then V(''I'') cannot be
empty Empty may refer to: ‍ Music Albums * ''Empty'' (God Lives Underwater album) or the title song, 1995 * ''Empty'' (Nils Frahm album), 2020 * ''Empty'' (Tait album) or the title song, 2001 Songs * "Empty" (The Click Five song), 2007 * ...
, 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, 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''2 + 1) in \R /math> do not have a common zero in \R. With the notation common in algebraic geometry, the Nullstellensatz can also be formulated as :\hbox(\hbox(J))=\sqrt for every ideal ''J''. Here, \sqrt 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 In mathematics, a bijection, also known as a bijective function, one-to-one correspondence, or invertible function, is a function between the elements of two sets, where each element of one set is paired with exactly one element of the other ...
correspondence between the algebraic sets in ''K''''n'' and the
radical ideal In ring theory, a branch of mathematics, the radical of an ideal I of a commutative ring is another ideal defined by the property that an element x is in the radical if and only if some power of x is in I. Taking the radical of an ideal is called ' ...
s of K _1, \ldots, X_n In fact, more generally, one has a Galois connection between subsets of the space and subsets of the algebra, where "
Zariski closure In algebraic geometry and commutative algebra, the Zariski topology is a topology which is primarily defined by its closed sets. It is very different from topologies which are commonly used in the real or complex analysis; in particular, it is ...
" and "radical of the ideal generated" are the
closure operator In mathematics, a closure operator on a set ''S'' is a function \operatorname: \mathcal(S)\rightarrow \mathcal(S) from the power set of ''S'' to itself that satisfies the following conditions for all sets X,Y\subseteq S : Closure operators are de ...
s. As a particular example, consider a point P = (a_1, \dots, a_n) \in K^n. Then I(P) = (X_1 - a_1, \ldots, X_n - a_n). More generally, :\sqrt = \bigcap_ (X_1 - a_1, \dots, X_n - a_n). Conversely, every
maximal ideal In mathematics, more specifically in ring theory, a maximal ideal is an ideal that is maximal (with respect to set inclusion) amongst all ''proper'' ideals. In other words, ''I'' is a maximal ideal of a ring ''R'' if there are no other ideals c ...
of the polynomial ring K _1,\ldots,X_n/math> (note that K is algebraically closed) is of the form (X_1 - a_1, \ldots, X_n - a_n) for some a_1,\ldots,a_n \in K. As another example, an algebraic subset ''W'' in ''K''''n'' 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 In mathematics, a constructive proof is a method of proof that demonstrates the existence of a mathematical object by creating or providing a method for creating the object. This is in contrast to a non-constructive proof (also known as an existenc ...
, such as the first one. Others are constructive, as based on
algorithm In mathematics and computer science, an algorithm () is a finite sequence of rigorous instructions, typically used to solve a class of specific problems or to perform a computation. Algorithms are used as specifications for performing ...
s for expressing or 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 , then it is a finite field extension of (that is, it is also finitely generated as a
vector space In mathematics and physics, a vector space (also called a linear space) is a set whose elements, often called '' vectors'', may be added together and multiplied ("scaled") by numbers called ''scalars''. Scalars are often real numbers, but can ...
). Here is a sketch of a proof using this lemma. Let A = k _1, \ldots, t_n/math> (''k'' algebraically closed field), ''I'' an ideal of ''A,'' and ''V'' the common zeros of ''I'' in k^n. Clearly, \sqrt \subseteq I(V). Let f \not\in \sqrt. Then f \not\in \mathfrak for some prime ideal \mathfrak\supseteq I in ''A''. Let R = (A/\mathfrak) ^/math> and \mathfrak a maximal ideal in R. By Zariski's lemma, R/\mathfrak 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, \ldots, 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 In mathematics, the resultant of two polynomials is a polynomial expression of their coefficients, which is equal to zero if and only if the polynomials have a common root (possibly in a field extension), or, equivalently, a common factor (ove ...
of two polynomials depending on a variable 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 , 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 that depend on , one chooses arbitrary values for the other variables. The
fundamental theorem of algebra The fundamental theorem of algebra, also known as d'Alembert's theorem, or the d'Alembert–Gauss theorem, states that every non- constant single-variable polynomial with complex coefficients has at least one complex root. This includes polynomia ...
asserts that this choice can be extended to a zero of . In the case of several polynomials p_1,\ldots, p_n, a linear change of variables allows to suppose that p_1 is monic in the first variable . Then, one introduces n-1 new variables u_2, \ldots, u_n, and one considers the resultant :R=\operatorname_x(p_1,u_2p_2+\cdots +u_np_n). As is in the ideal generated by p_1,\ldots, p_n, the same is true for the coefficients in of the
monomial In mathematics, a monomial is, roughly speaking, a polynomial which has only one term. Two definitions of a monomial may be encountered: # A monomial, also called power product, is a product of powers of variables with nonnegative integer expone ...
s in u_2, \ldots, u_n. So, if is in the ideal generated by these coefficients, it is also in the ideal generated by p_1,\ldots, 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,\ldots, 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 In mathematics, and more specifically in computer algebra, computational algebraic geometry, and computational commutative algebra, a Gröbner basis is a particular kind of generating set of an ideal in a polynomial ring over a field . A Gröbn ...
is an algorithmic concept that was introduced in 1973 by
Bruno Buchberger Bruno Buchberger (born 22 October 1942) is Professor of Computer Mathematics at Johannes Kepler University in Linz, Austria. In his 1965 Ph.D. thesis, he created the theory of Gröbner bases, and has developed this theory throughout his career. ...
. 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 if and only if its reduced Gröbner basis (for any
monomial ordering In mathematics, a monomial order (sometimes called a term order or an admissible order) is a total order on the set of all ( monic) monomials in a given polynomial ring, satisfying the property of respecting multiplication, i.e., * If u \leq v and ...
) is . *The number of the common zeros of the polynomials in a Gröbner basis is strongly related to the number of
monomial In mathematics, a monomial is, roughly speaking, a polynomial which has only one term. Two definitions of a monomial may be encountered: # A monomial, also called power product, is a product of powers of variables with nonnegative integer expone ...
s 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 polynomial In mathematics, a polynomial is an expression consisting of indeterminates (also called variables) and coefficients, that involves only the operations of addition, subtraction, multiplication, and positive-integer powers of variables. An ex ...
s (this is not used in practice since one knows better algorithms). * Strong Nullstellensatz: a power of belongs to an ideal if and only the
saturation Saturation, saturated, unsaturation or unsaturated may refer to: Chemistry * Saturation, a property of organic compounds referring to carbon-carbon bonds **Saturated and unsaturated compounds ** Degree of unsaturation **Saturated fat or fatty aci ...
of by produces the Gröbner basis . 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. Note that 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 _1,\cdots,t_nI) 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 \mathfrak\subset S is a maximal ideal, then \mathfrak := \mathfrak \cap R is a maximal ideal of R, and S/\mathfrak is a finite extension of R/\mathfrak. 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 \, R \to \mathrm \, k admits a
section Section, Sectioning or Sectioned may refer to: Arts, entertainment and media * Section (music), a complete, but not independent, musical idea * Section (typography), a subdivision, especially of a chapter, in books and documents ** Section sig ...
étale-locally (equivalently, after base change along \mathrm \, L \to \mathrm \, 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' \to X locally of finite presentation such that the base change f': Y \times_X X' \to X' of f along g admits a section. 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 Smooth may refer to: Mathematics * Smooth function, a function that is infinitely differentiable; used in calculus and topology * Smooth manifold, a differentiable manifold for which all the transition maps are smooth functions * Smooth algebrai ...
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 In abstract algebra, the transcendence degree of a field extension ''L'' / ''K'' is a certain rather coarse measure of the "size" of the extension. Specifically, it is defined as the largest cardinality of an algebraically independent subset of ...
over its prime subfield is strictly greater than \kappa. Then for any set S of cardinality \kappa, the polynomial ring A = K _i satisfies the Nullstellensatz, i.e., for any ideal J \sub A we have that \sqrt = \hbox (\hbox (J)).


Effective Nullstellensatz

In all of its variants, Hilbert's Nullstellensatz asserts that some polynomial belongs or not to an ideal generated, say, by ; we have in the strong version, in the weak form. This means the existence or the non-existence of polynomials such that . The usual proofs of the Nullstellensatz are not constructive, non-effective, in the sense that they do not give any way to compute the . It is thus a rather natural question to ask if there is an effective way to compute the (and the exponent 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 : such a bound reduces the problem to a finite system of linear equations that may be solved by usual
linear algebra Linear algebra is the branch of mathematics concerning linear equations such as: :a_1x_1+\cdots +a_nx_n=b, linear maps such as: :(x_1, \ldots, x_n) \mapsto a_1x_1+\cdots +a_nx_n, and their representations in vector spaces and through matrices ...
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 . A general solution of the ideal membership problem provides an effective Nullstellensatz, at least for the weak form. In 1925,
Grete Hermann Grete Hermann (2 March 1901 – 15 April 1984) was a German mathematician and philosopher noted for her work in mathematics, physics, philosophy and education. She is noted for her early philosophical work on the foundations of quantum mechanics, ...
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 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 János Kollár (born 7 June 1956) is a Hungarian mathematician, specializing in algebraic geometry. Professional career Kollár began his studies at the Eötvös University in Budapest and later received his PhD at Brandeis University in 1984 ...
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 be polynomials in variables, of total degree . If there exist polynomials such that , then they can be chosen such that ::\deg(f_ig_i) \le \max(d_s,3)\prod_^\max(d_j,3). :This bound is optimal if all the degrees are greater than 2. If is the maximum of the degrees of the , this bound may be simplified to :\max(3,d)^. Kollár's result has been improved by several authors. , the best improvement, due to M. Sombra is :\deg(f_ig_i) \le 2d_s\prod_^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 _0, \ldots, t_n The homogeneous ideal, :R_+ = \bigoplus_ R_d is called the ''maximal homogeneous ideal'' (see also
irrelevant ideal In mathematics, the irrelevant ideal is the ideal of a graded ring generated by the homogeneous elements of degree greater than zero. More generally, a homogeneous ideal of a graded ring is called an irrelevant ideal if its radical contains the ir ...
). As in the affine case, we let: for a subset S \subseteq \mathbb^n and a homogeneous ideal ''I'' of ''R'', :\begin \operatorname_(S) &= \, \\ \operatorname_(I) &= \. \end By f = 0 \text S we mean: for every homogeneous coordinates (a_0 : \cdots : a_n) of a point of ''S'' we have f(a_0,\ldots, a_n)=0. This implies that the homogeneous components of ''f'' are also zero on ''S'' and thus that \operatorname_(S) is a homogeneous ideal. Equivalently, \operatorname_(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 = \operatorname_(\operatorname_(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^n of the form \operatorname_(I). The correspondence is given by \operatorname_ and \operatorname_.


Analytic Nullstellensatz (Rückert’s Nullstellensatz)

The Nullstellensatz also holds for the germs of holomorphic functions at a point of complex ''n''-space \Complex^n. Precisely, for each open subset U \subset \Complex^n, let \mathcal_(U) denote the ring of holomorphic functions on ''U''; then \mathcal_ is a ''
sheaf Sheaf may refer to: * Sheaf (agriculture), a bundle of harvested cereal stems * Sheaf (mathematics), a mathematical tool * Sheaf toss, a Scottish sport * River Sheaf, a tributary of River Don in England * ''The Sheaf'', a student-run newspaper se ...
'' on \Complex^n. The stalk \mathcal_ at, say, the origin can be shown to be a
Noetherian In mathematics, the adjective Noetherian is used to describe objects that satisfy an ascending or descending chain condition on certain kinds of subobjects, meaning that certain ascending or descending sequences of subobjects must have finite lengt ...
local ring In abstract algebra, more specifically ring theory, local rings are certain rings that are comparatively simple, and serve to describe what is called "local behaviour", in the sense of functions defined on varieties or manifolds, or of algebraic n ...
that is a
unique factorization domain In mathematics, a unique factorization domain (UFD) (also sometimes called a factorial ring following the terminology of Bourbaki) is a ring in which a statement analogous to the fundamental theorem of arithmetic holds. Specifically, a UFD is ...
. If f \in \mathcal_ is a germ represented by a holomorphic function \widetilde: U \to \Complex , then let V_0(f) be the equivalence class of the set :\left \, where two subsets X, Y \subset \Complex^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 \widetilde. For each ideal I \subset \mathcal_, let V_0(I) denote V_0(f_1) \cap \dots \cap V_0(f_r) for some generators f_1, \ldots, f_r of ''I''. It is well-defined; i.e., is independent of a choice of the generators. For each subset X \subset \Complex ^n, let :I_0(X) = \left \. It is easy to see that I_0(X) is an ideal of \mathcal_ 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 \subset \mathcal_, :\sqrt = I_0(V_0(I)) where the left-hand side is the radical of ''I''.


See also

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


Notes


References

* * * * * * * * {{cite book , ref=CITEREFZariski–Samuel, last1=Zariski , first1=Oscar , last2=Samuel , first2=Pierre , author1-link=Oscar Zariski , author2-link=Pierre Samuel , title=Commutative algebra. Volume II , date=1960 , location=Berlin , isbn=978-3-662-27753-9 Polynomials Theorems in algebraic geometry