This paper introduces a structural decomposition method for monomial resolutions, expressing Betti numbers in terms of simpler ideals, enabling new minimal resolutions and projective dimension computations.
Contribution
It provides a novel decomposition approach for multigraded Betti numbers of monomial ideals, facilitating resolution construction and dimension analysis.
Findings
01
Decomposition expresses Betti numbers via basic ideals
02
Constructs minimal resolutions for certain monomial classes
03
Computes projective dimensions efficiently
Abstract
We express the multigraded Betti numbers of an arbitrary monomial ideal in terms of the multigraded Betti numbers of two basic classes of ideals. This decompo- sition has multiple applications. In some concrete cases, we use it to construct minimal resolutions of classes of monomial ideals; in other cases, we use it to compute projective dimensions. To illustrate the effectiveness of the structural decomposition, we give a new proof of a classic theorem by Charalambous.
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.
Full text
Structural Decomposition of Monomial Resolutions
Guillermo Alesandroni
Department of Mathematics, Wake Forest University, 1834 Wake Forest Rd, Winston-Salem, NC 27109
We express the multigraded Betti numbers of an arbitrary monomial ideal in terms of the multigraded Betti numbers of two basic classes of ideals. This decomposition has multiple applications. In some concrete cases, we use it to construct minimal resolutions of classes of monomial ideals; in other cases, we use it to compute projective dimensions. To illustrate the effectiveness of the structural decomposition, we give a new proof of a classic theorem by Charalambous that states the following: let k be a field, and M an Artinian monomial ideal in S=k[x1,…,xn]; then, for all i, bi(S/M)≥(in).
1. Introduction
The problem of finding the minimal resolution of an arbitrary monomial ideal in closed form has been deemed utopic by many a mathematician. As a consequence, people have tried to restrict the study of minimal resolutions to particular classes of ideals. Borel ideals, minimally resolved by the Eliahou-Kervaire resolution [EK]; generic ideals, minimally resolved by the Scarf complex [BPS]; and dominant ideals, minimally resolved by the Taylor resolution [Al], are examples of this restrictive approach.
In the first half of this paper, however, we turn to the general problem, and decompose the minimal resolution of an arbitrary monomial ideal in terms of the minimal resolutions of two basic classes that we call dominant, and purely nondominant ideals. More precisely, we express the multigraded Betti numbers of an ideal as the sum of the multigraded Betti numbers of some dominant and some purely nondominant ideals. Since dominant ideals are minimally resolved by their Taylor resolutions, our decomposition reduces the study of minimal monomial resolutions to the study of minimal resolutions of purely nondominant ideals.
Unfortunately, the resolutions of purely nondomiant ideals involve the same challenges that we encounter in the general context. Some of these difficulties are the existence of ghost terms, characteristic dependence, and the striking fact that some of the simplest purely nondominant ideals cannot be minimally resolved by any subcomplex of the Taylor resolution. Thus, in the second half of this work we focus our efforts on one particular case: monomial ideals whose structural decomposition has no purely nondominant part. As a result of this study, we obtain the multigraded Betti numbers of two families that we call 2-semidominant and almost generic ideals.
The structural decomposition is also a useful tool to compute projective dimensions. We prove, for instance, that if an ideal M satisfies certain conditions, pd(S/M)=2, and, under some other conditions, pd(S/M)=n, where n is the number of variables in the polynomial ring. Another result, also related to projective dimensions, is a new proof of a classic theorem of Charalambous [Ch] (see also [Pe, Corollary 21.6]), stating: let k be a field, and M an Artinian monomial ideal in S=k[x1,…,xn]; then, for all i, bi(S/M)≥(in). While the original proof relies on the radical of an ideal, ours is based on the structural decomposition.
The organization of the article is as follows. Section 2 is about background and notation. Sections 3 and 4 are technical. They contain some isomorphism theorems, as well as the structural decomposition theorems advertised above. In section 5, we compute the multigraded Betti numbers of two families of ideals. In section 6, we compute projective dimensions. Section 7 is the conclusion; it includes some comments, questions, and conjectures.
2. Background and Notation
Throughout this paper S represents a polynomial ring over an arbitrary field k, in a finite number variables. The letter M always denotes a monomial ideal
in S. With minor modifications, the constructions that we give below can be found in [Me,Pe].
Construction 2.1**.**
Let M be generated by a set of monomials {l1,…,lq}. For every subset {li1,…,lis} of {l1,…,lq}, with 1≤i1<…<is≤q,
we create a formal symbol [li1,…,lis], called a Taylor symbol. The Taylor symbol associated to {} is denoted by [∅].
For each s=0,…,q, set Fs equal to the free S-module with basis {[li1,…,lis]:1≤i1<…<is≤q} given by the
(sq) Taylor symbols corresponding to subsets of size s. That is, Fs=i1<…<is⨁S[li1,…,lis]
(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 resolutionTl1,…,lq of S/M is the exact sequence
[TABLE]
We define the multidegree of a Taylor symbol [li1,…,lis], denoted mdeg[li1,…,lis], as follows:
mdeg[li1,…,lis]=lcm(li1,…,lis). The Taylor symbols [li1,…,lis] are called faces. A Taylor symbol
of the form [li1,…,lij,…,lis] is referred to as a facet of the face [li1,…,lis].
Note:
In our construction above, the generating set {l1,…,lq} is not required to be minimal. Thus, S/M has many Taylor resolutions. We reserve the notation
TM for the Taylor resolution of S/M, determined by the minimal generating set of M. (Although some authors define a single Taylor resolution of S/M, our construction is general, like in [Ei].)
Construction 2.2**.**
Let M be minimally generated by {l1,…,lq}. Let A be the set of Taylor symbols of TM whose
multidegrees are not common to other Taylor symbols; that is, a Taylor symbol [σ] is in A if and only if mdeg[σ]=mdeg[σ′],
for every Taylor symbol [σ′]=[σ]. For each s=0,…,q, set Gs equal to the free S-module with basis
{[li1,…,lis]∈A:1≤i1<…<is≤q}. For each s=0,…,q, let gs=fs↾Gs. It can be proven that the gs
are well defined (more precisely, that gs(Gs)⊆Gs−1) and that
[TABLE]
is a subcomplex of TM, which is called the Scarf complex of S/M.
Definition 2.3**.**
Let M be a monomial ideal, and let
[TABLE]
be a free resolution of S/M.
We say that a basis element [σ] of F has homological degree i, denoted hdeg[σ]=i, if
[σ]∈Fi. F is said to be a minimal resolution if for every i, the differential matrix (fi) of F
has no invertible entries.
Definition 2.4**.**
Let M be a monomial ideal, and let
[TABLE]
be a minimal free resolution of S/M.
•
For every i≥0, the ithBetti numberbi(S/M) of S/M is bi(S/M)=rank(Fi).
•
For every i≥0, and every monomial l, the multigraded Betti numberbi,l(S/M) of S/M, in homological degree i and multidegree l,
is
[TABLE]
•
The projective dimensionpd(S/M) of S/M is
[TABLE]
Definition 2.5**.**
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′.
The set G is called dominant if each of its elements is dominant. The ideal M is called dominant if G is dominant.
•
G is called p-semidominant if G contains
exactly p nondominant monomials. The ideal M is p-semidominant if G is p-semidominant.
•
We say that G is purely nondominant when all the elements of G are nondominant. In this case, we also say that M is purely nondominant.
Example 2.6**.**
Let M1, M2, and M3 be minimally generated by G1={a2,b3,ab}, G2={ab,bc,ac}, and G3={a2b,ab3c,bc2}, respectively. Note that a2 and b3 are dominant in G1, but ab is not. Thus, both the set G1 and the ideal M1 are 1-semidominant. On the other hand, ab, bc, and ac are nondominant in G2. Therefore, G2 and M2 are purely nondominant (as well as 3-semidominant). Finally, a2b, ab3c, and bc2 are dominant in G3. Thus, G3 and M3 are dominant.
3. Isomorphism Theorems
The notation that we introduce below retains its meaning until the end of this section.
Let M be a monomial ideal with minimal generating set G={m1,…,mq,n1,…,np}, where m1,…,mq are dominant, and n1,…,np are nondominant. Let 1≤d≤q, and let
H={h1,…,hc}={md+1,…,mq,n1,…,np}. Then G can be expressed in the form G={m1,…,md,h1,…,hc}.
Let m=lcm(mr1,…,mrj), where 1≤r1<…<rj≤d. By convention, if j=0, m=1. For all s=1,…,c, let hs′=mlcm(m,hs). Let Mm=(h1′,…,hc′).
Example 3.1**.**
Let M=(a3b2,c3d,ac2,a2c,b2d,abc,bcd). Note that M is 5-semidominant, with m1=a3b2, m2=c3d, n1=ac2, n2=a2c, n3=b2d, n4=abc, n5=bcd. If we set d=2, then H={h1,…,h5}={n1,…,n5}. Suppose that m=lcm(m1)=a3b2. Then Mm=(h1′,…,h5′), where h1′=a3b2lcm(a3b2,ac2)=c2; h2′=a3b2lcm(a3b2,a2c)=c;
h3′=a3b2lcm(a3b2,b2d)=d; h4′=a3b2lcm(a3b2,abc)=c; h5′=a3b2lcm(a3b2,bcd)=cd.
Thus, Ma3b2=(c2,c,d,c,cd). Although {c2,c,d,c,cd} does not generate Ma3b2 minimally, sometimes, nonminimal generating sets like this will serve our purpose.
Proposition 3.2**.**
Let 1≤s1<…<si≤c. The Taylor symbols [hs1′,…,hsi′] of Th1′,…,hc′, and [mr1,…,mrj,hs1,…,hsi] of TM, satisfy
[TABLE]
Proof.
Note that hs1∣lcm(m,hs1)=mhs1′, and mhs1′∣mlcm(hs1′,…,hsi′). Thus, hs1∣mlcm(hs1′,…,hsi′).
Similarly,
hs2,…,hsi∣mlcm(hs1′,…,hsi′). Hence, lcm(m,hs1,…,hsi)∣mlcm(hs1′,…,hsi′). We will show that mlcm(hs1′,…,hsi′)∣lcm(m,hs1,…,hsi).
Let hs1′=x1α11…xnα1n,…,hsi′=x1αi1…xnαin,
and let γ1=max(α11,…,αi1),…,γn=max(α1n,…,αin). Then lcm(hs1′,…,hsi′)=x1γ1…xnγn. Notice that
mx1γ1 divides one of mhs1′=lcm(m,hs1),…,mhsi′=lcm(m,hsi), and therefore,
mx1γ1∣lcm(m,hs1,…,hsi).
Similarly,
mx2γ2,…,mxnγn∣lcm(m,hs1,…,hsi).
Thus,
x1γ1,…,xnγn∣mlcm(m,hs1,…,hsi).
It follows that
lcm(hs1′,…,hsi′)=x1γ1…xnγn∣mlcm(m,hs1,…,hsi), which is equivalent to saying that
mlcm(hs1′,…,hsi′)∣lcm(m,hs1,…,hsi).
Finally,
[TABLE]
∎
Example 3.3**.**
Let M, m, and H be as in Example 3.1. The Taylor symbols [h2′,h3′]=[c,d] of Tc2,c,d,c,cd, and [m1,h2,h3]=[a3b2,a2c,b2d] of TM, have multidegrees cd and a3b2cd, respectively. Therefore, mdeg[a3b2,c,d]=a3b2mdeg[c,d], which is consistent with Proposition 3.2.
Note:
We will say that a monomial loccurs in a resolution F if there is a basis element of F with multidegree l.
If a is an entry of a differential matrix of a resolution F and [σ] is an element of the basis of F, by abusing the
language we will often say that a** is an entry of F** and [σ]** is an element of F**. Moreover, sometimes we will use the notation
[σ]∈F.
Theorem 3.4**.**
Let m′ be a multidegree that occurs in Th1′,…,hc′.
(i)
There are no basis elements of TM, with multidegree mm′ and homological degree less than j.
2. (ii)
For every i, there is a bijective correspondence between the basis elements of Th1′,…,hc′, with multidegree m′ and homological
degree i, and the basis elements of TM, with multidegree mm′ and homological degree i+j.
Proof.
(i) Let [hs1′,…,hsi′] be a basis element of Th1′,…,hc′, with multidegree m′. By Proposition 3.2,
[TABLE]
It follows that every basis element [σ] of TM, with multidegree mm′, must contain the same dominant monomials mr1,…,mrj [Al, Lemma 4.3]. This means that
hdeg[σ]≥j.
(ii) Let Ai,m′={[σ]∈Th1′,…,hc′:hdeg[σ]=i;mdeg[σ]=m′}.
Let Bi,m′={[σ]∈TM:hdeg[σ]=i+j;mdeg[σ]=mm′}.
Let fi,m′:Ai,m′→Bi,m′ be defined by fi,m′[hs1′,…,hsi′]=[mr1,…,mrj,hs1,…,hsi].
Notice that fi,m′ is well defined:
if [σ]∈Ai,m′, then hdegfi,m′[σ]=i+j and by Proposition 3.2, mm′=mmdeg[σ]=mdegfi,m′[σ].
Suppose that [τ] is in Bi,m′. Let [ht1′,…,htk′] be an element in Th1′,…,hc′, with multidegree m′. By Proposition 3.2,
[TABLE]
Since [τ] and [mr1,…,mrj,ht1,…,htk] are basis elements of equal multidegree, they must contain the same dominant monomials [Al, Lemma 4.3] and, given that [τ] has homological degree i+j, [τ] must be of the form [τ]=[mr1,…,mrj,hs1,…,hsi]. By Proposition 3.2, [hs1′,…,hsi′]∈Ai,m′, and fi,m′[hs1′,…,hsi′]=[τ].
∎
Example 3.5**.**
Let M, m, and H be as in Example 3.1. Let m′=cd. Since the only basis element of TM in homological degree [math] is
[∅], and mdeg[∅]=1, there are no basis elements of TM in homological degree [math] and multidegree mm′=a3b2cd. This illustrates Theorem 3.4(i). On the other hand, the basis elements of
Tc2,c,d,c,cd with multidegree m′=cd are
[h5′], in homological degree 1;
[h2′,h5′], [h3′,h5′], [h4′,h5′], [h2′,h3′], [h3′,h4′] in homological degree 2;
[h2′,h3′,h5′], [h2′,h4′,h5′], [h3′,h4′,h5′], [h2′,h3′,h4′] in homological degree 3; and
[h2′,h3′,h4′,h5′] in homological degree 4.
Similarly, the basis elements of TM with multidegree mm′=a3b2cd are
[m1,h5] in homological degree 2;
[m1,h2,h5], [m1,h3,h5], [m1,h4,h5], [m1,h2,h3], [m1,h3,h4], in homological degree 3;
[m1,h2,h3,h5], [m1,h2,h4,h5], [m1,h3,h4,h5], [m1,h2,h3,h4] in homological degree 4; and
[m1,h2,h3,h4,h5] in homological degree 5, which illustrates the bijective correspondence of Theorem 3.4(ii).
Notation: for every multidegree m′ that occurs in Th1′,…,hc′ and every i=0,…,c, let fi,m′:Ai,m′→Bi,m′ be
the bijection constructed in Theorem 3.4.
Let Ai=m′⋃Ai,m′ and Bi=m′⋃Bi,m′. Let us define fi:Ai→Bi by
fi[σ]=fi,m′[σ], if mdeg[σ]=m′.
Let A=i⋃Ai; B=i⋃Bi. Let us define f:A→B by f[σ]=fi[σ], if hdeg[σ]=i.
Note that A is the basis of Th1′,…,hc′, and f is a bijection that sends an element with multidegree m′ and homological degree i
to an element with multidegree mm′ and homological degree i+j.
To better understand the statement of the next theorem, we refer the reader to [Al, Remark 3.4].
Theorem 3.6**.**
If aπθ is an entry of Th1′,…,hc′, determined by elements [θ],[π]∈A, then f[θ],f[π] determine an entry
bπθ of TM such that bπθ=(−1)jaπθ.
Proof.
Since [θ],[π] appear in consecutive homological degrees, so do f[θ],f[π]. Thus, f[θ],f[π] determine an entry bπθ of
TM.
If [π] is a facet of [θ], then f[π] is also a facet of f[θ] and, these elements are of the form:
On the other hand, if [π] is not a facet of [θ], f[π] cannot be a facet of f[θ], either. Thus aπθ=0=bπθ.
∎
Notation: let F0=Th1′,…,hc′. If there is an invertible entry aπ0θ0(0) of F0, determined by elements
[θ0],[π0]∈F0, let F1 be the resolution of S/Mm such that
[TABLE]
Let us assume that Fk−1 has been defined. If there is an invertible entry aπk−1θk−1(k−1) of Fk−1,
determined by elements [θk−1],[πk−1] of Fk−1, let Fk be the resolution of S/Mm such that
[TABLE]
Theorem 3.7**.**
Suppose that F0,…,Fu are resolutions of S/Mm, defined as above. Then
(i)
It is possible to define resolutions G0,…,Gu of S/M, as follows:
[TABLE]
2. (ii)
If aτσ(u) is an entry of Fu, determined by elements [σ],[τ] of Fu, then
f[σ],f[τ] are in the basis of Gu and determine an entry bτσ(u) of Gu, such that
bτσ(u)=(−1)jaτσ(u).
Proof.
The proof is by induction on u. If u=0, (i) and (ii) are the content of Theorem 3.6.
Let us assume that parts (i) and (ii) hold for u−1.
We will prove parts (i) and (ii) for u.
(i) We need to show that Gu can be defined by the rule
[TABLE]
In other words, we must show that f[θu−1], f[πu−1] are in the basis of Gu−1, and the entry bπu−1θu−1(u−1) of
Gu−1, determined by them, is invertible. But this follows from induction hypothesis and the fact that aπu−1θu−1(u−1) is
invertible.
(ii) Notice that the basis of Fu is obtained from the basis of Fu−1, by eliminating [θu−1],[πu−1]. This means
that [σ],[τ] are in the basis of Fu−1, and the pairs ([σ],[τ]), ([θu−1],[πu−1]) are
disjoint. Then by induction hypothesis, f[σ], f[τ] are in the basis of Gu−1, and because f is a bijection,
(f[σ],f[τ]), (f[θu−1],f[πu−1]) are disjoint pairs. Since the basis of Gu is obtained from the
basis of Gu−1, by eliminating f[θu−1],f[πu−1], we must have that f[σ],f[τ] are in the basis of Gu.
Finally, we need to prove that bτσ(u)=(−1)jaτσ(u). By [Al, Lemma 3.2(iv)], if
hdeg[σ]=hdeg[θu−1], then aτσ(u)=aτσ(u−1). In this case, we must also have that
hdegf[σ]=hdegf[θu−1], which implies that bτσ(u)=bτσ(u−1), by the same lemma. Then, by induction hypothesis,
bτσ(u)=bτσ(u−1)=(−1)jaτσ(u−1)=(−1)jaτσ(u). On the other hand, if
hdeg[σ]=hdeg[θu−1], then hdegf[σ]=hdegf[θu−1]. Combining the induction hypothesis with [Al, Lemma 3.2(iii)], we
obtain
[TABLE]
∎
Since the process of making standard cancellations must eventually terminate, there is an integer u≥0, such that F0,…,Fu are
defined as above and Fu is a minimal resolution of S/Mm. For the rest of this section u is such an integer and
Fu is such a minimal resolution. Moreover, the resolutions F0,…,Fu and G0,…,Gu are also
fixed for the rest of this section.
Notation: Let A′=A∖{[θ0],[π0],…,[θu−1],[πu−1]} and
B′=B∖{f[θ0],f[π0],…,f[θu−1],
f[πu−1]}. Notice that A′ is the basis of the minimal resolution Fu.
Theorem 3.8**.**
If bπθ(u) is an entry of Gu, determined by elements f[θ],f[π]∈B′, then bπθ(u) is noninvertible.
Proof.
Since f[θ],f[π]∈B′, [θ],[π]∈A′ and thus, the entry aπθ(u) of Fu is noninvertible. Now, by Theorem
3.7(ii), bπθ(u) is noninvertible.
∎
Theorem 3.9**.**
Let m′ be a multidegree that occurs in TMm.
(i)
There are no basis elements of Gu, with multidegree mm′ and homological degree less than j.
2. (ii)
For every i=0,…,c, there is a bijective correspondence between the basis elements of Fu, with multidegree m′ and homological
degree i, and the basis elements of Gu, with multidegree mm′ and homological degree i+j.
Proof.
(i) Since the basis of Gu is contained in that of TM, the statement follows from Theorem 3.4(i).
(ii) The set of basis elements of Fu, with multidegree m′ and homological degree i is
Ai,m′′=Ai,m′∖{[θ0],[π0],…,[θu−1],[πu−1]}. Similarly, the set of basis elements of Gu, with
multidegree mm′ and homological degree i+j is Bi,m′′=Bi,m′∖{f[θ0],f[π0],…,f[θu−1],f[πu−1]}. Notice that
[θk]∈Ai,m′ if and only if f[θk]∈Bi,m′. Likewise, [πk]∈Ai,m′ if and only if f[πk]∈Bi,m′.
Therefore, if we restrict
fi,m′:Ai,m′→Bi,m′ to Ai,m′′, we get a bijection between Ai,m′′ and Bi,m′′.
∎
Notation: If bγ0δ0(u) is an invertible entry of Gu, determined by basis elements
[δ0],[γ0] of Gu, let Gu+1 be the resolution of S/M such that
[TABLE]
Assume that Gu+(k−1) has been defined. If bγk−1δk−1(u+k−1) is an invertible entry of Gu+(k−1), determined by basis elements [δk−1], [γk−1] of
Gu+(k−1), let
Gu+k be the resolution of S/M such that
[TABLE]
Theorem 3.10**.**
Suppose that Gu, Gu+1 are defined as above. If bπθ(u) is an entry of Gu, determined by
elements f[θ],f[π]∈B′, then f[θ],f[π] are in the basis of Gu+1. Moreover, the entry bπθ(u+1) of
Gu+1, determined by f[θ] and f[π] is noninvertible.
Proof.
Since Gu=Gu+1⊕(0→S[δ0]→S[γ0]→0), we have that
bγ0δ0(u) is invertible, [δ0],[γ0] are in Gu, in consecutive homological degrees, and
mdeg[δ0]=mdeg[γ0]. Suppose that [δ0],[γ0]∈B′. Then there are elements [σ],[τ]∈A′, in consecutive homological
degrees, such that f[σ]=[δ0] and f[τ]=[γ0]. By Theorem 3.9(ii), [σ],[τ] are in Fu and determine and entry
aτσ(u). Now, it follows from Theorem 3.7(ii), that bγ0δ0(u)=(−1)jaτσ(u). This means that
aτσ(u) is invertible and Fu is not minimal, a contradiction.
On the other hand, if only one of [δ0],[γ0] is in B′, then mdeg[δ0]=mdeg[γ0]; another contradiction.
We conclude that neither [δ0] nor [γ0] is in B′
and therefore, the pairs (f[θ],f[π]); ([δ0],[γ0]) are disjoint. This proves that f[θ],f[π] are in
the basis of Gu+1.
Let us finally prove that bπθ(u+1) is noninvertible. If hdegf[θ]=hdeg[δ0], then bπθ(u+1)=bπθ(u) by [Al, Lemma 3.2(iv)],
and by Theorem 3.8, bπθ(u+1) is noninvertible. If hdegf[θ]=hdeg[δ0], by [Al, Lemma 3.2(iii)], we have
bπθ(u+1)=bπθ(u)−bγ0δ0(u)bπδ0(u)bγ0θ(u).
Since bπθ(u)=(−1)jaπθ(u), bπθ(u) is noninvertible. Since mdegf[π]=mdeg[δ0], the entry
bπδ0(u) of Gu, determined by [δ0], f[π], is noninvertible. Hence, the product bπδ0(u).bγ0θ(u)
must be noninvertible. This means that the quotient
bγ0δ0(u)bπδ0(u)bγ0θ(u) is noninvertible. Finally, bπθ(u+1) is noninvertible, for the
difference of two noninvertible monomials is noninvertible.
∎
Theorem 3.11**.**
Suppose that Gu,…,Gu+v are defined as above. If bπθ(u) is an entry of Gu, determined by
elements f[θ],f[π]∈B′, then f[θ],f[π] are in the basis of Gu+v, and the entry bπθ(u+v) of
Gu+v, determined by f[θ],f[π] is noninvertible.
Proof.
The proof is by induction on v. If v=1, the statement is the content of Theorem 3.10.
Let us assume that the statement holds for v−1.
Since Gu+(v−1)=Gu+v⊕(0→S[δv−1]→S[γv−1]→0), it follows that the
entry bγv−1δv−1(u+v−1) of Gu+(v−1), determined by [δv−1],[γv−1], is invertible. If we had that
[δv−1],[γv−1]∈B′, then, by induction hypothesis, bγv−1δv−1(u+v−1) would be noninvertible, a contradiction.
On the other hand, if exactly one of [δv−1],[γv−1] were in B′, their multidegrees would be different, another contradiction. Hence, neither
[δv−1] nor [γv−1] is in B′. This means that the pairs (f[θ],f[π]), ([δv−1],[γv−1]) are
disjoint. Thus, f[θ],f[π] are in the basis of Gu+v.
Let us now prove that bπθ(u+v) is noninvertible. If hdegf[θ]=hdeg[δv−1], then bπθ(u+v)=bπθ(u+v−1) by [Al, Lemma 3.2 (iv)],
and the result follows from induction hypothesis. Now, if hdegf[θ]=hdeg[δv−1],
[TABLE]
by [Al, Lemma 3.2(iii)].
Notice that bπθ(u+v−1) is noninvertible, by induction hypothesis. Since mdegf[π]=mdeg[δv−1], it follows that the entry
bπδv−1(u+v−1) of Gu+(v−1), determined by [δv−1],f[π], is noninvertible. This implies that the product
bπδv−1(u+v−1)bγv−1θ(u+v−1) is noninvertible. Moreover, since bγv−1δv−1(u+v−1) is invertible,
the quotient
bγv−1δv−1(u+v−1)bπδv−1(u+v−1)bγv−1θ(u+v−1)
is noninvertible. Finally, bπθ(u+v) is noninvertible, for the difference of two noninvertible monomials is noninvertible.
∎
Since the process of making standard cancellations must eventually terminate, there is an integer v≥0, such that
Gu,…,Gu+v are defined as above, and Gu+v is a minimal resolution of S/M.
For the rest of this section, v is such an integer and Gu+v is such a minimal resolution. Moreover, the resolutions
Gu,…,Gu+v are fixed for the rest of this section.
Theorem 3.12**.**
Let m′ be a multidegree that occurs in TMm. For each i, there is a bijective correspondence between the basis elements of Gu,
with multidegree mm′ and homological degree i+j, and the basis elements of Gu+v, with multidegree mm′ and homological degree i+j.
Proof.
Since the basis of Gu+v is contained in that of Gu, every basis element of Gu+v, with multidegree mm′ and
homological degree i+j is in Gu. Conversely, every basis element of Gu, with multidegree mm′ and homological degree i+j is in
Gu+v, by Theorem 3.11.
∎
Theorem 3.13**.**
Let F be a minimal resolution of S/Mm, and let G be a minimal free resolution of S/M. Let m′ be a multidegree
that occurs in TMm. Then
(i)
There are no basis elements of G, with multidegree mm′ and homological degree less than j.
2. (ii)
For each i, there is a bijective correspondence between the basis elements of F, with multidegree m′ and homological
degree i, and the basis elements of G, with multidegree mm′ and homological degree i+j.
Proof.
(i) Since the basis of G is contained in that of TM, this part follows from Theorem 3.4(i).
(ii) This part follows immediately from Theorem 3.9(ii) and Theorem 3.12.
∎
Example 3.14**.**
Consider Example 3.1, again. Recall that M=(m1,m2,h1,h2,h3,h4,h5)=(a3b2,c3d,ac2,a2c,b2d,abc,bcd), and m=lcm(m1)=a3b2. Since Mm=(c2,c,d,c,cd)=(c,d), the minimal resolution of S/Mm is of the form
[TABLE]
Thus, b0,1(S/Mm)=b1,c(S/Mm)=b1,d(S/Mm)=b2,cd(S/Mm)=1.
By Theorem 3.13(ii) (with m=a3b2, and j=1),
b1,a3b2(S/M)=b2,a3b2c(S/M)=b2,a3b2d(S/M)=b3,a3b2cd(S/M)=1.
By Theorem 3.13(i),
b0,a3b2(S/M)=b0,a3b2c(S/M)=b0,a3b2d(S/M)=b0,a3b2cd(S/M)=1. (In the next section we will give the entire list of multigraded Betti numbers of S/M.)
4. Structural Decomposition Theorems
The notation below retains its meaning until the end of this section.
Let M be an ideal with minimal generating set G={m1,…,mq,n1,…,np}, where m1,…,mq are dominant and n1,…,np are nondominant. Let 1≤d≤q, and let H={md+1,…,mq,n1,…,np}. Then G can be expressed in the form G={m1,…,md,h1,…,hc}, where H={h1,…,hc}.
•
If c>0, 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′=mlcm(m,hi).
•
If c=0, let C={(0,1)} and let M1=M.
Theorem 4.1**.**
For each integer k and each monomial l,
[TABLE]
Proof.
If c=0, the theorem is trivial. Let us consider the case c>0.
If bk,l(S/M)=0, then (j,m)∈C∑bk−j,l/m(S/Mm)=0, by Theorem 3.13(ii).
Suppose now that bk,l(S/M)=0. Then there is an element [τ] in the basis of a minimal resolution of S/M, such that hdeg[τ]=k and
mdeg[τ]=l. Let mr1,…,mrj be the dominant monomials that are contained in [τ], and such that {mr1,…,mrj} is a subset of {m1,…,md}. Since all basis elements of TM with equal multidegree must contain the same dominant monomials [Al, Lemma 4.3], every basis element of TM in homological degree k and multidegree l must be of the form [mr1,…,mrj,hs1,…,hsk−j]. Let m=lcm(mr1,…,mrj). Then (j,m)∈C, and bk,l(S/M)=bk−j,l/m(S/Mm), by Theorem 3.13(ii).
We will complete the proof by showing that bk−j′,l/m(S/Mm′)=0, for all (j′,m′)∈C∖{(j,m)}. Let (j′,m′)∈C. Then there are dominant monomials mu1,…,muj, such that
m′=lcm(mu1,…,muj′). Suppose that bk−j,l/m(S/Mm′)=0. Then TMm′ has a basis element [ht1′,…,htk−j′′] with multidegree l/m. By Proposition 3.2,
\l=mmdeg[ht1′,…,htk−j′′]=mdeg[mu1,…,muj′,ht1,…,htk−j′]. Since the basis elements of TM in homological degree k and multidegree l are of the form
[mr1,…,mrj,hs1,…,hsk−j], we must have that {mu1,…,muj′}={mr1,…,mrj}. In particular, j′=j, and
m′=lcm(mu1,…,muj′)=lcm(mr1,…,mrj)=m. Thus (j′,m′)=(j,m).
∎
Definition 4.2**.**
Recall that G={m1,…,mq,n1,…,np}={m1,…,md,h1,…,hc} is the minimal generating set of M. If d=q, the equation
[TABLE]
given by Theorem 4.1, will be called the first structural decomposition of M.
Note that when d=q, we have that c=p, and {h1,…,hc}={n1,…,np}.
Example 4.3**.**
Consider Example 3.1, again. Recall that M=(m1,m2,n1,n2,n3,n4,n5)=(a3b2,c3d,ac2,a2c,b2d,abc,bcd), where {h1,…,h5}={n1,…,n5}, and hence, d=q. By definition,
[TABLE]
Now, each ordered pair (j,m) in C, determines a monomial ideal Mm. Namely, (2,a3b2c3d) defines Ma3b2c3d=(h1′,h2′,h3′,h4′,h5′), where h1′=a3b2c3dlcm(a3b2c3d,ac2)=1. Therefore, Ma3b2c3d=(1)=S.
Likewise, (1,a3b2) defines Ma3b2=(c,d) (recall Example 3.14).
Finally, (0,1) defines M1=M=(ac2,a2c,b2d,abc,bcd). Therefore, the first structural decomposition decomposition of M is
[TABLE]
Theorem 4.4**.**
There is a family D of dominant ideals and a family N of purely nondominant ideals, such that
[TABLE]
where jD, jN are integers that depend on D and N, respectively, and mD, mN are monomials that depend on D and N, respectively.
Proof.
Let
[TABLE]
be the first structural decoposition of M. If some Mm=(h1′,…,hp′) (recall that c=p) is neither dominant nor purely nondominant, then its minimal generating set is of the form {u1,…,uq1,v1,…,vp1}, where u1,…,uq1 are dominant, v1,…,vp1 are nondominant, q1≥1, p1≥1, and q1+p1≤p. In particular, p1≤p−1. Let
bk,l(S/Mm)=(j′,m′)∑bk−j′,l/m′(S/Mm,m′) be the first structural decomposition of Mm. Combining the last two identities, we obtain
[TABLE]
If some Mm,m′ is neither dominant nor purely nondominant, then Mm,m′=(v1′,…,vp1′) (where vi′=m′lcm(m′,vi)), and the number p2 of nondominant generators in its minimal generating set is less than p1 (because Mm,m′ is minimally generated by at most p1 monomials). In particular, p2≤p1−1≤p−2. Suppose that, after applying Theorem 4.1r times, we obtain a decomposition
bk,l(S/M)=(j1,l1)∑⋯(jr,lr)∑bk−j1−…−jr,l/l1…lr(S/Ml1,…,lr), such that if some Ml1,…,lr is neither dominant nor purely nondominant, then
Ml1,…,lr=(w1′,…,wpr−1′), with pr−1≤p−(r−1).
If some Ml1,…,lr is neither dominant nor purely nondominant, then the number pr of nondominant generators in its minimal generating set is less than pr−1. In particular,
pr≤pr−1−1≤p−r. Therefore, after applying Theorem 4.1p times, we obtain a decomposition
[TABLE]
If we assume that there is an ideal Ml1,…,lp which is neither dominant nor purely nondominant, then Ml1,…,lp=(z1′,…,zpp−1′), with pp−1≤p−(p−1)=1.
But this scenario is not possible, for the minimal generating set of such an ideal must contain at least one dominant generator and at least one nondominant generator.
We conclude that each Ml1,…,lp is either dominant or purely nondominant.
∎
Definition 4.5**.**
The equation
[TABLE]
constructed in the proof of Theorem 4.4 will be called second structural decomposition of M. The sum D∈D∑bk−jD,l/mD(S/D) will be called dominant part of the second structural decomposition, and the sum N∈N∑bk−jN,l/mN(S/N) will be called purely nondominant part of the second structural decomposition.
Note:
Although Theorem 4.4 states the existence of a decomposition of the form
[TABLE]
the proof of Theorem 4.4 is constructive. In fact, we show that
[TABLE]
where the ideals Ml1,…,lp are either dominant or purely nondominant, and they determine the dominant and purely nondominant part of the second structural decomposition.
Recall that if D is a dominant ideal, its minimal resolution is given by TD [Al, Theorem 4.4]. Therefore, when the second structural decomposition of M has no purely nondominant part, we can immediately compute the multigraded Betti numbers bk,l(S/M). Such is the case in the next example.
Example 4.6**.**
In Example 3.1 we introduced the ideal M=(a3b2,c3d,ac2,a2c,b2d,abc,bcd) and, in Example 4.3 we gave its first structural decomposition. We would like to read off the Betti numbers of S/M from the Betti numbers of the three ideals on the right side of that decomposition. The first two of these ideals, namely Ma3b2=(c,d) and Mc3d=(a,b), are dominant. Hence, their minimal resolutions are TMa3b2 and TMc3d, respectively. However, the third ideal, M1=(ac2,a2c,b2d,abc,bcd), is not dominant. In order to obtain the multigraded Betti numbers of S/M1 we compute the first structural decomposition of M1 (we leave the details to the reader):
[TABLE]
Now, if we combine this equation with the first structural decomposition of M, given in Example 4.3, we obtain
[TABLE]
Note that this is the second structural decomposition of M, for each ideal on the right side of this decomposition is dominant. In order to compute bk,l(S/M), it would be unwise to choose integers k and monomials l at random. We might take many guesses and still not find any nonzero multigraded Betti numbers. The right way to compute bk,l(S/M) is by first computing the minimal resolutions of the dominant ideals on the right side of the decomposition, which we do next.
Therefore, bk−1,l/a3b2((c,d)S)=1 when (k−1,l/a3b2) equals one of (0,1), (1,c), (1,d), (2,cd); that is, when (k,l) equals one of (1,a3b2), (2,a3b2c), (2,a3b2d), (3,a3b2cd).
Therefore, bk−1,l/c3d((a,b)S)=1 when (k−1,l/c3d) equals one of (0,1), (1,a), (1,b), (2,ab); that is, when (k,l) equals one of (1,c3d), (2,ac3d), (2,bc3d), (3,abc3d).
•
The multigraded Betti numbers of S/(b) are
b0,1(S/(b))=b1,b(S/(b))=1.
Therefore, bk−2,l/a2c2((b)S)=1, or bk−1,l/ac2((b)S)=1, or bk−1,l/a2c((b)S)=1, when (k−2,l/a2c2) equals one of (0,1), (1,b), or when (k−1,l/ac2) equals one of (0,1), (1,b), or when (k−1,l/a2c) equals one of (0,1), (1,b); that is, when (k,l) equals one of (2,a2c2), (3,a2bc2), (1,ac2), (2,abc2), (1,a2c), (2,a2bc).
•
The multigraded Betti numbers of S/(c) are
b0,1(S/(c))=b1,c(S/(c))=1.
Therefore, bk−1,l/b2d((c)S)=1 when (k−1,l/b2d) equals one of (0,1), (1,c); that is, when (k,l) equals one of (1,b2d), (2,b2cd).
Recall that G={m1,…,md,h1,…,hc} is the minimal generating set of M. If d=1, the equation
[TABLE]
given by Theorem 4.1, will be called the third structural decomposition of M.
Note that when d=1, the right hand side of the equation above has only two terms. The third strutural decomposition will be instrumental in the proof of Charalambous theorem, in Section 6.
5. Decompositions without purely nondominant part
When the second structural decomposition of M has no purely nondominant part, the numbers bk,l(S/M) can be easily computed, as illustrated in Example 4.6. In this section, however, our aim is to compute Betti numbers of classes of ideals rather than single ideals. More specifically, we will introduce two families of ideals whose decompositions have no purely nondominant part, and will give their multigraded Betti numbers explicitly.
Definition 5.1**.**
Let L be the set of all monomials l such that the number of basis elements of TM, with multidegree l is odd.
(i)
We say that M has characteristic Betti numbers, if for each monomial l
[TABLE]
2. (ii)
For each l∈L, let
[TABLE]
We say that M has characteristic Betti numbers in minimal homological degrees, if
[TABLE]
Lemma 5.2**.**
Let
[TABLE]
be the first structural decomposition of M. Then, the second structural decomposition of M has no purely nondominant part if and only if the second structural decomposition of each Mm has no purely nondominant part.
Proof.
Let
[TABLE]
be the second structural decomposition of Mm. Then
bk,l(S/M)=(j,m)∑bk−j,l/m(S/Mm)=
[TABLE]
is the second structural decomposition of M.
∎
Theorem 5.3**.**
If the second structural decomposition of M has no purely nondominant part, then M has characteristic Betti numbers.
Proof.
The proof is by induction on the cardinality of the minimal generating set G of M.
If #G=1 or #G=2, then M is dominant and, by [Al, Corollary 4.5], M is Scarf. Now, Scarf ideals have characteristic Betti numbers.
Suppose now that the theorem holds for ideals with minimal generating sets of cardinality ≤q−1.
Let us assume that #G=q. By hypothesis, the second structural decomposition of M has no purely nondominant part, which implies that M itself is not purely nondominant. Therefore, G must be of the form G={m1,…,ms,n1,…,nt}, where m1,…,ms are dominant, n1,…,nt are nondominant, s>0, and s+t=q. In particular, t≤q−1. Now, the first structural decomposition of M is
[TABLE]
where each Mm is minimally generated by at most q−1 monomials.
Then,
[TABLE]
Suppose that, for some monomial l, k∑bk,l(S/M)=0. Then, there must be a pair (j′,m′)∈C
such that k∑bk−j′,l/m′(S/Mm′)=0. By Lemma 5.2, the second structural decomposition of Mm′ has no purely nondominant part and, by induction hypothesis,
Mm′ has characteristic Betti numbers. Hence, k∑bk−j′,l/m′(S/Mm′)=1.
Suppose, by means of contradiction, that there is a pair (j,m)∈C∖{(j′,m′)} such that k∑bk−j,l/m(S/Mm)=0. Then, there exist basis elements [σ]∈TMm′ and [τ]∈TMm, such that mdeg[σ]=l/m′, and mdeg[τ]=l/m. Recall that [σ], [τ], m′, and m are of the form [σ]=[na1′,…,nac′]; [τ]=[nb1′,…,nbd′]; m′=lcm(mu1,…,muj′); m=lcm(mv1,…,mvj). By Proposition 3.2 we have that
[TABLE]
Similarly,
[TABLE]
Hence,
mdeg[mu1,…,muj′,na1,…,nac] and mdeg[mv1,…,mvj,nb1,…,nbd] are two basis elements of TM, with the same multidegree l. By [Al, Lemma 4.3], these basis elements must contain the same dominant generators. However, since (j′,m′)=(j,m), we must have that {mu1,…,muj′}={mv1,…,mvj}, a contradiction. Therefore,
k∑bk−j,l/m(S/Mm)=0, for all (j,m)∈C∖{(j′,m′)}. Thus,
[TABLE]
We have proven that k∑bk,l(S/M)≤1, for each monomial l.
Since a minimal resolution F of S/M can be obtained from TM by making series of consecutive cancellations, and given that each consecutive cancellation involves a pair of basis elements of equal multidegree, the number of basis elements of TM with a given multidegree l is even if and only if the number of basis elements of F with multidegree l is even. But the number of basis elements of F with multidegree l is k∑bk,l(S/M)≤1, which proves the theorem.
∎
In Example 4.6, we computed the second structural decomposition of the ideal M=(a3b2,c3d,ac2,a2c,b2d,abc,bcd), and noticed that it has no purely nondominant part. Right after, we found the numbers bk,l(S/M) and proved that, with the language of this section, M has characteristic Betti numbers. This is consistent with Theorem 5.3.
Lemma 5.4**.**
Let bk,l(S/M)=(j,m)∑bk−j,l/m(S/Mm) be the first structural decomposition of M. Suppose that M has characteristic Betti numbers, and each Mm has characteristic Betti numbers in minimal homological degrees. Then M has characteristic Betti numbers in minimal homological degrees.
Proof.
Let l be a monomial that is the common multidegree of an odd number of basis elements of TM. Let r be such that br,l(S/M)=1. Then, there is a pair (j,m)∈C such that br−j,l/m(S/Mm)=1. It follows that there is a basis element [na1′,…,nar−j′] of TMm with multidegree l/m.
Recall that m is of the form m=lcm(mb1,…,mbj), with mb1,…,mbj∈{m1,…,ms}. By Proposition 3.2, l=mml=mmdeg[na1′,…,nar−j′]=mdeg[mb1,…,mbj,na1,…,nar−j]. Suppose that [σ] is a basis element of TM, such that mdeg[σ]=l. We will show that r≤hdeg[σ]. By [Al, Lemma 4.3], [σ] must be of the form
[σ]=[mb1,…,mbj,nc1,…,ncd]. By Proposition 3.2, \l=mdeg[σ]=mmdeg[nc1′…,ncd′]. Thus, the basis element [nc1′,…,ncd′] of TMm has multidegree l/m. Since Mm has Betti numbers in minimal homological degrees, hdeg[na1′,…,nar−j′]≤hdeg[nc1′,…,ncd′]. It follows that r=hdeg[mb1,…,mbj,na1,…,nar−j]≤hdeg[mb1,…,mbj,nc1,…,ncd]=hdeg[σ], which proves that M itself has characteristic Betti numbers in minimal homological degrees.
∎
Definition 5.5**.**
Suppose that the polynomial ring S has n variables x1,…,xn. We will say that M is almost generic, if there is an index i such that no variable among
x1,…,xi−1,xi+1,…,xn appears with the same nonzero exponent in the factorization of two minimal generators of M.
Example 5.6**.**
M=(a2b2cd2,a3b3c,cd4) is almost generic because no variable among a,b,d appears with the same nonzero exponent in the factorization of two minimal generators of M.
Lemma 5.7**.**
Let bk,l(S/M)=(j,m)∑bk−j,l/m(S/Mm) be the first structural decomposition of M. Suppose that M is almost generic. Then, each Mm is almost generic.
Proof.
Let G be the minimal generating set of M. By definition, there is an index i such that no variable among x1,…,xi−1,xi+1,…,xn appears with the same nonzero exponent in the factorization of two generators in G.
Let G={m1,…,ms,n1,…,nt}, where m1,…,ms are dominant, and n1,…,nt are nondominant. Then, each Mm in the first structural decomposition of M is of the form Mm=(n1′,…,nt′). Suppose, by means of contradiction, that some Mm is not almost generic. Then, there is a variable x=xi that appears with the same nonzero exponent α in the factorization of two generators na′,nb′∈{n1′,…,nt′}. Recall that na′=mlcm(m,na), nb′=mlcm(m,nb). Let u,v,w be the exponents with which x appears in the factorizations of m,na,nb, respectively. Note that x appears with exponents u+α and max(u,v) in the factorizations of mna′ and lcm(m,na), respectively. Since mna′=lcm(m,na), we must have that u+α=max(u,v). It follows that v=u+α. Likewise, x appears with exponents u+α and max(u,w) in the factorizations of mnb′ and lcm(m,nb), respectively. Since mnb′=lcm(m,nb), we must have that u+α=max(u,w). It follows that w=u+α. Combining these identities, we deduce that v=w, which implies that x appears with the same nonzero exponent in the factorizations of na and nb, which contradicts the fact that M is almost generic.
∎
Lemma 5.8**.**
If M is almost generic, its second structural decomposition has no purely nondominant part.
Proof.
Let G be the minimal generating set of M. The proof is by induction on the cardinality of G.
If #G=1 or #G=2, then M is dominant and the theorem holds.
Suppose that the theorem holds whenever #G≤q−1. Let us now assume that #G=q.
Since M is almost generic, there is an index i such that no variable among x1,…,xi−1,xi+1,
…,xn appears with the same nonzero exponent in the factorization of two generators in G. Let j=i, and let k be the greatest exponent with which xj appears in the factorization of a generator in G. Then there is a unique element in G, divisible by xjk, and such an element must be dominant (in xj). Hence, G can be represented in the form G={m1,…,ms,n1,…,nt}, where m1,…,ms are dominant, n1,…,nt are nondominant, s+t=q, and s≥1. In particular t≤q−1. By Lemma 5.7, each Mm in the first structural decomposition of M is almost generic, and since Mm=(n1′,…,nt′), Mm is minimally generated by at most q−1 elements. Then, by induction hypothesis, the second structural decomposition of Mm has no purely nondominant part. Finally, the theorem follows from Lemma 5.2.
∎
Corollary 5.9**.**
If M is almost generic, it has characteristic Betti numbers.
If M is almost generic, it has characteristic Betti numbers in minimal homological degrees.
Proof.
By induction on the cardinality of the minimal generating set G of M.
If #G=1 or #G=2, M is dominant, and the Theorem holds. Let us assume that the theorem holds whenever #G≤q−1.
Suppose now that #G=q. By Lemma 5.8, M is not purely nondominant. Then, G can be represented in the form G={m1,…,ms,n1,…,nt}, where m1,…,ms are dominant, n1,…,nt are nondominant, s+t=q, and s≥1. In particular, t≤q−1. Let bk,l(S/M)=(j,m)∑bk−j,l/m(S/Mm) be the first structural decomposition of M. Since Mm=(n1′,…,nt′), Mm is minimally generated by at most q−1 monomials. By Lemma 5.7, Mm is almost generic. By induction hypothesis, Mm has characteristic Betti numbers in minimal homological degrees. Now, the result follows from Lemma 5.4.
∎
Theorem 5.11**.**
If M is 2-semidominant, it has characteristic Betti numbers in minimal homological degrees.
Proof.
Let G={m1,…,mq,n1,n2} be the minimal generating set of M, where n1,n2 are nondominant. Then, the first structural decomposition of M is
[TABLE]
where Mm=(n1′,n2′).
If n1′=1 or n2′=1, then Mm=S, and bk−j,l/m(S/Mm)=0. Otherwise, (n1′,n2′) is minimally generated by either one or two monomials, which implies that
Mm is dominant. Note that the first and second structural decompositions agree, and have no purely nondominant part. By Theorem 5.3, M has characteristic Betti numbers. Moreover, since each Mm is dominant, it has characteristic in minimal homological degrees. Now, the result follows from Lemma 5.4.
∎
6. Structural decomposition and Projective Dimension
If the minimal generating set G of M has at least two monomials, and the ring S has n variables, there are two natural bounds for the projective dimension pd(S/M), namely, 2≤pd(S/M)≤n. In this section we discuss some cases where the lower and upper bounds are achieved.
Hilbert-Burch theorem [Ei, Theorem 20.15] describes the structure of the minimal resolutions of ideals M, when pd(S/M)=2. The next theorem gives sufficient conditions for the lower bound pd(S/M)=2 to be achieved.
Theorem 6.1**.**
Let M be either 2- or 3-semidominant. Suppose that there exist a minimal generator of M that divides the lcm of every pair of minimal generators of M. Then pd(S/M)=2.
Proof.
Let G={m1,…,ms,n1,…,nt} be the minimal generating set of M, where m1,…,
ms are dominant, and n1,…,nt are nondominant. By hypothesis, there is an element n in G that divides the lcm of every pair of elements in G. However, since each mi is dominant, mi∤lcm(n1,n2). It follows that n must be one of the n1,…,nt; say n=n1. Let
bk,l(S/M)=(j,m)∈C∑bk−j,l/m(S/Mm) be the first structural decomposition of M. Let (j,m)∈C. We will prove that bk−j,l/m(S/Mm)=0 for all k≥3, and all monomials l.
First, let us assume that j≥2. Then there are monomials mi1,…,mij∈G such that m=lcm(mi1,…,mij), and Mm=(n1′,…,nt′), where ni′=mlcm(m,ni). In particular,
n1∣lcm(mi1,mi2), and hence, n1∣m. This implies that lcm(m,n1)=m, and thus n1′=mlcm(m,n1)=1. Therefore, Mm=S, and bk−j,l/m(S/Mm)=0 for all k≥3 and all monomials l.
Now, let us assume that j=1. Then m=mi1, and by hypothesis, n1∣lcm(mi1,nk), for all k=2,…,t. Then lcm(mi1,n1)∣(mi1,nk), for all k=2,…,t, and therefore, n1′∣nk′, for all k=2,…,t. This means that Mm=(n1′,…,nt′)=(n1′), and thus, pd(S/Mm)≤1. It follows that bk−j,l/m(S/Mm)=bk−1,l/m(S/Mm)=0, for all k≥3, and all monomials l.
Finally, suppose that j=0. Then m=1, and Mm=(n1′,…,nt′)=(n1,…,nt). Since M is either 2-semidominant or 3-semidominant, t=2 or t=3. If t=2, then Mm=(n1,n2), and thus
bk−j,l/m(S/Mm)=bk,l(S/Mm)=0, for all k≥3, and all monomials l. On the other hand, if t=3, since n1∣lcm(n2,n3), Mm=(n1,n2,n3) is not dominant, and we must have
pd(S/Mm)≤2. It follows that bk−j,l(S/Mm)=bk,l(S/Mm)=0, for all k≥3, and all monomials l. Therefore, for all k≥3, and all monomials l the first structural decomposition of M gives
bk,l(S/M)=(j,m)∈C∑bk−j,l/m(S/Mm)=0, which means that pd(S/M)≤2. However, since #G≥2, we must have pd(S/M)=2.
∎
Example 6.2**.**
Let
[TABLE]
Let M=(m1,…,m6); M2=(m1,…,m6,n1,n2); M3=(m1,…,m6,n1,n2,n3). It is clear that M is dominant; M2 is 2-semidominant, and M3 is 3-semidominant. Note that n1 divides the lcm of every pair of monomials in {m1,…,m6,n1,n2,n3}. By Theorem 6.1, pd(S/M)=6; pd(S/M2)=pd(S/M3)=2. (We see how adding a few monomials to the minimal generating set can change the projective dimension dramatically.)
The fact that Artinian monomial ideals have maximum projective dimension (in the sense of Hilbert Syzygy theorem) was proven by Charalambous [Ch] (see also [Pe, Corollary 21.6]), using the radical of an ideal as main tool. Here we give an alternative proof of this fact that relies entirely on the first structural decomposition.
Theorem 6.3**.**
If M is Artinian in S=k[x1,…,xn], then pd(S/M)=n.
Proof.
By induction on n. If n=1, the result is trivial. Suppose that pd(S/M)=n−1, for Artinian ideals M in n−1 variables.
Let M be Artinian in S=k[x1,…,xn]. Then, for each i=1,…,n, the minimal generating set G of M contains a monomial xiαi, αi≥1. Notice that each xiαi is dominant.
Let bk,l(S/M)=(j,m)∈C∑bk−j,l/m(S/Mm) be the third structural decomposition of M, where m1=x1α1, and H=G∖{x1α1}. Since x1α1 is dominant, (1,x1α1)∈C. Thus, bk−1,l/x1α1(S/Mx1α1) is one of the terms on the right side of the third structural decomposition.
Let G={x1α1,…,xnαn,l1,…,lq}. By construction,
[TABLE]
Since x1α1 is dominant, x1 does not appear in the factorization of li′. Thus, Mx1α1 is an Artinian ideal in n−1 variables. By induction hypothesis, pd(S/Mx1α1)=n−1. Therefore, there is a monomial l, such that bn−1,l(S/Mx1α1)=0. Let l′=lx1α1.Then, bn−1,l′/x1α1(S/Mx1α1)=0. Finally,
[TABLE]
which implies that pd(S/M)=n.
∎
Theorem 6.4**.**
Let M be Artinian in S=k[x1,…,xn]. Let FM be a minimal resolution of S/M, obtained from TM by means of consecutive cancellations. Then there is a basis element [σ] of FM, such that hdeg[σ]=n, and mdeg[σ] is divisible by each variable x1,…,xn.
Proof.
By Theorem 6.3, there is a basis element [σ] in the basis of FM, such that hdeg[σ]=n.
By means of contradiction, suppose that the set {xj1,…,xji} of all variables dividing mdeg[σ] is a proper subset of {x1,…,xn}; that is i≤n−1.
Let m=mdeg[σ]; let G be the minimal generating set of M, and let Mm be the ideal generated by {l∈G:l∣m}. By [GHP, Theorem 2.1], there is a subcomplex (FM)≤m of FM, such that [σ] is a basis element of (FM)≤m, and (FM)≤m is a minimal resolution of S/Mm. Therefore, pd(S/Mm)≥hdeg[σ]=n. However, since Mm is a monomial ideal in k[xj1,…,xji], it follows from Hilbert Syzygy theorem that pd(S/Mm)≤i≤n−1, a contradiction.
We conclude that mdeg[σ] is divisible by x1,…,xn.
∎
Now we are ready to prove Charalambous theorem.
Theorem 6.5**.**
Let M be Artinian in S=k[x1,…,xn]. Then, for all i=0,…,n, bi(S/M)≥(in).
Proof.
Let 0≤i≤n. Let Xi be the class of all subsets of {x1,…,xn}, of cardinality i. Then #Xi=(in). Let {xj1,…,xji}∈Xi. Let G be the minimal generating set of M, and let Gj1,…,ji and let Mm be the monomial ideal generated by Gj1,…,ji. Since M is Artinian in k[x1,…,xn], G contains generators of the form xj1αj1,…,xjiαji, and hence, Mm is Artinian in k[xj1,…,xji]. By Theorem 6.4, there is a basis element [σj1,…,ji]. of a minimal resolution (FM)≤m of S/Mm, such that hdeg[σj1,…,ji]=i, and mdeg[σj1,…,ji] is divisible by xj1,…,xji. Since Mm is an ideal in k[xj1,…,xji], mdeg[σj1,…,ji] is not divisible by any variable of {x1,…,xn}∖{xj1,…,xji}. By [GHP, Theorem 2.1], (FM)≤m can be regarded as a subcomplex of a minimal resolution FM of S/M. Therefore, [σj1,…,ji] is a basis element of FM. Notice that if {xj1,…,xji} and {xk1,…,xki} are different elements of Xi, the basis elements [σj1,…,ji] and [σk1,…,ki], determined by these sets must be different too. In fact, the sets of variables dividing mdeg[σj1,…,ji] and mdeg[σk1,…,ki] are {xj1,…,xji} and {xk1,…,xi}, respectively. It follows that bi(S/M)≥#Xi=(in).
∎
Theorem 6.6**.**
Let M be an ideal in S=k[x1,…,xn], with minimal generating set G. Suppose that G contains a subset of the form
[TABLE]
Then pd(S/M)=n.
Proof.
Let G=G′∪{l1,…,lq}. Let bk,l(S/M)=(j,m)∈C∑bk−j,l/m(S/Mm) be the first structural decomposition of M. Let γ=α1+β1. Then x1γ=x1α1x1β1 is a minimal generator in G. Notice that the exponent γ with which x1 appears in the factorization of x1γ, must be larger than the exponent with which x1 appears in the factorization of any other minimal generator l in G; otherwise, l would be a multiple of x1γ. Hence, x1γ is dominant in G; which implies that (1,x1α11)∈C. Thus, bk−1,l/x1γ(S/Mx1γ) is one of the terms on the right side of the first structural decomposition. Now,
[TABLE]
where li′=x1γlcm(x1γ,li).
Since x1γ is dominant, x1 does not appear in the factorization of li′. Thus, Mx1γ is an Artinian monomial ideal in k[x2,…,xn−1]. It follows that pd(S/Mx1γ)=n−1. Therefore, there is a monomial l, such that bn−1,l(S/Mx1γ)=0. Let l′=lx1γ. Then, bn−1,l′/x1γ(S/Mx1γ)=0. Finally,
[TABLE]
which implies that pd(S/M)=n.
∎
Example 6.7**.**
Let M=(x13,x1x2,x1x3,x1x4,x1x5,x2x4,x3x5). Then, the subset G′={x13,x1x2,x1x3,x1x4,x1x5} of the minimal generating set of M, satisfies the hypotheses of Theorem 6.6. Hence, pd(S/M)=5.
The hypothesis of Theorem 6.6 is more common than it may seem. For instance, Artinian ideals satisfy this condition. The hypothesis of Theorem 6.6 is also satisfied if M is the smallest Borel ideal containing a given monomial. A particular case of Theorem 6.6 is proven in [Ra].
7. Conclusion
We close this article with some remarks, questions, and conjectures.
The structural decomposition is one of the very few techniques that allow us to compute Betti numbers by hand, not for arbitrary monomial ideals, but for a wide class of them. As a matter of fact, the ideal M in Example 4.6, is minimally generated by 7 monomials and even so we were able to compute the numbers bk,l(S/M). (Starting with TM, we could also calculate the bk,l(S/M) by means of consecutive cancellations. But since the basis of TM contains ∑(i7)=128 elements, and the basis of the minimal resolution of S/M contains 20 elements, we should make 2128−20=54 consecutive cancellations, which obviously requires the use of software.)
On a different note, the structural decomposition of an ideal M generates a finite family {Mm} of ideals that usually has these two properties: a) the minimal generating set of each Mm has smaller cardinality than the minimal generating set of M; b) if M is an ideal in S=k[x1,…,xn], then Mm is an ideal in a polynomial ring with less than n variables. As a consequence, the structural decomposition works well when one wants to prove facts by induction. Theorems 5.3 and 5.10, for instance, are proven by induction on the cardinaliy of the minimal generating set. On the other hand, Theorem 6.3 is proven by induction on the number of variables.
One last comment. Theorem 5.3 does not depict the entire family of ideals with characteristic Betti numbers. In fact, M=(a2bc,b2c2,a2b2,abc2) is purely nondominant and has characteristic Betti numbers. What other ideals have characteristic Betti numbers? The next two conjectures suggest some possibilities.
Conjecture 7.1**.**
Suppose that for some ideal M, there are indices i<j such that no variable among x1,…,xi−1,xi+1,…,xj−1,,xj+1,…,xn appears with the same nonzero exponent in the factorization of two minimal generators. Then M has characteristic Betti numbers.
Conjecture 7.2**.**
Let M be minimally generated by {m1,…,mq,n1,…,np}, where the mi are dominant and the ni are nondominant. If the ideal M′=(n1,…,np) is almost generic, then M has characteristic Betti numbers in minimal homological degrees.
Finally, we conjecture that Theorem 6.1 admits a simple generalization.
Conjecture 7.3**.**
If M is minimally generated by more than one monomial, and there is a minimal generator that divides the lcm of every pair of generators, then pd(S/M)=2.
Acknowledgements: I am deeply indebted to my wife Danisa for her support, from beginning to end of this project. Selflessly, she spent many hours typing many versions of this paper. With her common sense and her uncommon wisdom, she helped me to select the contents and organize the material. Time and time again, she turned my frustration into motivation. She is a true gift from God.
Bibliography9
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), 780-798.
2[BPS] D. Bayer, I. Peeva, and B. Sturmfels, Monomial resolutions , Math. Res. Lett 5 (1998), no. 1-2, 31-46.
3[Ch] H. Charalambous, Betti numbers of multigraded modules , J. Algebra 137 (1991), no. 2, 491-500.
4[Ei] D. Eisenbud, Commutative Algebra with a View Toward Algebraic Geometry , Springer-Verlag, New York-Berlin-Heidelberg, (1995).
5[EK] S. Eliahou and M. Kervaire, Minimal resolutions of some monomial ideals , J. Algebra 129 (1990), no. 1, 1-25.
6[GHP] V. Gasharov, T. Hibi, and I. Peeva, Resolutions of a-stable ideals , J. Algebra 254 (2002), no. 2, 375-394.
7[Me] J. Mermin, Three simplicial resolutions, Progress in Commutative Algebra 1 , Edited by Francisco, Christopher / Klingler, Lee C. / Sather-Wagstaff, Sean / Vassilev, Janet C. De Gruyter (2012).
8[Pe] I. Peeva, Graded Syzygies , Algebra and Applications, vol. 14, Springer, London, 2010.