This paper establishes conditions under which monomial ideals intersect transversally and provides a simplicial characterization of this intersection property.
Contribution
It introduces new criteria for transversal intersection of monomial ideals and offers a simplicial framework to understand this phenomenon.
Findings
01
Derived conditions for transversal intersection
02
Provided a simplicial characterization
03
Enhanced understanding of monomial ideal interactions
Abstract
In this paper we prove conditions for transversal intersection of monomial ideals and derive a simplicial characterization of this phenomenon.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Polynomial and algebraic computation · Algebraic structures and combinatorial models
Full text
Transversal Intersection of Monomial Ideals
Joydip Saha
and Indranath Sengupta
and Gaurab Tripathi
Discipline of Mathematics, IIT Gandhinagar, Palaj, Gandhinagar,
Gujarat 382355, INDIA.
The first author is a post-doctoral research fellow under the
research project EMR/2015/000776 sponsored by the SERB, Government of India.
The second author is the corresponding author, who is supported by the
research project EMR/2015/000776 sponsored by the SERB, Government of India.
1. Introduction
The transversal intersection phenomenon for monomial ideals
in the polynomial ring happens to be extremely interesting
and it turns out that it is equivalent to having disjoint
supports for their minimal generating sets; see Theorem
2.2. The Taylor complex which resolves (possibly
non-minimally) a monomial ideal has been understood completely
for ideals of the form I+J, when I and J are monomial
ideals intersecting transversally; see Theorem 3.2.
As an application of this theorem we prove in Corollary 3.3
that for two ideals I and J in R intersecting transversally,
the ideal I+J is resolved minimally by the complex M(I)⋅⊗M(J)⋅, if M(I)⋅ and M(J)⋅ denote minimal
free resolutions of I and J respectively. Minimal free resolutions
for ideals of the form I+J have an interesting structure when I
and J intersect transversally and are supported simplicially; see 4.3.
2. Monomial Ideals
Let R=K[x1,x2,⋯,xn], where xi’s are indeterminates over
the field K. Let Mon(R) denote the set of all monomials in R.
Every nonzero polynomial f∈R is a unique K-linear combination
of monomials given by f=∑v∈Mon(R)avv. Let
m(f):={v∈Mon(R)∣av=0}. An ideal
I in R is said to be a monomial ideal if it is
generated by monomials of R. We list down some standard facts on
monomial ideals.
Proposition 2.1**.**
(1)
I* is a monomial ideal if and only if f∈I⇒m(f)⊂I.*
2. (2)
Let {u1,⋯,um} be a monomial generating set of an
ideal I, where ui’s are monomials. A monomial v∈I if and only if
v=uiw, for some 1≤i≤m.
3. (3)
Each monomial ideal I has a unique minimal monomial set of generators G(I).
If T={m}, we simply write supp(m) instead of supp({m}).
If S and T are two nonempty subsets of Mon(R), then,
supp(S)∩supp(T)=∅ if and only if
supp(f)∩supp(g)=∅ for every f∈S and g∈T.
Definition 2**.**
We say that the ideals I and J of R intersect transversally
if I∩J=IJ.
Theorem 2.2**.**
Let I and J be two monomial ideals of R. Then, I∩J=IJ if and only if
\mboxsupp(G(I))∩\mboxsupp(G(J))=∅.
Proof.
Let I∩J=IJ. Consider the set
[TABLE]
If S=∅, then for every f∈G(I) and g∈G(J) we have
\mboxsupp(f)∩\mboxsupp(g)=∅, which proves that
\mboxsupp(G(I))∩\mboxsupp(G(J))=∅.
Suppose that S=∅. We define a partial order ≤ on S in the
following way: Given s,t∈S, we define s≤t if and only
s∣t. Let m be a minimal element (by Zorn’s lemma) of S; then there
exists f,g such that f∈G(I) and g∈G(J) such that \mboxlcm(f,g)=m.
Since \mboxlcm(f,g)∈I∩J and I∩J=IJ, we have \mboxlcm(f,g)=m∈IJ.
By Proposition 2.1, there exist h1∈G(I) and h2∈G(J),
such that h1h2∣m, since the generating set of IJ is the set
G(I)G(J)={uv∣u∈G(I),v∈G(J)}.
We prove that \mboxsupp(h1)∩\mboxsupp(h2)=∅. If this is not the case, then
\mboxlcm(h1,h2)=h1h2, in fact \mboxlcm(h1,h2)<h1h2 and
\mboxlcm(h1,h2)∣m; contradicting minimality of m in S.
We now prove that \mboxsupp(f)∩\mboxsupp(h2)=∅. We know that
h1h2∣\mboxlcm(f,g)=m. Therefore, if
\mboxsupp(f)∩\mboxsupp(h2)=∅, then h2∣g; which contradicts
minimality of the generating set G(J). Similarly we can prove that
\mboxsupp(g)∩\mboxsupp(h1)=∅. Now, h1h2∣m=\mboxlcm(f,g)
implies that h2∣m=\mboxlcm(f,g). Moreover, f∣\mboxlcm(f,g). Therefore,
\mboxlcm(f,h2)∣\mboxlcm(f,g). Similarly, \mboxlcm(g,h1)∣\mboxlcm(f,g). Now if
\mboxlcm(f,h2)<m or \mboxlcm(g,h1)<\mboxlcm(f,g)=m, then we
have a contradiction, since \mboxlcm(f,g) and \mboxlcm(g,h1) both are in the set S
and m is a minimal element in S. Therefore, we have must have
\mboxlcm(f,h2)=\mboxlcm(g,h1)=\mboxlcm(f,g)=m=h1h2w (say) and
gcd(f,h2)fh2=gcd(g,h1)gh1=h1h2w,
therefore gcd(f,h2)f=h1w. Hence, h1∣f and that
contradicts minimality of the generating set G(I). Hence,
S=∅ and we are done.
Conversely, let us assume that \mboxsupp(G(I))∩\mboxsupp(G(J))=∅.
Without loss of generality, we can assume that \mboxsupp(G(I))={1,2,…,k} and
\mboxsupp(G(J))={k+1,k+2,...,n}. Let f∈I∩J, such that
f=∑v∈Mon(R)avv. We have v∈I∩J for all v∈m(f).
It is therefore enough to show that if m is a monomial and
m∈I∩J, then m∈IJ. Let m∈I∩J; there exist
mI∈G(I) and mJ∈G(J) such that mI∣m and mJ∣m.
Let mIm1=m; then mJ∣m=mIm1. We know that
\mboxsupp(mI)∩\mboxsupp(mJ)=∅, therefore mJ∣m1
and it follows that m1=mJm2 and m=mImJm2. Therefore,
m∈IJ since mImJ∈IJ. ∎
Theorem 2.3**.**
Let I and J be two ideals of R such that w.r.t. some monomial order ⪯,
\mboxsupp(Lt(I))∩\mboxsupp(Lt(J))=∅. Then I and J intersect
transversally.
Proof.
Let GI and GJ be Gröbner bases with respect
to the monomial order ⪯ of the ideals I and J respectively. Again we assume
that f∈I∩J, then there exist polynomials p∈GI and
q∈GJ such that Lt(p)∣Lt(f) and
Lt(q)∣Lt(f). Since \mboxsupp(Lt(I))∩\mboxsupp(Lt(J))=∅,
we have Lt(p)⋅Lt(q)∣Lt(f). After division we write f=pq+r,
then r∈I∩J and Lt(r)⪯Lt(f). we can apply same process on r,
and after finite stage we get f∈IJ. ∎
3. The Taylor complex
We define the multidegree of a
monomial xa=x1a1x2a2⋯xnan to be the
n-tuple (a1,…,an), denoted by
mdeg(xa). Hence R=⊕m∈Mon(R)Km
has a direct sum decomposition as K-vector spaces Km, where Km={cm∣c∈K}.
Definition 3** (The Taylor complex).**
Let M be a monomial ideal of R minimally generated by the
monomials m1,m2,⋯,mp. The Taylor complex
for M is given by T(M)⋅ as follows: T(M)i is the
free R-module generated by ej1∧ej2∧⋯∧eji, for all 1≤j1<⋯<ji≤p, where
{e1,…,ep} is the standard basis for the free R-module Rp.
The differential
δ(M)⋅ is given by the following:
δ(M)i(ej1∧⋯∧eji)
[TABLE]
We define mdeg(ej1∧⋯∧eji)=\mboxmdeg(\mboxlcm(mj1⋯mji)). The Taylor complex
(T(M)⋅,δ(M)⋅) defined above is in deed a chain complex
of free R modules and gives a free resolution for the R-module R/M;
see section 26 in [2].
Theorem 3.1**.**
The Taylor complex (T(M)⋅,δ(M)⋅)
defined above is a free resolution (though not minimal) of the monomial ideal M;
called the Taylor resolution of M.
Let I and J be two monomial ideals of R intersecting transversally. Let
T(I)⋅ and T(J)⋅ be the Taylor resolutions
of I and J respectively. Then, the Taylor’s resolution of I+J is isomorphic
to the complex T(I)⋅⊗T(J)⋅ and hence
T(I)⋅⊗T(J)⋅ is acyclic.
Proof.
We know that T(I)i=R(ip) and T(J)j=R(jq), where p and q denote the minimal number of generators
of I and J respectively. Then,
[TABLE]
A basis of (T(I)⋅⊗T(J)⋅)r is given by (ek1∧⋯∧eki)⊗(ek1′′∧⋯∧ekj′′),
such that i+j=r and 1≤k1<k2<⋯<ki≤p and
1≤k1′<k2′<⋯<kj′≤q. Now for each r, the free
module (T(I)⋅⊗T(J)⋅)r can be graded with the help of mdeg as follows. We define
[TABLE]
This defines a multi-graded structure for the complex T(I)⋅⊗T(J)⋅.
Let G(I)={m1,m2⋯,mp} and G(J)={m1′,m2′⋯,mq′}
denote the minimal set of generators for I and J respectively. Then I+J is
minimally generated by G(I)∪G(J), by Theorem 2.2, since G(I)
and G(J) are of disjoint support. We will now show that the tensor product complex
T(I)⋅⊗T(J)⋅is isomorphic to the Taylor
resolution T(I+J)⋅. We define ψr:(T(I)⋅⊗T(J)⋅)r⟶(T(I+J)⋅)r as
[TABLE]
Moreover,
[TABLE]
since G(I) and G(J) are with disjoint supports. Hence, the map is a
graded isomorphism between the free modules (T(I)⋅⊗T(J)⋅)r and
(T(I+J)⋅)r.
We therefore have the following diagram of complexes:
We know that G(I) and G(J) have disjoint supports, therefore,
[TABLE]
Then
[TABLE]
and
[TABLE]
The last equality in the above expression follows from the fact that G(I) and G(J) have disjoint supports. Similarly, it can be proved that
[TABLE]
where
[TABLE]
Hence,
[TABLE]
We now introduce i+j new symbols ws, such that
ws=mks for s≤i and ws=mks−i′′ for s>i. We
also introduce another set of i+j symbols Es, such Es=eks
for s≤i and Es=eks−i′′ for s>i. Hence, the expression after
the last equality in (*) can be written in a compact form as
[TABLE]
Now
[TABLE]
Hence, the diagram is commutative.∎
Corollary 3.3**.**
Let I and J be ideals in R such that IJ=I∩J. Let
M(I)⋅ and M(J)⋅ denote minimal free resolutions
of I and J respectively. Then, M(I)⋅⊗M(J)⋅
is a minimal free resolution of the ideal I+J.
Proof.
The minimal free resolutions M(I)⋅ and M(J)⋅ are direct summands of the Taylor resolutions T(I)⋅ and T(J)⋅
respectively. It follows that (M(I)⋅⊗M(J)⋅) is a
direct summand of T(I)⋅⊗T(J)⋅=T(I+J)⋅. Hence, (M(I)⋅⊗M(J)⋅) is a free resolution of
I+J and it is minimal since M(I)⋅ and M(J)⋅ are both minimal.∎
4. A Simplicial characterization of transversal intersection of monomial ideals
We first introduce the basic definitions of a simplicial complex; see [1].
Definition 4**.**
A simplicial complexΔ on the vertex set {1,…,m} is
a collection of subsets called faces or simplices, satisfying the following condition:
σ∈Δ and τ⊂σ implies that τ∈Δ.
A simplex σ∈Δ of cardinality ∣σ∣=r+1 has dimension
r and it is called an r* face* of Δ.
Definition 5**.**
A facet is a maximal simplex of a simplicial complex Δ.
Let Γ(Δ) denote the set of all facets of Δ. Then, the
vertex set of Δ and the set Γ(Δ) determine Δ completely.
Definition 6**.**
A standard simplicial complex of dimension m−1 on the vertex set
{1,…,m} is the simplicial complex whose Γ(Δ)={{1,…,m}}.
Definition 7**.**
Let Δ1 and Δ2 be simplicial complexes on disjoint vertex sets.
Let the vertext set of Δ1 be {1,…,m} and that of
Δ2 be {m+1,…,m+p}. The join of simplicial complexesΔ1 and Δ2 is the simplicial complex
Δ1∗Δ2, whose vertex set is {1,…,m+p} and
[TABLE]
We now define a frame as a complex of K-vector spaces with a fixed basis, which encodes the minimal free resolution of a monomial ideal; see [2].
Definition 8**.**
An r−frame U⋅ is a complex of finite K vector spaces with
differential ∂ and a fixed basis satisfying the following:
(i)
Ui=0 for i<0;
2. (ii)
U0=K;
3. (iii)
U1=Kr, with basis {w1,…,wr};
4. (iv)
∂(wj)=1, for all j=1,…,r.
Construction of a frame of a simplicial complex. Let Δ be a simplicial complex on the vertex set {1,…,m}. For each integer i,
let Γi(Δ) be the set of all i dimensional faces of Δ
and let KΓi(Δ) denote the K-vector space generated by the
basis elements eσ, for σ∈Γi(Δ). The
chain complex of Δ over K is the complex
C(Δ)⋅,
[TABLE]
The boundary maps ∂i are defined as
[TABLE]
such that sign(j,σ)=(−1)t−1, where j is the t-th element of the set
σ⊂{1,…,m} written in increasing order. If i<−1 or
i>m−1, then KΓi(Δ)=0 and ∂i=0. We see that
the chain complex of a simplicial complex is an m-frame.
If Δ is a standard simplicial complex of dimension m−1
on the vertex set {1,…,m}, then
C(Δ)⋅ is acyclic and
KΓi(Δ)=K(im). Therefore,
the m-frame of a standard simplicial complex of
dimension m−1 is nothing but the Koszul complex.
Definition 9**.**
Let M={m1,m2,⋯,mr} be a set of monomials in R.
An M−complex G⋅ is a multigraded complex of
finitely generated free multigraded R modules with
differential Δ and a fixed multihomogeneous
basis with multidegrees that satisfy
(i)
Gi=0 for i<0;
2. (ii)
G0=R;
3. (iii)
G1=R(m1)⊕⋯⊕R(mr);
4. (iv)
Δ(wj)=mj for each basis vector wj∈G1.
Construction. Let U⋅ be an
r−frame and M={m1,m2,⋯,mr} be a set of monomials
in R. The M−homogenization of U⋅
is defined to be the complex G⋅ with
G0=R and G1=R(m1)⊕⋯⊕R(mr).
Let v1ˉ,⋯,vpˉ and u1ˉ,⋯,uqˉ
be the given bases of Ui and Ui−1
respectively. Let u1,u2,⋯,uq be the basis of
Gi−1 chosen in the previous step of induction.
We take v1,⋯,vp to be a basis of Gi.
If
[TABLE]
with coefficients αsj∈k, then set
mdeg(vj)=\mboxlcm(mdeg(us)∣αsj=0),
where \mboxlcm(∅)=1. We define
[TABLE]
Definition 10**.**
Let I⊂R be a monomial ideal with G(I)={m1,…,mr}. We say that a minimal free resolution of I is supported by a simplicial complex
Δ on the vertex set {1,…,r} if it is isomorphic to the G(I) homogenization of the chain complex C(Δ)⋅ of Δ.
Lemma 4.1**.**
Let I and J be two monomial ideals such that I∩J=IJ, ∣G(I)∣=r and ∣G(J)∣=s, and whose minimal free resolutions are supported by standard simplicial complexes ΔI and ΔJ on the vertex sets {1,…,r} and {r+1,…,r+s} respectively. Then minimal free resolution of I+J is supported by the standard simplicial complex ΔI∗ΔJ.
Proof.
We have seen that if Δ is a standard simplicial complex of
dimension m−1 on the vertex set {1,…,m}, then the
m-frame of Δ is nothing but the Koszul complex. Therefore, it follows that
if a minimal free resolution M(I)⋅ of I
is supported by the standard simplicial complex ΔI, then the it is actually isomorphic to
the Taylor complex T(I)⋅. Since I∩J=IJ, by the Theorem 2.2 we have G(I)∩G(J)=∅, then ∣G(I)∪G(J)∣=r+s. Again ΔI∗ΔJ is also standard simplicial complex of dimension r+s−1. Therefore G(I)∪G(J)-homogenization of C(ΔI∗ΔJ)⋅ is isomorphic to the Taylor complex T(I+J)⋅. Thus by Theorem 3.2, we have
[TABLE]
Again by the Corollary 3.3, M(I)⋅⊗M(J)⋅ is minimal free resolution of I+J.
Therefore minimal free resolution of I+J is supported by the standard simplicial complex ΔI∗ΔJ∎
Lemma 4.2**.**
Let ΔI be a simplicial complex on vertex {1,…,r} and ΔJ be another simplicial complex on vertex {r+1,…,r+s},i.e., the vertex sets of
ΔI and ΔJ are disjoint. Then
[TABLE]
Proof.
Let Γ(ΔI)={γ1,…,γl1} and
Γ(ΔJ)={σ1,…,σl2}. We have
Γ(ΔI∗ΔJ)={γi∪σj∣1≤i≤l1,1≤j≤l2}. Now assuming (ts)=0 for s<t, we have
∣Γp(ΔI)∣=∑i=1l1(p∣γi∣), for all 1≤p≤l1 and ∣Γq(ΔJ)∣=∑j=1l2(q∣σj∣) for all 1≤q≤l2. On the other hand,
∣Γt(ΔI∗ΔJ)∣=∑j=1l2∑i=1l1(t∣γi∪σj∣)=∑j=1l2∑i=1l1(t∣γi∣+∣σj∣)=∑p+q=t∑j=1l2∑i=1l1(p∣γi∣)(q∣σj∣). Therefore the map
[TABLE]
defined by
[TABLE]
is an isomorphism, where γ∈ΔI,∣γ∣=p and σ∈ΔJ,∣γ∣=q and p+q=t. We therefore have to show the following
diagram commutes
Let γ∈ΔI,∣γ∣=p and σ∈ΔJ,∣γ∣=q
such that p+q=t. Then,
[TABLE]
Theorem 4.3**.**
Let I and J be two monomial ideals such that I∩J=IJ, ∣G(I)∣=r and ∣G(J)∣=s, and their minimal free resolutions are supported by the simplicial complexes ΔI and ΔJ on the vertex sets {1,…,r} and {r+1,…,r+s} respectively. Then minimal free resolution of I+J is supported by the simplicial complex ΔI∗ΔJ.
Proof.
We have I∩J=IJ, therefore \mboxsupp(G(I))∩\mboxsupp(G(J))=∅,
by Theorem 2.2. Again, by Lemma 4.2,
[TABLE]
Since M(I)⋅ is the G(I)-homogenization of the complex
C(ΔI)⋅ and M(J)⋅ is the G(J)-homogenization of the complex C(ΔJ)⋅, we can
proceed in the same way as lemma 4.2 to prove that M(I)⋅⊗M(J)⋅ is the G(I)∪G(J)–homogenization of the complex C(ΔI∗ΔJ)⋅. Again by the Corollary 3.3, M(I)⋅⊗M(J)⋅ is minimal free resolution of I+J.
Therefore, minimal free resolution of I+J is supported by the simplicial complex
ΔI∗ΔJ. ∎
Funding Sources
This research is supported by the research project EMR/2015/000776
sponsored by the SERB, Government of India.
Bibliography2
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] E. Miller, B. Sturmfels, Combinatorial Commutative Algebra , Springer, GTM 227, 2005.
2[2] I. Peeva, Graded Syzygies , Springer-Verlag London Limited, 2011.