The saturation number of powers of graded ideals
J\"urgen Herzog, Shokoufe Karimi, Amir Mafi

TL;DR
This paper introduces the concept of saturation number for graded ideals in polynomial rings, analyzing its properties and behavior for various classes of ideals, including monomial, principal Borel, and squarefree Veronese ideals.
Contribution
It defines the saturation number for graded ideals and investigates its bounds and exact values for specific ideal classes, revealing linear and quasi-linear behaviors.
Findings
The saturation number is linearly bounded for all ideals.
For monomial ideals, the saturation number function is quasi-linear for large k.
Explicit formulas are provided for principal Borel and squarefree Veronese ideals.
Abstract
Let be the polynomial ring in variables over a field with maximal ideal , and let be a graded ideal of . In this paper, we define the saturation number of to be the smallest non-negative integer such that . We show that is linearly bounded, and that is a quasi-linear function for , if is a monomial ideal. Furthermore, we show that if is a principal Borel ideal and prove that where is the squarefree Veronese ideal generated in degree . \end{abstract}
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 structures and combinatorial models
The saturation number of powers of graded ideals
Jürgen Herzog, Shokoufe Karimi and Amir Mafi
Jürgen Herzog, Fachbereich Mathematik, Universität Duisburg-Essen, Campus Essen, 45117 Essen, Germany
Sh. Karimi, Department of Mathematics, University of Kurdistan, P.O. Box: 416, Sanandaj, Iran.
A. Mafi, Department of Mathematics, University of Kurdistan, P.O. Box: 416, Sanandaj, Iran.
Abstract.
Let be the polynomial ring in variables over a field with maximal ideal , and let be a graded ideal of . In this paper, we define the saturation number of to be the smallest non-negative integer such that . We show that is linearly bounded. Furthermore, we show that if is a principal Borel ideal and prove that where is the squarefree Veronese ideal generated in degree . A general strategy is given to compute when is a polymatroidal ideal.
Key words and phrases:
graded ideals, polymatroidal ideals, saturation number
2010 Mathematics Subject Classification:
Primary 13F20; Secondary 13H10, 05E40
This paper was done while the first author was visiting University of Kurdistan, Iran. He is thankful to the University for the hospitality.
Introduction
Throughout this paper, we assume that is the polynomial ring in variables over a field with the unique graded maximal ideal , and that is a graded ideal of . If is a monomial ideal, then we denote by the unique minimal set of monomial generators of .
The ideal
[TABLE]
is called the saturation of . Since and is Noetherian, there exists an integer such that . This implies that . Here denotes the length of a module .
In the first part of this paper we introduce of which is defined to be the smallest non-negative integer such that . We show that and obtain from this that is bounded by a linear function of . It would be interesting to have this linear bound also for regular local rings. For monomial ideals one obtains an even better result. Indeed, we show that there exists a quasi-linear function such that for if all powers of have linear resolution. This is a consequence of the fact that is finitely generated when is a monomial ideal.
In the second part we study the saturation number of special classes of polymatroidal ideals. A polymatroidal ideal is a monomial ideal, generated in a single degree satisfying the following condition: for all monomials with , there exists an index such that and (see [8] or [9]). A squarefree polymatroidal ideal is called a matroidal ideal. Among the stable ideals, the principal Borel ideals are polymatroidal. The saturation number for this class of ideals behaves particularly nice. We show that for all . The squarefree principal ideals are matroidal. Here the situation is more complicated. In this paper only consider the squarefree Veronese ideals. We denote by (see [8] or [13]) the squarefree Veronese ideal of degree in the variables , and show that for all . According to [15, Proposition 5] any polymatroidal ideal is of intersection type. This fact, allows us to compute the saturation number of a polymatroidal ideal in each concrete case. Moreover, it can be shown that if is any monomial ideal of intersection type with , then . Here .
For unexplained notation or terminology, we refer the reader to [9] and [3]. Several explicit examples were performed with help of the computer algebra systems Macaulay2 [7] and CoCoA [1].
1. Upper bounds for the saturation number of an ideal and its powers
We start this section by the following definition.
Definition 1.1**.**
The number is called the saturation number of . **
It is clear that if and only if . In particular, if is a squarefree monomial ideal.
Let be a finitely generated graded -module. We set
[TABLE]
if minimum and maximum exist and otherwise we set and respectively. Note that if is a finite length graded -module, then is the largest degree of a socle element of . For a finite length graded -module , we set and .
Lemma 1.2**.**
Let be a graded -module of finite length. Then
[TABLE]
Proof.
We proceed by induction on . The assertion is trivial if . Let . Then , and . Thus, together with the induction hypothesis we obtain
[TABLE]
as desired.
Applied to the saturation of an ideal we obtain
Corollary 1.3**.**
Let be a graded ideal. Then
[TABLE]
In general the inequality may be strict. The following example was communicated to us by Dancheng Lu and Lizhong Chu:
let . Then and .
We denote by the Castelnuovo-Mumford regularity of a finitely generated graded -module.
Corollary 1.4**.**
Let be a graded ideal. Then
Proof.
It follows from Corollary 1.3 that . Since is of finite length, we have . By [4] and [6], . The desired conclusion follows.
The following result follows by Corollary 1.4 and [16] (see also [5]).
Corollary 1.5**.**
Let be a graded ideal. Then there exists a linear function such that for all .
Observe that where is an -primary ideal. We call special if is a power of . In particular, is special for all . In the sequel we will use
Proposition 1.6**.**
Let a graded ideal with . Then
[TABLE]
Proof.
If , then , and since is saturated we have . Now let . We proceed by induction on . If , then the assertion is trivial. Now let . We claim that . It is clear that . Conversely, let . Then since is saturated and . Hence . Together with our induction hypothesis we obtain
[TABLE]
as desired.
For monomial ideals, Corollary 1.5 can be improved as follows: a function is called quasi-linear, if there exists an integer and for , linear function with such that for .
Theorem 1.7**.**
Let be a monomial ideal. Then there exists a quasi-linear function such that for .
Proof.
We want to show that is quasi-linear. By Brodmann [2], is constant for all . If for all , then for . Therefore, we may assume that there exists such that that for . Now let , and let be the highest degree of a socle element of . Then . On the other hand, , where denotes the -regularity of a graded module, see [5]. It follows therefore from [5, Theorem 3.1] (see also [16]), that is a linear function for . Thus it remains to be shown that is a quasi-linear function.
Note that is the least degree of a generator of . We denote this number by , and have to show that the function is quasi-linear for . In order to prove this we consider the graded -algebra Since is a monomial ideal, this -algebra is finitely generated, see [10, Theorem 3.2]. Therefore, by [10, Theorem 2.1] there exists an integer such that is a standard graded -algebra. Now let be any number , and let with . Then . Thus , and the desired conclusion follows.
2. The saturation number for polymatroidal ideals
As a first example of polymatroidal ideals we consider (squarefree) principal Borel ideals. Let be a monomial in . We set for . For a given integer , we let be the ideal generated by all with for . The ideal is squarefree if and only if .
Definition 2.1**.**
Let be a monomial ideal, and let be an integer. Then is called -strongly stable, if
- (i)
; 2. (ii)
for all and all integers with and it follows that .
The ideal is called squarefree strongly stable, if it is -strongly stable. is strongly stable, if is -strongly stable for bigger than the maximal degree of a monomial in . In other words, if and divides , then for all .
Let be monomials in with for and . There exists a unique smallest -strongly stable ideal containing which we denote by . The monomials are called Borel generators of . If , then is called -principal Borel, and -principal Borel ideals are simple called principal Borel ideals.
Let be monomials of same degree and assume that for . Then we write if . This defines for each , a partial order on the set of monomials of degree whose exponents are bounded by .
Theorem 2.2**.**
Let be a monomial with , and let . Then .
Proof.
It is observed in [8] that principal Borel ideals are polymatroidal. Therefore these ideals are of intersection type, as shown in [15, Proposition 5]. Let with . Then , (see for example [12, Examples 2.8]).
We claim that . We prove by induction on . If , then there is nothing to prove. Let and the claim has been proved for fewer than . It is clear that . Since , we can apply the inductive hypothesis to deduce our claim. Therefore, by applying [13, Corollary 4.10], we see that
[TABLE]
A monomial of least degree in is Finally we apply Proposition 1.6 we get that , as desired.
Lemma 2.3**.**
Let be a polymatroidal ideal and an integer. Then is a polymatroidal ideal. In particular, if is -bounded monomial. Then is a polymatroidal ideal.
Proof.
We show that for the exchange property holds. Indeed, let be such that , Since is polymatroidal, there exists such that and . Since , it follows that , Therefore, . This implies that .
Lemma 2.4**.**
Let be a -bounded monomial of degree . Then , where or is a -Borel ideal generated in degree .
Proof.
We may assume that . By Lemma 2.3, is a polymatroidal ideal, and hence has a -resolution, see [14, Lemma 1.3 ]. It follows that , where is generated in degree . Let . Then for all . Suppose for some . Then , a contradiction. This shows that all generators of are -bounded.
To complete the proof we must show that is -Borel. Let with , and . Then we must show that , that is, for . Indeed, if , then . If , then because and is -Borel.
The next result is taken from [11].
Lemma 2.5**.**
Let be -bounded monomials of degree . Let with and with . Then if and only if for .
Theorem 2.6**.**
Let as before and , be positive integers. Let with integers and . We set . If , then is defined in if and only if and if then is defined in if and only if , and we have
[TABLE]
if is defined in . Otherwise, .
Proof.
We may assume that . Indeed,if , then and . In this case the assertion is obvious.
We first show that . For this it suffices to show that , because is -Borel. Indeed, let with and with . By Lemma 2.5 we must show that for . Figure 1 illustrates this comparison. The integers and are labeled from right to left. Then for any with the boxes with the same coordinate give us the value of and . For example, for in Figure 1 we obtain and , and for we obtain and . From the equations and with and , it follows that because . Therefore Figure 1 shows that the desired inequalities hold.
Now since , and since by Lemma 2.4 the monomials of degree in generate -Borel ideal, we see that .
Conversely, note that with respect to , the monomial is the unique largest -bounded monomial of degree . Therefore, , because Lemma 2.4 implies that the monomials which do not belong to are -bounded of degree .
As an immediate consequence of Theorem 2.6 we obtain
Corollary 2.7**.**
Given integers with and . Then
[TABLE]
Example 2.8**.**
Let . Then and for we have
[TABLE]
In fact, because is squarefree. Now let . If , then if and only if . Therefore, and . Finally, if , then if and only if . Therefore, and . **
Now let be any polymatroidal ideal. In [15, Proposition 5] it is shown that is of intersection type, which means that is the intersection of powers of monomial prime ideals. In other words, there exists monomial prime ideals and positive integers , and such that . Notice that , so that .
Corollary 1.6 implies that if the least degree of a generator of , and , then .
Example 2.9**.**
Let . An element of least degree in is . Therefore, .**
By applying monomial localization one obtains
Corollary 2.10**.**
Let be a monomial ideal with the property that and that all powers of are of intersection type. Then for all .
Since power of polymatroidal ideals are again polymatroidal we have
Corollary 2.11**.**
Let be a polymatroidal ideal with . Then for all .
Example 2.12**.**
Let be a transversal polymatroid. In other words, is a product of monomial prime ideals. Then . This follows from Corollary 2.11 because , (see[13, Corollary 4.6]).**
In order to compute of a polymatroidal ideal we have to determine its presentation as an intersection of powers of monomial prime ideals, as described in [15]: let be a discrete polymatroid on the ground set of rank with rank function , see [8]. The complementary rank function is given by for all .
A subset is called -closed, if for any proper subset of , and is called -separable if there exist non-empty subsets and of with and such that . If is not -separable, then it is called -inseparable.
With this information the intersection presentation of polymatroidal ideal is given as follows:
Theorem 2.13** (Theorem 12, [15]).**
Let be a polymatroidal ideal associated with the discrete polymatroid with complementary rank function . Then
[TABLE]
where the intersection is taken over all which are -closed and -inseparable.
Example 2.14**.**
Consider the polymatroidal ideal . Its rank function is given by , if and if . Therefore, if , if and if . It follows that is -closed and -inseparable, if and only if or . Thus Theorem 2.13 implies that
[TABLE]
Since , Corollary 1.6 implies that . **
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. Abbott and A. M. Bigatti, a C++ library for doing Computations in Commutative Algebra , Available at http://cocoa.dima.unige.it/cocoalib.
- 2[2] M. Brodmann, The asymptotic nature of the analytic spread , Math. Proc. Cambridge Philos. Soc., 86 (1979), 35-39.
- 3[3] W. Bruns and J. Herzog, Cohen-Macaulay rings , Cambridge University Press, Cambridge, UK, (1998).
- 4[4] A. Conca and J. Herzog, Castelnuovo-Mumford regularity of products of ideals , Collect. Math., 54 (2003), 137-152.
- 5[5] D. Cutkosky, J. Herzog and N.V. Trung, Asymptotic behaviour of Castelnuovo-Mumford regularity , Compos. Math., 80 (1999), 273-297.
- 6[6] D. Eisenbud, Commutative algebra , with a view toward algebraic geometry, Graduate Texts in Mathematics, 150, Springer-Verlag, New York, (1995).
- 7[7] D. R. Grayson and M. E. Stillman, Macaulay 2, a software system for research in algebraic geometry , Available at http://www.math.uiuc.edu/Macaulay 2/.
- 8[8] J. Herzog and T. Hibi, Discrete polymatroids , J. Algebr. Comb., 16 (2002), 239-268.
