This paper introduces the concepts of pretty $k$-clean monomial ideals and $k$-decomposable multicomplexes, establishing their equivalence and extending existing theories in combinatorial commutative algebra.
Contribution
It defines new classes of monomial ideals and multicomplexes, proving their equivalence and generalizing prior results in the field.
Findings
01
A multicomplex is $k$-decomposable iff its associated monomial ideal is pretty $k$-clean.
02
A monomial ideal is pretty $k$-clean iff its polarization is $k$-clean.
03
The results extend previous work by Herzog-Popescu, Soleyman Jahan, and the author.
Abstract
We introduce pretty k-clean monomial ideals and k-decomposable multicomplexes, respectively, as the extensions of the notions of k-clean monomial ideals and k-decomposable simplicial complexes. We show that a multicomplex Γ is k-decomposable if and only if its associated monomial ideal I(Γ) is pretty k-clean. Also, we prove that an arbitrary monomial ideal I is pretty k-clean if and only if its polarization Ip is k-clean. Our results extend and generalize some results due to Herzog-Popescu, Soleyman Jahan and the current author.
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 · Rings, Modules, and Algebras · Algebraic structures and combinatorial models
Full text
Pretty k-clean monomial ideals and k-decomposable multicomplexes
We introduce pretty k-clean monomial ideals and k-decomposable multicomplexes, respectively, as the extensions of the notions of k-clean monomial ideals and k-decomposable simplicial complexes. We show that a multicomplex Γ is k-decomposable if and only if its associated monomial ideal I(Γ) is pretty k-clean. Also, we prove that an arbitrary monomial ideal I is pretty k-clean if and only if its polarization Ip is k-clean. Our results extend and generalize some results due to Herzog-Popescu, Soleyman Jahan and the current author.
Let R be a Noetherian ring and M be a finitely generated R-module. It is
well-known that there exists a so called prime filtration
[TABLE]
that is such that Mi/Mi−1≅R/Pi for some Pi∈Supp(M). The set {P1,…,Pr} is called the support of M and denoted by Supp(F). Let Min(M) denote the set of minimal prime ideals in Supp(M). Dress [2] calls a prime filtration F of Mclean if Supp(F)=Min(M). The module M is called clean, if M admits a clean filtration and R is clean if it is a clean module over itself.
Herzog and Popescu [5] introduced the concept of pretty clean modules. A prime filtration
[TABLE]
of M with Mi/Mi−1≅R/Pi is called pretty clean, if for all i<j for which Pi⊆Pj it follows
that Pi=Pj. The module M is called pretty clean, if it has a pretty clean filtration. We say an ideal I⊂R is clean (or pretty clean) if
R/I is clean (or pretty clean).
Dress showed [2] that a simplicial complex is shellable if and only if its Stanley-Reisner
ideal is clean. This result was extended in two different forms by Herzog and Popescu in [5] and also by the current author in [7]. Herzog and Popescu showed that a multicomplex is shellable if and only if its associated monomial ideal is pretty clean (see [5, Theorem 10.5.]) and we proved that a simplicial complex is k-decomposable if and only if its Stanley-Reisner ideal is k-clean (see [7, Theorem 4.1.]). Pretty cleanness and k-cleanness are, respectively, the algebraic counterpart of shellability for multicomplexes due to [5] and k-decomposability for simplicial complexes due to Billera-Provan [1] and Woodroofe [11].
Soleyman Jahan proved that a monomial ideal is pretty clean if and only if its polarization is clean (see [9, Theorem 3.10.]). This yields a characterization of pretty clean monomial ideals, and it also
implies that a multicomplex is shellable if and only the simplicial complex corresponding to its polarization
is (non-pure) shellable. The purpose of this paper is to improve and generalize these results. To this end we introduce two notions: pretty k-clean monomial ideal and k-decomposable multicomplex. The first notion is as an extension of pretty clean monomial ideals as well as k-clean monomial ideals and the second one extends two notions shellable multicomplexes and k-decomposable simplicial complexes. The new constructions introduced here imply that pretty clean monomial ideals and shellable multicomplexes have recursive structures and, moreover, determine more details of their combinatorial properties.
The paper is organized as follows. In the first section, we review some preliminaries which are needed in the sequel. In the second section, we define pretty cleaner monomials, which naturally leads us to define pretty k-clean monomial ideals. We show that
Theorem 2.6. A pretty k-clean monomial ideal is pretty clean and also every pretty clean monomial ideal is pretty k-clean for some k≥0.
This theorem implies that pretty k-cleanness is an extension of pretty cleanness and, moreover, since pretty k-clean monomial ideals have a recursive structure it follows that pretty clean ideals have such a property, too.
In the third section we define a class of multicomplexes, called k-decomposable multicomplexes and discuss some structural properties of them. We prove that
Theorem 3.8. Every k-decomposable multicomplex is shellable and every shellable multicomplex is k-decomposable for some k≥0.
In Proposition 3.9 we show that our definition of k-decomposable multicomplexes extends the corresponding notion known for simplicial complexes due to Billera and Provan [1] or Woodroofe [11].
The final section is devoted to the main results of the paper. As the first main result, we show that
Theorem 4.2. A multicomplex Γ is k-decomposable if and only if its associated monomial ideal I(Γ) is pretty k-clean.
This result generalizes Theorem 10.5 of [5] and also Theorem 4.1 of [7] and, moreover, it implies that Theorem 3.8 is a combinatorial translation of Theorem 2.6. To obtain the second main result of section 4, we first prove that a multicomplex is k-decomposable if and only if its polarization is k-decomposable (see Theorem 4.5). This leads us to prove that
Corollary 4.6. A monomial ideal I is pretty k-clean if and only if its polarization Ip is k-clean.
This extends Theorem 3.10 of [9] which says that an arbitrary monomial ideal I is pretty clean if and only if its polarization is clean.
Our proofs here are often combinatorial and in this way we introduce the new features of the structure of pretty clean monomial ideals.
1. preliminaries
Let S=K[x1,…,xn] be the polynomial ring over a field K. Let I⊂S be a monomial ideal. Set ass(I)=Ass(S/I) and min(I)=Min(S/I). A prime filtration of I is of the form
[TABLE]
with Ij/Ij−1≅S/Pj, for j=1,…,r such that all Ij are monomial ideals.
The prime filtration F is called clean, if Supp(F)=min(I). Also, F is called pretty clean, if for all i<j which Pi⊆Pj it
follows that Pi=Pj. The monomial ideal I is called clean(or pretty clean), if it has a clean (or pretty clean) filtration. It was shown in [5] that if F is a pretty clean filtration of I then Supp(F)=ass(I).
Let Δ be a simplicial complex on the vertex set [n]:={x1,…,xn}. The set of facets (maximal faces) of Δ
is denoted by F(Δ) and if F(Δ)={F1,…,Fr}, we write Δ=⟨F1,…,Fr⟩. For a monomial ideal I of S, the set of minimal generators of I is denoted by G(I).
Definition 1.1**.**
A simplicial complex Δ is called shellable if there exists an ordering F1,…,Fm on the
facets of Δ such that for any i<j, there exists a vertex
v∈Fj∖Fi and ℓ<j with
Fj∖Fℓ={v}. We call F1,…,Fm a shelling for Δ.
Theorem 1.2**.**
[2]** The simplicial complex Δ is shellable if and only if its Stanley-Reisner ideal IΔ is
a clean monomial ideal.
For a simplicial complex Δ and F∈Δ, the link of F in
Δ is defined as
[TABLE]
and the deletion of F is the
simplicial complex
[TABLE]
Woodroofe in [11] extended the definition of k-decomposability
to non-pure complexes as follows.
Let Δ be a simplicial complex on vertex set X. Then a face σ is called a
shedding face if every face τ containing σ satisfies the following exchange property: for every
v∈σ there is w∈X∖τ such that (τ∪{w})∖{v} is a face of Δ.
Definition 1.3**.**
[11] A simplicial complex Δ is recursively defined to be k-decomposable if
either Δ is a simplex or else has a shedding face σ with dim(σ)≤k such that both Δ∖σ
and linkΔ(σ) are k-decomposable. The complexes {} and {∅} are considered to be
k-decomposable for all k≥−1.
Definition 1.4**.**
[7] Let I⊂S be a monomial ideal. A non unit monomial u∈I is called a cleaner monomial of I if min(ass(I+Su))⊆min(ass(I)).
Definition 1.5**.**
[7] Let I⊂S be a monomial ideal. We say that I is k-clean whenever I is a prime ideal or I has no embedded prime ideals and there exists a cleaner monomial u∈I with ∣supp(u)∣≤k+1 such that both I:u and I+Su are k-clean.
Theorem 1.6**.**
[7, Theorem 4.1.]** Let Δ be a (d−1)-dimensional simplicial complex. Then Δ is k-decomposable if and only if IΔ is k-clean, where 0≤k≤d−1.
The concept of multicomplex was first defined by Stanley [10]. Then Herzog and Popescu [5] gave a modification of Stanley’s definition which will be used in this paper.
Let N be the set of non-negative integers. Define on Nn the partial order given by
a⪯b if a(i)≤b(i) for all i.
Set N∞=N∪{∞}. For a∈N∞n we define fpt(a)={i:a(i)=∞} and infpt(a)={i:a(i)=∞} and fpt∗(a)={i:0<a(i)<∞}.
Let Γ be a subset of N∞n. An element m∈Γ is called maximal if there is no a∈Γ with a≻m. We denote by M(Γ) the set of maximal elements of Γ. It was shown in [5, Lemma 9.1] that M(Γ) is finite.
Definition 1.7**.**
A subset Γ⊂N∞n is called a multicomplex if
(1)
for all a∈Γ and all b∈N∞n with b⪯a it follows that b∈Γ;
2. (2)
for all a∈Γ there exists an element m∈M(Γ) such that a⪯m.
The elements of a multicomplex are called faces. An element a∈Γ is called a facet of Γ if for all m∈M(Γ) with a⪯m one has infpt(a)=infpt(m). Let F(Γ) denote the set of facets of Γ. The facets in M(Γ) are called maximal facets.
It is clear that the set of facets and also the set of maximal facets of a multicomplex Γ determine Γ. The monomial ideal associated toΓ is the ideal I(Γ) generated by all monomials xa such that a∈Γ. Also, if I⊂S is any monomial ideal then the multicomplex associated toI is defined to be Γ(I)={a∈N∞n:xa∈I}. Note that I(Γ(I))=I and, moreover, Γ(I) is unique with this property. For A={a1,…,ar}⊂N∞n, we denote by ⟨a1,…,ar⟩ the unique smallest multicomplex containing A.
For a∈Γ, define dim(a)=∣infpt(a)∣−1 and
[TABLE]
We call S⊂N∞n a Stanley set of degreea if there exist a∈Nn and m∈N∞n with
m(i)∈{0,∞} such that S=a+S∗, where S∗=⟨m⟩. The dimension of S is defined to be dim(⟨m⟩).
Definition 1.8**.**
[5] A multicomplex Γ is shellable if the facets of Γ can be ordered a1,…,ar such that
(1)
Si=⟨ai⟩\⟨a1,…,ai−1⟩ is a Stanley set for i=1,…,r;
2. (2)
If Si∗⊂Sj∗ then Si∗=Sj∗ or i>j.
An ordering of the facets satisfying (1) and (2) is called a shelling of Γ.
Theorem 1.9**.**
[5, Proposition 10.3.]** Let Δ be a simplicial complex with facets F1,…,Fr, and Γ be the multicomplex with facets aF1,…,aFr. Then Δ is shellable if and only if Γ is shellable.
Theorem 1.10**.**
[5, Theorem 10.5]** The multicomplex Γ is shellable if and only if I(Γ) is a pretty clean monomial ideal.
Let I⊆S be a monomial ideal generated by the set
G(I)={u1,…,ur}. Let for each i,
ui=∏j=1nxjtij and for each j,
tj=max{tij:i=1,…,r}. Let
[TABLE]
be a polynomial ring over K. For each i=1,…,r set
[TABLE]
The monomial vi is squarefree and is called the
polarization of ui. Also, we denote the polarization of I
by Ip and it is a squarefree monomial ideal generated by
{v1,…,vr}.
Theorem 1.11**.**
[9, Theorem 3.10.]** The monomial ideal I is pretty clean if and only if Ip is clean.
2. Pretty k-clean monomial ideals
Let I⊂S be a monomial ideal. A prime filtration
[TABLE]
of S/I is called multigraded, if all Mi are multigraded submodules of M, and if there are multigraded isomorphisms Mi/Mi−1≅S/Pi(−ai) with some ai∈Zn and some multigraded prime ideals Pi.
Definition 2.1**.**
Let I⊂S be a monomial ideal. A non unit monomial u∈I is called pretty cleaner if for P∈ass(I:u) and Q∈ass(I+Su) which P⊆Q it follows that P=Q.
Definition 2.2**.**
A monomial ideal I⊂S is called pretty k-clean if it is a prime ideal or there exists a pretty cleaner monomial u∈I with ∣supp(u)∣≤k+1 such that both I:u and I+Su are pretty k-clean.
Note that pretty k-cleanness implies pretty k′-cleanness for 0≤k≤k′. But the converse implication is not true in general. To see an example of pretty k-clean ideals which are not pretty [math]-clean, refer to Remark 4.4.
Remark 2.3*.*
It is clear that every k-clean monomial ideal is pretty k-clean. But a cleaner monomial need not be pretty cleaner. To see this, consider the monomial ideal
[TABLE]
Then
[TABLE]
Notice that x12 is cleaner but not pretty cleaner.
It follows from the definition that the construction of a pretty k-clean monomial ideal is similar to that of a k-clean monomial ideal (c.f. [7]). In other words, for a pretty k-clean monomial ideal I⊂S there is a rooted, finite, directed and binary tree T whose root is I and every node n is labeled by a pretty k-clean monomial ideal In containing I. Also, every nonterminal node n is labeled by a monomial un which is a pretty cleaner monomial of In. T is depicted in the following:
[TABLE]
T is called the ideal tree of I and the number of all pretty cleaner monomials un1,un2,… appeared in T is called the length ofT. We denote the length of T by l(T).
We define the pretty k-cleanness length of the pretty k-clean monomial ideal I by
[TABLE]
The following proposition gives an useful description of the structure of pretty clean filtrations.
Proposition 2.4**.**
[5, Proposition 10.1.]** Let S=K[x1,…,xn] be the polynomial ring, and I⊂S a
monomial ideal. The following conditions are equivalent:
(a)
S/I* admits a multigraded prime filtration F:(0)=M0⊂M1⊂…⊂Mr−1⊂Mr=S/I such that Mi/Mi−1≅S/Pi(−ai) for all i;*
2. (b)
there exists a chain of monomial ideals I=I0⊂I1⊂…⊂Ir=S and monomials ui of multidegree ai such that Ii=Ii−1+Sui and Ii−1:ui=Pi;
As an immediate consequence of the previous proposition we get
Corollary 2.5**.**
Let S=K[x1,…,xn] be the polynomial ring, and I⊂S a
monomial ideal. Let S/I be pretty clean with the multigraded prime filtration F:I=I0⊂I1⊂…⊂Ir=S such that Ii/Ii−1≅S/Pi(−ai) for all i. Set Ii=⋂j=i+1rJj for i=0,…,r. Then ass(Ii)={Pi+1,…,Pr} for all i=0,…,r.
Now we want to prove the main result of this section.
Theorem 2.6**.**
Every pretty k-clean monomial ideal is pretty clean. Also, a pretty clean monomial ideal is pretty k-clean, for some k≥0.
Proof.
Suppose that I is a pretty k-clean monomial ideal. We use induction on the pretty k-cleanness length of I. Assume that I is not prime and there exists a pretty cleaner monomial u∈I with ∣supp(u)∣≤k+1 such that both I:u and I+Su are pretty k-clean. By induction, I:u and I+Su are pretty clean and there are pretty clean filtrations
[TABLE]
and
[TABLE]
with (Li/I:u)/(Li−1/I:u)≅S/Qi(−ai) where Qi are prime ideals.
It is known that the multiplication map φ:S/I:u(−a)⟶.uI+Su/I is an isomorphism. Restricting φ to Li/I:u yields a monomorphism φi:Li/I:u⟶.uI+Su/I. Set Hi/I:=φi(Li/I:u). Hence Hi/I≅(Li/I:u)(−a). It follows that
[TABLE]
Therefore we obtain the following prime filtration induced from F2:
[TABLE]
By adding F1 to F3 we get the prime filtration
[TABLE]
Let Qi∈Supp(F1) and Pj∈Supp(F2) with Pj⊆Qi. By [5, Corollary 3.6], Qi∈ass(I+Su) and Pj∈ass(I:u). Since u is a pretty cleaner we have Pj=Qi. Therefore I is pretty clean.
Conversely, let I be a pretty clean monomial ideal. Then there is a pretty clean filtration
[TABLE]
of S/I with Mi/Mi−1≅S/Pi(−ai). If I is a prime ideal then we have nothing to prove. Assume that I is not a prime ideal. Since I is pretty clean, by Proposition 2.4, there exists a chain of monomial ideals I=I0⊂I1⊂…⊂Ir=S and monomials ui of multidegree ai such that Ii=Ii−1+Sui and Ii−1:ui=Pi. It is clear that I1 is pretty k-clean, where ∣supp(u1)∣≤k+1. By Corollary 2.5, ass(I1)={P2,…,Pr}. It follows from P1⊂Pi∈ass(I1) that P1=Pi. Hence, since u1 is pretty cleaner, we obtain that I is pretty k-clean.
∎
The following result is an improvement of [5, Corollary 3.5.] in the special case where M is the quotient ring S/I.
Theorem 2.7**.**
Let I⊂S be a pretty k-clean monomial ideal. Then I is k-clean if and only if ass(I)=min(I).
Proof.
It follows from the definition.
∎
Theorem 2.8**.**
Let I⊂S be pretty k-clean. Then for all monomial u∈S, I:u is pretty k-clean.
For some examples of pretty k-clean monomial ideals see [7].
3. k-decomposable multicomplexes
The aim of this section is to extend the concept of k-decomposability to multicomplexes. We first define some notions. Let Γ be a multicomplex and a∈Γ. We define the star, deletion and link of a in Γ, respectively, as follows:
[TABLE]
For the multicomplexes Γ1,Γ2⊂N∞n, the join of Γ1 and Γ2 is defined to be
[TABLE]
One can easily check that
[TABLE]
If {a1,…,ar}⊂N∞n, then
[TABLE]
Example 3.1*.*
Let Γ=⟨(2,∞),(3,0)⟩. Then
[TABLE]
For a=(2,1) we have
[TABLE]
Definition 3.2**.**
Let Γ be a (d−1)-dimensional multicomplex and let 0≤k≤d−1. An element a∈Γ∩Nn with ∣fpt∗(a)∣≤k+1 is called shedding face if it satisfies the following conditions:
(i)
for all b∈F(starΓ(a)), ⟨b⟩\(Γ\a) is a Stanley set of degree a;
2. (ii)
for every b∈F(starΓ(a)) and every c∈F(Γ\a) if fpt(b)⊆fpt(c) then fpt(b)=fpt(c).
Definition 3.3**.**
Let Γ be a (d−1)-dimensional multicomplex and let 0≤k≤d−1. We say that Γ is k-decomposable if it has only one facet or there exists a shedding face a∈Γ with ∣fpt∗(a)∣≤k+1 such that both linkΓ(a) and Γ\a are k-decomposable.
Remark 3.4*.*
Note that for a multicomplex Γ with F(Γ)={a} one has a∈{0,∞}n (see [5, Corollary 9.11]).
Now we discuss some structural properties of k-decomposable multicomplexes.
Theorem 3.5**.**
Let Γ be a k-decomposable multicomplex. Then for all a∈Γ, linkΓa is k-decomposable.
Proof.
If Γ has just one facet then we have no thing to prove. Suppose that ∣F(Γ)∣>1 and there is a shedding face b∈Γ with ∣fpt∗(b)∣≤k+1.
Case 1. Let b⪯a and a∨b∈Γ. Then linkΓa=linklinkΓb(a−b). Since ∣F(linkΓb)∣≤∣F(Γ)∣, it follows from induction hypothesis that linklinkΓb(a−b) is k-decomposable.
Case 2. Let b⋠a and a∨b∈Γ. Then
[TABLE]
and
[TABLE]
Now, since ∣F(linkΓb)∣≤F(Γ)∣ and ∣F(Γ\b)∣≤∣F(Γ)∣ we conclude that linklinkΓa(a∨b−a) and linkΓa\(a∨b−a) are k-decomposable, by induction hypothesis. Now we show that a∨b−a is a shedding face of linkΓa.
Let c∈F(starlinkΓa(a∨b−a)). Hence, since starlinkΓa(a∨b−a)=linkstarΓb(a) we get c+a∈F(starstarΓb(a)). Thus c+a∈F(starΓb). It follows that there is m∈{0,∞}n such that ⟨c+a⟩\(Γ\b)=b+⟨m⟩. This implies that
[TABLE]
Let u∈F(starlinkΓa(a∨b−a)) and v∈F((linkΓa)\(a∨b−a)) with fpt(u)⊆fpt(v). Then we have u+a∈F(starΓb), v+a∈F(Γ\b) and fpt(u+a)⊆fpt(v+a). Because b is a shedding face of Γ we get fpt(u+a)=fpt(v+a). It follows that fpt(u)=fpt(v).
Case 3. Let a∨b∈Γ. Then linkΓa=linkΓ\ba.
Since ∣F(Γ\b)∣≤∣F(Γ)∣, it follows from induction hypothesis that linkΓa is k-decomposable.
∎
Theorem 3.6**.**
Let Γ∈N∞n be a multicomplex which has just one maximal facet b. Then Γ is k-decomposable if and only if ∣fpt∗(b)∣≤k+1.
Proof.
“Only if part”: Let Γ be k-decomposable. If Γ has only one facet then the assertion follows from Remark 3.4. Suppose that ∣F(Γ)∣>1 and let a be a shedding face of Γ with ∣fpt∗(a)∣≤k+1 such that linkΓa and Γ\a are k-decomposable. Since b∈F(starΓa), there exists m∈{0,∞}n such that ⟨b⟩\(Γ\a)=a+⟨m⟩. Note that infpt(b)=infpt(m).
Let 0<b(i)<∞ for some i. If a(i)=0 then since b∈a+⟨m⟩ we have 0<m(i)<∞, a contradiction. Therefore a(i)=0. This implies that fpt∗(b)⊆fpt∗(a). Hence ∣fpt∗(b)∣≤k+1.
“If part”: If ∣fpt∗(b)∣=0 then b∈{0,∞}n and so Γ has just one facet. Hence Γ is k-decomposable. Suppose that ∣fpt∗(b)∣>0. We show that a with
[TABLE]
is a shedding face of Γ.
Since F(linkΓ(a))={b−a}, it follows that linkΓa is k-decomposable. We have ⟨b⟩\(Γ\a)=a+⟨m⟩ where infpt(m)=infpt(b). Since for all c∈F(Γ), infpt(c)=infpt(b) it follows that fpt(c)=fpt(b) and so the condition (ii) of Definition 3.2 holds. It remains to show that Γ\a is k-decomposable.
Let 0<b(i)<∞. Set
[TABLE]
In a similar way to a for Γ, we show that c is a shedding face of Γ\a. The proof is completed inductively.
Consequently, Γ is k-decomposable.
∎
Two multicomplexes Γ1,Γ2⊂N∞n are called disjoint whenever there exists 1<m<n such that a∈Γ1 (resp. a∈Γ2) implies a(i)=0 for i>m (resp. a(i)=0 for i≤m).
Theorem 3.7**.**
Let Γ1 and Γ2 be two disjoint multicomplexes. If Γ1⋅Γ2 is k-decomposable then Γ1 and Γ2 are k-decomposable. The converse holds, if in addition, F(Γ2)⊂{0,∞}n.
Proof.
Note that Γ=Γ1⋅Γ2 has one facet if and only if Γ1 and Γ2 have one facet. So assume that ∣F(Γ1)∣>1 or ∣F(Γ2)∣>1.
For every face a∈Γ we have
[TABLE]
and
[TABLE]
where a1∈Γ1, a2∈Γ2 and a=a1+a2.
“Only if part”: Let Γ1⋅Γ2 be k-decomposable with shedding face a=a1+a2 where ai∈Γi. We want to show that Γi is k-decomposable with shedding face ai. We may assume that starΓ1a1=Γ1. Since linkΓa1=linkΓ1a1⋅Γ2, we get linkΓ1a1 and Γ2 are k-decomposable, by induction. On the other hand, Γ\a is k-decomposable. Hence linkΓ\aa2=Γ1\a1⋅linkΓ2a2 is k-decomposable, by Theorem 3.5. Thus Γ1\a1 is k-decomposable, by induction.
Let b1∈F(starΓ1a1). Choose a facet b2∈F(starΓ2a2) and set b=b1+b2. Then b∈F(starΓa) and
[TABLE]
On the other hand, ⟨b⟩\(Γ\a)=a+⟨m⟩ where m(i)∈{0,∞}. Let a=a1+a2 and m=m1+m2 where ai,mi∈Γi. We conclude from (3) that ⟨b1⟩\(Γ1\a1)=a1+⟨m1⟩.
Let b1∈F(starΓ1a1) and c2∈F(Γ1\a1) with fpt(b1)⊆fpt(c1). Choose b2∈F(starΓ2a2) and c2∈F(Γ2\a2) with fpt(b2)⊆fpt(c2). Then there is c2′∈M(Γ2) such that c2⪯c2′. It follows that b1+b2∈F(starΓa) and c1+c2′∈F(Γ\a). Note that fpt(c2)=fpt(c2′). Therefore fpt(b1+b2)=fpt(c1+c2′). In particular, fpt(b1+b2)=fpt(c1+c2). It follows that fpt(b1)=fpt(c1). Therefore a1 is a shedding face of Γ1.
“If part”: Let Γ1 and Γ2 be k-decomposable with shedding faces a1 and a2, respectively, and let F(Γ2)⊂{0,∞}n. We claim that a1 is a shedding face of Γ.
By induction hypothesis, linkΓ(a1) and Γ\a1 are k-decomposable.
Let b=b1+b2∈F(starΓ(a1)) where bi∈Γi. Then
[TABLE]
is a Stanley set.
Let b=b1+b2∈F(starΓa1) and c=c1+c2∈F(Γ\a1) with bi,ci∈Γi. Suppose that fpt(b)⊆fpt(c). Then fpt(bi)⊆fpt(ci), for i=1,2. Since b2 and c2 are facets of Γ2 and, moreover, F(Γ2)⊂{0,∞}n, we have infpt(c2)=infpt(b2), by definition. Thus fpt(b2)=fpt(c2). On the other hand, by k-decomposability of Γ1, fpt(b1)=fpt(c1). Therefore fpt(b)=fpt(c), as desired.
∎
Now we come to the main result of this section.
Theorem 3.8**.**
Every k-decomposable multicomplex Γ is shellable. Also, every shellable multicomplex is k-decomposable for some k≥0.
Proof.
Let Γ be k-decomposable. If Γ has only one facet then we are done. Suppose that ∣F(Γ)∣>1. Let a∈Γ be a shedding face of Γ with ∣fpt∗(a)∣≤k+1 such that linkΓa and Γ\a are k-decomposable. By induction, linkΓ(a) and Γ\a are shellable. Let a1,…,at and at+1−a,…,ar−a be, respectively, shelling orders of Γ\a and linkΓa. It is easy to check that at+1,…,ar is a shelling order of starΓa. We claim that a1,…,ar is a shelling order of Γ.
We want to show that Si=⟨ai⟩\⟨a1,…,ai−1⟩ is a Stanley set, for al i. The case i≤t is clear. Suppose that i>t. Clearly,
[TABLE]
Because Γ is k-decomposable we have ⟨ai⟩\⟨a1,…,at⟩=a+⟨m⟩ where m∈{0,∞}n. Moreover, starΓ(a) is shellable and hence there exist a′∈Nn with ∣fpt∗(a′)∣≤k+1 and m′∈{0,∞}n such that
⟨ai⟩\⟨at+1,…,ai−1⟩=a′+⟨m′⟩.
It is clear that m=m′. Therefore ⟨ai⟩\⟨a1,…,ai−1⟩=a∨a′+⟨m⟩.
Let Si∗⊆Sj∗. If i,j≤t or t≤i,j then we are done, because starΓ(a) and Γ\a are shellable. Suppose that i≤t<j. Since infpt(aj)=infpt(Sj∗) and infpt(ai)=infpt(Si∗) we have fpt(aj)⊆fpt(ai). But fpt(aj)=fpt(ai), because aj∈F(starΓ(a)) and ai∈F(Γ\a). Consequently, infpt(aj)=infpt(ai) and so Si∗=Sj∗, as desired.
For the second part of theorem, suppose that Γ is shellable with the shelling a1,…,ar. If r=1 then Γ is k-decomposable for some k≥0. So assume that r>1. We proceed by induction on the number of facets of Γ. Since Sr=⟨ar⟩\⟨a1,…,ar−1⟩ is a Stanley set, so there exists a∈Nn and m∈{0,∞}n such that Sr=a+⟨m⟩. Let ∣fpt∗(a)∣≤k+1 for some k≥0. It is clear that starΓ(a)=⟨ar⟩ and Γ\a=⟨a1,…,ar−1⟩. By induction hypothesis, Γ\a is k′-decomposable for some k′≥0. Assume that k≥k′. If we show that a satisfies the condition (ii) of Definition 3.2 then we have shown that a is a shedding face of Γ.
Let i<r and fpt(ar)⊆fpt(ai). Then infpt(ai)⊆infpt(ar) and so Si∗⊆Sr∗. It follows that Si∗=Sr∗. This implies that fpt(ar)=fpt(ai), as the desired.
∎
For F⊂[n] define aF∈N∞n by aF(i)=∞ if i∈F and aF(i)=0, otherwise. Also, for a∈{0,∞}n set Fa={i∈[n]:a(i)=∞}. The next result shows that our definition of k-decomposability of multicomplexes
extends the concept of k-decomposability of simplicial complexes defined in [1, 11].
Proposition 3.9**.**
Let Δ be a simplicial complex with facets F1,…,Fr, and Γ be the multicomplex with the facets aF1,…,aFr. Then Δ is k-decomposable if and only if Γ is k-decomposable.
Proof.
“Only if part”: We use induction on the number of the facets of Δ. Let Δ be k-decomposable with shedding face σ∈Δ. We claim that eσ=∑i∈Fei is a shedding face of Γ where ei denotes the ith standard unit vector in Nn. Clearly, ∣fpt∗(eσ)∣≤k+1. Note that
[TABLE]
and
[TABLE]
By induction, linkΓeσ and Γ\eσ are k-decomposable.
Let aF∈F(starΓeσ). Then
[TABLE]
Therefore ⟨aF⟩\(Γ\eσ) is a Stanley set of degree eσ.
Consider b∈F(starΓeσ) and c∈F(Γ\eσ) with fpt(b)⊆fpt(c). If fpt(b)=fpt(c) then Fc⫋Fb and so there exists x∈σ such that x∈Fb\Fc. Particularly, Fb\x is a facet of starΔσ\σ and Δ\σ. This contradicts the assumption that σ is a shedding face of Δ. Therefore fpt(b)=fpt(c).
“If part”: If r=1 then we are done. Assume that r>1 and suppose that Γ is k-decomposable and a∈Nn is a shedding face of Γ with ∣fpt∗(a)∣≤k+1.
Set σ=fpt∗(a). Since linkΓeσ=linkΓa and Γ\eσ=Γ\a thus linkΓeσ and Γ\eσ are k-decomposable. Hence by induction hypothesis, linkΔσ and Δ\σ are k-decomposable. It remains to show that σ satisfies the exchange property. Let F be a facet of both starΔσ\σ and Δ\σ. Then there exists a facet G∈starΔσ and x∈σ such that F=G\x. Clearly, infpt(aF)⫋infpt(aG). It follows that fpt(aG)⫋fpt(aF). This is a contradiction, because aG∈F(starΓeσ) and aF∈F(Γ\eσ). Therefore σ is a shedding face of Δ.
∎
For the simplicial complexes
Δ1 and Δ2 defined on disjoint vertex sets, the join
of Δ1 and Δ2 is Δ1.Δ2={σ∪τ:σ∈Δ1,τ∈Δ2}.
Theorem 3.7 together with Proposition 3.9 now yields
Corollary 3.10**.**
Let Δ1 and Δ2 be simplicial complexes on disjoint vertex sets. Then Δ1 and Δ2 are k-decomposable if and only if Δ1⋅Δ2 is k-decomposable.
4. The main results
In this section we present the main results of the paper. For the proof of the first main theorem we need the following lemma whose proof is easy and we leave without proof.
Lemma 4.1**.**
Let Γ be a multicomplex and a∈Γ. Then
I(Γ\a)=I(Γ)+Sxa* and I(linkΓa)=I(Γ):xa.*
It follows that for a monomial ideal I and a monomial xa∈I we have
Γ(I:xa)=linkΓ(I)a* and Γ(I+Sxa)=Γ(I)\a.*
We are prepare to prove the first main result of this section which is an improvement of [5, Theorem 10.5.].
Theorem 4.2**.**
Let Γ be a multicomplex. Then Γ is k-decomposable if and only if I(Γ) is pretty k-clean.
Proof.
“Only if part”: Let F(Γ)={a1,…,ar}. If r=1, then I(Γ) is a prime ideal and so we have no thing to prove. So suppose that r>1. Let Γ be k-decomposable with shedding face a. It follows from induction hypothesis and Lemma 4.1 that I(Γ):xa and I(Γ)+Sxa are pretty k-clean.
Let P∈ass(I(linkΓa)) and Q∈ass(I(Γ\a)) with P⊆Q. Hence there exist b∈F(linkΓa) and c∈F(Γ\a) such that P=I(⟨b⟩) and Q=I(⟨c⟩) (see the proof of [5, Theorem 10.1]). Then fpt(b+a)⊆fpt(b)⊆fpt(c) where b+a is a facet of starΓa. By k-decomposability of Γ, we have fpt(b+a)=fpt(c). In particular, fpt(b)=fpt(c) and so P=Q. Therefore xa is a pretty cleaner of I(Γ), as desired.
“If part”: Let I(Γ) be pretty k-clean. If Γ has just one facet then we are done. Suppose that Γ has more than one facet. Then I(Γ) is not prime. Thus there exists a pretty cleaner monomial xa∈I(Γ) with ∣supp(xa)∣≤k+1 such that I(Γ):xa and I(Γ)+Sxa are pretty k-clean. It follows from Lemma 4.1 and induction hypothesis that linkΓa and Γ\a are k-decomposable.
Let b∈F(starΓa). We want to show that ⟨b⟩\(Γ\a) is a Stanley set. By the proof of Theorem 10.6 and the discussion at the end of Section 6 from [5], ⟨b⟩\(Γ\a) is a Stanley set if and only if I(Γ\a)/I(⟨Γ\a,b⟩) is a cyclic quotient. Therefore it is enough to show that I(Γ\a)/I(⟨Γ\a,b⟩) is a cyclic quotient. It is easy to check that ⟨Γ\a,b⟩ is k-decomposable with shedding face a and so by the only if part, I(⟨Γ\a,b⟩) is pretty k-clean. It follows from Theorem 2.6 that I(⟨Γ\a,b⟩) is pretty clean and so by [5, Theorem 10.5.], I(Γ\a)/I(⟨Γ\a,b⟩)≅S/P is a cyclic quotient where P=(xi:i∈fpt(b)), as desired.
Let b∈F(starΓa) and c∈F(Γ\a) with fpt(b)⊂fpt(c). Set
[TABLE]
Clearly, b′∈F(starΓa) and c′∈F(Γ\a) with fpt(b′)⊂fpt(c′). We have b′∨a−a∈F(linkΓa). Let P=I(⟨b′∨a−a⟩) and Q=I(⟨c′⟩). Then P∈ass(I(linkΓa)) and Q∈ass(I(Γ\a)). Since fpt(b′∨a−a)=fpt(b′)⊂fpt(c′), we have P⊆Q. It follows that P=Q and so fpt(b)=fpt(b′)=fpt(c′)=fpt(c).
Therefore a is a shedding face of Γ.
∎
Remark 4.3*.*
Note that Theorems 3.5 and 3.8 are, respectively, combinatorial translations of Theorems 2.8 and 2.6.
Remark 4.4*.*
Consider the simplicial complex
[TABLE]
on [6]. It was shown in [8] that Δ is shellable but not vertex-decomposable. It follows from Proposition 3.9 that the multicomplex Γ with F(Γ)={aF:F∈F(Δ)} is shellable but not [math]-decomposable. This means that a pretty k-clean ideal need not be pretty k′-clean for k>k′. To see more examples of shellable simplicial complexes which are not vertex-decomposable we refer the reader to [3, 6].
Let I⊂S be a monomial ideal. We denote by Γ and Γp the multicomplexes associated to I and Ip, respectively. Soleyman Jahan [9] showed that there is a bijection between the facets of Γ and the facets of Γp. We recall some notions of the construction of Γp from [9]. Let I⊂S be minimally generated by u1,…,ur and let D⊂[n] be the set of elements i∈[n] such that xi divides uj for at least one j=1,…,r. Then we set
[TABLE]
if i∈D and ti=1, otherwise. Moreover we set t=∑i=1nti. For every a∈F(Γ), the facet aˉ∈F(Γp) is defined as follows: if a(i)=∞ then set aˉ(ij)=∞ for all 1≤j≤ti, and if a(i)<ti then set
[TABLE]
It was shown in [9, Proposition 3.8.] that the map
[TABLE]
is a bijection.
Theorem 4.5**.**
Let Γ be the multicomplex associated to a monomial ideal I. Then Γ is k-decomposable if and only if Γp is k-decomposable.
Proof.
“Only if part”: If ∣F(Γ)∣=1 then we have no thing to prove. Assume that ∣F(Γ)∣>1. Hence there exists a shedding face a∈Γ such that linkΓa and Γ\a are k-decomposable. We define a′∈Γp as follows: if a(i)=0 then we set a′(ij)=0 for all 1≤j≤ti and if a(i)=0 then we set
[TABLE]
It is easy to check that
linkΓpa′=(linkΓa)p and Γp\a′=(Γ\a)p.
By induction hypothesis, linkΓpa′ and Γp\a′ are k-decomposable. Now we show that a′ is a shedding face of Γp.
Let bˉ∈F(starΓpa′). Then
[TABLE]
Let bˉ∈F(starΓpa′) and cˉ∈Γp\a′ such that fpt(bˉ)⊆fpt(cˉ). Hence cˉ⪯bˉ. Since both bˉ and cˉ are facets of Γp, we have bˉ=cˉ and, moreover, fpt(bˉ)=fpt(cˉ).
“If part”: Let Γp be k-decomposable with the shedding face a′∈Nt. Define a∈Nn by a(i)=∑j=1tia′(ij). In a similar argument to only if part, we can show that Γ is k-decomposable with the shedding face a.
∎
Let Γ⊂N∞n be a multicomplex with facets F(Γ)={a1,…,ar} where ai∈{0,∞}n. For all i, set Fi={xj:ai(j)=∞}. We call Δ=⟨F1,…,Fr⟩ the simplicial complex associated toΓ.
We come to the second main result of the paper which improves Theorem 3.10. of [9].
Corollary 4.6**.**
The monomial ideal I is pretty k-clean if and only if Ip is k-clean.
Proof.
I is pretty k-clean if and only if Γ(I) is k-decomposable (by Theorem 4.2) if and only if Γ(I)p is k-decomposable (by Theorem 4.5) if and only if the simplicial complex Δ associated to Γ(I)p is k-decomposable (by Proposition 3.9) if and only if IΔ=I(Γ(I)p)=Ip is k-clean (by Theorem 1.6).
∎
Combining Theorem 2.7 and Corollary 4.6 we immediately
obtain the following result which implies that the converse of Theorem 3.3 of [7] holds.
Corollary 4.7**.**
If I⊂S is a monomial ideal which has no embedded prime ideal. Then I is k-clean if and only if Ip is k-clean.
Corollary 4.8**.**
Let I⊂K[X] and J⊂K[Y] be two monomial ideals. Then I and J are pretty k-clean if and only if IJ is pretty k-clean.
Proof.
Let IΔ1=Ip and IΔ2=Jp for some disjoint simplicial complexes Δ1 and Δ2. I and J are pretty k-clean if and only if Ip and Jp are k-clean (by Corollary 4.6) if and only if Δ1 and Δ2 are k-decomposable (by Theorem 1.6) if and only if Δ1.Δ2 is k-decomposable (by Theorem 3.10) if and only if IΔ1.Δ2=IpJp=(IJ)p is k-clean (by Corollary 3.10) if and only if IJ is pretty k-clean (by Theorem 4.6).
∎
Bibliography11
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] L.J. Billera and J.S. Provan, Decompositions of simplicial complexes related to diameters of convex polyhedra , Math. Oper. Res. 5 , no. 4, 576-594 (1980).
2[2] A. Dress, A new algebraic criterion for shellability . Beitrage zur Alg. und Geom. 34 (1) 45-55 (1993).
3[3] M. Hachimori, Combinatorics of construtible complexes , Ph.D. thesis, Univ. of Tokyo, Tokyo, (2000).
4[4] J. Herzog, A Survey on Stanley Depth , In: Monomial Ideals, Computations and Applications, Volume 2083 of Lecture Notes in Mathematics, Springer, 2013.
5[5] J. Herzog, D. Popescu, Finite filtrations of modules and shellable multicomplexes . Manuscripta Math. 121 (2006), no. 3, 385 410.
6[6] S. Moriyama and F. Takeuchi, Incremental construction properties in dimension two: shellability, extendable shellability and vertex decomposability , Discrete Math. 263 , 295-296 (2003).
7[7] R. Rahmati-Asghar, k 𝑘 k -clean monomial ideals . ar Xiv:1702.07574 v 1.
8[8] R. S. Simon, Combinatorial properties of “cleanness” , J. Algebra, 167 (1994) 361-388.