This paper provides explicit formulas for the multiplicities of various classes of monomial ideals, including codimension 1 ideals, almost complete intersections, and a new extended class, with visual interpretations.
Contribution
It introduces new formulas for multiplicities of specific monomial ideals and defines a new class extending monomial complete intersections.
Findings
01
Formulas for multiplicities of codimension 1 monomial ideals
02
Formulas for multiplicities of almost complete intersections
03
Introduction of a new class of ideals with multiplicity formula
Abstract
In this article we give explicit descriptions of the multiplicities of some classes of monomial ideals. For instance, we give a formula for the multiplicities of all codimension 1 monomial ideals, and another formula for the multiplicities of almost complete intersections. We also introduce a new class of ideals that extends the family of monomial complete intersections, and give a formula for their multiplicity, as well as a visual interpretation of this invariant.
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.
Denote by S a polynomial ring over a field, and let M=(m1β,β¦,mqβ) be a monomial ideal of S. If codim(S/M)=1, we prove that its multiplicity is given by
[TABLE]
On the other hand, if M is a complete intersection, and Mβ²=(m1β,β¦,mqβ,m) is an almost complete intersection, we show that
[TABLE]
We also introduce a new class of ideals that, broadly speaking, extends the family of monomial complete intersections and that of codimension 1 ideals, and give an explicit formula for their multiplicity.
1. Introduction
Although the concept of multiplicity has been in our midst for a long time, an intensive research of this invariant was triggered by a series of conjectured multiplicity bounds introduced by Huneke, Herzog, and Srinivasan [HS, HS1] in the late 1990βs and the early 2000βs. As a result of the efforts of many mathematicians, some of these conjectures were proved in particular cases [FS], and finally, the general case was established using Boij-SΓΆderberg theory [BS, EFW, ES].
With the multiplicity bounds still fresh in our minds, we now set the focus on a different target; finding exact values of the multipicities of classes of ideals. For instance, if S represents a polynomial ring over a field, and M=(m1β,β¦,mqβ) is a monomial ideal of S, we prove the following:
(i)
If codim(S/M)=1, then e(S/M)=deg(gcd(m1β,β¦,mqβ)).
2. (ii)
If M is a complete intersection, and Mβ²=(m1β,β¦,mqβ,m) is an almost complete intersection, then e(S/Mβ²)=i=1βqβdeg(miβ)βi=1βqβdeg(gcd(miβ,m)miββ).
Using monomial complete intersections as starting point and the formula for their multiplicities as inspiration, we construct a larger family of monomial ideals, and describe their multiplicities both algebraically and graphically.
The organization of this article is as follows. In Section 2, we give the necessary background to understand this work. In Section 3, we express the multiplicities of ideals of codimension 1 in explicit form. In Section 4, we define the concept of stem ideal, which extends that of monomial complete intersection, and compute its multiplicity explicitly. In Section 5, we compute multiplicities in an even more general setting. In Section 6, we introduce a new approach, and use it to compute the multiplicities of monomial almost complete intersections.
2. Background and notation
Throughout this paper S represents a polynomial ring in n variables over a field. In some examples, n takes a specific value, and the variables are denoted with the letters a, b, c, etc. Everywhere else, n is arbitrary, and S is denoted S=k[x1β,β¦,xnβ]. The letter M always represents a monomial ideal in S.
We open this section by defining the Taylor resolution as a multigraded free resolution, something that will turn out to be fundamental in the present work. The construction that we give below can be found in [Me].
Construction 2.1**.**
Let M=(m1β,β¦,mqβ). For every subset {mi1ββ,β¦,misββ} of {m1β,β¦,mqβ}, with 1β€i1β<β¦<isββ€q,
we create a formal symbol [mi1ββ,β¦,misββ], called a Taylor symbol. The Taylor symbol associated to {} will be denoted by [β ].
For each s=0,β¦,q, set Fsβ equal to the free S-module with basis {[mi1ββ,β¦,misββ]:1β€i1β<β¦<isββ€q} given by the
(sqβ) Taylor symbols corresponding to subsets of size s. That is, Fsβ=i1β<β¦<isββ¨βS[mi1ββ,β¦,misββ]
(note that F0β=S[β ]). Define
[TABLE]
[TABLE]
For s=1,β¦,q, let fsβ:FsββFsβ1β be given by
[TABLE]
and extended by linearity.
The Taylor resolutionTMβ of S/M is the exact sequence
[TABLE]
We define the multidegree of a Taylor symbol [mi1ββ,β¦,misββ], denoted mdeg[mi1ββ,β¦,misββ], as follows:
mdeg[mi1ββ,β¦,misββ]=lcm(mi1ββ,β¦,misββ).
Definition 2.2**.**
Let M be minimally generated by a set of monomials G.
β’
A monomial mβG is called dominant (in G) if there is a variable x, such that for all mβ²βGβ{m}, the exponent with
which x appears in the factorization of m is larger than the exponent with which x appears in the factorization of mβ². In this case, we say that m is dominant in x, and x is a dominant variable for m.
β’
M is called a dominant ideal if each element of G is dominant.
Example 2.3**.**
Let M1β and M2β be minimally generated by G1β={a2,b3,ab} and G2β={a2b,ab3c,bc2}, respectively. Note that a2 and b3 are dominant in G1β, but ab is not. Therefore, M1β is not dominant. On the oher hand, a2b, ab3c, and bc2 are dominant in G2β (note that a, b, and c are dominant variables for a2b, ab3c, and bc2, respectively). Thus, M2β is a dominant ideal.
The next theorem gives a complete characterization of when the Taylor resolution is minimal [Al].
Theorem 2.4**.**
With the above notation, TMβ is minimal if and only if M is dominant.
Proof.
β
The following classical result will be quoted often. Let F be a free resolution of S/M. If [Οijβ] represents the jth basis element of F in homological degree i, define dijβ=deg(mdeg[Οijβ]). The Peskine-Szpiro formula [PS] states the following.
Lemma 2.5**.**
With the above notation, we have
[TABLE]
where c=codim(S/M).
Remark 2.6**.**
As pointed out in [HS1], The Peskine-Szpiro formula does not require F to be minimal. In this article, the Peskine-Szpiro formula will be used in two particular cases; when F=TMβ, and when F is a minimal resolution of S/M.
3. Multiplicity and codimension 1
Let m1β,β¦,mrβ be r monomials of the form miβ=x1Ξ±i1βββ¦xnΞ±inββ. For each i, let mi,polβ denote the polarization of miβ; that is,
[TABLE]
Also, for each i, let Aiβ={x11β,β¦,x1Ξ±i1ββ,β¦,xn1β,β¦,xnΞ±inββ}. The sets Aiβ are said to be associated to the monomials miβ. If m1β,β¦,mrβ are the minimal generators of a monomial ideal M, then the Venn diagram displaying the sets A1β,β¦,Arβ will be called the diagram of M (Example 4.3 shows the diagram of an ideal M).
The next lemma states basic facts about sets and lcmβs.
Lemma 3.1**.**
Let A1β,β¦,Arβ be the sets associated to r monomials m1β,β¦,mrβ. Then
(i)
deg(lcm(m1β,β¦,mrβ))=#(i=1βrβAiβ).
2. (ii)
(ii) Since M is minimally generated by q monomials, and codim(S/M)=q, no pair of minimal generators can be divided by a common variable. This implies that M is a complete intersection, and the result holds.
β
Remark 3.3**.**
: Theorem 3.2 (ii) simply paraphrases the well-known fact that the multiplicity of a complete intersection is the product of the degrees of its minimal generators. Including this result in Theorem 3.2 allows us to compare the multiplicities of monomial ideals in two opposite scenarios: when the codimension is minimal or maximal. The formulas given by Theorem 3.2 inspired the formula in Theorem 4.5, where we give the multiplicities of some monomial ideals with intermediate codimension.
4. Multiplicity and stem ideals
Suppose that m1β is a dominant generator of M=(m1β,β¦,mqβ). According to the third structural decomposition [Al1, Definition 4.7],
[TABLE]
where M1β=(m2β,β¦,mqβ), and Mm1ββ=(m1βlcm(m1β,m2β)β,β¦,m1βlcm(m1β,mqβ)β).
Lemma 4.1**.**
Suppose that m1β is a dominant generator of M=(m1β,β¦,mqβ). Let M1β and Mm1ββ be the ideals determined by the third structural decomposition of M.
(i)
If codim(S/M)=codim(S/M1β)=codim(S/Mm1ββ), then
[TABLE]
2. (ii)
If codim(S/M)=codim(S/M1β)<codim(S/Mm1ββ), then
[TABLE]
Proof.
Suppose that codim(S/M)=codim(S/M1β)=c. If we denote by [ΞΈi,jβ] (respectively, [Οi,jβ], and [Οi,jβ]) the jth basis element in homological degree i of the minimal resolution of S/M (respectively, S/M1β, and S/Mm1ββ) then, by the third structural decomposition,
[TABLE]
By the Peskine-Szpiro formula,
[TABLE]
[TABLE]
Therefore,
[TABLE]
(i) Since codim(S/Mm1ββ)=c,
[TABLE]
Hence,
[TABLE]
(ii) Since codim(S/Mm1ββ)β₯c+1,
[TABLE]
Hence,
[TABLE]
β
Next, we will introduce the class of stem ideals, and will give an explicit description of their multiplicities. The interesting fact about stem ideals is that they extend the class of dominant ideals of codimension 1, and that of complete intersections; and the formula for their multiplicities generalizes the statement of Theorem 3.2.
Definition 4.2**.**
A dominant ideal M=(m1β,β¦,mqβ) will be called a stem ideal if, after reordering the minimal generators, there are integers 0=i0β<i1β<β¦<icβ=q, and monomials l1β,β¦,lcβ of positive degree with the following properties:
(i)
For each 1β€tβ€c, gcd(mitβ1β+1β,mitβ1β+2β,β¦,mitββ)=ltβ.
2. (ii)
If 1β€r<sβ€q, and for some t, rβ€itβ<s, then gcd(mrβ,msβ)=1.
The monomials l1β,β¦,lcβ will be called stems of M. (Note that codim(S/M)=c.)
Example 4.3**.**
Let M=(m1β=a2bc,m2β=b3c,m3β=c4,m4β=d2e2,m5β=def,m6β=dg2). We will show that M is a stem ideal. Let i0β=0; i1β=3; i2β=6, and let l1β=c;l2β=d. Then
(i)
gcd(m1β,m2β,m3β)=c=l1β, and gcd(m4β,m5β,m6β)=d=l2β.
2. (ii)
Let 1β€rβ€i1β=3<sβ€6. Since the only variables that appear in the factorization of mrβ are in {a,b,c}, and the only variables that appear in the factorization of msβ are in {d,e,f,g}, it follows that
lcm(mrβ,msβ)=1.
We have proven that M is a stem ideal, with stems l1β=c, and l2β=d. The diagram of M is
Let M be a stem ideal. Suppose that, with the notation of Definition 4.2, i1ββi0ββ₯i2ββi1ββ₯β¦β₯icββicβ1ββ₯1. Then
(a)
If i1ββ₯2, and gcd(m1β,m2β,β¦,mi1ββ)gcd(m2β,β¦,mi1ββ)β=1, then codim(S/Mm1ββ)β₯c+1.
2. (b)
If i1ββ₯2, and gcd(m1β,m2β,β¦,mi1ββ)gcd(m2β,β¦,mi1ββ)βξ =1, then codim(S/Mm1ββ)=c.
Proof.
(a) When i1β=2, gcd(m1β,m2β,β¦,mi1ββ)gcd(m2β,β¦,mi1ββ)β=gcd(m1β,m2β)gcd(m2β)βξ =1. Thus, we may assume i1ββ₯3. By Lemma 3.1 (ii),
#(t=2βi1ββAtβ)=deg(gcd(m2β,β¦,mi1ββ))=deg(gcd(m1β,β¦,mi1ββ))=#(t=1βi1ββAtβ).
It follows that t=1βi1ββAtβ=t=2βi1ββAtβ. Hence, t=2βi1ββAtββA1β and t=2βi1ββ(AtββA1β)=[t=2βi1ββAtβ]βA1β=β .
For each 2β€tβ€i1β, let mtβ²β=m1βlcm(m1β,mtβ)β. Note that AtββA1β is the set associated to mtβ²β. By Lemma 3.1 (ii), deg(gcd(m2β²β,β¦,mi1ββ²β))=#t=2βi1ββ(AtββA1β)=#(β )=0. Therefore, gcd(m2β²β,β¦,mi1ββ²β)=1. It follows that codim((m2β²β,β¦,mi1ββ²β)Sβ)β₯2. On the other hand, codim((mi1β+1β,β¦,micββ)Sβ)=cβ1. Combining these facts, we get
[TABLE]
(b) Since gcd(m1β,m2β,β¦,mi1ββ)gcd(m2β,β¦,mi1ββ)βξ =1, we must have that gcd(m2β,β¦,mi1ββ)β€m1β. Hence, t=2βi1ββAtββA1β. Thus, β β(t=2βi1ββAtβ)βA1β=t=2βi1ββ(AtββA1β). It follows that 1β€#(t=2βi1ββ(AtββA1β))=deg(gcd(m2β²β,β¦,mi1ββ²β)). Hence, there is a variable dividing each of m2β²β,β¦,mi1ββ²β. Since Mm1ββ=(m2β²β,β¦,mi1ββ²β,mi1β+1β,β¦,micββ), it follows that codim(S/Mm1ββ)=c.
β
The next theorem, which is the main result of this section, shows that the multiplicity of a stem ideal is the product of the degrees of its stems.
Theorem 4.5**.**
Let M=(m1β,β¦,mqβ) be a stem ideal with stems l1β,β¦,lcβ. Then
[TABLE]
Proof.
Without loss of generality, we may assume that i1β=i1ββi0ββ₯i2ββi1ββ₯β―β₯icββicβ1ββ₯1. The proof is by induction on the number q of minimal generators of M.
Suppose that q=1. Then M=(m1β) is a complete intersection, and e(S/M)=deg(m1β)=deg(l1β).
Suppose now that the theorem holds when M is minimally generated by qβ1 monomials. Let us prove the theorem in the case that M is minimally generated by q monomials.
We will consider three cases.
First case: i1β=1. In this case, we must have that itβ=t, for all t=1,β¦,c. (In particular, c=icβ=q.) Thus, if 1β€r<sβ€q, we have that r=irβ<s and, by property (ii) of Definition 4.2, gcd(mrβ,msβ)=1. This means that M is a complete intersection and, therefore, e(S/M)=t=1βqβdeg(mtβ)=t=1βcβdeg(mitββ)=t=1βcβdeg(ltβ).
Second case: i1ββ₯2, and gcd(m2β,β¦,mi1ββ)=gcd(m1β,m2β,β¦,mi1ββ). Then codim(S/M)=codim(S/M1β)=c, and codim(S/Mm1ββ)β₯c+1, by Lemma 4.4 (i).
It follows from Lemma 4.1 (ii), that e(S/M)=e(S/M1β) and, by induction hypothesis,
[TABLE]
Third case: i1ββ₯2, and gcd(m2β,β¦,mi1ββ)ξ =gcd(m1β,β¦,mi1ββ). Then codim(S/M)=codim(S/M1β)=codim(S/Mm1ββ)=c, and, by Lemma 4.1(i), e(S/M)=e(S/M1β)βe(S/Mm1ββ). Notice that
[TABLE]
By induction hypothesis,
[TABLE]
β
In Example 4.3, the stems of a stem ideal M are shown to be l1β=c and l2β=d. By Theorem 4.5, e(S/M)=deg(l1β)deg(l2β)=1.1=1. In general, if M=(m1β,β¦,mqβ) is a stem ideal, its multiplicity depends on its codimension, and is given by the following table:
[TABLE]
Remark 4.6**.**
: In the diagrams above, abusing the notation, we have identified the sets associated to the stems liβ with the stems themselves.
Remark 4.7**.**
: In the codimension 1 case, we do not need to assume that M is a stem ideal. The result follows from Theorem 3.2 (i), and holds for arbitrary monomial ideals.
In the next three results we investigate quadratic dominant ideals, which are simple particular cases of stem ideals. We describe their multiplicity as well as their regularity, and show how one of these invariants can be expressed in terms of the other.
Corollary 4.8**.**
Let M be a quadratic dominant ideal with minimal generating set G. Then
[TABLE]
where U={mβG:lcm(m,mβ²)=1,Β forΒ allΒ mβ²βGβ{m}}.
Proof.
Let M=(m1β,β¦,mqβ). Let {y1β,β¦,yhβ}β{x1β,β¦,xnβ} be the set of all variables that divide more than one element of G. For all t=1,β¦,h, let Utβ={mβG:ytββ£m} (Notice that #Utββ₯2.) Without loss of generality, we may assume that there are integers j1β<j2β<β¦<jhβ, such that U1β={m1β,β¦,mj1ββ}, U2β={mj1β+1β,mj1β+2β,β¦,mj2ββ}, β¦, Uhβ={mjhβ1β+1β,mjhβ1β+2β,β¦,mjhββ}. Then U={mjhβ+1β,mjhβ+2β,β¦,mjhβ+vβ=mqβ}. We will prove that the integers i0β=0,i1β=j1β,β¦,ihβ=jhβ,ih+1β=jhβ+1,ih+2β=jhβ+2,β¦,ih+vβ=jhβ+v=q, and the monomials ltβ=gcd(mitβ1β+1β,β¦,mitββ), with 1β€tβ€h+v, satisfy the two defining conditions of a stem ideal.
First property. If 1β€tβ€h, then ltβ=gcd(Utβ). Since each monomial of Utβ is divisible by ytβ, deg(ltβ)=deg(gcd(Utβ))β₯1. That is, ltβ is a monomial of positive degree. On the other hand, if t=h+w, with 1β€wβ€v, then ltβ=mitββ and, once again, ltβ is a monomial of positive degree.
Second property. Suppose that, for some t, rβ€itβ<s. If sβ₯ih+1β=jhβ+1, then msββU and, by definition, gcd(msβ,mrβ)=1. On the other hand, if s<ih+1β, then for some t<kβ€h, msββUkβ, and mrββ/Ukβ. Therefore, ykββ£msβ and ykββ€mrβ.
Let msβ=ykβy, with yβ{y1β,β¦,yhβ}. Since #Ukββ₯2 and msβ is a dominant monomial, y must be a dominant variable of msβ, which implies that yβ€mrβ. Hence, gcd(msβ,mrβ)=1.
We have proven that M is a stem ideal with stems l1β=gcd(U1β),β¦,lhβ=gcd(Uhβ),lh+1β=mihβ+1β,β¦,lh+vβ=mih+vββ. Since for all t=1,β¦,h, #Utββ₯2, it follows that deg(ltβ)=1. Finally, by Theorem4.5,
[TABLE]
β
Proposition 4.9**.**
Let M=(m1β,β¦,mqβ) be a quadratic dominant ideal with minimal generating set G. Let U={mβG:lcm(m,mβ²)=1,Β forΒ allΒ mβ²βGβ{m}}. Let {y1β,β¦,ykβ}β{x1β,β¦,xnβ} be the set of all variables that divide more than one element of G. Then
reg(S/M)=#U+k=codim(S/M).
Proof.
For all t=1,β¦,k, let Utβ={mβG:ytββ£m}. Let itβ=#Utβ. Then Utβ can be expressed in the form Utβ={ytβz1β,ytβz2β,β¦,ytβzitββ}. Hence, lcm(Utβ)=ytβz1βz2ββ¦zitββ, and deg(lcm(Utβ))=itβ+1.
Let [Ο]=[m1β,β¦,mqβ]. Then deg(mdeg[Ο])=deg(lcm(G))=t=1βkβdeg(lcm(Utβ))+deg(lcm(U))=t=1βkβ(itβ+1)+2(#U)=t=1βkβitβ+k+2#U. Now, q=t=1βkβ#Utβ+#U=t=1βkβitβ+#U. Thus, deg(mdeg[Ο])=q+[#U+k]. Hence, bq,q+[#U+k]β(S/M)ξ =0, which means that reg(S/M)β₯#U+k.
Let r=reg(S/M)=max{s:bi,i+sβ(S/M)ξ =0}, and let [Ο]=[h1β,β¦,hiβ] be a basis element of the minimal resolution of S/M, such that hdeg[Ο]=i, and deg(mdeg[Ο])=i+r. Since M is dominant, if hβGβ{h1β,β¦,hiβ}, then hβ€lcm(h1β,β¦,hiβ). It follows that the basis element [Οβ²]=[h1β,β¦,hiβ,h] satisfies hdeg[Οβ²]=i+1; deg(mdeg[Οβ²])=i+r+j, with jβ₯1. Hence, bi+1,i+r+jβ(S/M)ξ =0. Since reg(S/M)=r, we must have j=1. This implies that for all k=i,β¦,q, there is a basis element [Οkβ]βTMβ that determines the regularity of S/M (that is, hdeg[Οkβ]=k, and deg(mdeg[Οkβ])=k+r). In particular, for [Οqβ]=[m1β,β¦,mqβ] we have hdeg[Οqβ]=q, and deg(mdeg[Οqβ])=q+r. Combining facts, we have that reg(S/M)=r=#U+k.
For each mβU, let xmβ be a variable dividing m. It follows from the definition of U that xmβξ =xmβ²β if mξ =mβ², and {xmβ:mβU}β{y1β,β¦,ykβ}=β . Let X={xmβ:mβU}β{y1β,β¦,ykβ}. Note that every minimal generator is divisible by some variable of X. Thus, codim(S/M)β€#X=#U+k. Fot all t=1,β¦,k, let mtβ²ββUtβ. Then the ideal generated by {mtβ²β:t=1,β¦,k}βU is a complete intersection. Thus, codim(S/M)=#U+k.
β
Corollary 4.10**.**
Let M be a quadratic dominant ideal with minimal generating set G. Let k be the number of variables that divide more than one element of G. Then
It follows from Corollary 4.8 and Proposition 4.9.
β
5. Multiplicity and structural decomposition
In this section we describe the multiplicities of ideals belonging to a class that extends the family of stem ideals.
Let M be a dominant ideal such that codim(S/M)=c. Suppose that M can be expressed in the form M=(m1β,β¦,mdβ,h1β,β¦,hcβ), where (h1β,β¦,hcβ) is a complete intersection (note that stem ideals satisfy these hypotheses). Let C={(j,mΛ)βZ+ΓS: there are integers 1β€r1β<β¦<rjββ€d, such that mΛ=lcm(mr1ββ,β¦,mrjββ)}βͺ{(0,1)}. For each (j,mΛ)βC, let MmΛβ=(h1β²β,β¦,hcβ²β), where hiβ²β=mΛlcm(mΛ,hiβ)β (in particular, M1β=(h1β,β¦,hcβ)). According to [Al1, Theorem 4.1], we have the following.
Theorem 5.1**.**
*For each integer k and each monomial l,
[TABLE]
For practical reasons, the set C defined above will be expressed in the form C={(j1β,mΛ1β),β¦,(jwβ,mΛwβ)}.
The notation that we introduce now retains its meaning throughout this section. For each iβ₯0, let {[ΞΈ1iβ],β¦,[ΞΈtiβiβ]} be the set of basis elements of the minimal resolution of S/M in homological degree i (notice that tiβ=biβ(S/M)). Likewise, for each iβ₯0, and each 1β€kβ€w, let {[ΟmΛkβ,1iβ],β¦[ΟmΛkβ,tmΛkβ,iβiβ]} be the set of all basis elements of the minimal resolution of S/MmΛkββ, in homological degree i (thus, tmΛkβ,iβ=biβ(S/MmΛkββ)).
In order for the proof of the next theorem to be clear we will make the following convention. If jkβ,i are two integers such that iβjkβ<0, or iβjkββ₯pd(S/MmΛkββ), then we define deg[ΟmΛkβ,jiβjkββ]+deg(mΛkβ)=0. (The [ΟmΛkβ,jiβ] are the basis elements of the minimal resolution of S/MmΛkββ in homological degree i. In the proof of the next theorem, we will encounter expressions of the form deg[ΟmΛkβ,jiβjkββ]+deg(mΛkβ). These expressions make sense when 0β€iβjkββ€pd(S/MmΛkββ); otherwise, they do not, and we define them as [math]).
Lemma 5.2**.**
With the above notation,
[TABLE]
Proof.
If l=0, then i=1βpd(S/MmΛkββ)β(β1)ij=1βtmΛkβ,iββdegl[ΟmΛkβ,jiβ]=i=1βpd(S/MmΛkββ)β(β1)ibiβ(S/MmΛkββ)=β1+i=0βpd(S/MmΛkββ)β(β1)ibiβ(S/MmΛkββ)=β1.
Let 1β€lβ€c. Recall that each MmΛkββ is of the form MmΛkββ=(h1β²β,β¦,hcβ²β), where
hiβ²β=lcm(mr1ββ,β¦,mrjββ)lcm(mr1ββ,β¦,mrjββ,hiβ)β. Since hiβ²β is a divisor of hiβ, MmΛkββ is a complete intersection. Therefore, codim(S/MmΛkββ)=c, and the formula above is simply a restatement of the Peskine-Szpiro formula.
β
Theorem 5.3**.**
Let M be a dominant ideal with codim(S/M)=c. Suppose that M can be expressed in the form M=(m1β,β¦,mdβ,h1β,β¦,hcβ), where (h1β,β¦,hcβ) is a complete intersection. Then,
Applying Lemma 5.2 to the last expression, we obtain
[TABLE]
Therefore,
[TABLE]
Finally, multiplying both sides by c!(β1)cβ, we obtain:
[TABLE]
β
Corollary 5.4**.**
Let M be a dominant ideal with codim(S/M)=c. Suppose that M can be expressed in the form M=(m1β,β¦,mdβ,h1β,β¦,hcβ), where (h1β,β¦,hcβ) is a complete intersection. Then,
[TABLE]
Proof.
According to Theorem 5.3, e(S/M)=k=1βwβ(β1)jkβe(S/MmΛkββ). By definition, each MmΛkββ is of the form MmΛkββ=(h1β²β,β¦,hcβ²β), where
hiβ²β=lcm(mr1ββ,β¦,mrjββ)lcm(mr1ββ,β¦,mrjββ,hiβ)β (with j=jkβ). Since hiβ²β is a divisor of hiβ, MmΛkββ is a complete intersection and, thus,
[TABLE]
β
A particular case where the hypotheses of Corollary 5.4 are satisfied is when M is a dominant almost complete intersection. In such case, M can be expressed in the form M=(m,h1β,β¦,hcβ), where (h1β,β¦,hcβ) is a complete intersection, and codim(S/M)=c. By Corollary 5.4,
[TABLE]
We close this article with an example where we illustrate Theorem 5.3 and Corollary 5.4.
Example 5.5**.**
Let M=(a3c,abe3,a2b2,c2,d2e2). Notice that M is dominant, with codim(S/M)=3. In addition, (a2b2,c2,d2e2) is a complete intersection. Also, C={(0,1);(1,a3c);(1,abe3);(2,a3bce3)}. By Theorem 5.3,
[TABLE]
Hence,
[TABLE]
6. A different approach
In this section we introdude a new line of reasoning. The idea is to express the multiplicity of an ideal M in terms of the multiplicity of some other ideal Mβ², and take full advantage of the Peskine-Szpiro formula. In particular, we will use the sometimes overlooked fact that the formula in Lemma 2.5 equals o when k is less than the codimension of the ideal.
Below we sketch a new nad easier proof of Theorem 3.2(i), where we illustrate this idea.
Let M=(m1β,β¦,mqβ), and suppose that codim(S/M)=1. Set l=gcd(m1β,β¦,mqβ), and let Mβ²=(m1β²β,β¦,mqβ²β), where miβ²β=lmiββ. Let [Οijβ] (respectively, [Οijβ]) be the jth basis element of TMβ (respectively, TMβ²β) in homological degree i, and let dijβ=deg(mdeg[Οijβ]) (respectively, cijβ=deg(mdeg[Οijβ])). Since codim(S/Mβ²)β₯2, the formula of Lemma 2.5 yields
[TABLE]
Since codim(S/M)=1, we have
[TABLE]
Hence, e(S/M)=deg(l)=deg(gcd(m1β,β¦,mqβ)).
The next theorem, which gives the multiplicities of all monomial almost complete intersections, extends the result following Corollary 5.4 and, once more, illustrates the new approach introduced at the begining of this section. First we need a lemma.
Lemma 6.1**.**
Let M=(m1β,β¦,mqβ,m) be an almost complete intersection, such that M is not dominant, and M1β=(m1β,β¦,mqβ) is a complete intersection. Then, for some 1β€iβ€q, Mβ²=(m1β,β¦,miββ,β¦,mqβ,m) is a dominant almost complete intersection, where Mβ²β²=(m1β,β¦,miββ,β¦,mqβ) is a complete intersection.
Proof.
Let 1β€rβ€q. Since mrββ€m, there is a variable x such that the exponent with which x appears in the factorization of mrβ is larger than the exponent with which x appears in the factorization of m. In addition, none of the monomials m1β,β¦,mrββ,β¦,mqβ is divisible by x, for M1β is a complete intersection. Hence, mrβ is a dominant generator of M. Since r is arbitrary, we have that m1β,β¦,mqβ are dominant generators of M and given that M is not dominant, m must be a nondominant generator of M.
Let y be a variable dividing m. Since m is nondominant, there is a generator miβ such that yβ£miβ. Given that mβ€miβ there is a variable z such that the exponent with which z appears in the factorization of m is larger than the exponent with which z appears in the factorization of miβ. Once again, since m is not dominant, there is a generator mjβ (with iξ =j) such that zβ£mjβ.
Therefore, the ideal Mβ²=(m1β,β¦,miββ,β¦,mqβ,m) is dominant. Also, since Mβ²β²=(m1β,β¦,miββ,β¦,mqβ) is a complete intersection and gcd(mjβ,m)ξ =1, it follows that Mβ²=(m1β,β¦,miββ,β¦,mqβ,m) is an almost complete intersection.
β
Theorem 6.2**.**
Let M=(m1β,β¦,mqβ,m) be an almost complete intersection, where M1β=(m1β,β¦,mqβ) is a complete intersection. Then
[TABLE]
Proof.
If M is dominant, the theorem follows from Corollary 5.4. Thus, we may assume that M is not dominant. By Lemma 6.1, for some 1β€iβ€q, the ideal Mβ²=(m1β,β¦,miββ,β¦,mqβ,m) is a dominant almost complete intersection, and the ideal Mβ²β²=(m1β,β¦,miββ,β¦,mqβ) is a complete intersection. Without loss of generality, we may assume that M2β=(m1β,β¦,mqβ1β) is a complete intersection, and M3β=(m1β,β¦,mqβ1β,m) is a dominant almost complete intersection.
Denote by [ΞΈijβ] (respectively, [Οijβ]) the jth basis element of TMβ (respectively, TM2ββ) in homological degree i. For [Οijβ]=[mr1ββ,β¦,mriββ], define [Οijβ,mqβ]=[mr1ββ,β¦,mriββ,mqβ], [Οijβ,m]=[mr1ββ,β¦,mriββ,m], and [Οijβ,mqβ,m]=[mr1ββ,β¦,mriββ,mqβ,m].
Since codim(S/M)=q, we have that
[TABLE]
Since codim(S/M2β)=qβ1,
[TABLE]
Since codim(S/M3β)=qβ1,
[TABLE]
Hence,
[TABLE]
Also,
[TABLE]
Thus,
[TABLE]
Combining these facts, we obtain
[TABLE]
Hence,
[TABLE]
β
With this new approach, we have been able to prove things without assuming dominance. It is natural to ask whether this reasoning can be applied to extend the results of Sections 5 and 6. For instance, if in the definition of a stem ideal we do not required the ideal to be dominant, would Theorem 4.5 still hold? Moreover, would Theorem 5.3 still hold (in some form) if we did not require the ideal to be dominant?
Acknowledgements: I am grateful to Chris Francisco who, after all these years, has remained a mentor to me. My wife Danisa always types my articles and gives me valuable feedback on their content. It is my privilege to work side by side with her. Many thanks, sweetheart!
Bibliography10
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[Al] G. Alesandroni, Minimal resolutions of dominant and semidominant ideals , J. Pure Appl. Algebra 221 (2017), no. 4, 780-798.
2[Al 1] G. Alesandroni, Structural decomposition of monomial resolutions , J. Algebra 516 (2018), 210-244.
3[BS] M. Boij and J. SΓΆderberg, Betti numbers of graded modules and the multiplicity conjecture in the non-Cohen-Macaulay case , Algebra Number Theory 6 (2012), no. 3, 437-454.
4[EFW] D. Eisenbud, G. Floystad, and J. Weyman, The existence of equivariant pure free resolutions , Ann. Inst. Fourier (Grenoble) 61 (2011), no. 3, 905-926.
5[ES] D. Eisenbud and F. Schreyer, Betti numbers of graded modules and cohomology of vector bundles , J. Amer. Math. Soc. 22 (2009), no. 3, 859-888.
6[FS] C. Francisco and H. Srinivasan, Multiplicity conjectures , In Syzygies and Hilbert Functions, ed. I. Peeva, Lect. Notes Pure Appl. Math., Chapman and Hall, New York, (2007).
7[HS] J. Herzog and H. Srinivasan, Bounds for multiplicities , Trans. Amer. Math. Soc. 350 (1998), no. 7, 2879-2902.
8[HS 1] J. Herzog and H. Srinivasan, Multiplicities of monomial ideals , J. Algebra 274 (2004), no. 1, 230-244.