This paper establishes new degree bounds for the sparse Nullstellensatz and Noether exponent, considering the monomial structure of polynomials, thus improving previous bounds in the sparse setting.
Contribution
It introduces the first bounds that incorporate the supports of polynomials, advancing the understanding of degree bounds in sparse polynomial ideals.
Findings
01
Improved upper bounds for degrees in Nullstellensatz
02
Bounds that account for polynomial supports
03
First bounds considering monomial structure in sparse case
Abstract
We prove new upper bounds for the degrees in Hilbert's Nullstellensatz and for the Noether exponent of polynomial ideals in terms of the monomial structure of the polynomials involved. Our bounds improve the previously known bounds in the sparse setting and are the first to take into account the different supports of the polynomials.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Polynomial and algebraic computation · Coding theory and cryptography
Full text
On degree bounds for the sparse Nullstellensatz
María Isabel Herrero*♮,♢,111Partially supported by the following Argentinean research grants: PIP 11220130100527CO (CONICET) and UBACYT 20020160100039BA (2017-2019)., Gabriela Jeronimo♮,♭,♢,∗, Juan Sabia♭,♢,∗*
Abstract
We prove new upper bounds for the degrees in Hilbert’s Nullstellensatz and for the Noether exponent of polynomial ideals in terms of the monomial structure of the polynomials involved. Our bounds improve the previously known bounds in the sparse setting and are the first to take into account the different supports of the polynomials.
♮ Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Matemática. Buenos Aires, Argentina.
♭ Universidad de Buenos Aires. Ciclo Básico Común. Departamento de Ciencias Exactas. Buenos Aires, Argentina.
♢ Universidad de Buenos Aires. Consejo Nacional de Investigaciones Científicas y Técnicas. Instituto de Investigaciones Matemáticas “Luis A. Santaló” (IMAS). Buenos Aires, Argentina.
Hilbert’s Nullstellensatz states that, given polynomials f1,…,fs∈k[x1,…,xn] with coefficients in a field k and no common zeroes in the n-dimensional affine space over the algebraic closure of k, there exist polynomials g1,…,gs∈k[x1,…,xn] such that 1=∑i=1sgifi. An effective version of this theorem consists in giving upper bounds for the degrees or a characterization of the Newton polytopes of polynomials g1,…,gs satisfying this identity in terms of the polynomials f1,…,fs.
A great deal of work on the effective Nullstellensatz has been done over the last 30 years (see successive advances in, for example, [3], [11], [6], [16], [17], [12], [10]).
The best upper bounds for the degrees of polynomials g1,…,gs in terms of the degrees of f1,…,fs are the ones obtained in [11], slightly improved in the case s≤n in [10].
When considering particular cases, the degrees of the input polynomials may not be enough for obtaining sharp estimates. A foundational work in this sense is [2], where the Newton polytopes of polynomials and their volumes are introduced to count the number of common zeros of polynomial systems (for further development of this theory, see for instance [9] and [18]). In this sparse setting, the effective Nullstellensatz problem was addressed in [17], where the monomial structure of the polynomials gifi is characterized leading to upper bounds for the degrees that can improve the previous ones. The sparse Nullstellensatz from [17] was dramatically improved in [4], [19] and [20] for systems with no common roots at toric infinity (for the classical Nullstellensatz, the same behaviour of the degree bounds for generic systems follows from the work of Macaulay, see [13]).
In [4], the authors conjectured that their genericity conditions could be dropped, and this question was addressed in [14].
A problem that is closely related to the effective Nullstellensatz consists in estimating the so-called Noether exponent of a polynomial ideal. For an ideal I⊂k[x1,…,xn], the Noether exponent of I is the minimum integer μ such that (I)μ⊆I. Given f1,…,fs∈k[x1,…,xn] that generate the ideal I, the problem is to find an upper bound for μ depending on parameters associated to f1,…,fs. Different bounds for this exponent μ in terms of the degrees and the Newton polytopes of the given generators have been proved (see, for instance, [11], [17], [10], [20]).
In this paper, we prove new bounds for both the degrees in the Nullstellensatz and the Noether exponent of an ideal in the sparse setting. Our work is in the vein of [10] and [17], in the sense that we consider arbitrary sparse systems (that is, no genericity assumptions are made).
First, from the results in [10], we obtain bounds depending on the volume of a convex polytope containing the supports of the given polynomials and the vertex set of the standard unitary simplex (see Propositions 1 and 2) which improve the previously known bounds depending on the same invariants.
The main results of the paper are the first upper bounds that distinguish the different supports of the given polynomials. In this setting, we prove upper bounds for the Nullstellensatz (see Theorem 8 and Corollary 10) and for the Noether exponent of ideals (see Theorem 12). For these mixed sparse systems, our bounds can be considerably smaller than the previous bounds, as illustrated by Examples 2 and 3, and, for arbitrary polynomial systems, they differ from them by at most a factor equal to the maximum of the polynomial degrees.
2 Preliminaries
Throughout this paper, we work with polynomials with coefficients in a field of characteristic [math]. If k is a field, we write k for an algebraic closure of k.
Given a finite set A⊂(Z≥0)n, a sparse polynomial supported on A with coefficients in a field k is a polynomial f∈k[x1,…,xn] of the form
f=∑α∈Acαxα with cα∈k∖{0} for every α∈A. Here, for α=(α1,…,αn)∈(Z≥0)n, we write xα=x1α1…xnαn.
We say a system of polynomials f1,…,fs∈k[x1,…,kn] is an unmixed polynomial system supported on A⊂(Z≥0)n if, for every 1≤i≤s, fi is a polynomial supported on A. When f1,…,fs∈k[x1,…,xn] are supported on (possibly) different subsets A1,…,As⊂(Z≥0)n, we say they form a mixed sparse polynomial system.
We adopt the notation V(f1,…,fs) for the set of common zeros of f1,…,fs in kn.
For a family of n finite sets A1,…,An⊂(Z≥0)n, we denote MVn(A1,…,An) the mixed volume of the convex hulls of A1,…,An in Rn (see, for instance, [5, Chapter 7] for a definition and basic properties of this notion).
In the case where A1=⋯=An=A, we have that MVn(A1,…,An)=n!Voln(A), where Voln(A) is the Euclidean volume in Rn of the convex hull of A.
By Bernstein’s theorem (see [2]), the mixed volume MVn(A1,…,An) is an upper bound for the number of isolated roots in (C∖{0})n of a system of sparse polynomials in C[x1,…,xn] supported on A1,…,An.
We will write Δn for the vertex set of the standard unitary simplex in Rn, that is, Δn={0,e1,…,en}⊂(Z≥0)n, where ei is the ith vector of the canonical basis of Rn. Note that Δn is the support set of a generic affine linear polynomial in n variables.
For a finite subset A⊂(Z≥0)n, we denote by \mboxconv(A) the convex hull of A in Rn. Given a positive integer m, we write m⋅A:=m⋅\mboxconv(A)={α1+⋯+αm∣αi∈\mboxconv(A)∀1≤i≤m}.
For an integer 1≤r≤n, we write A(r) for the family consisting of r sets equal to A.
In particular, we will frequently use the notation Δn(r), which represents the family of supports of r linear forms in n variables. We will also use the notation A for the set A:={0}×A={(0,α)∈Zn+1∣α∈A}.
3 The unmixed case
In this section we will deduce upper bounds for the Noether exponent of an ideal and the Nullstellensatz for unmixed sparse systems by applying the results from [10] to suitable toric varieties. With no loss of generality, we work with polynomials with coefficients in an algebraically closed field K (note that, once a bound is obtained, over an arbitrary field k all the coefficients of the polynomials involved are solutions to linear systems over k).
Proposition 1
Let f1,…,fs∈K[x1,…,xn] be nonzero polynomials with supports contained in a finite set A⊂(Z≥0)n and let I be the ideal of K[x1,…,xn] generated by f1,…,fs. Then, (I)μ⊂I for
μ≤n!Voln(A∪Δn).
*Proof:
Let A={α1,…,αN}⊂(Z≥0)n. Following [17, Theorem 2.10], consider the affine toric variety
[TABLE]
We have that X may be defined by polynomial equations as
[TABLE]
and that it is an irreducible variety of dimension n and degree n!Voln(A∪Δn) (by Bernstein’s theorem [2]).
Consider the map φ:K[y0,…,yn+N]→K[x1,…,xn] defined by φ(y0)=1, φ(yi)=xi for 1≤i≤n and φ(yn+j)=xαj for 1≤j≤N. The kernel of the map φ is the defining ideal of the variety X.
Given f1,…,fs supported on a subset of A, there exist linear forms L1,…,Ls∈K[y0,…,yn+N] such that φ(Li)=fi for i=1,…,s (if fi=∑j=1Nciαjxαj, we can take Li=∑j=1Nciαjyn+j). Consider the ideal I:=(L1,…,Ls)⊂K[X].
By [10, Theorem 1.3], (I)D⊂I for D:=deg(X)=n!Voln(A∪Δn). Therefore, (I)D⊂I.
□
Proposition 2
Let f1,…,fs∈K[x1,…,xn] be nonzero polynomials with supports contained in a finite set A⊂(Z≥0)n. Let d=max{deg(fi)∣1≤i≤s}. If V(f1,…,fs)=∅, there exist polynomials g1,…,gs∈K[x1,…,xn] such that
[TABLE]
Moreover, the Newton polytope of gi is contained in (n!Voln(A∪Δn)−1)⋅\mboxconv(A∪Δn) for every 1≤i≤s.
*Proof:
Let A={α1,…,αN}⊂(Z≥0)n. Consider the variety Y⊂Pn+N defined as the projective closure of the image of the map
[TABLE]
which is an irreducible variety of dimension n and degree n!Voln(A∪Δn).
Assuming fi=∑j=1Nciαjxαj for i=1,…,s, let Li=∑j=1Nciαjyn+j. Due to the fact that V(f1,…,fs)=∅, we have that y0 lies in the radical of the ideal (L1,…,Ls)⊂K[Y].
Applying [10, Corollary 1.4], we deduce that y0D∈(L1,…,Ls)⊂K[Y] for D=deg(Y)=n!Voln(A∪Δn). Then, there exist homogeneous polynomials G1,…,Gs∈K[y0,…,yn+N] such that y0D=∑i=1sGiLimodI(Y) and deg(GiLi)=D for i=1,…,s.
Dehomogenizing and taking into account that the polynomials yn+jy0∣αj∣−1−y1αj1…ynαjn, where ∣αj∣=∑k=1nαjk, generate the ideal of the affine chart Y∩{y0=0}, we obtain an equality 1=∑i=1sgifi, where gi(x)=Gi(1,x1,…,xn,xα1,…,xαN) for i=1,…,s. We conclude that deg(gifi)≤max1≤j≤N{∣αj∣}.deg(GiLi)≤dD and that the Newton polytope of gi is contained in (D−1)\mboxconv(A∪Δn).
□
In the following example we can see how these bounds for
the degrees in the Nullstellensatz and the Noether exponent improve the
bounds from [10], [11], [12] and [17].
Example 1
(see [17, Example 2.12] and [12, Example 4.13]) Let s≥2, n≥2, δ≥2 and, for i=1,…,s, let fi=ai0+∑j=1naijxj+∑k=1δbikx1k…xnk∈Q[x1,…,xn] be polynomials with supports contained in A=Δn∪{k(e1+⋯+en);k=1,…,δ}
without common zeros in Cn. Then, by Proposition 2, there exist
g1,…,gs∈Q[x1,…,xn] such that
[TABLE]
since
Voln(A)=δ/(n−1)! and deg(fi)=nδ for every 1≤i≤s. Our bound is sharper than the previous ones for these polynomials:
•
the bound from **[17, Corollary 2.11]** is
deg(gifi)≤min{n+1,s}2(nδ)2;
•
from **[12, Corollary 3]**, the bound deg(gi)≤2n4δ2 is obtained;
•
the bound from **[11, Corollary 1.9]** is deg(gifi)≤(nδ)min{n,s};
•
the bound from **[10, Theorem 1.1]** is deg(gifi)≤(nδ)s if s≤n and deg(gifi)≤2(nδ)n−1 if s>n.
For arbitrary polynomials f1,…,fs supported on a subset of the previous set A, the bound for the Noether exponent of the ideal (f1,…,fs)⊂Q[x1,…,xn] from Proposition 1 is μ≤nδ, whereas the bound in [17, Corollary 2.11] is
μ≤min{n+1,s}2nδ and
the bound in [11, Corollary 1.7] and [10, Theorem 1.3] is
μ≤(nδ)min{n,s}.
Note that, for systems with no zeros at toric infinity, our bounds here would be similar to those obtained in [19] and [20], but we do not make any assumptions on the polynomials.
4 The mixed case
The aim of this section is to prove upper bounds for the degrees in the Nullstellensatz and for the Noether exponent of ideals generated by mixed sparse systems that take into account the different supports of the given polynomials.
We will follow the approach in [10], which allows us to improve the known bounds but,
unlike the ones in [17], [19] and [20], does not give a priori estimates of the Newton polytopes of the polynomials involved.
First we prove some auxiliary results.
Lemma 3
Let L be a field of characteristic zero, W∈L[t0,…,tn] be a reduced polynomial and D a positive integer. If W(0,t1,…,tn)=0, then W(T0D,t1,…,tn) is reduced in L[T0,…,tn].
*Proof:
If n=0, the statement follows straightforward because W(T0D) has only simple roots in an algebraic closure of L.
For n≥1, without loss of generality, it suffices to consider the case when all the irreducible factors of W have positive degree in t0. The proof follows from the univariate case by considering W in L(t1,…,tn)[t0].
□
The following proposition can be regarded as a sparse version of [10, Theorem 3.3], which is, in turn, a generalization of the classical Perron’s theorem (see [15, Satz 57]).
A similar result in the context of implicitization of rational varieties has been proved in [7].
Proposition 4
Let L be a field of characteristic zero, h0,…,hn∈L[x1,…,xn]∖L polynomials with supports A0,…,An⊂(Z≥0)n and D∈N. If the map
h:Ln→Ln+1, h(x)=(h0(x),…,hn(x)), is generically finite, then there exists a nonzero polynomial W∈L[t0,…,tn] such that W(h0,…,hn)=0 and
[TABLE]
where, for every 0≤i≤n, Ai:={(0,α)∈Zn+1∣α∈Ai}, and e0:=(1,0,…,0).
*Proof:
As h is generically finite, h(Ln) is an irreducible hypersurface in Ln+1. Then, there exists an irreducible polynomial W∈L[t0,…,tn] defining it and, therefore, satisfying W(h0,…,hn)=0.
Let
P(T0,t1…,tn)=W(T0D,t1,…,tn)∈L[T0,t1,…,tn] and Y={(y0,…,yn)∈Ln+1∣P(y0,…,yn)=0}. Note that, by Lemma 3, P is a reduced polynomial and, therefore, degP=degY.
Consider Y={(y,x)∈Ln+1×Ln∣y0D=h0(x),y1=h1(x),…,yn=hn(x)}. If πy:Ln+1×Ln→Ln+1 denotes the projection to the first n+1 coordinates, then we will show that
[TABLE]
It is clear that πy(Y)⊆Y. To prove the converse inclusion, consider a nonzero polynomial g∈L[t0,…,tn] such that h(Ln)∩{g=0}⊆h(Ln). Note that P=W(T0D,t1,…,tn) and g(T0D,t1,…,tn) do not have common factors, because W and g in L[t0,…,tn] do not have common factors. Then, the Zariski closure of {y∈Ln+1∣P(y)=0,g(y0D,y1,…,yn)=0} is Y. In addition, for every y∈Ln+1 such that P(y)=0 and g(y0D,y1,…,yn)=0, we have that (y0D,y1,…,yn)∈h(Ln) and, therefore, there exists x∈Ln such that (y,x)∈Y. We conclude identity (1) holds.
Now we are going to estimate deg(πy(Y)). By identity (1), πy(Y) is equidimensional of dimension n; then, it suffices to count the number of points in its intersection with a generic linear variety of codimension n. By means of Gaussian elimination, we may assume the linear variety is defined by equations in L[T0,t1,…,tn] of the form Li=ti+aiT0+bi, i=1,…,n.
Note that there is a one-to-one correspondence between the points (y0,…,yn)∈πy(Y)∩{Li=0;1≤i≤n} and the common zeros (y0,x1,…,xn) of the system
[TABLE]
Since for generic ai,bi(1≤i≤n) the common zeros of this system in Ln+1 are isolated and have all nonzero coordinates, by [2], the number of these solutions is bounded by MVn+1(A0∪{De0},A1∪{0,e0},…,An∪{0,e0}).□
4.1 Degree bounds for the Nullstellensatz
Our first result in the mixed context is the following upper bound for the degrees in the Nullstellensatz.
Proposition 5
Let K be an
algebraically closed field of characteristic zero, s≤n+1 and f1,…,fs∈K[x1,…,xn] be nonzero polynomials with supports A1,…,As⊂(Z≥0)n. Let d=max{deg(fi)∣1≤i≤s}. If V(f1,…,fs)=∅, there exist polynomials g1,…,gs∈K[x1,…,xn]
such that 1=∑i=1sgifi satisfying, for every 1≤i≤s,
[TABLE]
*Proof:
We adapt the proof of [10, Theorem 3.6] to our setting. Without loss of generality, we may assume that fi∈/K for i=1,…,s.
Consider the map Φ:Kn+1→Ks+n,
[TABLE]
As 1∈(f1,…,fs), this map is one to one and its image Im(Φ) is a closed subset of Ks+n of dimension n+1.
Then, a generic linear projection π:Im(Φ)→Kn+1 is finite and, therefore, it induces a finite morphism Ψ=π∘Φ:Kn+1→Kn+1. If y=(y1,…,ys) and π(y,x)=(L1(y,x),…,Ln+1(y,x)), where L1,…,Ln+1 are linear forms and their coefficient matrix A∈K(n+1)×(s+n) is generic, we may
assume that the determinant of the (n+1)×(n+1) submatrix of A consisting of its first n+1 columns is not zero. Thus, by multiplying by the inverse of this submatrix, we
may assume, without loss of generality, that π(y,x)=(y1+l1(x),…,ys+ls(x),ls+1(x),…,ln+1(x)), and therefore,
[TABLE]
As Ψ is finite, there exists a minimal polynomial P in K[t1,…,tn+1,z] monic in z such that P(Ψ(x,z),z)=0.
If N:=degz(P), the coefficient of zN in the expression P(Ψ(x,z),z) has the form 1−∑i=1sgifi. To estimate the degrees of the polynomials in this expression, note that, for a polynomial Q∈K[t1,…,tn+1], the degree in the variables x of Q(Ψ(x,z)) is at most degtQ(t1d1,…,tsds,ts+1,…,tn+1), where di=deg(fi) for every 1≤i≤s. This implies that
[TABLE]
Then, it suffices to obtain an upper bound for the degree in the variables t=(t1,…,tn+1) of this polynomial.
In order to do so, consider the field L=K(z) and apply Proposition 4 to D=1 and the polynomials zf1(x)+l1(x),…,zfs(x)+ls(x),ls+1(x),…,ln+1(x)∈L[x], which induce a generically finite map Ψ:Ln→Ln+1. Since, for every 1≤i≤s, the support of zfi(x)+li(x) is Ai∪Δn and, for every s+1≤i≤n+1, the support of li(x) is Δn, it follows that there exists a nonzero polynomial W∈L[t1,…,tn+1] such that W(Ψ(x))=0 and
[TABLE]
By clearing denominators, we may assume that W∈K[t1,…,tn+1,z]. The minimality of P implies that P divides W and so,
[TABLE]
The result follows from inequalities (2), (4) and (3).
□
When the number of polynomials involved is at most n, the previous bound can be rewritten in terms of an n-dimensional mixed volume:
Remark 6
If s≤n, it is not difficult to see that
[TABLE]
and then, in this case, the bound stated in Proposition 5 can be re-written as
[TABLE]
Note that in the particular case of a polynomial system f1,…,fn,fn+1∈Q[x1,…,xn] where fi=xi−ai for i=1,…,n, and fn+1 is a polynomial with support dΔn such that fn+1(a1,…,an)=0, the bound for the degrees given in Proposition 5 is d2. However, it is easy to write 1=∑i=1n+1gifi with deg(gifi)≤d for every 1≤i≤n+1. This is in fact the well-known degree bound in the Nullstellensatz in terms of the degrees of the polynomials (see [10]).
However, we may obtain another bound for the degrees in the sparse Nullstellensatz, which enables us to deduce a refinement of our previous result, by applying Proposition 4 in a different way.
Proposition 7
With the same assumptions and notation as in Proposition 5, for every 1≤j≤s, let dj:=deg(fj), δj:=max{di∣1≤i≤s,i=j} and Mj:=MVn(A1∪Δn,…,Aj−1∪Δn,Aj+1∪Δn,…,As∪Δn,Δn(n+1−s)).
Then, for every 1≤i≤s, we have:
[TABLE]
*Proof:
By taking D:=d1 in the statement of Proposition 4, we deduce that the polynomial W appearing in the proof of Proposition 5 satisfies
[TABLE]
Taking into account that A1∪Δn∪{d1e0}⊂d1Δn+1, by basic properties of mixed volumes,
we obtain:
[TABLE]
Then, if δ1:=max{d2,…,ds}, we may replace inequality (4) with
[TABLE]
By interchanging the roles of f1 and fj for every 1≤j≤s, we deduce from (2) the stated upper bound.
□
Combining the results in Propositions 5 and 7, we deduce:
Theorem 8
Let K be an
algebraically closed field of characteristic zero, s≤n+1 and f1,…,fs∈K[x1,…,xn] be nonzero polynomials with supports A1,…,As⊂(Z≥0)n. Let d:=max{deg(fi)∣1≤i≤s}, M:=MVn+1(A1∪Δn+1,…,As∪Δn+1,Δn+1(n+1−s)) and, for 1≤j≤s, let dj:=deg(fj), δj:=max{di∣1≤i≤s,i=j} and Mj:=MVn(A1∪Δn,…,Aj−1∪Δn,Aj+1∪Δn,…,As∪Δn,Δn(n+1−s)). If V(f1,…,fs)=∅, there exist polynomials g1,…,gs∈K[x1,…,xn] such that 1=∑i=1sgifi satisfying, for every 1≤i≤s,
deg(gifi)≤N(A1,…,As;n),
where
[TABLE]
The following example illustrates how our bound for
the degrees in the Nullstellensatz for mixed sparse systems may improve the
bounds from [11], [10], [12] and [17] considerably.
Example 2
Let d∈N, d≥2.
For every 1≤i≤n, consider a polynomial fi∈Q[x1,…,xn] with support A=Δn∪{2e1,…,de1}, fi=ai0+∑j=1naijxj+∑k=2dbikx1k, and let
fn+1∈Q[x1,…,xn] be a polynomial with support An+1=d⋅Δn⊂(Z≥0)n. Assume f1,…,fn,fn+1 do not have common zeros in Cn.
Then, by Theorem 8, there exist polynomials g1,…,gn,gn+1∈Q[x1,…,xn] such that
[TABLE]
since MVn+1((A∪Δn+1)(n),An+1∪Δn+1)=d2,
MVn((A∪Δn)(n))=d, MVn((A∪Δn)(n−1),An+1∪Δn)=d2 and deg(fi)=d for every 1≤i≤n+1. For this system,
•
the bound in **[11, Corollary 1.9]** is
deg(gifi)≤dn, assuming d≥3;
•
the bound in **[10, Theorem 1.1]** is
deg(gifi)≤2dn−1;
•
the bound in **[17, Theorem 3.19]** is deg(gifi)≤2dn;
•
the bound from **[12, Corollary 4.11]** is deg(gi)≤2n2dn.
Remark 9
The polynomials obtained by homogeneizing those in Example 2 define a projective variety of codimension 2 contained in the hyperplane at infinity. This would imply that the bound in [1, Corollary 1.3] (see also [8]), which takes into account distinguished components at infinity, is similar to our bound. More generally, it would be interesting to generalize these results to the mixed sparse setting.
From Theorem 8, we can also deduce a bound for the degrees in the Nullstellensatz for a family of s>n+1 sparse polynomials.
Let f1,…,fs∈K[x1,…,xn] be nonzero polynomials with supports A1,…,As⊂(Z≥0)n such that V(f1,…,fs)=∅. By taking generic linear combinations of f1,…,fs, for a set J={j1,…,jn+1} with 1≤j1<⋯<jn+1≤s, we can obtain polynomials h1,…,hn+1 with supports
[TABLE]
such that V(h1,…,hn+1)=∅. By Theorem 8, there exists polynomials gJ,1,…,gJ,n+1∈K[x1,…,xn] such that 1=∑i=1n+1gJ,ihi and deg(gJ,ihi)≤N(AJ,1,…,AJ,n+1;n) for every 1≤i≤n+1. It follows that there exist polynomials g1,…,gs∈K[x1,…,xn] such that 1=∑i=1sgifi satisfying deg(gi)≤N(AJ,1,…,AJ,n+1;n) for every 1≤i≤s. Therefore, we have:
Corollary 10
Let s>n+1 and f1,…,fs∈K[x1,…,xn] be nonzero polynomials with supports A1,…,As⊂(Z≥0)n such that V(f1,…,fs)=∅. Then, using the notation in Theorem 8, there exist polynomials g1,…,gs∈K[x1,…,xn] such that 1=∑i=1sgifi satisfying, for every 1≤i≤s,
[TABLE]
where AJ,1,…,AJ,n+1 are the sets defined in (6).
4.2 Noether exponent
This section is devoted to proving an upper bound for the Noether exponent of a polynomial ideal generated by a mixed system in terms of the supports of the given generators.
We first prove a suitable sparse version of the Generalized Elimination Theorem from [10, Theorem 4.3].
Proposition 11
Let s≤n and f1,…,fs∈K[x1,…,xn] be nonzero polynomials with
supports A1,…,As⊂(Z≥0)n. Let
d=max{deg(fi)∣1≤i≤s}. Assume V(f1,…,fs)=∅. If G∈K[x1,…,xn] is a nonzero polynomial
which is constant over every irreducible component of V(f1,…,fs),
there exist polynomials g1,…,gs∈K[x1,…,xn] and a nonzero univariate polynomial ϕ∈K[T] such that
[TABLE]
*Proof:
Let Φ:Kn+1→Ks+n, Φ(x,z)=(zf1(x),…,zfs(x),x). Since G is constant over each irreducible component of V:=V(f1,…,fs), we have that G(V) is a finite set {a1,…,aq}. Consider the polynomial Q=∏1≤i≤q(T−ai)∈K[T]. Then, Q(G)∈(f1,…,fs) and, therefore, localizing in the multiplicative set of the powers of Q(G), we have that 1∈(f1,…,fs)Q(G)⊂K[x1,…,xn]Q(G). It follows that the map Φ is one to one outside the zero set of Q(G).
Set Γ⊂Ks+n for the Zariski closure of \mboxIm(Φ), which is an (n+1)-irreducible variety.
Then, for generic linear forms ℓ0,ℓ1,…,ℓn in K[y1,…,ys,x1,…,xn], the projection
πℓ:Γ→Kn+1, πℓ(y,x)=(ℓ0(y,x),…,ℓn(y,x)), is a finite morphism.
Consider now πℓ,G:Γ→Kn+2, πℓ,G(y,x)=(ℓ0(y,x),…,ℓn(y,x),G(x)).
There is a nonzero polynomial P∈K[t0,…,tn,T] such that P(ℓ0(y,x),…,ℓn(y,x),G(x))=0.
By making a change of variables Ti=ti−αit0, for i=1,…,n, and T0=t0, if Li=ℓi−αiℓ0, we obtain that
P(ℓ0,L1+α1ℓ0,…,Ln+αnℓ0,G)=ρ(G)ℓ0D+∑j=1DAj(L1,…,Ln,G)ℓ0D−j=P(ℓ0,L1,…,Ln,G),
where P∈K[T0,…,Tn,T] is a nonzero polynomial whose leading coefficient as a polynomial in T0 equals ρ(T), which depends only on the variable T.
Thus, we obtain a finite morphism
K[L1,…,Ln,G]ρ(G)→K[ℓ0,L1,…,Ln,G]ρ(G).
Recalling that we also have a finite map K[ℓ0,L1,…,Ln]=K[ℓ0,ℓ1,…,ℓn]→K[Γ] and a bijection K[Γ]Q(G)→K[x1,…,xn,z]Q(G), we deduce that the induced composition
[TABLE]
is finite.
Without loss of generality, we may assume that, for i=1,…,s,
Li(y,x)=yi+μi(x) for a generic linear form μi∈K[x], and that, for i=s+1,…,n, Li depends only on the variables x.
Let Pz∈K[T1,…,Tn,T][Z] be a minimal polynomial of z; then,
[TABLE]
and the leading coefficient ϕ of Pz is a factor of a power of Q(T)ρ(T).
The proof finishes similarly as the proof of Proposition 5, by considering the coefficient of zdegz(Pz) in the expansion of Pz(zf1(x)+μ1(x),…,zfs(x)+μs(x),Ls+1(x),…,Ln(x),z), which is of the form ϕ(G)−∑i=1sgi(x)fi(x). Considering Pz as a polynomial in K(z)[T1,…,Tn,T] and applying Proposition 4, we deduce that
[TABLE]
[TABLE]
[TABLE]
[TABLE]
□
The main result of this section is the following.
Theorem 12
Let f1,…,fs∈K[x1,…,xn] be nonzero polynomials with supports A1,…,As⊂(Z≥0)n and d=max{deg(fi)∣1≤i≤s}. Let I be the ideal of K[x1,…,xn] generated by f1,…,fs. Then, (I)μ⊂I for
[TABLE]
and
[TABLE]
where, for J={j1,…,jn}, AJ,i:=Aji∪⋃k∈/JAk for every 1≤i≤n.
*Proof:
Assume I=(1), since otherwise there is nothing to prove.
First, we consider the case s≤n. Let G∈I.
By Proposition 11, there exist ϕ∈K[T]∖{0} such that
ϕ(G)∈I and deg(ϕ(G))≤deg(G)⋅d⋅MVn(A1∪Δn,…,As∪Δn,Δn(n−s)).
Write ϕ(T)=TμG∏j=1r(T−aj) with aj∈K∖{0}. Since, for 1≤j≤r, G−aj does not lie in any associated prime of the ideal I (because G lies in all of them), the fact that GμG∏j=1r(G−aj)∈I implies that GμG∈I. Now,
We conclude that there exists μ∈Z≥0, μ≤d⋅MVn(A1∪Δn,…,As∪Δn,Δn(n−s)), such that Gμ∈I for every G∈I. From this fact, it is easy to prove that (I)μ⊂I (see, for instance, the proof of [10, Corollary 4.6]).
Assume now that s≥n+1. By taking generic linear combinations of f1,…,fs, for a set J={j1,…,jn} with 1≤j1<⋯<jn≤s, we can obtain polynomials h1,…,hn with supports AJ,1,…,AJ,n
such that V(h1,…,hn)∖V(f1,…,fs) is a finite set. Then, if G∈I, it satisfies the assumptions in Proposition 11 for the polynomials h1,…,hn. Therefore, there exists ϕ∈K[T]∖{0} such that ϕ(G)∈(h1,…,hn) and, as a consequence, ϕ(G)∈I, with deg(ϕ(G))≤deg(G)⋅d⋅MVn(AJ,1∪Δn,…,AJ,n∪Δn). As before, it follows that μ≤d⋅MVn(AJ,1∪Δn,…,AJ,n∪Δn).
□
Finally, we present an example that compares our mixed bound for the Noether exponent to previously known bounds:
Example 3
Consider positive integers D and 1≤D1≤⋯≤Dn. Let A=Δn∪{k(e1+⋯+en);1≤k≤D}⊂(Z≥0)n. For an ideal I=(f1,…,fn) in Q[x1,…,xn] generated by polynomials f1,…,fn with supports Ai=Di⋅A, for all 1≤i≤n, by Theorem 12, we have that (I)μ⊂I for a non-negative integer
[TABLE]
since MVn(A1,…,An)=(∏i=1nDi)MVn(A(n))=(∏i=1nDi)nD and, for 1≤i≤n, deg(fi)=nDDi. On the other hand, in this case,
the bound in **[10, Theorem 1.3]** is
\Big{(}\prod_{i=1}^{n}D_{i}\Big{)}n^{n}D^{n}.
In particular, when D1=⋯=Dn−1=1 and Dn=D, our bound is n2D4, whereas the bounds from [17] and [10] are n3Dn+1 and nnDn+1, respectively.
Acknowledgments. The authors wish to thank the anonymous referees for their helpful comments.
Bibliography20
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] M. Andersson, E. Wulcan, Variants of the effective Nullstellensatz and residue calculus. Notions of positivity and the geometry of polynomials, 17–31, Trends Math., Birkhäuser, Springer Basel AG, Basel, 2011.
2[2] D. N. Bernstein, The number of roots of a system of equations. Funct. Anal. Appl. 9 (1975), no. 3, 183–185.
3[3] W. D. Brownawell, Bounds for the degrees in the Nullstellensatz. Ann. of Math. (2) 126 (1987), no. 3, 577–591.
4[4] J.F. Canny, I.Z. Emiris, A subdivision-based algorithm for the sparse resultant. J. ACM 47 (2000), no. 3, 417–-451.
5[5] D. Cox, J. Little, D. O’Shea, Using algebraic geometry. Graduate Texts in Mathematics, 185. Springer-Verlag, New York, 1998.
6[6] N. Fitchas, A. Galligo, Nullstellensatz effectif et conjecture de Serre (théorème de Quillen-Suslin) pour le calcul formel. Math. Nachr. 149 (1990), 231-–253.
7[7] A. Dickenstein, M.I. Herrero, B. Mourrain, A tropical approach through curve valuations to the implicitization of rational varieties. Preprint, 2019.
8[8] L. Ein, R. Lazarsfeld, A geometric effective Nullstellensatz. Invent. Math. 137 (1999), no. 2, 427–448.