The initial ideal of generic sequences and Fr\"{o}berg's Conjecture
Van Duc Trung

TL;DR
This paper investigates Pardue's Conjecture regarding the initial ideal of generic sequences and its equivalence to Fr"{o}berg's Conjecture, providing partial proofs under certain degree conditions and advancing understanding of Hilbert functions of generic ideals.
Contribution
The paper proves Pardue's Conjecture under specific degree conditions, offering a partial resolution to Fr"{o}berg's Conjecture for cases where r ≤ n+2.
Findings
Pardue's Conjecture holds under certain degree conditions.
Partial proof of Fr"{o}berg's Conjecture for r ≤ n+2.
Results apply over any characteristic field.
Abstract
Let be an infinite field and let be an ideal in the polynomial ring generated by generic forms of degrees . A longstanding conjecture by Fr\"{o}berg predicts the shape of the Hilbert function of In 2010 Pardue stated a conjecture on the initial ideal of generic forms with respect to the deg-revlex order and he proved that it is equivalent to Fr\"{o}berg's Conjecture. We study Pardue's Conjecture and we prove it under suitable conditions on the degrees of the forms. This yields a partial solution to Fr\"{o}berg's Conjecture in the case over an infinite field of any characteristic.
Peer Reviews
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 · Algebraic Geometry and Number Theory
FRÖBERG’S CONJECTURE AND THE INITIAL IDEAL
OF GENERIC SEQUENCES
VAN DUC TRUNG
Abstract
Let be an infinite field and let be an ideal in the polynomial ring generated by generic forms of degrees . In the case , following an effective method by Gao, Guan and Volny, we give a description of the initial ideal of with respect to the degree reverse lexicographic order. Thanks to a theorem due to Pardue (2010), we apply our result to give a partial solution to a longstanding conjecture stated by Fröberg (1985) on the Hilbert series of
1 Introduction
Let be the polynomial ring in variables over an infinite field A homogeneous ideal in is said to be of type if it is generated by forms of degree for The Hilbert function of is by definition for every and it reflects important information of the ideal . We are interested in the behavior of the Hilbert function of generic ideals of type We adopt the definition of generic ideals given by Fröberg in [8] because it is more suitable for our approach. Assume that is an extension of a base field .
Definition 1.1**.**
(1) A form of degree in is called generic over if it is a linear combination of all monomials of degree and all coefficients are algebraically independent over .**
(2) A homogeneous ideal is called generic if all are generic forms with all the coefficients algebraically independent over .**
Other definitions in the literature appear in terms of the affine space whose points are the coefficients of the forms and we say that a property of such sequences is generic if it holds in a nonempty Zariski open subset of the affine space, see for instance [16] or [17]. The property ought to hold for a randomly chosen sequence. The Hilbert function of a generic ideal of type is the Hilbert function of a regular sequence, hence the generating Hilbert series is well known
[TABLE]
In general if is a graded standard -algebra and is a generic form, it is natural to guess that for every the multiplication map
[TABLE]
is of maximal rank (either injective or surjective), hence
[TABLE]
In terms of the corresponding Hilbert series this can be rewritten as
[TABLE]
where for a power series one has , with if for all , and otherwise. Following the terminology of Pardue in [17], if this is the case, we say that is semi-regular. A sequence of homogeneous polynomials is a semi-regular sequence on if each is semi-regular on . Clearly regular sequences are semi-regular sequences. This approach motivated a longstanding conjecture stated in 1985 by Fröberg.
Conjecture 1.2**.**
(Fröberg’s Conjecture). Let be a generic homogeneous ideal of type in . Then the Hilbert series of is given by
[TABLE]
This problem is of central interest in commutative algebra in the last decades and a great deal was done (see for instance Anick [2], Fröberg [8], Fröberg-Hollman [9], Fröberg-Löfwall [10], Fröberg-Lundqvist [11], Moreno-Socías [16], Pardue [17], Stanley [19], Valla [20]). A large number of validations through computational methods push to a positive answer. Fröberg’s Conjecture is known to be true for (complete intersection); [8]; [2]; (almost complete intersection) with char [8]; and , and [9].
Denote by the initial ideal of with respect to a term order on . Because the Hilbert series of and of coincide for every , a rich literature has been developed with the aim to characterize the initial ideal of generic ideals with respect to suitable term orders. In the case Moreno-Socías stated a conjecture describing the initial ideal of generic ideals with respect to the degree reverse lexicographic order. From now on, the initial ideal of will be always with respect to the degree reverse lexicographic order and it will be denoted simply by For general facts and properties on the degree reverse lexicographic order see for instance [7, Proposition 15.2]. It is natural to guess generic complete intersections share special initial ideals. We present here Moreno-Socías’ Conjecture.
Conjecture 1.3**.**
(See Moreno-Socías [15].) Let be a generic homogeneous ideal of type in . Then is almost reverse lexicographic, i.e, if is a minimal generator of then every monomial of the same degree and greater than must be in as well.
Moreno-Socías’ Conjecture was proven in the case by Aguire et al. [1] and Moreno-Socías [16], by Cimpoeas [6], by Harima and Wachi [14], and sequences satisfying for every by Cho and Park assuming char [5]. Without restriction on the characteristic of by using an incremental method from [12], Capaverde and Gao improved the result of Cho and Park. They gave a complete description of the initial ideal of in the case satisfies for every . In particular they proved Moreno-Socías’ Conjecture under the above conditions, see [4, Theorem 3.19]. Moreno-Socías’ Conjecture implies Fröberg’s Conjecture and Pardue stated a conjecture which is equivalent to Fröberg’s Conjecture ([17, Theorem 2]) by a slight modification of the requirement on the initial ideal.
For every monomial , denote by the largest index such that divides . It is easy to see that Moreno-Socías’ Conjecture implies the following conjecture stated by Pardue.
Conjecture 1.4**.**
[17, Conjecture E]** Let be a generic homogeneous ideal of type in . If is a minimal generator of and then every monomial of the same degree in the variables must be in as well.
Our aim is to study Fröberg’s Conjecture directly through the above conjecture instead of Moreno-Socías’ Conjecture.
Definition 1.5**.**
Let be a generic homogeneous ideal in . Suppose is a generator of and . We say satisfies property if every monomial of the same degree in the variables is also in .**
Thus, in order to claim Conjecture 1.4 is true for , we need to prove that every minimal generator of satisfies property . By using the incremental method from [4] and [12], in Proposition 3.3, we give an explicit description of the initial ideal of generic ideals with respect to the degree reverse lexicographic order. This is a crucial point for proving Theorem 3.1 that gives an inductive method for proving Conjecture 1.4.
In Theorem 4.3, we prove that Conjecture 1.4 holds true for every generic ideal if . If , in Theorem 4.4, we prove Conjecture 1.4 for generic ideals of type where and
[TABLE]
for every Here denotes the greatest integer less or equal to
As application, in Theorem 4.6, we prove that Fröberg’s Conjecture holds true for generic ideals of type with or and verifying condition (1). Our hope is that our results will be successfully applied to give new insights in proving Fröberg’s Conjecture. All the computations in this paper have been performed by using Macaulay2 [13].
We would like to point out that, at the end of our paper, we realized that independently Bertone and Cioffi in [3, Corollary 3.9] proved Moreno-Socías’ Conjecture with a condition similar to (1) under the assumption char The methods and the aim are lightly different even if strictly related.
2 Preliminaries
Let be the polynomial ring in variables and fix the order on the variables . Let be a generic homogeneous ideal of type in . Note that, is a generic homogeneous ideal of type in . Define to be the ring homomorphism that takes z to zero, fixing the elements in and the variables . Let be the image of . Then is a generic homogeneous ideal of type in . We recall that we consider always the degree reverse lexicographic order.
Proposition 2.1**.**
* and have the same minimal generators.*
Proof.
From a property of the degree reverse lexicographic order in [7, Proposition 15.12], we get . On the other hand, since is regular in , by [7, Theorem 15.13] is regular in . Furthermore, by [7, Theorem 15.14] the minimal generators of are not divisible by . Thus, and have the same minimal generators. ∎
Let be the set of monomials in which are not in and we call them the standard monomials with respect to . We set It is known that is a complete intersection and the Hilbert series of is a symmetric polynomial of degree , say with
[TABLE]
Notice that where is the set of monomials of degree in (see for instance [16, Proposition 2.2]). The set of standard monomials with respect to a generic ideal of type depends only on . So, we denote it by . We will describe more clearly the set of standard monomials in the case , that is . For each , define
[TABLE]
Proposition 2.2**.**
The structure of is as follows, (1) for all . (2) , for all . (3) , for all .
Proof.
(1) For , we have . Let denote the subset of consisting of the smallest monomials in . By [4, Lemma 3.5] we get . It is clear that . Conversely, for every monomial . Assume that . Then divides , so that . This implies a contradiction since . Thus, and (1) holds. (2) For , we have . By [4, Lemma 3.5] we get . (3) Since , by [4, Lemma 3.4] we get for . ∎
Remark 2.3**.**
(1) is determined by . (2) , for all .**
In the following example, we show explicitly the structure of according to Proposition 2.2.
Example 2.4**.**
Let be the set of standard monomials with respect to a generic ideal of type . Then . Denote by and . We have
[TABLE]
In the next section, we will see how to construct starting from by using the incremental method introduced in [12] and adapted to our situation in [4].
3 Main results
Let be a generic homogeneous ideal of type in . Define to be the set of the coefficients of the polynomials and . Let be the reduced Gröbner basis of with respect to the degree reverse lexicographic order. Then are homogeneous polynomials in . Reducing modulo we obtain a polynomial that is a -linear combination of all monomials of degree in with coefficients that are still algebraically independent over . Hence, from now on we assume that is reduced modulo and the coefficients of are algebraically independent over . In order to construct from we need to compare and . We recall here the incremental method to construct from , for more details see [4, Section 3]. Let be the set of standard monomials with respect to and be the set of standard monomials with respect to . Denote by the set of monomials of degree in for every . Note that, for , we have
[TABLE]
and for , we have
Let , denote by the column vector whose entries are the monomials in listed in decreasing order. For each monomial , reducing the product modulo we obtain a polynomial, say the reduced form of , that is a -linear combination of monomials in . Note that each coefficient of the reduced form of is a -linear combination of coefficients of polynomial . Let denote the matrix such that
[TABLE]
where denotes the column vector whose entries are the monomials in listed in decreasing order. By [4, Lemma 3.2] the rows of are linearly independent. This means that . Furthermore, the monomials in corresponding to the first linearly independent columns of are the generators that will be added to to form . Note that some of the monomials we add might be redundant. In this section, we will prove the following main result.
Theorem 3.1**.**
Let be a generic homogeneous ideal of type in , where . If and Conjecture 1.4 is true for , then Conjecture 1.4 is also true for .
The proof needs a deep investigation given in Proposition 3.3, Proposition 3.6 and Proposition 3.7. First of all we notice that Theorem 3.1 can be deduced from [4, Proposition 3.12] when . Indeed, by [4, Proposition 3.12], if then
[TABLE]
Let be a generator of in . We claim satisfies property . Indeed, if then is divisible by and . Hence, every monomial of degree in variables is not in , so that . If then
[TABLE]
If is a monomial in , then satisfies property through a similar argument as above. On the other hand, it is not hard to see that also satisfies properties P. Thus, if Conjecture 1.4 is true for with , then every minimal generator of satisfies property . This means Conjecture 1.4 is true for . Consider now the case . Set . The following lemma will be useful for proving Proposition 3.3.
Lemma 3.2**.**
For , we have . Furthermore, the monomials of are multiples of the smallest monomials in .
Proof.
Since , so . Hence, . Let denote the subset of consisting of the smallest monomials in . By [4, Lemma 3.5 (ii)] we have ∎
By convention, we use the following notation. Let be a finite subset of monomials in and denote by the set of monomials in listed in decreasing order. Let be a subset of and denote . The set of generators of can be described as the following.
Proposition 3.3**.**
Let be a generic ideal of type in , where and . Let be the set of standard monomials with respect to a generic ideal of type in . (1) If ( ) then
**
(2) If ( ) then
**
where is a subset of containing elements for every .
Proof.
Since is a combination of all monomials in , we can write
[TABLE]
where is the row vector of the coefficients of corresponding to the monomials in . Denote the last coefficient of by . Note that is the coefficient corresponding to the monomial . Set . We will construct a set of generators for by using incremental method. For , we have and is a row matrix . Hence, the first column of is linearly independent. Thus, the largest monomial of will be added. For equation (2) can be explicitly written in the following form
[TABLE]
Denote by the submatrices of formed by the columns corresponding to the monomials in respectively. We now consider the block . Note that the entries of are the -linear combinations of the coefficients in . Since , we have and
[TABLE]
Since , we have and the smallest monomials in are
[TABLE]
Let . Suppose , for some and . Then
[TABLE]
Thus, the term of the product is reduced mod . Therefore, in the coefficients of the reduced form of the product , will appear only in the coefficient of the monomial . Thus,
[TABLE]
where and is a -linear combination of the coefficients in . Hence, the last columns of are linearly independent. So, . This implies that the first linearly independent columns of are the first linearly independent columns of (before defined). Define to be the subset of such that its elements are the indices of the first linearly independent columns of . Then the generators which will be added are the elements in . Since the last columns of are linearly independent again, we have
[TABLE]
Therefore, the next linearly independent columns of are the first linearly independent columns of and so on. We have the first linearly independent columns of are the first linearly independent columns of respectively.
However, the monomials in corresponding to the first linearly independent columns of respectively are redundant since they are multiples of the monomials that were added in the steps . Thus, in the step , only the monomials will be added.
Note that, in the case (mod ) we have . Indeed, since , by [4, Lemma 3.4] we have . Hence, . For , equation (2) also has form as in (3). Let denote the square submatrix of given by
[TABLE]
Then, has form
[TABLE]
By [4, Proposition 3.16] is nonsingular. Hence, the first linearly independent columns of are given by all the columns of and the columns corresponding to the first linearly independent columns of . Note that the monomials in corresponding to the first linearly independent columns of are redundant since they are multiplies of monomials were already added in the step . Furthermore, by using Lemma 3.2,for , we obtain the following. If (mod ) then only the monomials in will be added. If (mod ) then only the monomials in will be added. Finally, for , by [4, Corollary 3.11] the monomials in , , , , will be added. ∎
Remark 3.4**.**
(1) The set of generators of appearing in Proposition 3.3 is not minimal. For instance the monomial is a multiple of . However, with respect to the property P, we will see that the problems only come from the monomials in . (2) The set of generators of in Proposition 3.3 is determined by the monomials in .**
The following lemma will be useful for proving Proposition 3.6.
Lemma 3.5**.**
* for every .*
Proof.
If (mod ), by Proposition 3.3 . Hence, by Lemma 3.2 . If (mod ) then , and Lemma 3.5 follows from Lemma 3.2 again. ∎
In the next proposition, we will prove that the generators of not in , , , , satisfy property in any case.
Proposition 3.6**.**
(1) If (mod ), then the generators of in , , , , , , satisfy property . (2) If (mod ), then the generators of in , , , , , , , satisfy property .
Proof.
(1) If is a generator of in , , , , , , , then is divisible by and . For every monomial of degree in variables , if , by Lemma 3.5, then we have . Otherwise , so that . Thus, satisfies property .
(2) If is a generator of in , then is divisible by because . Hence, for every monomial of degree in variables , we have , so that . Thus, satisfies property .
If is a generator of in , , , , , , . Then, by an argument as in (1), satisfies property . ∎
We still have to prove that the generators of in satisfy property . Under condition , we get the following.
Proposition 3.7**.**
If , then the generators of in satisfy property .
Proof.
Since , by Propsition 2.2 the monomials in are divisible by . Hence, if is a generator of in , for some , then is divisible by . This follows satisfies property because for every monomial of degree in variables , we have , so that . ∎
Proof of Theorem 3.1. If (mod ), by Proposition 3.3 we have
The monomial satisfies property because it is the largest monomial of . By Proposition 3.7 and Proposition 3.6 (1) the generators of in and in , , , , , , satisfy property . Hence, if Conjecture 1.4 is true for , then every minimal generator of satisfies property , so that Conjecture 1.4 is true for .
If (mod ), then Theorem 3.1 is proved by a similar argument as above. From Proposition 3.3, we have the following corollary that describes more explicitly the set of the standard monomials with respect to in case .
Corollary 3.8**.**
*Let be a generic homogeneous ideal of type in , where and . Let and .
(1) If (mod ), then
(2) If (mod ), then
Thus, in order to construct from we only need to know explicitly the monomials in . In the following example, we help the reader to construct from and according to Proposition 3.3. Moreover, we construct from according to Corollary 3.8.
Example 3.9**.**
Let be the generic ideal of type in . Let as in Example 2.4. Then and . We write as reduced form as the following**
[TABLE]
For , The largest monomials of will be added, in this case it is .**
For
[TABLE]
where and . The monomials in corresponding to the first linearly independent columns of will be added. By using Macaulay2 to compute , we see that the largest monomials of are the minimal generators of . This means that the first columns of are linearly independent, so that . Thus, the set of generators of as in Proposition 3.3 is
[TABLE]
Let be the set of the standard monomials with respect to . Denote by and . By Corollary 3.8, we have*
[TABLE]
In [4, Lemma 3.14], it is conjectured that are the largest monomials of for every . However, in the following example, we show that this conjecture is not true.
Example 3.10**.**
Let be the generic ideal of type in . Let as in Example 3.9 with the variable instead of variable . Then , and . Here plays the same role of in Proposition 3.3. We write**
[TABLE]
For , The largest monomials of will be added, in this case it is .**
For
[TABLE]
where and . The monomials in corresponding to the first linearly independent columns of will be added. We have**
[TABLE]
Since and , we get . By using Macaulay2 to compute , we see that the largest monomials of are the minimal generators of . This means that the first columns of are linearly independent. Hence the first linearly independent columns of are the first columns and the -th column. Thus . However the monomial is not a minimal generator because and was already added in step .**
4 Application for Fröberg’s Conjecture
In [17, Theorem 2], Pardue proved that Fröberg’s Conjecture is equivalent to Conjecture 1.4. In order to prove the equivalence of the conjectures, Pardue used the notion of semi-regular sequences already quoted in the introduction and introduced in [17, Section 3]. Regular sequences and semi-regular sequences can be characterized by Hilbert series.
Proposition 4.1**.**
[17, Proposition 1]** Let , where is a homogeneous ideal, and are homogeneous polynomials of degree . Then, (1) is a semi-regular sequence on if and only if for all
[TABLE]
(2) is a regular sequence on if and only if
[TABLE]
In [17, Theorem 2], Pardue proved that Conjecture 1.4 is equivalent to the following conjecture.
Conjecture 4.2**.**
[17, Conjecture C]** Let be a generic homogeneous ideal of type in . Then is a semi-regular sequence on .
We apply now Theorem 3.1 to get partial answers to Conjecture 1.4 and Conjecture 4.2. Let be positive integers. For every , we set for all .
Theorem 4.3**.**
Let be a generic homogeneous ideal of type in with and . Then, Conjecture 1.4 is true for .
Proof.
It is known that Conjecture 1.4 is true in case . For , we have is a generic ideal of type . Hence, Conjecture 1.4 is true for . Since
[TABLE]
by Theorem 3.1 we have that Conjecture 1.4 is true for . ∎
Theorem 4.4**.**
Let be a generic homogeneous ideal of type in with and . If for all , then Conjecture 1.4 is true for .
Proof.
We prove by induction on . For , we have is a generic ideal of type . By Theorem 4.3, Conjecture 1.4 is true for . Since , by Theorem 3.1 we have that Conjecture 1.4 is true for .
For , we have is a generic ideal of type with for all . Hence, by induction Conjecture 1.4 is true for . Since, , by Theorem 3.1 we have that Conjecture 1.4 is true for . ∎
Since Conjecture 1.4 is equivalent to Conjecture 4.2, we also get a partial answer to Conjecture 4.2.
Theorem 4.5**.**
Let be a generic homogeneous ideal of type in with . If for all (in case ), then is a semi-regular sequence on .
We apply now Theorem 4.5 to prove the main result of this section.
Theorem 4.6**.**
Let be a generic homogeneous ideal of type in with . If for all (in case ), then the Hilbert series of is given by
[TABLE]
Proof.
Since Fröberg’s Conjecture is known to be true if , we only have to consider the case . Let be the polynomial ring in variables and view as . Then, there exist the generic homogeneous polynomials of type in such that is the image of in . Set . It is known that is the complete intersection and Hilbert series of is given by
[TABLE]
Applying Theorem 4.5 for we have is a semi-regular sequence on . By Proposition 4.1 we get
[TABLE]
and Theorem 4.6 follows from the following isomorphisms.
[TABLE]
∎
Acknowledgements
I thank my advisor Maria Evelina Rossi for suggesting the problem and for providing helpful suggestions throughout the preparation of this manuscript. I am also grateful to the department of Mathematics of Genova University for supporting my PhD program. The main algorithm that I used in this paper is the incremental method from [12] and [4]. So, I also wish to thank Gao, Guan, Volny and Capaverde for providing this effective approach.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] E. Aguirre, A. S. Jarrah and R. Laubenbacher, Generic ideals and Moreno-Socías conjecture , In Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation (New York, 2001), ACM, 21-23.
- 2[2] D.J. Anick, Thin algebras of embedding dimension three , J. Algebra 100 (1986), 235-259.
- 3[3] C. Bertone and F. Cioffi, Construction of almost revlex ideals with Hilbert function of some complete intersections , ar Xiv:1803.02330 [math.AC].
- 4[4] J. Capaverde and S. Gao, Gröbner bases of generic ideals , ar Xiv:1711.05309 v 1 [math.AC] 14 Nov 2017.
- 5[5] Y. H. Cho and J. P. Park, Conditions for generic initial ideals to be almost reverse lexicographic , J. Algebra 319, 7 (2008), 2761-2771.
- 6[6] M. Cimpoeas, Generic initial ideal for complete intersections of embedding dimension three with strong Lefschetz property , Bull. Math. Soc. Sci. Math. Roumanie (N. S.) 50(98), 1 (2007), 33-36.
- 7[7] D. Eisenbud, Commutative Algebra with a View Toward Algebraic Geometry , Springer-Verlag, New York, 1995.
- 8[8] R. Fröberg, An inequality for Hilbert series of graded algebras , Mathematica Scandinavica 56 (1985), 117-144.
