First syzygy of Hibi rings associated with planar distributive lattices
Priya Das, Himadri Mukherjee
Abstract
Let L be a finite distributive lattice and S=K[xα:α∈L] be
a polynomial ring over a field K and I=⟨xαxβ−xα∨βxα∧β:α≁β,α,β∈L⟩ an ideal of S. In this article we describe
the first syzygy of the Hibi ring R[L]=S/I, for a planar distributive lattice L. We also
derive an exact formula for the first Betti number of a planar distributive lattice. We give a characterization of planar
distributive lattices for which the first syzygy is linear.
Keywords: Free resolution, Syzygy, Hibi rings, Gröbner basis
1 Introduction
Let L be a finite distributive lattice and let S=K[xα:α∈L] be a polynomial ring over a field
K. For α,β∈L,
f(α,β)=xαxβ−xα∨βxα∧β∈S is called a diamond relation
if α≁β. Let I=⟨f(α,β):α≁β,α,β∈L⟩⊂S
be the associated ideal, called a Hibi ideal. The associated ring R[L]=S/I is called a Hibi ring. In [8], Hibi
showed that R[L]
is an algebra with straightening laws on L over a field K and further in [5], Herzog-Hibi showed that
the diamond
relations f(α,β) are Gröbner basis for the lexicographic term order on S extending the order of L.
The ring appears in geometric context in Lakshmibai-Gonciulea [6] where it was proved that
the Schubert varieties in Gd,n degenerate flatly to the toric varieties
X(Id,n)(=Xd,n as in [6]) which are varieties associated to the lattices Id,n={(i1,…,id):1≤i1<…<id≤n}. Using the degeneration, several geometric properties for the
Schubert varieties were derived in [6], where the study of the singularities of X(Id,n) were discussed. The
question of singularity of the algebraic varieties associated to a lattice L, namely
SpecK[L] is dealt with in Wagner [12] and Lakshmibai-Mukherjee[11].
In a series of papers, as in Brown-Lakshmibai [3], [4], interesting multiplicity formulas and other
applications were found for several classes of distributive lattice.
Also Hibi in [8] proved that I is prime if and only if L is distributive and that R[L]
is Gorenstein when the set of join irreducible elements
J={z∈L:x∨y=z⇒x=z or y=z} is pure i.e. all maximal chains have the same length.
Furthermore, Hibi also showed in [8] that R[L] is a Cohen-Macaulay normal domain. Hibi rings over a finite
distributive lattice are
further studied by several authors, cf. Aramova-Herzog-Hibi [1], Thomas [7], Ene [9] and
Ene-Herzog-Saeedi-Madani [10], to mention but a few. The projective dimension and regularity of I was
found in Ene [9],
Ene-Herzog-Saeedi-Madani [10] respectively. It was also proved in Ene-Herzog-Saeedi-Madani [10] that, for a finite
distributive lattice, reg R[L]=∣P∣−rankP−1, where P is the poset of join irreducible elements of L. This, in
particular, implies that R[L] has a linear resolution if and only if P is a direct
sum of a chain and an isolated element, see Ene-Herzog-Saeedi-Madani [10]. Also in [2], the author gave an
explicit minimal
free resolution for monomial curves in AK4 using Gröbner basis technique.
In [13], the author found the first syzygies of determinantal ideals using Gröbner basis theory.
In this article we give a set of minimal generators for planar distributive lattice L. Using the generator we also
give a formula for the first Betti number for these lattices.
2 First syzygy of Hibi ring
Let f1,f2,…,fn be all the diamond relations in I. Let us denote F=⊕i=1nS(−2)
and g1,g2,…,gn be the generators of F,
ϕ:F⟶S, gi⟼fi, ker(ϕ) is the
first syzygy of R[L]. Let us denote ker(ϕ)=Syz1R[L] and Syz11R[L] denote linear
generators of the S-module Syz1R[L].
Let P={α,β,γ,δ} be a poset ≤ defined by α≤β,γ,δ, let the lattice of the poset
ideals of P be called a cube lattice.
Lemma 2.1**.**
L* is a planar distributive lattice if and only if every join irreducible (meet irreducible)
β∈L is covered (covers) by at most two join irreducibles (meet irreducibles) in L.*
Proof.
⇒: Let L be a planar distributive lattice and β∈L be a
join-irreducible element. Let us assume that it is covered by three join-irreducible elements x,y,z in L. Then
x∨y,x∨z,y∨z are non-comparable. Hence there will be a cube sublattice in L, which is
non-planar. Hence it follows.
⇐: Let every join-irreducible β in L covered by at most two join-irreducible in L, let this
propery be called (). Then
every sublattice of L also has the property (). Now if L is not planar then there exist a cube
sublattice in L, then this sublattice vialates the propery (*), as the cube has three join-irreducible elements
covering the minimal element which is a join-irreducible. Hence we arrive at a contradiction. By duality we get the result with
meet irreducibles.
∎
Lemma 2.2**.**
L* is a planar distributive lattice if and only if for all x,y,z∈L,x∨y∼x∨z and
x∧y∼x∧z.*
Proof.
⇒: Let L be a planar distributive lattice. Let x,y,z∈L, then
the sublattice generated by x∧y,x∧z,y∧z are also planar. If x∧y,x∧z,y∧z
are not comparable to each other then we will get three join-irreducibles covering minimal element. Therefore by Lemma 2.1
we will arrive at a contradiction. Hence x∧y∼x∧z and by duality other also holds.
⇐: Let the given conditions hold.
Then we have the cases (i)x∨y≤x∨z,x∧y≤x∧z(ii)x∨y≥x∨y,x∧y≤x∧z(iii)x∨y≥x∨y,x∧y≤x∧z. Then the only possibilities to get the sublattices as in Figures 2
,1, 4, 3, which are all planar sublattices. Hence L is planar.
∎
If we have two relations f(α1,β1)=xα1xβ1−xα1∨β1xα1∧β1 and f(α2,β2)=xα2xβ2−xα2∨β2xα2∧β2 coming from the diamonds (α1,β1) and (α2,β2) respectively. Then
with respect to monomial ordering >, we have in(f(α1,β1))=xα1xβ1,
in(f(α2,β2))=xα2xβ2. Then we have the following possibilities
-
α1=α2 or α1=β2 or β1=α2 or β1=β2.
2. 2.
α1,α2,β1,β2 all are different.
Without a loss of generality, let us suppose that α1=α2, for the case (1). Then we have
in(f(α1,β1))=xα1xβ1, in(f(α1,β2))=xα1xβ2 and therefore,
Lcm(f(α1,β1),f(α1,β2))=xα1xβ1xβ2. So,
[TABLE]
Then either β1∼β2, let us say β1≤β2 or β1≁β2. Also by Lemma 2.2, for
α1,β1,β2 we have α1∧β1∼α1∧β2 and
α1∨β1∼α1∨β2. Then we have the only possibilities
-
α1∧β1≤α1∧β2, α1∨β1≤α1∨β2.
2. 2.
α1∧β1≥α1∧β2, α1∨β1≤α1∨β2.
3. 3.
α1∧β1≤α1∧β2, α1∨β1≥α1∨β2.
Now we verify all the above cases
Case I: When β1∼β2.
Check for (1): We will get the following sublattice
Check for (2): We will get the following sublattice
Check for (3): We will get the following sublattice
Case I: When β1≁β2.
Check for (1): This subcase cannot consider since we will get β1≤β2, which will give a contradiction.
Check for (2): We will get the following sublattice
Check for (3): We will get the same sublattice like Figure 4 by replacing β1 and β2 by β2
and β1 respectively.
Now using the conditions of the cases (for which lattice exists), we prove that the following are the types of the
generators of the first syzygy of the Hibi ring. Let us denote
D2={(α,β):α≁β,α,β∈L}. Infact, D2=Hom(F2,L) non trivial homomorphism where F2=the free lattice generated by α and β in L.
Lemma 2.3**.**
(Strip-type)* Let (α1,β1),(α1,β2)∈D2, for every sublattice
isomorphic to Figure 2 with conditions α1∨β1=α1∨β2,α1∧β1=α1∧β2,β1≤β2,β1≤α1∨β2,β1≥α1∧β2,β2≁α1∨β1,β2≥α1∧β1 the following are the generators of the
first syzygy*
-
S1=−xβ2g(α1,β1)+xβ1g(α1,β2)−xα1∧β1g(β2,α1∨β1).
2. 2.
S2=xα1∨β2g(α1,β1)−xα1∨β1g(α1,β2)+xα1g(β2,α1∨β1).
Proof.
-
Let f(α1,β1),f(α1,β2) be the relations corresponding to
(α1,β1),(α1,β2) respectively such that
f(α1,β1)=xα1xβ1−xα1∨β1xα1∧β1,f(α1,β2)=xα1xβ2−xα1∨β2xα1∧β2.
Then with respect to monomial ordering
>, in(f(α1,β1))=xα1xβ1,
in(f(α1,β2))=xα1xβ2.
Lcm(f(α1,β1),f(α1,β2))=xα1xβ1xβ2.
[TABLE]
As β2≁α1∨β1. Hence −xβ2g(α1,β1)+xβ1g(α1,β2)−xα1∧β1g(β2,α1∨β1) is a generator of the first syzygy.
2. 2.
Let f(α1,β2),f(β2,α1∨β1) be the relations corresponding to (α1,β2),(β2,α1∨β1) respectively, therefore
f(α1,β2)=xα1xβ2−xα1∨β2xα1∧β2,f(β2,α1∨β1)=xβ2xα1∨β1−xα1∨β2xβ1.
Then with respect to monomial ordering
>, in(f(α1,β2))=xα1xβ2, in(f(β2,α1∨β1))=xβ2xα1∨β1. Lcm(f(α1,β1),f(β2,α1∨β1))=xα1xβ2xα1∨β1. Now,
[TABLE]
Hence, xα1∨β2g(α1,β1)−xα1∨β1g(α1,β2)+xα1g(β2,α1∨β1) is a generator of the first syzygy.
∎
Lemma 2.4**.**
(L-type)* Let (α1,β1),(α1,β2)∈D2, for every sublattice
isomorphic to Figure 1 with conditions α1∧β1=α1∧β2,α1∨β1=α1∨β2,β1≤β2,β1≤α1∨β2,β1≁α1∧β2,β2≁α1∨β1,β2≥α1∧β1 the
following is a generator of the first syzygy*
L=−xβ2g(α1,β1)+xβ1g(α1,β1)+xα1∨β2g(β1,α1∧β2)−xα1∧β1g(β2,α1∨β1).
Proof.
Let f(α1,β1),f(α1,β2) be the relations corresponding to
(α1,β1),(α1,β2) respectively such that
f(α1,β1)=xα1xβ1−xα1∨β1xα1∧β1,f(α1,β2)=xα1xβ2−xα1∨β2xα1∧β2.
Then with respect to monomial ordering
>, in(f(α1,β1))=xα1xβ1,
in(f(α1,β2))=xα1xβ2.
Lcm(f(α1,β1),f(α1,β2))=xα1xβ1xβ2.
[TABLE]
where the third equality follows as
β1∨(α1∧β2)=β2∧(α1∨β1). Hence
−xβ2g(α1,β1)+xβ1g(α1,β2)+xα1∨β2g(β1,α1∧β2)−xα1∧β1g(β2,α1∨β1) is a generator of the first syzygy.
∎
Lemma 2.5**.**
(Box-type)* Let (α1,β1),(α1,β2)∈D2, for every sublattice
isomorphic to Figure 4 with conditions α1∧β1=α1∧β2,α1∨β1=α1∨β2,β1≁β2,β1≤α1∨β2,β1≥α1∧β2,β2≁α1∨β1,β2≁α1∧β1 the
following are the generators of the first syzygy*
-
B1=−xβ2g(α1,β1)+xβ1g(α1,β2)−xα1∨β1g(β2,α1∧β1)−xα1∧β2g(α1∨β1,β1∨β2).
2. 2.
B2=−xβ1g(α1,β2)+xα1g(β1,β2)+xβ1∨β2g(α1,β1∧β2)+xα1∧β2g(α1∨β1),(β1∨β2).
Proof.
-
Let f(α1,β1),f(α1,β2) be the relations corresponding to
(α1,β1),(α1,β2) respectively such that
f(α1,β1)=xα1xβ1−xα1∨β1xα1∧β1,f(α1,β2)=xα1xβ2−xα1∨β2xα1∧β2.
Then with respect to monomial ordering
>, in(f(α1,β1))=xα1xβ1,
in(f(α1,β2))=xα1xβ2. Lcm(f(α1,β1),f(α1,β2))=xα1xβ1xβ2.
[TABLE]
Hence the lemma follows.
2. 2.
Let f(α1,β2),f(β1,β2) be the relations corresponding to (α1,β2),(β1,β2) respectively. Therefore, f(α1,β2)=xα1xβ2−xα1∨β2xα1∧β2 and f(β1,β2)=xβ1xβ2−xβ1∨β2xβ1∧β2. Then with respect to monomial ordering >, in(f(α1,β2))=xα1xβ2,
in(f(β1,β2))=xβ1xβ2. Lcm(f(α1,β2),f(β1,β2))=xα1xβ1xβ2. Now,
[TABLE]
Hence the lemma follows.
∎
Theorem 2.6** **(Main Theorem 1).
Syz11R[L] is generated by the types S1,S2,L,B1,B2.
Proof.
Let f(α1,β1)=xα1xβ1−xα1∨β1xα1∧β1,f(α2,β2)=xα2xβ2−xα2∨β2xα2∧β2
be the relation coming from the diamonds (α1,β1),(α2,β2) .
Therefore with respect to monomial ordering >,
in(f(α1,β1))=xα1xβ1, in(f(α2,β2))=xα2xβ2. Now we have that
the S-polynomial is found from the sublattices described in the Figures 3, 1, 4 and
we proved in all Lemmas
2.3, 2.4, 2.5, that these are the only linear generators of the first syzygy which is coming from the above
said figures. Hence the theorem follows.
∎
Lemma 2.7**.**
(Diamond-type)* Let (α1,β1),(α2,β2)∈D2, where α1,α2,β1,β2 all are distincts and f(α1,β1),f(α2,β2) be the relations of the pairs
(α1,β1),(α2,β2)
respectively. If there does not exist a,b∈L such that a∧b=β1,a∨b=β2 then
the following is a generator of first syzygy and we call it as a diamond type*
D=(xα2xβ2−xα2∨β2xα2∧β2)g(α1,β1)−(xα1xβ1−xα1∨β1xα1∧β1)g(α2,β2).
Proof.
Let f(α1,β1)=xα1xβ1−xα1∨β1xα1∧β1 and
f(α2,β2)=xα2xβ2−xα2∨β2xα2∧β2. Then
in(f(α1,β1))=xα1xβ1,
in(f(α2,β2))=xα2xβ2 and
Lcm(f(α1,β1),f(α2,β2))=xα1xα2xβ1xβ2. So,
[TABLE]
Hence (xα2xβ2−xα2∨β2xα2∧β2)g(α1,β1)−(xα1xβ1−xα1∨β1xα1∧β1)g(α2,β2) is a generator of the
syzygy.
∎
Let us denote the S-module Syz12R[L] be the set of all diamond type syzygies of R[L].
Theorem 2.8**.**
Syz1R[L]=Syz11R[L]⊕Syz12R[L].
Proof.
It follows from the Theorem 2.6 and Lemma 2.7.
∎
Theorem 2.9** **(Main Theorem 2).
Syz12R[L]=0, if for (α1,β1),(α2,β2)∈D2, where α1,α2,β1,β2 all
are distincts and α1,β1<α2,β2. If there exists a,b∈L such that a∧b=β1,a∨b=β2,α1,α2,a≁b,α2∧b≁α1∨β1, then the generator of the first syzygy from these two
diamonds is a combination of other types of the generators.
Proof.
The proof follows from the following Lemmas 2.10 and 2.11.
∎
Lemma 2.10**.**
With the same notation as Lemma 2.9, if a and b satisfy the given conditions then there exists
non-trivial x,y,z∈L such that the following (5) is a sublattice of L.
Proof.
In Figure 5, we have a∧b=β1 and a∨b=β2. Now we prove that
there exist x,y,z∈L such that the following claim holds.
-
Claim: there exist x such that x=α2∧b=α2∧β2∧b and β1<x<b.
Let α2∧b=x1,(α2∧β2)∧b=x. Now since x1∨β2=(α2∧b)∨β2=β2,x∨β2=((α2∧β2)∧b)∨β2=β2,x1∧β2=(α2∧b)∧β2=α2∧b,x∧β2=((α2∧β2)∧b)=α2∧b then it implies x=x1 and since we have x=(α2∧β2)∧b.
Let (α2∧β2)∧b=b. Then α2∧β2≥b. Since α1>a,β1>b, then
α1∧β1>a∨b=β2. Which is a contradiction. Hence it follows.
2. 2.
Claim: x≁α1∨β1,(α1∨β1)∧x=β1.
By the given conditions, we have x≁α1∨β1,(α1∨β1)∧x=(α1∧x)∨(β1∧x)=(α1∧β1)∨β1=β1.
3. 3.
Claim: a∨x=α2∧β2 and a∧x=β1.
a∨x=a∨[(α2∧β2)∧b]=(a∨b)∧[a∨(α2∧β2)]=β2∧(α2∧β2)=α2∧β2 and
a∧x=a∧[(α2∧β2)∧b]=β1∧(α2∧β2)=β1.
4. 4.
Claim: y∧b=x, where y=(α1∨β1)∨x.
[(α1∨β1)∨x]∧b=[(α1∨β1)∧b]∨(x∧b)=β1∨x=x.
5. 5.
Claim: a∨y=α2∧β2 and a∧y=α1∧β1.
a∨[(α1∨β1)∨x]=[a∨(α1∨β1)∨x=a∨x=α2∧β2.
and a∧[(α1∨β1)∨x]=(a∧x)∨[a∧(α1∨β1)]=β1∨(α1∨β1)=α1∨β1.
6. 6.
Claim: (α2∧β2)∧z=y and (α2∧β2)∨z=β2, where
z=(α1∨β1)∨b.
(α2∧β2)∧[(α1∨β1)∨b]=[(α2∧β2)∧(α1∨β1)]∨[(α2∧β2)∧b]=(α1∨β1)∨x=y
and (α2∧β2)∨[(α1∨β1)∨b]=(α2∧β2)∨(α1∨β1)=(α2∧β2)∨b=β2.
∎
Lemma 2.11**.**
In the following Figure 6, if f(2,3),f(11,12) be the relations coming from the
diamonds (2,3),(11,12) respectively. Then the diamond type arrising out of these two diamonds can be expressed as a
combination of L-shape syzygies.
Proof.
Let f(2,3)=x2x3−x1x4 and f(11,12)=x11x12−x9x13 be the relations coming
from the diamonds
(2,3) and (11,12) respectively. Then with respect to monomial ordering > we have
in(f(2,3))=x2x3 and in(f(11,12))=x11x12.
So Lcm(f(2,3),f(11,12))=x2x3x11x12.
S(f(2,3),f(11,12))=x11x12f(2,3)−x2x3f(11,12)=x2x3x9x13−x1x4x11x12=x9x13f1−x1x4f6. Therefore (x11x12−x9x13)g(2,3)−(x2x3−x1x4)g(11,12)
gives a element of the first syzygy.
Now this expression can be written as
(x11x12−x9x13)g(2,3)−(x2x3−x1x4)g(11,12)=x11(x12g(2,3)−x6g(2,8)+x2g(6,8)−x1g(6,10))−x13(x9g(2,3)−x6g(2,5)+x2g(5,6)−x1g(6,7))+x6(x13g(2,5)−x11g(2,8)+x2g(8,11)−x1g(10,11))+x2(x13g(5,6)−x11g(6,8)+x6g(8,11)−x3g(11,12))−x1(x13g(6,7)−x11g(6,10)+x6g(10,11)−x4g(11,12)) which shows that it is a combination of four
L-type elements.
Hence the lemma follows for this case.
∎
Remark: The Theorem 2.9, tells us when the first syzygy is linear.
3 First Betti number of planar distributive lattice
Let Cm+1 be the chain 1<2<…<m+1, G(m,n)=Cm+1×Cn+1 be the product lattice, we call G(m,n) an
m×n a grid lattice.
Let L be a planar distributive lattice and JM be the set of all join-meet irreducible elements of L.
Let D(θi,θj)=[θi∧θj,θi∨θj], the interval for θi≁θj,θi,θj∈JM.
One can write the lattice L as a union of these intervals. Let n(θ1,θ2) be the number of strip
type generator in D(θ1,θ2). Then we have the following
Lemma 3.1**.**
For θ1,θ2∈JM,
[TABLE]
where S(.,.) is the number of strip type generator from the grid lattice.
Proof.
Since the grid lattice formed by D(θ1,θ2) is the lattice
G(ht(θ1)−ht(θ1∧θ2),ht(θ2)−ht(θ1∧θ2)). Hence by the Lemma 4.3
it follows.
∎
Lemma 3.2**.**
For a planar distributive lattice L, the number of strip type generator of R[L], we denote it by
n(S) is the following
[TABLE]
Proof.
From the Figure 7 it follows.
∎
Let m(θ1,θ2) be the number of L-type generator in D(θ1,θ2). Then we have the following
Lemma 3.3**.**
For θ1,θ2∈JM,
[TABLE]
where L(.,.) denotes the number of L-shape generator from the grid lattice.
Proof.
This lemma is clearly follows from the Lemma 4.5.
∎
Lemma 3.4**.**
For a planar distributive lattice L, the number of L-type generator of R[L], we denote it by
n(L) is the following
[TABLE]
where r=ht(θi∨θj)−ht(θj),s=ht(θj)−ht(θj∧θk).
Proof.
The number of L-type for each D(θi,θj) is m(θi,θj). For each θi,θj,θk there is double counting m(r,s) where r=ht(θi∨θj)−ht(θj),s=ht(θj)−ht(θj∧θk). Also for each θi,θj,θk there is a L-type (see the dotted
line in the the Figure 8) and the number is (ht(θj∨θk)−ht(θi∨θj)(ht(θj∧θk)−ht(θi∧θj))(2r+1)(2s+1). Since for (θi,θj),(θj,θk),(θk,θl) thete is no L-type. Hence the lemma follows.
∎
Let B(θ1,θ2) be the number of box type in D(θ1,θ2) then we have the following:
Lemma 3.5**.**
For a planar distributive lattice L, the number of box type generator of R[L], n(B) is
given by
[TABLE]
Proof.
For each θi,θj the number of box types is B(θi,θj) and for each θi,θj,θk there is double countings B(θi∨(θj∧θk),θj) in numbers in their
intersections.
Hence the lemma follows.
∎
Definition: Let (α1,β1),(α2,β2)∈D2. Then we say these two diamonds are
comparable if α1≤α2,α1≤β2,β1≤α2,β1≤β2. If at least one
of these pairs is not comparable we say (α1,β1),(α2,β2) are non- comparable.
Lemma 3.6**.**
Let (α1,β1),(α2,β2)∈D2, the diamond type arrising out of these two diamonds is
expressed by strip, L, box types (infact only L-type) if only if
-
The diamonds are non-comparable or,
2. 2.
There exist a diamond (α3,β3)∈D2 such that there is a sublattice 9
Proof.
⇐: This follows from the Lemma 2.9.
⇒: Let there does not exist (α3,β3)∈D2 such that there is no sublattice 9 and
let (α1,β1),(α2,β2) are comparable, then we prove that (α1,β1),(α2,β2)
are not expressible. The element
(xα2xβ2−xα2∨β2xα2∧β2)g(α1,β1)−(xα1xβ1−xα1∨β1xα1∧β1)g(α2,β2) can be expressed
by other type of generators if there exist a diagram like Figure 10, by Lemma 2.9. Now we will show for
maximal sublattices this can not be express. Let either the diamond (a) or (b) is missing, let say (a) is missing.
Then xα2g(α1,β1) or xβ2g(α1,β1) is a term of a syzygy generator. But from the
figure we see that the coefficient of g(α1,β1) could only be the points which are bolded in the figure
and we see that xα2 or xβ2 is not there. Thus this element cannot be expressed as a combination of
other type of syzygy genrators. Similarly, we can show that if the diamond (b) is not there then the element cannot be
expressed in terms of other types of generators. Hence the lemma follows.
∎
Remark: This lemma will help us to find the number of diamond type generator for a planar distributive
lattice. Let
n(D) be the number of diamond type generators. Then we have the following formula for the first Betti number.
Theorem 3.7**.**
Let L be a planar distributive lattice such that the condition of the Lemma 3.6
holds. Then the first syzygy of the Hibi ring R[L] is linear.
Proof.
This theorem follows from the Lemma 3.6. Since any diamond type generator can be expressed
by other type of generators (linear).
∎
Theorem 3.8**.**
The first Betti number β1(L) of R[L] is
[TABLE]
Proof.
It follows from the Lemmas 3.2,3.4,3.5 and 3.6.
∎
Let k(L)=#{(θi,θj):θi≁θj,θi,θj∈JM}.
Theorem 3.9** **(Main Theorem 3).
With above notations we have the following
-
When k(L)=1, the first syzygy of R[L] is linear.
2. 2.
When k(L)=2,
- (a)
If the lattice is 11, then first syzygy is non linear.
2. (b)
Else if the lattice is 12 then first syzygy is linear if and only if ht(θ2∧θ3)−ht(θ1∧θ2)=1 or ht(θ2∨θ3)−ht(θ1∨θ2)=1, where θ1,θ2,θ3∈JM.
3. 3.
If k(L)≥3 then the first syzygy is non linear.
Proof.
-
Since k(L)=1 then it is always a grid lattice. By Lemma 3.6 it is linear.
-
-
(a)
If the lattice is 11, then the first syzygy have diamond type generators such as
(xθ3xθ4−xθ3∨θ4xθ3∧θ4)g(θ1,θ2)−(xθ1xθ2−xθ1∨θ2xθ1∧θ2)g(θ3,θ4) and it cannot be
expressed by other types of generators, by Lemma 3.6. Hence it is non linear.
- (b)
⇒: If the lattice is 12 and since first syzygy is linear then by Lemma 3.6 there is a
sublattice 9 and therefore ht(θ2∧θ3)−ht(θ1∧θ2)=1
or ht(θ2∨θ3)−ht(θ1∨θ2)=1, where θ1,θ2,θ3∈JM.
⇐: Let the condition holds then all diamond type elements of the first syzygy can be expressed by other types.
Hence the first syzygy is linear.
-
If k(L)≥3 then we have a figure like 13, then the first syzygy element coming from the
lower diamond and
upper diamond cannot be expressed by other type of syzygies. Hence diamond type elements will occur. Thus for this case the
first syzygy is not linear.
∎
4 Betti number of the Grid lattice
Theorem 4.1**.**
The first syzygy of Hibi ring for an m×n grid lattice is generated by strip type, L-type,
box type.
Proof.
We have the generators except strip type, L-type, box type and diamond type are coming from
non planer lattices. But by Theorem
2.9 we have that diamond type will not appear in the m×n grid lattice. Hence the theorem follows.
∎
Now we give an exact formula for the first Betti number of the Hibi ring R[L],
where L is an m×n grid distributive lattice.
Lemma 4.2**.**
Let T(n) be the number of strip type generators for R[L], where L is
a 1×n grid lattice. Then
T(n)=2(3n+1).
Proof.
So we have the lattice 1×n grid. We know that strip type generators from a
lattice coming from every two diamonds which have a common side. Therefore, we have the following
T(n)=2T(n−1)−T(n−2)+2(n−1)
So, clearly T(n)=2(3n+1).
∎
Now we find strip type generators for the m×n grid lattice.
Lemma 4.3**.**
For the m×n grid lattice the total number of strip type generators we denote it by
S(m,n) is the following
S(m,n)=(2m+1)T(n)+(2n+1)T(m),
where T(m) and T(n) are the number of srtip type generators for the
lattices 1×n and 1×m respectively.
Proof.
The strip type generators from m×n grid lattice is
(m+(m−1)+…+1)T(n)+(n+(n−1)+…+1)T(m)=(2m+1)T(m)+(2n+1)T(m).
∎
Now we find the number of L-type generators for the 2×n grid lattice and using this we will find the
number of L-type generators for m×n grid lattice.
Lemma 4.4**.**
Let L(2,n) be the number of L-type generators for 2×n grid lattice. Then
L(2,n)=3n(n2−1).
Proof.
We see that
[TABLE]
∎
Lemma 4.5**.**
The total number of L-type generators we denote it by L(m,n) for the m×n grid lattice
is the following
L(m,n)=2L(2,m)L(2,n).
Proof.
We see that the total number is
[TABLE]
∎
Lemma 4.6**.**
The total number of box type generators we denote it by B(m,n) for the m×n grid lattice
is the following
B(m,n)=2B(2,m)B(2,n).
Proof.
Since in a 2×2 grid lattice the number of box type is same as number of L-type generators, hence
the lemma follows.
∎
Lemma 4.7**.**
The Betti number β1 of R[L] for the m×n
grid lattice is the following
β1=S(m,n)+L(m,n)+B(m,n).
Proof.
As by above lemma, first syzygy is generated by L-type, box type and strip type, so the total betti number
is the sum of all numbers. Hence the lemma follows.
∎
Acknowledgement
The corresponding author thanks University Grants Commission(UGC) for financial support and Dept. of Mathematics of Bits-Pilani
Goa campus for hospitality.