fbpx
Wikipedia

Hilbert's Nullstellensatz

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 edit

Let   be a field (such as the rational numbers) and   be an algebraically closed field extension of   (such as the complex numbers). Consider the polynomial ring   and let   be an ideal in this ring. The algebraic set   defined by this ideal consists of all  -tuples   in   such that   for all   in  . Hilbert's Nullstellensatz states that if p is some polynomial in   that vanishes on the algebraic set  , i.e.   for all   in  , then there exists a natural number   such that   is in  .[1]

An immediate corollary is the weak Nullstellensatz: The ideal   contains 1 if and only if the polynomials in I do not have any common zeros in Kn. The weak Nullstellensatz may also be formulated as follows: if I is a proper ideal in   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 (X2 + 1) in   do not have a common zero in  

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

 

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

In this way, taking   we obtain an order-reversing bijective correspondence between the algebraic sets in Kn and the radical ideals of   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  . Then  . More generally,

 

Conversely, every maximal ideal of the polynomial ring   (note that   is algebraically closed) is of the form   for some  .

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

Proofs edit

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 1 or pr as a linear combination of the generators of the ideal.

Using Zariski's lemma edit

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

Here is a sketch of a proof using this lemma.[2]

Let   (k algebraically closed field), I an ideal of A, and V the common zeros of I in  . Clearly,  . Let  . Then   for some prime ideal   in A. Let   and   a maximal ideal in  . By Zariski's lemma,   is a finite extension of k; thus, is k since k is algebraically closed. Let   be the images of   under the natural map   passing through  . It follows that   and  .

Using resultants edit

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 x 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 x, 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 p that depends on x, one chooses arbitrary values for the other variables. The fundamental theorem of algebra asserts that this choice can be extended to a zero of p.

In the case of several polynomials   a linear change of variables allows to suppose that   is monic in the first variable x. Then, one introduces   new variables   and one considers the resultant

 

As R is in the ideal generated by   the same is true for the coefficients in R of the monomials in   So, if 1 is in the ideal generated by these coefficients, it is also in the ideal generated by   On the other hand, if these coefficients have a common zero, this zero can be extended to a common zero of   by the above property of the resultant.

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

Using Gröbner bases edit

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 1 if and only if its reduced Gröbner basis (for any monomial ordering) is 1.
  • 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 p belongs to an ideal I if and only the saturation of I by p produces the Gröbner basis 1. Thus, the strong Nullstellensatz results almost immediately from the definition of the saturation.

Generalizations edit

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  ) is Jacobson. More generally, one has the following theorem:

Let   be a Jacobson ring. If   is a finitely generated R-algebra, then   is a Jacobson ring. Furthermore, if   is a maximal ideal, then   is a maximal ideal of  , and   is a finite extension of  .[3]

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   admits a section étale-locally (equivalently, after base change along   for some finite field extension  ). In this vein, one has the following theorem:

Any faithfully flat morphism of schemes   locally of finite presentation admits a quasi-section, in the sense that there exists a faithfully flat and locally quasi-finite morphism   locally of finite presentation such that the base change   of   along   admits a section.[4] Moreover, if   is quasi-compact (resp. quasi-compact and quasi-separated), then one may take   to be affine (resp.   affine and   quasi-finite), and if   is smooth surjective, then one may take   to be étale.[5]

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

Let   be an infinite cardinal and let   be an algebraically closed field whose transcendence degree over its prime subfield is strictly greater than  . Then for any set   of cardinality  , the polynomial ring   satisfies the Nullstellensatz, i.e., for any ideal   we have that  .[6]

Effective Nullstellensatz edit

In all of its variants, Hilbert's Nullstellensatz asserts that some polynomial g belongs or not to an ideal generated, say, by f1, ..., fk; we have g = f r in the strong version, g = 1 in the weak form. This means the existence or the non-existence of polynomials g1, ..., gk such that g = f1g1 + ... + fkgk. The usual proofs of the Nullstellensatz are not constructive, non-effective, in the sense that they do not give any way to compute the gi.

It is thus a rather natural question to ask if there is an effective way to compute the gi (and the exponent r 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 gi: 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 gi. 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 gi 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.[7] 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:[8]

Let f1, ..., fs be polynomials in n ≥ 2 variables, of total degree d1 ≥ ... ≥ ds. If there exist polynomials gi such that f1g1 + ... + fsgs = 1, then they can be chosen such that
 
This bound is optimal if all the degrees are greater than 2.

If d is the maximum of the degrees of the fi, this bound may be simplified to

 

Kollár's result has been improved by several authors. As of 14 October 2012, the best improvement, due to M. Sombra is[9]

 

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

Projective Nullstellensatz edit

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   The homogeneous ideal,

 

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

 

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

 

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

There exists an order-reversing one-to-one correspondence between proper homogeneous radical ideals of R and subsets of   of the form   The correspondence is given by   and  

Analytic Nullstellensatz (Rückert’s Nullstellensatz) edit

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

If   is a germ represented by a holomorphic function  , then let   be the equivalence class of the set

 

where two subsets   are considered equivalent if   for some neighborhood U of 0. Note   is independent of a choice of the representative   For each ideal   let   denote   for some generators   of I. It is well-defined; i.e., is independent of a choice of the generators.

For each subset  , let

 

It is easy to see that   is an ideal of   and that   if   in the sense discussed above.

The analytic Nullstellensatz then states:[11] for each ideal  ,

 

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

See also edit

Notes edit

  1. ^ Zariski–Samuel, Ch. VII, Theorem 14.
  2. ^ Atiyah–Macdonald, Ch. 7.
  3. ^ Emerton, Matthew. "Jacobson rings" (PDF). (PDF) from the original on 2022-07-25.
  4. ^ EGA §IV.17.16.2.
  5. ^ EGA §IV.17.16.3(ii).
  6. ^ Lang, Serge (1952). "Hilbert's Nullstellensatz in Infinite-Dimensional Space". Proc. Am. Math. Soc. 3 (3): 407–410. doi:10.2307/2031893. JSTOR 2031893.
  7. ^ Brownawell, W. Dale (1987), "Bounds for the degrees in the Nullstellensatz", Ann. of Math., 126 (3): 577–591, doi:10.2307/1971361, JSTOR 1971361, MR 0916719
  8. ^ Kollár, János (1988), (PDF), Journal of the American Mathematical Society, 1 (4): 963–975, doi:10.2307/1990996, JSTOR 1990996, MR 0944576, archived from the original (PDF) on 2014-03-03, retrieved 2012-10-14
  9. ^ Sombra, Martín (1999), "A Sparse Effective Nullstellensatz", Advances in Applied Mathematics, 22 (2): 271–295, arXiv:alg-geom/9710003, doi:10.1006/aama.1998.0633, MR 1659402, S2CID 119726673
  10. ^ This formulation comes from Milne, Algebraic geometry [1] and differs from Hartshorne 1977, Ch. I, Exercise 2.4
  11. ^ Huybrechts, Proposition 1.1.29.

References edit

hilbert, nullstellensatz, mathematics, german, theorem, zeros, more, literally, zero, locus, theorem, theorem, that, establishes, fundamental, relationship, between, geometry, algebra, this, relationship, basis, algebraic, geometry, relates, algebraic, sets, i. 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 Contents 1 Formulation 2 Proofs 2 1 Using Zariski s lemma 2 2 Using resultants 2 3 Using Grobner bases 3 Generalizations 4 Effective Nullstellensatz 5 Projective Nullstellensatz 6 Analytic Nullstellensatz Ruckert s Nullstellensatz 7 See also 8 Notes 9 ReferencesFormulation editLet k displaystyle k nbsp be a field such as the rational numbers and K displaystyle K nbsp be an algebraically closed field extension of k displaystyle k nbsp such as the complex numbers Consider the polynomial ring k X1 Xn displaystyle k X 1 ldots X n nbsp and let I displaystyle I nbsp be an ideal in this ring The algebraic set V I displaystyle mathrm V I nbsp defined by this ideal consists of all n displaystyle n nbsp tuples x x1 xn displaystyle mathbf x x 1 dots x n nbsp in Kn displaystyle K n nbsp such that f x 0 displaystyle f mathbf x 0 nbsp for all f displaystyle f nbsp in I displaystyle I nbsp Hilbert s Nullstellensatz states that if p is some polynomial in k X1 Xn displaystyle k X 1 ldots X n nbsp that vanishes on the algebraic set V I displaystyle mathrm V I nbsp i e p x 0 displaystyle p mathbf x 0 nbsp for all x displaystyle mathbf x nbsp in V I displaystyle mathrm V I nbsp then there exists a natural number r displaystyle r nbsp such that pr displaystyle p r nbsp is in I displaystyle I nbsp 1 An immediate corollary is the weak Nullstellensatz The ideal I k X1 Xn displaystyle I subseteq k X 1 ldots X n nbsp contains 1 if and only if the polynomials in I do not have any common zeros in Kn The weak Nullstellensatz may also be formulated as follows if I is a proper ideal in k X1 Xn displaystyle k X 1 ldots X n nbsp 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 X2 1 in R X displaystyle mathbb R X nbsp do not have a common zero in R displaystyle mathbb R nbsp With the notation common in algebraic geometry the Nullstellensatz can also be formulated as I V J J displaystyle hbox I hbox V J sqrt J nbsp for every ideal J Here J displaystyle sqrt J nbsp 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 displaystyle k K nbsp we obtain an order reversing bijective correspondence between the algebraic sets in Kn and the radical ideals of K X1 Xn displaystyle K X 1 ldots X n nbsp 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 a1 an Kn displaystyle P a 1 dots a n in K n nbsp Then I P X1 a1 Xn an displaystyle I P X 1 a 1 ldots X n a n nbsp More generally I a1 an V I X1 a1 Xn an displaystyle sqrt I bigcap a 1 dots a n in V I X 1 a 1 dots X n a n nbsp Conversely every maximal ideal of the polynomial ring K X1 Xn displaystyle K X 1 ldots X n nbsp note that K displaystyle K nbsp is algebraically closed is of the form X1 a1 Xn an displaystyle X 1 a 1 ldots X n a n nbsp for some a1 an K displaystyle a 1 ldots a n in K nbsp As another example an algebraic subset W in Kn is irreducible in the Zariski topology if and only if I W displaystyle I W nbsp is a prime ideal Proofs editThere 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 1 or pr as a linear combination of the generators of the ideal Using Zariski s lemma edit 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 Here is a sketch of a proof using this lemma 2 Let A k t1 tn displaystyle A k t 1 ldots t n nbsp k algebraically closed field I an ideal of A and V the common zeros of I in kn displaystyle k n nbsp Clearly I I V displaystyle sqrt I subseteq I V nbsp Let f I displaystyle f not in sqrt I nbsp Then f p displaystyle f not in mathfrak p nbsp for some prime ideal p I displaystyle mathfrak p supseteq I nbsp in A Let R A p f 1 displaystyle R A mathfrak p f 1 nbsp and m displaystyle mathfrak m nbsp a maximal ideal in R displaystyle R nbsp By Zariski s lemma R m displaystyle R mathfrak m nbsp is a finite extension of k thus is k since k is algebraically closed Let xi displaystyle x i nbsp be the images of ti displaystyle t i nbsp under the natural map A k displaystyle A to k nbsp passing through R displaystyle R nbsp It follows that x x1 xn V displaystyle x x 1 ldots x n in V nbsp and f x 0 displaystyle f x neq 0 nbsp Using resultants edit 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 x 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 x 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 p that depends on x one chooses arbitrary values for the other variables The fundamental theorem of algebra asserts that this choice can be extended to a zero of p In the case of several polynomials p1 pn displaystyle p 1 ldots p n nbsp a linear change of variables allows to suppose that p1 displaystyle p 1 nbsp is monic in the first variable x Then one introduces n 1 displaystyle n 1 nbsp new variables u2 un displaystyle u 2 ldots u n nbsp and one considers the resultant R Resx p1 u2p2 unpn displaystyle R operatorname Res x p 1 u 2 p 2 cdots u n p n nbsp As R is in the ideal generated by p1 pn displaystyle p 1 ldots p n nbsp the same is true for the coefficients in R of the monomials in u2 un displaystyle u 2 ldots u n nbsp So if 1 is in the ideal generated by these coefficients it is also in the ideal generated by p1 pn displaystyle p 1 ldots p n nbsp On the other hand if these coefficients have a common zero this zero can be extended to a common zero of p1 pn displaystyle p 1 ldots p n nbsp by the above property of the resultant This proves the weak Nullstellensatz by induction on the number of variables Using Grobner bases edit A Grobner basis is an algorithmic concept that was introduced in 1973 by Bruno Buchberger It is presently fundamental in computational geometry A Grobner 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 1 if and only if its reduced Grobner basis for any monomial ordering is 1 The number of the common zeros of the polynomials in a Grobner 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 p belongs to an ideal I if and only the saturation of I by p produces the Grobner basis 1 Thus the strong Nullstellensatz results almost immediately from the definition of the saturation Generalizations editThe 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 textstyle R k t 1 cdots t n I nbsp is Jacobson More generally one has the following theorem Let R displaystyle R nbsp be a Jacobson ring If S displaystyle S nbsp is a finitely generated R algebra then S displaystyle S nbsp is a Jacobson ring Furthermore if n S displaystyle mathfrak n subseteq S nbsp is a maximal ideal then m n R displaystyle mathfrak m mathfrak n cap R nbsp is a maximal ideal of R textstyle R nbsp and S n displaystyle S mathfrak n nbsp is a finite extension of R m displaystyle R mathfrak m nbsp 3 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 SpecR Speck textstyle mathrm Spec R to mathrm Spec k nbsp admits a section etale locally equivalently after base change along SpecL Speck textstyle mathrm Spec L to mathrm Spec k nbsp for some finite field extension L k textstyle L k nbsp In this vein one has the following theorem Any faithfully flat morphism of schemes f Y X textstyle f Y to X nbsp locally of finite presentation admits a quasi section in the sense that there exists a faithfully flat and locally quasi finite morphism g X X textstyle g X to X nbsp locally of finite presentation such that the base change f Y XX X textstyle f Y times X X to X nbsp of f textstyle f nbsp along g textstyle g nbsp admits a section 4 Moreover if X textstyle X nbsp is quasi compact resp quasi compact and quasi separated then one may take X textstyle X nbsp to be affine resp X textstyle X nbsp affine and g textstyle g nbsp quasi finite and if f textstyle f nbsp is smooth surjective then one may take g textstyle g nbsp to be etale 5 Serge Lang gave an extension of the Nullstellensatz to the case of infinitely many generators Let k textstyle kappa nbsp be an infinite cardinal and let K textstyle K nbsp be an algebraically closed field whose transcendence degree over its prime subfield is strictly greater than k displaystyle kappa nbsp Then for any set S textstyle S nbsp of cardinality k textstyle kappa nbsp the polynomial ring A K xi i S textstyle A K x i i in S nbsp satisfies the Nullstellensatz i e for any ideal J A textstyle J subset A nbsp we have that J I V J displaystyle sqrt J hbox I hbox V J nbsp 6 Effective Nullstellensatz editIn all of its variants Hilbert s Nullstellensatz asserts that some polynomial g belongs or not to an ideal generated say by f1 fk we have g f r in the strong version g 1 in the weak form This means the existence or the non existence of polynomials g1 gk such that g f1g1 fkgk The usual proofs of the Nullstellensatz are not constructive non effective in the sense that they do not give any way to compute the gi It is thus a rather natural question to ask if there is an effective way to compute the gi and the exponent r 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 gi 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 gi 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 gi 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 7 Brownawell s proof relied on analytic techniques valid only in characteristic 0 but one year later Janos Kollar gave a purely algebraic proof valid in any characteristic of a slightly better bound In the case of the weak Nullstellensatz Kollar s bound is the following 8 Let f1 fs be polynomials in n 2 variables of total degree d1 ds If there exist polynomials gi such that f1g1 fsgs 1 then they can be chosen such thatdeg figi max ds 3 j 1min n s 1max dj 3 displaystyle deg f i g i leq max d s 3 prod j 1 min n s 1 max d j 3 nbsp dd This bound is optimal if all the degrees are greater than 2 If d is the maximum of the degrees of the fi this bound may be simplified to max 3 d min n s displaystyle max 3 d min n s nbsp Kollar s result has been improved by several authors As of 14 October 2012 update the best improvement due to M Sombra is 9 deg figi 2ds j 1min n s 1dj displaystyle deg f i g i leq 2d s prod j 1 min n s 1 d j nbsp His bound improves Kollar s as soon as at least two of the degrees that are involved are lower than 3 Projective Nullstellensatz editWe 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 displaystyle R k t 0 ldots t n nbsp The homogeneous ideal R d 1Rd displaystyle R bigoplus d geqslant 1 R d nbsp is called the maximal homogeneous ideal see also irrelevant ideal As in the affine case we let for a subset S Pn displaystyle S subseteq mathbb P n nbsp and a homogeneous ideal I of R IPn S f R f 0 on S VPn I x Pn f x 0 for all f I displaystyle begin aligned operatorname I mathbb P n S amp f in R mid f 0 text on S operatorname V mathbb P n I amp x in mathbb P n mid f x 0 text for all f in I end aligned nbsp By f 0 on S displaystyle f 0 text on S nbsp we mean for every homogeneous coordinates a0 an displaystyle a 0 cdots a n nbsp of a point of S we have f a0 an 0 displaystyle f a 0 ldots a n 0 nbsp This implies that the homogeneous components of f are also zero on S and thus that IPn S displaystyle operatorname I mathbb P n S nbsp is a homogeneous ideal Equivalently IPn S displaystyle operatorname I mathbb P n S nbsp is the homogeneous ideal generated by homogeneous polynomials f that vanish on S Now for any homogeneous ideal I R displaystyle I subseteq R nbsp by the usual Nullstellensatz we have I IPn VPn I displaystyle sqrt I operatorname I mathbb P n operatorname V mathbb P n I nbsp and so like in the affine case we have 10 There exists an order reversing one to one correspondence between proper homogeneous radical ideals of R and subsets of Pn displaystyle mathbb P n nbsp of the form VPn I displaystyle operatorname V mathbb P n I nbsp The correspondence is given by IPn displaystyle operatorname I mathbb P n nbsp and VPn displaystyle operatorname V mathbb P n nbsp Analytic Nullstellensatz Ruckert s Nullstellensatz editThe Nullstellensatz also holds for the germs of holomorphic functions at a point of complex n space Cn displaystyle mathbb C n nbsp Precisely for each open subset U Cn displaystyle U subseteq mathbb C n nbsp let OCn U displaystyle mathcal O mathbb C n U nbsp denote the ring of holomorphic functions on U then OCn displaystyle mathcal O mathbb C n nbsp is a sheaf on Cn displaystyle mathbb C n nbsp The stalk OCn 0 displaystyle mathcal O mathbb C n 0 nbsp at say the origin can be shown to be a Noetherian local ring that is a unique factorization domain If f OCn 0 displaystyle f in mathcal O mathbb C n 0 nbsp is a germ represented by a holomorphic function f U C displaystyle widetilde f U to mathbb C nbsp then let V0 f displaystyle V 0 f nbsp be the equivalence class of the set z U f z 0 displaystyle left z in U mid widetilde f z 0 right nbsp where two subsets X Y Cn displaystyle X Y subseteq mathbb C n nbsp are considered equivalent if X U Y U displaystyle X cap U Y cap U nbsp for some neighborhood U of 0 Note V0 f displaystyle V 0 f nbsp is independent of a choice of the representative f displaystyle widetilde f nbsp For each ideal I OCn 0 displaystyle I subseteq mathcal O mathbb C n 0 nbsp let V0 I displaystyle V 0 I nbsp denote V0 f1 V0 fr displaystyle V 0 f 1 cap dots cap V 0 f r nbsp for some generators f1 fr displaystyle f 1 ldots f r nbsp of I It is well defined i e is independent of a choice of the generators For each subset X Cn displaystyle X subseteq mathbb C n nbsp let I0 X f OCn 0 V0 f X displaystyle I 0 X left f in mathcal O mathbb C n 0 mid V 0 f supset X right nbsp It is easy to see that I0 X displaystyle I 0 X nbsp is an ideal of OCn 0 displaystyle mathcal O mathbb C n 0 nbsp and that I0 X I0 Y displaystyle I 0 X I 0 Y nbsp if X Y displaystyle X sim Y nbsp in the sense discussed above The analytic Nullstellensatz then states 11 for each ideal I OCn 0 displaystyle I subseteq mathcal O mathbb C n 0 nbsp I I0 V0 I displaystyle sqrt I I 0 V 0 I nbsp where the left hand side is the radical of I See also editStengle 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 edit Zariski Samuel Ch VII Theorem 14 Atiyah Macdonald Ch 7 Emerton Matthew Jacobson rings PDF Archived PDF from the original on 2022 07 25 EGA IV 17 16 2 EGA IV 17 16 3 ii Lang Serge 1952 Hilbert s Nullstellensatz in Infinite Dimensional Space Proc Am Math Soc 3 3 407 410 doi 10 2307 2031893 JSTOR 2031893 Brownawell W Dale 1987 Bounds for the degrees in the Nullstellensatz Ann of Math 126 3 577 591 doi 10 2307 1971361 JSTOR 1971361 MR 0916719 Kollar Janos 1988 Sharp Effective Nullstellensatz PDF Journal of the American Mathematical Society 1 4 963 975 doi 10 2307 1990996 JSTOR 1990996 MR 0944576 archived from the original PDF on 2014 03 03 retrieved 2012 10 14 Sombra Martin 1999 A Sparse Effective Nullstellensatz Advances in Applied Mathematics 22 2 271 295 arXiv alg geom 9710003 doi 10 1006 aama 1998 0633 MR 1659402 S2CID 119726673 This formulation comes from Milne Algebraic geometry 1 and differs from Hartshorne 1977 Ch I Exercise 2 4 Huybrechts Proposition 1 1 29 References editAlmira Jose Maria 2007 Nullstellensatz revisited PDF Rend Semin Mat Univ Politec Torino 65 3 365 369 Atiyah M F Macdonald I G 1994 Introduction to Commutative Algebra Addison Wesley ISBN 0 201 40751 5 Eisenbud David 1999 Commutative Algebra With a View Toward Algebraic Geometry Graduate Texts in Mathematics Vol 150 New York Springer Verlag ISBN 978 0 387 94268 1 Hartshorne Robin 1977 Algebraic Geometry Graduate Texts in Mathematics vol 52 New York Springer Verlag ISBN 978 0 387 90244 9 MR 0463157 Hilbert David 1893 Ueber die vollen Invariantensysteme Mathematische Annalen 42 3 313 373 doi 10 1007 BF01444162 Huybrechts Daniel 2005 Complex Geometry An Introduction Springer ISBN 3 540 21290 6 Mukai Shigeru 2003 An Introduction to Invariants and Moduli Cambridge studies in advanced mathematics Vol 81 William Oxbury trans p 82 ISBN 0 521 80906 1 Zariski Oscar Samuel Pierre 1960 Commutative algebra Volume II Berlin ISBN 978 3 662 27753 9 a href Template Cite book html title Template Cite book cite book a CS1 maint location missing publisher link Retrieved from https en wikipedia org w index php title Hilbert 27s Nullstellensatz amp oldid 1204199306, wikipedia, wiki, book, books, library,

article

, read, download, free, free download, mp3, video, mp4, 3gp, jpg, jpeg, gif, png, picture, music, song, movie, book, game, games.