On the canonical ideal of the Ehrhart ring of the chain polytope of a poset
Mitsuhiro MIYAZAKI
(Department of Mathematics, Kyoto University of Education,
1 Fujinomori, Fukakusa, Fushimi-ku, Kyoto, 612-8522, Japan)
Abstract
Let P be a poset, O(P) the order polytope of P and
C(P) the chain polytope of P.
In this paper, we study the canonical ideal of the Ehrhart ring K[C(P)] of
C(P) over a field K and characterize the level
(resp. anticanonical level) property of K[C(P)] by a combinatorial structure of P.
In particular, we show that if K[C(P)] is level (resp. anticanonical level),
then so is K[O(P)].
We exhibit examples which show the converse does not hold.
Moreover, we show that the symbolic powers of the canonical ideal of K[C(P)]
are identical with ordinary ones and degrees of the generators of the canonical
and anticanonical ideals are consecutive integers.
Key Words:chain polytope, order polytope, Ehrhart ring, level ring
MSC:52B20, 13H10, 13F50, 06A11, 06A07
1 Introduction
Let P be a finite partially ordered set (poset for short).
Stanley [Sta3] investigated two convex polytopes associated with P, the order polytope
O(P) and the chain polytope C(P).
He showed a surprising connection between O(P) and C(P).
For example
the Ehrhart rings
K[O(P)] and K[C(P)]
of O(P) and C(P)
have the same Hilbert series.
About the same time, Hibi [Hib] constructed and studied the ring RK[H], where H is
a finite distributive lattice, which nowadays called the Hibi ring, in the study
of algebras with straightening law (ASL).
It turned out that RK[H] is identical with the Ehrhart ring K[O(P)] of the order
polytope O(P),
where P is the set of join-irreducible elements of H.
After that, Hibi rings, i.e., the ring of the form K[O(P)] for some poset P,
are extensively studied by many researchers, including the present author.
In our previous papers, we studied many aspects of Hibi rings, especially described generators
of the canonical ideals of Hibi rings and characterized level and anticanonical level properties
of Hibi rings [Miy1, Miy2].
The key notion to investigate the generators of the canonical ideal of a Hibi ring is
“sequence with condition N” (see below).
In this paper, we investigate the canonical ideal of the Ehrhart ring K[C(P)] of the chain
polytope C(P) of a poset P.
The key notion in this case is “sequence with condition N’ ”.
Let y0, x1, y1, x2, …, yt−1, xt be a sequence of elements
of P.
We say that y0, x1, y1, x2, …, yt−1, xt satisfy condition N (resp. condition N’) if
- (1)
y0>x1<y1>x2<⋯<yt−1>xt** and**
2. (2)
if i≤j−2, then yi≥xj
(resp. yi>xj).
We define that an empty sequence (i.e., t=0) satisfy condition N (resp. condition N’).
In the case of Hibi rings, i.e., the case of K[O(P)],
a Laurent monomial associated to a map ν:P−→Z is a generator of the
canonical (resp. anticanonical) ideal if and only if there is a sequence with condition N with an appropriate
relation with ν,
where P−=P∪{−∞}.
Moreover, the symbolic powers of the canonical ideal are identical with the ordinary ones
and the degrees of the generators of the canonical and anticanonical ideals are consecutive
integers, i.e., if there are generators of the canonical (resp. anticanonical) ideal of
degrees d1 and d2 with d1<d2, then for any integer d with d1<d<d2,
there is a generator of the canonical (resp. anticanonical) ideal with degree d.
Further, K[O(P)] is level (resp. anticanonical level) if and only if
“q(1)-reduced” (resp. “q(−1)-reduced”) sequence with condition N is the empty sequence only.
See Definition 4.7 for the definition of the notion q(1)-reduced (resp. q(−1)-reduced).
In this paper, we show that the almost identical phenomena occur for K[C(P)].
A Laurent monomial associated to a map ξ:P−→Z is a generator
of the canonical (resp. anticanonical) ideal if and only if there is a sequence with condition N’ with
an appropriate relation
with ξ
(which is different from the one in the case of K[O(P)], see Proposition 4.10).
Moreover, the symbolic powers of the canonical ideal are identical with the ordinary
ones (Theorem 3.8)
and the generators of the canonical and anticanonical ideals are consecutive
integers (Theorem 5.4).
Further, K[C(P)] is level (resp. anticanonical level) if and only if
q(1)-reduced (resp. q(−1)-reduced) sequence with condition N’ is the empty sequence only (Theorem 4.17).
Since condition N’ is weaker than condition N, it follows that if K[C(P)] is level (resp. anticanonical level), then so is K[O(P)].
We also exhibit examples which show that the converse does not hold.
See Examples 4.19 and 4.20.
2 Preliminaries
In this paper, all rings and algebras are assumed to
be commutative
with identity element
unless stated otherwise.
First we state notations about sets used in this paper.
We denote by N the set of nonnegative integers, by
Z the set of integers, by
Q the set of rational numbers and by
R the set of real numbers.
We denote the cardinality of a set X by #X.
For nonempty sets X and Y, we denote the set of maps from X to Y by YX.
If X is a finite set, we identify RX with the Euclidean space
R#X.
Let X be a set and A a subset of X.
We define the characteristic function χA∈RX by
χA(x)=1 for x∈A and χA(x)=0 for x∈X∖A.
Now we define a symbol which is frequently used in this paper.
Definition 2.1
Let X be a finite set and ξ∈RX.
For B⊂X, we set ξ+(B):=∑b∈Bξ(b).
Next we define operations of elements in RX.
Definition 2.2
Let X be a set.
For ξ, ξ′∈RX and a∈R,
we define
maps ξ±ξ′ and aξ
by
(ξ±ξ′)(x)=ξ(x)±ξ′(x) and
(aξ)(x)=a(ξ(x))
for x∈X.
Note that if X is a finite set, B is a subset of X and a∈R, then
(ξ±ξ′)+(B)=ξ+(B)±(ξ′)+(B)
and (aξ)+(B)=a(ξ+(B)).
We denote f∈RX with f(x)=0 for any x∈X by 0.
Next we recall some definitions concerning finite partially
ordered sets (poset for short).
Let Q be a finite poset.
We denote the set of maximal (resp. minimal) elements of Q
by maxQ (resp. minQ).
If maxQ (resp. minQ) consists of one element z, we often
abuse notation and write z=maxQ (resp. z=minQ).
A chain in Q is a totally ordered subset of Q.
For a chain X in Q, we define the length of X as #X−1.
The maximum length of chains in Q is called the rank of Q and denoted rankQ.
A subset A of Q is an antichain in Q if every pair of two elements in A
are incomparable by the order of Q.
If I⊂Q and
x∈I, y∈Q, y≤x⇒y∈I,
then we say that I is a poset ideal of Q.
Let +∞ (resp. −∞) be a new element which is not contained in Q.
We define a new poset Q+ (resp. Q−) whose base set is Q∪{+∞}
(resp. Q∪{−∞}) and
x<y in Q+ (resp. Q−) if and only if x, y∈Q and x<y in Q
or x∈Q and y=+∞
(resp. x=−∞ and y∈Q).
We set Q±:=(Q+)−.
Let Q′ be an arbitrary poset. (We apply the following definition for
Q′=Q, Q+, Q− or Q±.)
If x, y∈Q′, x<y and there is no z∈Q′ with x<z<y,
we say that y covers x and denote
x<⋅y or y⋅>x.
For x, y∈Q′ with x≤y, we set
[x,y]Q′:={z∈Q′∣x≤z≤y}.
Further, for x, y∈Q′ with x<y, we set
[x,y)Q′:={z∈Q′∣x≤z<y},
(x,y]Q′:={z∈Q′∣x<z≤y} and
(x,y)Q′:={z∈Q′∣x<z<y}.
We denote [x,y]Q′
(resp. [x,y)Q′, (x,y]Q′ or (x,y)Q′)
as [x,y]
(resp. [x,y), (x,y] or (x,y))
if there is no fear of confusion.
Definition 2.3
Let Q′ be an arbitrary finite poset and
let x and y be elements of Q′ with x≤y.
A saturated chain from x to y is a sequence of elements
z0, z1, …, zt of Q′ such that
[TABLE]
Note that the length of the chain z0, z1, …, zt is t.
Definition 2.4
Let Q′, x and y be as above.
We define
dist(x,y):=min{t∣ there is a saturated chain from x to y
with length t.}
and call dist(x,y) the distance of x and y.
Further, for n∈Z, we define
q(n)dist(x,y):=max{nt∣
there is a saturated chain from x to y
with length t.}
and call q(n)dist(x,y) the n-th quasi-distance of x and y.
Note that q(−1)dist(x,y)=−dist(x,y) and
q(1)dist(x,y)=rank([x,y]).
Note also that q(n)dist(x,z)+q(n)dist(z,y)≤q(n)dist(x,y)
for any x, z, y with x≤z≤y.
Further, q(n)dist(x,y)=n if x<⋅y,
q(n)dist(x,x)=0 and q(mn)dist(x,y)=mq(n)dist(x,y) for any positive integer m.
Now we state the following.
Definition 2.5
Let Q be a finite poset and ξ∈RQ.
For z∈Q, we set
ξ+↑(z):=max{∑ℓ=0sξ(zℓ)∣
there exist elements z0, z1, …, zs with
z=z0<⋅z1<⋅⋯<⋅zs<⋅+∞ in Q+}.
(resp. ξ+′↑(z):=max{∑ℓ=1sξ(zℓ)∣
there exist elements z0, z1, …, zs with
z=z0<⋅z1<⋅⋯<⋅zs<⋅+∞ in Q+},
where we define the empty sum to be 0).
Similarly, we set
ξ+↓(z):=max{∑ℓ=0sξ(zℓ)∣
there exist elements z0, z1, …, zs with
z=z0⋅>z1⋅>⋯⋅>zs⋅>−∞ in Q−}
(resp. ξ+′↓(z):=max{∑ℓ=1sξ(zℓ)∣
there exist elements z0, z1, …, zs with
z=z0⋅>z1⋅>⋯⋅>zs⋅>−∞ in Q−}).
It is clear from the definition that
ξ+↑(z)=ξ(z)+ξ+′↑(z),
ξ+↓(z)=ξ(z)+ξ+′↓(z) and
ξ+↑(z)+ξ+′↓(z)=ξ+′↑(z)+ξ+↓(z)=max{ξ+(C)∣C is a maximal chain in Q with C∋z}.
Note that ξ1+↑(z)+ξ2+↑(z)=(ξ1+ξ2)+↑(z)
does not hold in general.
The following
lemma is easily proved.
Lemma 2.6
Let Q be a finite poset and ξ∈RQ.
- (1)
Suppose that z∈Q, z=z0<⋅z1<⋅⋯<⋅zs<⋅+∞ in Q+
and
ξ+↑(z)=∑ℓ=0sξ(zℓ)
(resp. z=z0⋅>z1⋅>⋯⋅>zs⋅>−∞ in Q−
and
ξ+↓(z)=∑ℓ=0sξ(zℓ)).
Then for any k with 0≤k≤s,
ξ+↑(zk)=∑ℓ=ksξ(zℓ) and ξ+′↑(zk)=∑ℓ=k+1sξ(zℓ)
(resp. ξ+↓(zk)=∑ℓ=ksξ(zℓ) and ξ+′↓(zk)=∑ℓ=k+1sξ(zℓ)).
2. (2)
Let z∈Q∖maxQ (resp. z∈Q∖minQ).
Then ξ+′↑(z)=max{ξ+↑(z′)∣z′⋅>z}
(resp. ξ+′↓(z)=max{ξ+↓(z′)∣z′<⋅z}).
3. (3)
Suppose that w1, w2∈Q, w1<w2 and
w1=z0<⋅z1<⋅⋯<⋅zs=w2.
Then
ξ+′↑(w1)≥∑ℓ=1s−1ξ(zℓ)+ξ+↑(w2)
and
ξ+′↓(w2)≥∑ℓ=1s−1ξ(zℓ)+ξ+↓(w1).
Moreover, we see the following fact.
Lemma 2.7
Let Q be a finite poset,
z∈Q and n an integer.
Set M:=max{ξ+(C)∣C is a maximal chain in Q}.
Then
[TABLE]
Further, if x, y∈Q, x<y and ξ(w)≥n for any w∈(x,y), then
[TABLE]
The first assertion is clear from the fact that
ξ+↑(z)+ξ+′↓(z)=max{ξ+(C′)∣C′
is a maximal chain in Q and C′∋z}.
In order to prove the other assertions, take elements
[TABLE]
of Q such that
−∞<⋅z1<⋅⋯<⋅zs=x=z0′<⋅⋯<⋅zs′′=y=z1′′<⋅⋯<⋅zs′′′′<⋅+∞ in Q±,
ξ+↓(x)=∑ℓ=1sξ(zℓ),
q(n)dist(x,y)=s′n and
ξ+↑(y)=∑ℓ=1s′′ξ(zℓ′′),
Then, since
z1,…,zs,z1′,…,zs′−1′,z1′′,…,zs′′′′
is a maximal chain in Q and ξ(zℓ′)≥n for 1≤ℓ≤s′−1,
we see that
[TABLE]
Further,
[TABLE]
and
[TABLE]
**by Lemma 2.6 (3).
**
Next we fix notation about Ehrhart rings.
Let X be a finite set with −∞∈X
and P a rational convex polytope in RX, i.e.,
a convex polytope whose vertices are contained in QX.
Set X−:=X∪{−∞} and let {Tx}x∈X− be
a family of indeterminates indexed by X−.
For f∈ZX−,
we define the Laurent monomial Tf by
Tf:=∏x∈X−Txf(x).
We set degTx=0 for x∈X and degT−∞=1.
Then the Ehrhart ring of P over a field K is the N-graded subring
[TABLE]
of the Laurent polynomial ring K[Tx±1∣x∈X][T−∞].
We denote the Ehrhart ring of P over K by EK[P].
(We use −∞ as the degree indicating element in order to be consistent with the
case of Hibi ring.)
If EK[P] is a standard graded algebra, i.e., generated as a K-algebra by degree 1
elements, we denote EK[P] as K[P].
Note that EK[P] is Noetherian since P is rational.
Therefore normal by the criterion of Hochster [Hoc].
Further,
by the description of the canonical module of a normal affine semigroup ring
by Stanley [Sta2, p. 82], we see that the ideal
[TABLE]
of EK[P] is the canonical module of EK[P],
where relintP denotes the interior of P in the affine span of P.
We call this ideal the canonical ideal of EK[P].
Now we recall the definitions of order and chain polytopes [Sta3].
Let P be a finite poset.
The order polytope O(P) and the chain polytope C(P) are defined as
follows.
O(P):={f∈RP∣0≤f(x)≤1 for any x∈P and
if x<y in P, then f(x)≥f(y)},
C(P):={f∈RP∣0≤f(x) for any x∈P and
f+(C)≤1 for any chain in P}.
The Ehrhart ring K[O(P)] of the order polytope of P is identical with
the ring considered by Hibi [Hib], which is nowadays called the Hibi ring.
We studied in our previous papers [Miy1, Miy2] the canonical ideals of Hibi rings.
The main object of the study of this paper is EK[C(P)] and its canonical ideal.
We denote the canonical ideal of EK[C(P)] as ω.
In order to study EK[C(P)], we first collect some basic facts on EK[C(P)].
First, the vertices of C(P) are of the form χA, where A is an antichain
of P (including the empty set).
Further, it is easily seen that
C(P)={f∈RP∣f(x)≥0 for any x∈P and f+(C)≤1 for any
maximal chain in P}.
Thus, relintC(P)={f∈RP∣f(x)>0 for any x∈P and
f+(C)<1 for any maximal chain in P}.
Here, we define the following notation.
Definition 2.8
For n∈Z, we set
S(n)(P):={ξ∈ZP−∣ξ(x)≥n
for any x∈P and
ξ(−∞)≥ξ+(C)+n
for any
maximal chain C in P}.
In the following, we fix a finite poset P and abbreviate S(n)(P) as S(n)
and apply the above definitions by setting Q=P, P+, P− or P±.
By the above consideration, we can describe EK[C(P)] and ω by using
this notation.
[TABLE]
Finally in this section, we note
the following fact which seems to be a folklore.
Proposition 2.9
EK[C(P)]* is a standard graded K-algebra.*
It is enough to show that if ξ∈S(0) and ξ(−∞)≥2,
then there are ξ1, ξ2∈S(0) such that ξ1(−∞)=1 and
ξ1+ξ2=ξ.
If ξ(x)=0 for any x∈P, it is enough to set ξ1(x)=ξ2(x)=0,
for any x∈P, ξ1(−∞)=1 and ξ2(−∞)=ξ(−∞)−1.
Suppose that ξ(x)>0 for some x∈P.
Set A:=max{x∈P∣ξ(x)>0}∪{−∞},
ξ1:=χA and ξ2:=ξ−ξ1.
First it is clear from the definition that ξ1(−∞)=1 and
ξ=ξ1+ξ2.
Let x be an arbitrary element of P.
If x∈A, then ξ(x)>0 and ξ1(x)=1.
Thus, ξ2(x)≥0.
If x∈A. then ξ1(x)=0 and ξ(x)≥0.
Thus, ξ2(x)≥0.
Now let C be an arbitrary maximal chain in P.
We have to show that ξ1+(C)≤ξ1(−∞) and
ξ2+(C)≤ξ2(−∞).
If C∩A=∅, then there is a unique element x∈C∩A.
Therefore, ξ1+(C)=1=ξ1(−∞) and
ξ2+(C)=ξ+(C)−1≤ξ(−∞)−1=ξ2(−∞).
Suppose that C∩A=∅.
If ξ(c)=0 for any c∈C, ξ1+(C)=ξ+(C)=0.
Thus, ξ1+(C)≤1=ξ1(−∞) and
ξ2+(C)=ξ+(C)=0≤ξ2(−∞).
Assume that ξ(c)>0 for some c∈C.
Set x:=max{c∈C∣ξ(c)>0}.
Since x∈A, there exists y∈A with y>x.
Take a saturated chain x=z0<⋅⋯<⋅zs=y
and y=z0′<⋅⋯<⋅zs′′<⋅+∞.
Then
C′:=(C∩(−∞,x])∪{z1,…,zs,z1′,…,zs′′}
is a maximal chain in P.
Further, ξ+(C′)>ξ+(C) since ξ(c)=0 for any c∈C with c>x and
C′∋zs=y∈A.
Therefore, ξ+(C)≤ξ+(C′)−1≤ξ(−∞)−1.
Since C∩A=∅, ξ1+(C)=χA+(C)=0≤1=ξ1(−∞)
and
ξ2+(C)=ξ+(C)−ξ1+(C)=ξ+(C)≤ξ(−∞)−1=ξ2(−∞).
**Thus, we see that ξ1, ξ2∈S(0).
**
3 Symbolic powers of the canonical ideal
In this section, we consider the symbolic powers ω(n) of the canonical ideal
ω of K[C(P)] and describe the Laurent monomial basis of ω(n)
as a vector space over K.
Further, we show that the symbolic powers of ω are equal to the ordinary ones.
Here we note the following fact.
Let R be a Noetherian normal domain and I a fractional ideal.
I is said to be divisorial if R:Q(R)(R:Q(R)I)=I, i.e.,
I is reflexive as an R-module,
where Q(R) is the fraction field of R.
It is known that the set of divisorial ideals form a group,
denoted Div(R), by the operation
I⋅J:=R:Q(R)(R:Q(R)IJ).
We denote the n-th power of I in this group I(n),
where n∈Z.
Note that if I⊊R, then I(n) is identical with the
n-th symbolic power of I.
Note also that the inverse element of I in Div(R) is R:Q(R)I.
Suppose further that R is an affine semigroup ring
generated by Laurent monomials
in the Laurent polynomial ring K[X1±1,…,Xs±1]
over K,
where K is a field and X1, …, Xs are indeterminates.
Let I be a divisorial ideal generated by
Laurent monomials
m1, …, mℓ.
Then R:Q(R)I=⋂i=1ℓRmi−1.
Thus, R:Q(R)I is an R-submodule of
of K[X1±1,…,Xs±1]
generated by Laurent monomials.
Therefore, the set of divisorial ideals generated by
Laurent monomials
form a subgroup of Div(R).
It is known that the canonical module ω is reflexive and isomorphic to an ideal.
Therefore
ω∈Div(R).
Thus, if the canonical module ω of
R is isomorphic to an ideal of R generated by
Laurent monomials, then
the inverse element ω(−1) of ω in Div(R)
is also an R-submodule
K[X1±1,…,Xs±1]
generated by
Laurent monomials.
Since an R-submodule of K[X1±1,…,Xs±1]
generated by Laurent monomials
has a unique system
of generators consisting of Laurent monomials,
we call an element of this system a generator of the R-submodule.
Taking into account of this fact,
we first note the following fact.
Lemma 3.1
Let n be an integer.
Set ξ∈ZP− by
[TABLE]
then ξ∈S(n).
**It is clear that ξ(z)≥n for any z∈P.
Let C be an arbitrary maximal chain in P.
Then C∪{−∞,∞} is a saturated chain from −∞ to ∞
of length
#(C∪{−∞,∞})−1.
Thus, n(#(C∪{−∞,∞})−1)≤q(n)dist(−∞,∞)=ξ(−∞).
Therefore, ξ+(C)+n=n(#C)+n≤ξ(−∞).
**
Next we state the following.
Proposition 3.2
Let n be an integer and ξ∈ZP−.
Then Tξ∈ω(n) if and only if ξ∈S(n).
In particular,
[TABLE]
The cases where n=0 and 1 are noted in the previous section.
Let m be a positive integer.
We first show that Tξ∈ω(−m) if and only if ξ∈S(−m).
In order to prove the “only if” part, first let η be a map from P− to
Z such that η(z)=1 for any z∈P and η(−∞)=q(1)dist(−∞,∞).
Then Tη∈ω by Lemma 3.1.
Thus, Tmη∈ωm.
Since Tξ∈ω(−m), we see that Tξ+mη∈K[C(P)].
Therefore, ξ(z)+mη(z)≥0 for any z∈P and we see that
ξ(z)≥−m since η(z)=1.
Next, let C be an arbitrary maximal chain in P,
N a huge integer (N>q(1)dist(−∞,∞)) and
let η′ be a map from P− to Z such that η′(z)=N for z∈C,
η′(z)=1 for z∈P∖C and η′(−∞)=N(#C)+1.
Then Tη′∈ω since N is a huge integer and therefore
Tmη′∈ωm.
Thus, Tξ+mη′∈K[C(P)] since Tξ∈ω(−m).
Therefore,
ξ(−∞)+mη′(−∞)≥ξ+(C)+m((η′)+(C)).
Since η′(−∞)=N(#C)+1 and (η′)+(C)=N(#C),
we see that
ξ(−∞)−ξ+(C)≥m((η′)+(C))−mη′(−∞)=−m,
i.e.,
ξ(−∞)≥ξ+(C)−m.
Next, we prove the “if” part.
Let Tη1, …, Tηm be arbitrary Laurent monomials in ω,
where ηi∈ZP− for 1≤i≤m.
Since ηi(z)≥1 and ξ(z)≥−m
for any z∈P and i, we see that
(ξ+η1+⋯+ηm)(z)≥0 for any z∈P.
Next let C be an arbitrary maximal chain in P.
Since ηi+(C)+1≤ηi(−∞) for any i,
we see that
(η1+⋯+ηm)+(C)+m≤(η1+⋯+ηm)(−∞).
Since ξ(−∞)≥ξ+(C)−m by assumption, we see that
(ξ+η1+⋯+ηm)(−∞)≥(ξ+η1+⋯+ηm)+(C).
Therefore, we see that Tξ+η1+⋯+ηm∈K[C(P)].
Since Tη1, …, Tηm are arbitrary Laurent monomials
in ω, we see that Tξ∈ω(−m).
We next show that for ξ∈ZP−,
Tξ∈ω(m) if and only if ξ∈S(m).
We first show the “only if” part.
Set ζ∈ZP− by ζ(z)=−m for any z∈P and
ζ(−∞)=q(−m)dist(−∞,∞).
Then ζ∈S(−m) by Lemma 3.1 and therefore
we see that Tζ∈ω(−m)
by the fact proved above.
Since Tξ+ζ∈K[C(P)] by assumption, we see that
ξ(z)+ζ(z)≥0 for any z∈P.
Thus, ξ(z)≥−ζ(z)=m for any z∈P.
Next let C be an arbitrary maximal chain in P.
Set ζ′∈ZP− by
[TABLE]
Then
ζ′∈S(−m) and therefore
by the criterion of a Laurent monomial to be an element of ω(−m) proved above,
we see that
Tζ′∈ω(−m).
Thus, Tξ+ζ′∈K[C(P)] by assumption
and we see that
ξ+(C)+(ζ′)+(C)≤ξ(−∞)+ζ′(−∞).
Therefore,
ξ(−∞)≥ξ+(C)+(ζ′)+(C)−ζ′(−∞)=ξ+(C)+m.
**Next we show the “if” part.
Let ξ be a map from P− to Z such that ξ(z)≥m for any z∈P
and ξ(−∞)≥ξ+(C)+m for any maximal chain C in P.
Let Tζ, ζ∈ZP− be an arbitrary Laurent monomial in
ω(−m).
Then by the first part of this proof, we see that ζ(z)≥−m for any
z∈P and ζ(−∞)≥ζ+(C)−m for any maximal chain C in P.
Therefore, (ξ+ζ)(z)=ξ(z)+ζ(z)≥0 and
(ξ+ζ)(−∞)=ξ(−∞)+ζ(−∞)≥ξ+(C)+m+ζ+(C)−m=(ξ+ζ)+(C)
for any maximal chain C in P.
Thus, we see that Tξ+ζ∈K[C(P)].
Since Tζ is an arbitrary Laurent monomial in ω(−m),
we see that Tξ∈ω(m).
**
As a corollary, we see the following fact.
Corollary 3.3
Let n be an integer and let ξ:P−→Z be
the map defined in Lemma 3.1.
Then Tξ is an element of ω(n) with degTξ=q(n)dist(−∞,∞)
and for any map ζ:P−→Z
with Tζ∈ω(n),
degTζ≥degTξ.
**By Lemma 3.1,
we see that ξ∈S(n).
Thus,
Tξ∈ω(n) by Proposition 3.2
and degTξ=ξ(−∞)=q(n)dist(−∞,+∞).
Also, by Proposition 3.2, we see that ζ∈S(n).
Take a maximal chain C in P with
q(n)dist(−∞,∞)=n(#(C∪{−∞,∞})−1).
Then q(n)dist(−∞,∞)=n(#C)+n.
Since ζ(c)≥n for any c∈C, we see that
ζ+(C)≥n(#C).
Thus, degTζ=ζ(−∞)≥ζ+(C)+n=q(n)dist(−∞,∞)=degTξ.
**
Next, we show that the symbolic powers of ω are equal to ordinary ones.
For α∈R, we denote by ⌊α⌋ the maximum integer
less than or equals to
α and by ⌈α⌉ the minimum integer
larger than or equals to α.
Let ϵ be 1 or −1,
n an integer with n≥2 and Tξ an arbitrary Laurent monomial in
ω(nϵ), where ξ∈ZP−.
In this setting, we define two maps ξ1 and ξ2∈ZP− as follows.
Set ξ1 by
[TABLE]
and ξ2=ξ−ξ1.
We first show the following.
Lemma 3.4
In the above notation,
ξ1+↑(z)=⌊n1ξ+↑(z)⌋
for any z∈P
and
max{ξ1+(C)∣C is a maximal chain in P}=⌊n1max{ξ+(C)∣C is a maximal chain in P}⌋.
First we show the former assertion by Noetherian induction on z.
The case where z is a maximal element of P is trivial.
Assume that z is not maximal.
Then by Lemma 2.6 (2), we see that
ξ+′↑(z)=max{ξ+↑(z′)∣z′⋅>z}.
Since
⌊n1max{ξ+↑(z′)∣z′⋅>z}⌋=max{⌊n1ξ+↑(z′)⌋∣z′⋅>z},
we see by the induction hypothesis and Lemma 2.6 (2)
that
⌊n1ξ+′↑(z)⌋=max{ξ1+↑(z′)∣z′⋅>z}=ξ1+′↑(z).
Therefore, by the definition of ξ1, we see that
ξ1+↑(z)=ξ1(z)+ξ1+′↑(z)=⌊n1ξ+↑(z)⌋−⌊n1ξ+′↑(z)⌋+⌊n1ξ+′↑(z)⌋=⌊n1ξ+↑(z)⌋.
**Next we show the latter assertion.
Since max{ξ+(C)∣C is a maximal chain in P}=max{ξ+↑(z)∣z is a minimal element of P}
and the corresponding equation for ξ1, we see that
max{ξ1+(C)∣C is a maximal chain in P}=max{ξ1+↑(z)∣z is a minimal element of P}=max{⌊n1ξ+↑(z)⌋∣z is a minimal element of P}=⌊n1max{ξ+(C)∣C is a maximal chain in P}⌋.
**
Now we prove the following.
Lemma 3.5
In the above setting, ξ1∈S(ϵ).
It is enough to show that ξ1(z)≥ϵ for any z∈P and
ξ1(−∞)≥max{ξ1+(C)∣C is a maximal chain in P}+ϵ.
Let z be an arbitrary element of P.
If z is a maximal element of P, then
ξ1(z)=⌊n1ξ(z)⌋≥ϵ
since ξ(z)≥nϵ
by Proposition 3.2.
Assume that z is not a maximal element of P.
Then ξ+↑(z)=ξ(z)+ξ+′↑(z)≥nϵ+ξ+′↑(z).
Therefore,
ξ1(z)=⌊n1ξ+↑(z)⌋−⌊n1ξ+′↑(z)⌋≥⌊n1(nϵ+ξ+′↑(z))⌋−⌊n1ξ+′↑(z)⌋=ϵ.
**Further, since Tξ∈ω(nϵ), we see by Proposition
3.2 that
ξ(−∞)≥max{ξ+(C)∣C is a maximal chain in P}+nϵ.
Thus,
ξ1(−∞)=⌊n1ξ(−∞)⌋≥⌊n1(max{ξ+(C)∣C is a maximal chain in P}+nϵ)⌋=max{ξ1+(C)∣C is a maximal chain in P}+ϵ
by Lemma 3.4.
**
Next we show that ξ2∈S((n−1)ϵ).
First we state the following.
Lemma 3.6
In the above setting,
ξ2+↑(z)=⌈nn−1ξ+↑(z)⌉ for any z∈P and
max{ξ2+(C)∣C is a maximal chain in P}=⌈nn−1max{ξ+(C)∣C is a maximal chain in P}⌉.
We first prove the former assertion by Noetherian induction on z.
If z is a maximal element of P, then
ξ2+↑(z)=ξ2(z)=ξ(z)−ξ1(z)=ξ(z)−⌊n1ξ(z)⌋=⌈nn−1ξ(z)⌉=⌈nn−1ξ+↑(z)⌉
by the definition of ξ1 and ξ2.
Suppose that z is not a maximal element of P.
Take z1∈P with z1⋅>z and ξ+↑(z1)=maxz′⋅>zξ+↑(z′).
Then since ξ2+↑(z)=ξ2(z)+maxz′⋅>zξ2+↑(z′),
we see by induction hypothesis that
ξ2+↑(z)=ξ2(z)+maxz′⋅>z⌈nn−1ξ+↑(z′)⌉=ξ2(z)+⌈nn−1ξ+↑(z1)⌉.
Since
ξ2(z)=ξ(z)−ξ1(z)=ξ(z)−(⌊n1ξ+↑(z)⌋−⌊n1ξ+′↑(z)⌋)=ξ(z)−⌊n1ξ+↑(z)⌋+⌊n1ξ+↑(z1)⌋,
we see that
ξ2+↑(z)=ξ2(z)+⌈nn−1ξ+↑(z1)⌉=ξ(z)−⌊n1ξ+↑(z)⌋+⌊n1ξ+↑(z1)⌋+⌈nn−1ξ+↑(z1)⌉=ξ(z)+ξ+↑(z1)−⌊n1ξ+↑(z)⌋=ξ+↑(z)−⌊n1ξ+↑(z)⌋=⌈nn−1ξ+↑(z)⌉.
**Now we prove the latter assertion.
By the fact
max{ξ+(C)∣C is a maximal chain in P}=max{ξ+↑(z)∣z is a minimal element of P}
and the corresponding fact for ξ2,
we see that
max{ξ2+(C)∣C is a maximal chain in P}=max{ξ2+↑(z)∣z is a minimal element of P}=max{⌈nn−1ξ+↑(z)⌉∣z is a minimal element of P}=⌈nn−1max{ξ+(C)∣C is a maximal chain in P}⌉.
**
Now we show the following.
Lemma 3.7
ξ2∈S((n−1)ϵ).
Let z∈P.
If z is a maximal element of P, then
by Lemma 3.6
ξ2(z)=ξ2+↑(z)=⌈nn−1ξ+↑(z)⌉=⌈nn−1ξ(z)⌉≥(n−1)ϵ,
since ξ(z)≥nϵ.
Next suppose that z is not a maximal element of P.
Take z1∈P with z1⋅>z and ξ+↑(z1)=maxz′⋅>zξ+↑(z′)=ξ+′↑(z).
Then by Lemma 3.6, we see that
ξ2+↑(z1)=maxz′⋅>zξ2+↑(z′)=ξ2+′↑(z).
Therefore, by Lemma 3.6, we see that
ξ2(z)=ξ2+↑(z)−ξ2+↑(z1)=⌈nn−1ξ+↑(z)⌉−⌈nn−1ξ+↑(z1)⌉≥(n−1)ϵ,
since
ξ+↑(z)=ξ(z)+ξ+↑(z1)≥nϵ+ξ+↑(z1).
**Further, since
ξ(−∞)≥max{ξ+(C)∣C is a maximal chain in P}+nϵ,
we see by Lemma 3.6 that
ξ2(−∞)=ξ(−∞)−ξ1(−∞)=ξ(−∞)−⌊n1ξ(−∞)⌋=⌈nn−1ξ(−∞)⌉≥⌈nn−1(max{ξ+(C)∣C is a maximal chain in P}+nϵ)⌉=max{ξ2+(C)∣C is a maximal chain in P}+(n−1)ϵ.
Thus, we see that ξ2∈S((n−1)ϵ).
**
By Proposition 3.2, Lemmas 3.5 and 3.7,
and induction on n, we see the following.
Theorem 3.8
Let n be a positive integer.
Then
[TABLE]
and
[TABLE]
Remark 3.9
Let P={x,y} be a poset with x<y and let ξ:P−→Z
be a map with ξ(x)=ξ(y)=3 and ξ(−∞)=8.
Then ξ∈S(2).
If we set ξ′(w)=⌊21ξ(w)⌋ for any w∈P−,
then ξ′∈S(1) but ξ−ξ′∈S(1).
Thus, simply setting ξ1(w)=⌊n1ξ(w)⌋ for any
w∈P− does not meet our demand.
Further, let P1={x1,x2,y} be a poset with order relation x1<x2
and let ξ:P−→Z be the map with
ξ(x1)=ξ(x2)=2, ξ(y)=4 and ξ(−∞)=6.
Then ξ∈S(2).
If we set ξ′(z)=1 for z∈P and ξ′(−∞)=3, then ξ′∈S(1)
but ξ−ξ′∈S(1).
Thus, setting ξ1(z)=1 for any z∈P and ξ1(−∞)=q(ϵ)dist(−∞,∞)
does not meet our demand also.
For a poset Q, we define a graph G(Q) whose vertex set is Q and for
a, b∈Q, {a,b} is an edge of G(Q) if and only if a=b and
a and b are comparable by the order of Q.
A graph G such that there is a poset Q with G=G(Q) is called a
comparability graph.
Recall that for a finite graph G with vertex set V and edge set E,
a stable set of G is a subset of V pairwise nonadjacent.
Further, the stable set polytope (vertex-packing polytope) of G is the convex
polytope in RV which is the convex hull of {χA∣A is a stable set}.
Since in our setting, C(P) is the convex hull of
{χA∣A is an antichain of P} and a subset of P is an antichain if and
only if it is a stable set of G(P), we see that C(P) is the stable set polytope
of G(P).
Further, it is known the following fact.
Fact 3.10** ([GH, Theorem 1])**
Let G be a graph.
Then G is a comparability graph of a poset if and only if each odd cycle of
G has at least one triangular chord.
By the consideration above, we see the following.
Corollary 3.11
Let G be a finite graph.
Suppose that each odd cycle of G has a triangular chord.
Denote the canonical ideal of the Ehrhart ring of the stable set polytope of
G as ω.
Then for any positive integer n,
ω(n)=ωn and ω(−n)=(ω(−1))n.
In particular, the symbolic power of the canonical ideal of
the Ehrhart ring of the stable set polytope
of a bipartite graph is identical with the ordinary power.
4 Characterizations of level and anticanonical level properties of K[C(P)]
In this section, we describe generators of ω (resp. ω(−1))
by “sequence with condition N’ ” in P.
Recall that we [Miy1, Miy2] described generators of the canonical and anticanonical
ideals of K[O(P)] by “sequence with condition N” in P.
First we recall the definition of condition N and define condition N’ of a sequence
of elements of P.
Definition 4.1
Let y0, x1, y1, x2, …, yt−1, xt be a sequence of elements
of P.
We say that y0, x1, y1, x2, …, yt−1, xt satisfy condition N (resp. condition N’) if
- (1)
y0>x1<y1>x2<⋯<yt−1>xt and
2. (2)
if i≤j−2, then yi≥xj
(resp. yi>xj).
We define that an empty sequence (i.e., t=0) satisfy condition N (resp. condition N’).
When considering a sequence y0, x1, …, yt−1, xt with condition N (resp. condition N’), we usually set x0=−∞ and yt=∞ and consider a
sequence x0, y0, x1, …, yt−1, xt, yt in P±.
We note the following basic fact because it is used frequently.
Lemma 4.2
Let y0, x1, …, yt−1, xt be a sequence with condition N’.
If yi≤yj (or xi≤xj) and i=j, then i<j.
In particular, y0, y1, …, yt−1 (resp. x1, x2, …, xt)
are different elements of P.
Further, if yk≤xℓ, then ℓ≥k+2.
**If j<i, then
yj≥yi>xi+1
(or yj−1>xj≥xi)
and j≤(i+1)−2
(or j−1≤i−2),
contradicting condition N’.
Similarly, if ℓ≤k, then ℓ−1≤(k+1)−2 and
yℓ−1>xℓ≥yk>xk+1 violating condition N’.
Further, since xk+1<yk, we see ℓ=k+1.
Thus, ℓ≥k+2.
**
Here we recall the definition of level (resp. anticanonical level) property.
Definition 4.3** ([Sta1, Pag])**
Let R be a standard graded Cohen-Macaulay algebra over a field.
If the degree of all the generators of the canonical module ω of R are the same,
then we say that R is level.
Moreover, if R is normal (thus, is a domain)
and the degree of all the generators of ω(−1)
are the same, we say that R is anticanonical level.
In the following, we characterize if a Laurent monomial in ω
(resp. ω(−1)) is a generator by sequences with condition N’ in P and also characterize
level and anticanonical level properties of K[C(P)] by sequences with condition N’ in P.
Since the cases of ω and ω(−1) are similar, we treat both
cases simultaneously.
In the following, let ϵ be 1 or −1.
Further, we define the following notation.
Definition 4.4
Let ξ∈ZP,
ξ∈ZP−,
ξ∈ZP+ or
ξ∈ZP± and n∈Z.
We set
Cξ[n]:={C∣C is a maximal chain in P and
ξ+(C)=n}.
Note that if ξ∈S(m) and ξ(−∞)=d, then Cξ[n]=∅
for any n with n>d−m.
Next we note the following.
Lemma 4.5
Suppose that ξ∈S(ϵ) and set d:=ξ(−∞).
Then Tξ is not a generator of ω(ϵ) if and only if there
is an antichain A (which may be an empty set) such that
for any C∈Cξ[d−ϵ],
C∩A=∅ and ξ(a)>ϵ for the unique element a∈C∩A.
(This condition is trivially satisfied if Cξ[d−ϵ]=∅.)
We first prove the “if” part.
Set ξ1:P−→Z by
[TABLE]
and ξ2:=ξ−ξ1.
Then ξ2(z)≥ϵ for any z∈P by assumption.
Further, Cξ2[m]=∅ for any m with
m≥d−ϵ since A∩C=∅
for any C∈Cξ[d−ϵ] and Cξ[n]=∅ for any n with
n>d−ϵ.
Thus, ξ2+(C)≤d−ϵ−1 for any maximal chain C in P.
Therefore, ξ2∈S(ϵ) since ξ2(−∞)=d−1
and we see that Tξ2∈ω(ϵ).
Since ξ1∈S(0), we see that
Tξ1∈K[C(P)] and therefore
Tξ is not a generator of ω(ϵ),
since Tξ=Tξ1Tξ2.
**Now we prove the “only if” part.
Suppose that Tξ is not a generator of ω(ϵ).
Then, since K[C(P)] is a standard graded algebra, there are
ξ1∈S(0) and ξ2∈S(ϵ), such that ξ=ξ1+ξ2
and ξ1(−∞)=1.
Set A:={a∈P∣ξ1(a)>0}.
Then, since ξ1(−∞)=1 and ξ1∈S(0), we see that
A is an antichain.
Let C be an arbitrary element of Cξ[d−ϵ].
Since ξ2(−∞)=d−1 and ξ2∈S(ϵ), we see that
ξ2+(C)+ϵ≤d−1.
Since ξ1+(C)+ξ2+(C)=ξ+(C)=d−ϵ, we see that ξ1+(C)≥1.
Thus, C∩A=∅ and for the unique element a∈A∩C,
ξ(a)=ξ1(a)+ξ2(a)≥1+ϵ>ϵ
since ξ2∈S(ϵ).
**
By using this criterion of a Laurent monomial Tξ∈ω(ϵ) to be a generator
of ω(ϵ), we next state a sufficient condition for a Laurent monomial
Tξ∈ω(ϵ) to be a generator of ω(ϵ).
Lemma 4.6
Let ξ∈S(ϵ) and set ξ(−∞)=d.
If there are elements z0, w1, z1, w2, …, zs−1, ws
of P with
z0>w1<z1>w2<⋯<zs−1>ws and
C0, C1, …, Cs∈Cξ[d−ϵ] such that
- (1)
s=0* or
C0∋z0, Cs∋ws and
Ci∋wi, zi for 1≤i≤s−1
(the latter part is trivially valid if s=1), and*
2. (2)
ξ(z)=ϵ* for any z∈Ci∩(wi,zi) and for any i with
0≤i≤s, where we set w0=−∞ and zs=∞,*
then Tξ is a generator of ω(ϵ)
Assume the contrary.
Then by Lemma 4.5, we see that there is an antichain A in P such that
for any C∈Cξ[d−ϵ], A∩C=∅ and ξ(a)>ϵ for the
unique element a∈A∩C.
**If s=0, then for a∈A∩C0, ξ(a)=ϵ by assumption and this is a contradiction.
Thus, s>0.
Set A∩Ci={ai} for 0≤i≤s.
Since as≤ws and a0≥z0 by assumption, we see that there exists
i with 1≤i≤s, ai≤wi and ai−1≥zi−1.
Since zi−1>wi, this contradicts to the fact that A is an antichain.
**
Next we show a strong converse of this lemma.
We show that if Tξ is a generator of ω(ϵ), then we can not only take a
sequence z0, w1, …, zs−1, ws satisfying the condition of
Lemma 4.6, but also z0, w1, …, zs−1, ws satisfy condition N’.
Further, we show that we can take sequence which are “q(ϵ)-reduced”.
Definition 4.7
For a sequence of elements w0, z0, w1, …, zs−1, ws, zs
with
w0<z0>w1<⋯<zs−1>ws<zs in P±, we set
[TABLE]
Further, for a sequence
y0, x1, …, yt−1, xt of elements in P with condition N’,
we say that y0, x1, …, yt−1, xt is q(ϵ)-reduced if
[TABLE]
for any xi, yj with xi<yj and 0≤i<j≤t,
where we set x0=−∞ and yt=∞.
Example 4.8
If there is a part of the sequence of the following form
[TABLE]
then it is not q(1)-reduced,
since
q(1)dist(xi,yi+2)=1>0=q(1)(xi,yi,xi+1,yi+1,xi+2,yi+2)
in the former case and
q(1)dist(xi,yi+1)=1=q(1)(xi,yi,xi+1,yi+1)
in the latter case.
Later, we seek a
sequence
y0, x1, …, yt−1, xt with
condition N’ such that
q(ϵ)(x0,y0,…,xt,∞) as large as possible.
If there is a part of the first kind in the sequence with condition N’, we can replace it with
y0, x1, …, xi, yi+2, xi+2, …, xt
and obtain a sequence with larger q(1)(x0,y0,…).
Further, if there is a part of the second kind in the sequence with condition N’, we apply
the replacement above and remove redundancy.
Lemma 4.9
Let ξ be an element of S(ϵ) with Tξ is a generator of ω(ϵ).
Set d:=ξ(−∞).
Then there exists a q(ϵ)-reduced sequence y0, x1, …, yt−1, xt with condition N’
such that there are C0, C1, …, Ct∈Cξ[d−ϵ] with
the following conditions.
- (1)
t=0* or
C0∋y0, Ct∋xt and
Ci∋xi, yi for 1≤i≤t−1, and*
2. (2)
ξ(z)=ϵ* for any z∈Ci∩(xi,yi) and for any i with
0≤i≤t, where we set x0=−∞ and yt=∞.*
First we note that Cξ[d−ϵ]=∅ by Lemma 4.5.
Further, if there exists C∈Cξ[d−ϵ] with ξ(z)=ϵ for any z∈C,
then the empty sequence satisfies the required condition.
Thus, in the following of the proof, we assume that for any C∈Cξ[d−ϵ],
there is z∈C with ξ(z)>ϵ.
Put
Y0:={y∈P∣∃C∈Cξ[d−ϵ];y=min{c∈C∣ξ(c)>ϵ}},
X1:={x∈P∣∃y∈Y0;x<y},
Y1:=Y0∪{y∈P∣∃x∈X1,∃C∈Cξ[d−ϵ];x∈C,y=min{c∈C∣c>x,ξ(c)>ϵ}},
X2:={x∈P∣∃y∈Y1;x<y},
Y2:=Y1∪{y∈P∣∃x∈X2,∃C∈Cξ[d−ϵ];x∈C,y=min{c∈C∣c>x,ξ(c)>ϵ}},
X3:={x∈P∣∃y∈Y2;x<y}
and so on.
Also put X:=⋃i=1∞Xi and Y:=⋃i=0∞Yi.
Set A:=maxY.
Then A is an antichain in P.
Moreover, Y∖A⊂X.
In fact, if y∈Y∖A, there is a∈A with a>y.
Since a∈A⊂Y, we see that y∈X.
If A∩C=∅ for any C∈Cξ[d−ϵ], then by Lemma 4.5,
we see that Tξ is not a generator of ω(ϵ), since ξ(a)>ϵ for any a∈A,
contradicting the assumption.
Therefore, there exists C∈Cξ[d−ϵ] such that C∩A=∅.
Take such C and set {c∈C∣ξ(c)>ϵ}={c1,c2,…,cv},
c1<c2<⋯<cv.
By the definition of Y0, we see that c1∈Y0⊂Y.
Since C∩A=∅, we see that c1∈Y∖A⊂X.
Therefore, we see that c2∈Y, and so on.
Repeating this argument, we see that cv∈X.
Set t:=min{ℓ∣cv∈Xℓ}, xt:=cv and Ct:=C.
Since xt∈Xt, we see that there is yt−1∈Yt−1 with yt−1>xt.
Note that yt−1∈Yt−2 since xt∈Xt−1.
By the definition of Yt−1, we see that there are xt−1∈Xt−1 and
Ct−1∈Cξ[d−ϵ] with
xt−1∈Ct−1 and
yt−1=min{c∈Ct−1∣ξ(c)>ϵ,c>xt−1}.
Note that xt−1∈Xt−2 since yt−1∈Yt−2.
Since xt−1∈Xt−1, there is yt−2∈Yt−2 with yt−2>xt−1.
Note that yt−2∈Yt−3 since xt−1∈Xt−2.
Continueing this argument, we see that there exist a sequence
y0, x1, …, yt−1, xt of elements of P
and C1, C2, …, Ct∈Cξ[d−ϵ] such that
y0>x1<…<yt−1>xt,
xk∈Xk for 1≤k≤t, xk∈Xk−1 for 2≤k≤t,
yk∈Yk for 0≤k≤t−1, yk∈Yk−1 for 1≤k≤t−1,
yk, xk∈Ck and ξ(z)=ϵ for any z∈Ck∩(xk,yk)
for 1≤k≤t−1,
xt∈Ct and ξ(z)=ϵ for any z∈Ct∩(xt,∞).
Since xk∈Xk−1 for 2≤k≤t, we see that if i≤j−2,
then yi>xj,
i.e., y0, x1, …, yt−1, xt satisfies condition N’.
Moreover, by the definition of Y0, we can take C0∈Cξ[d−ϵ] with
y0=min{c∈C0∣ξ(c)>ϵ}.
Then y0∈C0 and for any z∈C0∩(−∞,y0), ξ(z)=ϵ.
Next we show that y0, x1, …, yt−1, xt is q(ϵ)-reduced.
Assume the contrary and suppose that there are i and j with 0≤i<j≤t,
xi<yj and
q(ϵ)dist(xi,yj)≥∑ℓ=ijq(ϵ)dist(xℓ,yℓ)−∑ℓ=ij−1q(ϵ)dist(xℓ+1,yℓ).
Then
[TABLE]
Take a saturated chain
xℓ+1=zℓ,0<⋅zℓ,1<⋅⋯<⋅zℓ,sℓ=yℓ
with ϵsℓ=q(ϵ)dist(xℓ+1,yℓ) for i≤ℓ≤j−1.
Then,
Cℓ′:=(Cℓ+1∩(−∞,xℓ+1])∪{zℓ,1,…,zℓ,sℓ−1}∪(Cℓ∩[yℓ,∞))
is a maximal chain in P for i≤ℓ≤j−1.
Further, take a saturated chain
xi=z0′<⋅z1′<⋅⋯<⋅zs′′=yj
with ϵs′=q(ϵ)dist(xi,yj).
Then,
C′′:=(Ci∩(−∞,xi])∪{z1′,…,zs′−1′}∪(Cj∩[yj,∞))
is also a maximal chain in P.
Therefore,
[TABLE]
since Cℓ′ for i≤ℓ≤j−1 and C′′ are maximal chains in P
and ξ∈S(ϵ).
On the other hand,
[TABLE]
since
for any i≤ℓ≤j, Cℓ∈Cξ[d−ϵ] and
ξ(z)=ϵ for any z∈Cℓ∩(xℓ,yℓ).
Thus, we see by inequation (4.1) that equalities hold in (Proof)
and (4.3)
and therefore ξ(zm′)=ϵ for 1≤m≤s′−1
and ξ+(C′′)=d−ϵ.
This means that yj∈Yi, contradicting the fact that yj∈Yj−1.
**Therefore, we see that y0, x1, …, yt−1, xt is q(ϵ)-reduced.
**
By Lemmas 4.6 and 4.9, we see the following.
Proposition 4.10
Let ξ∈S(ϵ) and set d:=ξ(−∞).
Then the following conditions are equivalent.
- (1)
Tξ* is a genenrator of ω(ϵ).*
2. (2)
There are elements z0, w1, …,
zs−1, ws
of P with
z0>w1<⋯<zs−1>ws
and C0, C1, …, Cs∈Cξ[d−ϵ] such that
- (a)
s=0* or
C0∋z0, Cs∋ws and
Ci∋wi, zi for 1≤i≤s−1, and*
2. (b)
ξ(z)=ϵ* for any z∈Ci∩(wi,zi) and for any i with
0≤i≤s, where we set w0=−∞ and zs=∞,*
3. (3)
There exists a q(ϵ)-reduced sequence y0, x1, …, yt−1, xt with condition N’
such that there are C0, C1, …, Ct∈Cξ[d−ϵ]
with the following conditions.
- (a)
t=0* or
C0∋y0, Ct∋xt and
Ci∋xi, yi for 1≤i≤t−1, and*
2. (b)
ξ(z)=ϵ* for any z∈Ci∩(xi,yi) and for any i with
0≤i≤t, where we set x0=−∞ and yt=∞.*
As a corollary, we obtain an upper bound of the degrees of generators of ω(ϵ).
Corollary 4.11
Let Tξ, ξ∈S(ϵ), be a generator of ω(ϵ).
Then
[TABLE]
(See Definition 4.7 for the notation.)
Set d:=degTξ.
Then by Proposition 4.10, we see that there are a q(ϵ)-reduced sequence
y0, x1, …, yt−1, xt with condition N’ and C0, C1, …,
Ct∈Cξ[d−ϵ] satisfying
(3) of Proposition 4.10.
If t=0, then since ξ(c)=ϵ for any c∈C0, we see that
[TABLE]
Therefore, degTξ=d≤q(ϵ)dist(−∞,∞)=q(ϵ)(x0,y0).
Now suppose that t>0.
Since max{ξ+(C)∣C is a maximal chain in P}=d−ϵ,
we see that
d−ϵ≥ξ+↓(xi)+ξ+′↑(xi)≥∑c∈Ci∩(−∞,xi]ξ(c)+∑c∈Ci∩(xi,∞)ξ(c)=ξ+(Ci)=d−ϵ.
Therefore,
[TABLE]
for 1≤i≤t.
We see by the same way that
[TABLE]
for 0≤i≤t−1.
In particular,
[TABLE]
for 1≤i≤t−1, since ξ(c)=ϵ for any c∈Ci∩(xi,yi).
Moreover, we see that
[TABLE]
by the same way.
On the other hand, we see by Lemma 2.7,
[TABLE]
for 0≤i≤t−1.
Thus,
[TABLE]
In fact, this upper bound is the least upper bound, see Proposition 4.16.
Further, it is
seen, by Corollary 3.3
that the minimum degree of the
Laurent monomials in ω(ϵ) is
q(ϵ)dist(−∞,∞).
The q(ϵ)-reduced sequence with condition N’ satisfying (3) of Proposition 4.10
is far from unique.
However, for a given q(ϵ)-reduced sequence y0, x1, …, yt−1, xt with
condition N’
we can construct an element ξ∈S(ϵ) such
that
d=ξ(−∞)=q(ϵ)(−∞,y0,…,xt,∞)
and
there are C0, C1, …, Ct∈Cξ[d−ϵ] which satisfy
conditions of (3) of Proposition 4.10.
In order to do this task, suppose that a q(ϵ)-reduced sequence
y0, x1, …, yt−1, xt with condition N’ is given and fixed.
We set x0:=−∞, yt:=∞
and d:=q(ϵ)(x0,y0,…,xt,yt).
If t=0, then it is enough to set
[TABLE]
since
ξ∈S(ϵ) by Lemma 3.1 and
there is a maximal chain C0 in P with
ξ+(C0)=ϵ(#C0)=q(ϵ)dist(−∞,∞)−ϵ=d−ϵ.
Thus, we assume that t>0 in the following.
We define two maps μ′:{y0,y1,…,yt}→Z
and μ′′:{x0,x1,…,xt}→Z
by
μ′′(xi):=q(ϵ)(xi,yi,…,xt,yt)
for 0≤i≤t,
μ′(yi):=q(ϵ)(xi+1,yi+1,…,xt,yt)−q(ϵ)dist(xi+1,yi)
for 0≤i≤t−1 and μ′(yt):=0.
Note that
μ′′(x0)=d,
μ′′(xi)=μ′(yi)+q(ϵ)dist(xi,yi) for 0≤i≤t,
μ′′(xi)=μ′(yi−1)+q(ϵ)dist(xi,yi−1) for 1≤i≤t
and
μ′′(xi)−μ′(yj)=q(ϵ)(xi,yi,…,xj,yj) for 0≤i≤j≤t.
Moreover, if i<j and xi<yj, then
q(ϵ)dist(xi,yj)<μ′′(xi)−μ′(yj),
since y0, x1, …, yt−1, xt is q(ϵ)-reduced.
Note that it may happen that xi=yj for some i and j,
but this does not imply μ′′(xi)=μ′(yj).
Example 4.12
Let ϵ=1 and let P and y0, x1, y1, x2 be as follows.
[TABLE]
Then μ′(y2)=0, μ′′(x2)=3, μ′(y1)=2, μ′′(x1)=5, μ′(y0)=4
and μ′′(x0)=7.
We first define the map ξ0:P→Z by
[TABLE]
Note that yj may be yt=∞ in the above definition,
thus {μ′(yj)+q(ϵ)dist(z,yj)∣yj>z in P+}=∅,
since z∈P.
For ξ0, we see the following fact.
Lemma 4.13
- (1)
ξ0(z)≥ϵ* for any z∈P.*
2. (2)
ξ0(z)=ϵ* if z∈{y0,…,yt−1}.*
3. (3)
ξ0+↑(yi)=μ′(yi)* for 0≤i≤t−1.*
4. (4)
ξ0+(C)≤d−ϵ* for any maximal chain C in P.*
5. (5)
q(ϵ)dist(x0,y0)+ξ0+↑(y0)=d.
(2)** is obvious from the definition.
We next prove (1).
The case where z∈{y0,…,yt} follows from (2).
Assume that z=yi and 0≤i≤t−1.
Take j with yj>yi and \xi_{0}(y_{i})=\mu^{\prime}(y_{i})-\big{(}\mu^{\prime}(y_{j})+q^{(\epsilon)}{\mathrm{dist}}(y_{i},y_{j})\big{)}+\epsilon.
Then i<j by Lemma 4.2 and xi<yj.
Since y0, x1, …, yt−1, xt is q(ϵ)-reduced sequence with condition N’,
we see that**
[TABLE]
On the other hand, since
[TABLE]
we see that
[TABLE]
Therefore,
[TABLE]
Next we prove (3) by backward
induction on i.
First consider the case where i=t−1.
Since y0, x1, …, yt−1, xt satisfies condition N’, we see that
yj>yt−1 implies j=t by Lemma 4.2.
Therefore,
[TABLE]
On the other hand, since
z∈P, z>yt−1 implies z∈{y0,…,yt−1}
by Lemma 4.2, we see that
[TABLE]
Therefore, we see that
[TABLE]
Next suppose that 0≤i≤t−2.
We first show that ξ0+↑(yi)≤μ′(yi).
Take z0, z1, …, zs with
yi=z0<⋅z1<⋅⋯<⋅zs<⋅∞
and
∑ℓ=0sξ0(zℓ)=ξ+↑(yi).
First consider the case where
{z1, …, zs}∩{y0, …, yt−1}=∅.
Since ξ0(zℓ)=ϵ for 1≤ℓ≤s, we see that
[TABLE]
If {z1,…,zs}∩{y0,…,yt−1}=∅,
take minimal u with u≥1 and zu∈{y0,…,yt−1}
and set zu=yj.
Then j>i by Lemma 4.2.
Thus, ξ0+↑(yj)=μ′(yj) by the induction hypothesis.
Moreover,
ξ0+↑(yj)=∑ℓ=usξ0(zℓ) by Lemma 2.6 (1).
On the other hand, since ξ0(zℓ)=ϵ for 1≤ℓ≤u−1,
we see that
[TABLE]
Therefore,
[TABLE]
Thus,
[TABLE]
Next we prove that ξ0+↑(yi)≥μ′(yi).
Take j with yj>yi and
[TABLE]
Then j>i by Lemma 4.2.
Take z0, …, zu∈P+ with
yi=z0<⋅⋯<⋅zu=yj
and uϵ=q(ϵ)dist(yi,yj).
Then by Lemma 2.6 (3)
and the induction hypothesis
[TABLE]
where we set ξ0+↑(yt):=0.
Since ξ0(zℓ)≥ϵ for 1≤ℓ≤u−1 by (1),
we see that
[TABLE]
by (4.4).
Thus, we have proved (3).
(5)** follows from (3) and the fact
d=μ′′(x0)=μ′(y0)+q(ϵ)dist(x0,y0).**
Finally, we prove (4).
Let C be a maximal chain in P.
We set C={c1,…,cs},
−∞<⋅c1<⋅⋯<⋅cs<⋅∞.
First, consider the case where C∩{y0,…,yt−1}=∅.
Then ξ0(ci)=ϵ for any i by (2).
Thus,
[TABLE]
Since y0, x1, …yt−1, xt is q(ϵ)-reduced, we see that
[TABLE]
Therefore,
[TABLE]
Next we consider the case where C∩{y0,…,yt−1}=∅.
Take minimal u with cu∈{y0,…,yt−1} and set cu=yj.
Then
[TABLE]
Since ξ0(cℓ)=ϵ for 1≤ℓ≤u−1,
we see that
[TABLE]
since y0, x1, …, yt−1, xt is q(ϵ)-reduced.
On the other hand, since
ξ0+↑(yj)≥∑ℓ=usξ0(cℓ), we see that
[TABLE]
**by (3).
**
Next we state a lemma which is used in the induction argument.
Lemma 4.14
Let k be an integer with 0≤k≤t−1 and suppose that a map
ξk:P→Z is defined so that
ξk(z)≥ϵ** for any z∈P.**
ξk(z)=ϵ** if z∈{x1,…,xk,y1,…,yt−1}.**
ξk+↑(yi)=μ′(yi)** for 0≤i≤t−1.**
ξk+(C)≤d−ϵ** for any maximal chain C in P.**
ξk+↓(xi)+q(ϵ)dist(xi,yi)+ξk+↑(yi)=d**
for 0≤i≤k.**
are satisfied, where we set ξk+↓(x0)=0.
Let ξk+1:P→Z be a map such that
[TABLE]
Then
- (1)
ξk+1(z)≥ξk(z)* for any z∈P.
In particular,
ξk+1(z)≥ϵ for any z∈P.*
2. (2)
ξk+1(z)=ϵ* if z∈{x1,…,xk+1,y0,…,yt−1}.*
3. (3)
ξk+1+↑(yi)=μ′(yi)* for 0≤i≤t−1.*
4. (4)
ξk+1+(C)≤d−ϵ* for any maximal chain C in P.*
5. (5)
ξk+1+↓(xi)+q(ϵ)dist(xi,yi)+ξk+1+↑(yi)=d*
for 0≤i≤k+1,
where we set ξk+1+↓(x0)=ξk+1+↑(yt)=0.*
First note that we have to be careful because that it might happen
xk+1∈{y0,…,yt−1}.
(2)** is obvious from (H2) and the definition of ξk+1.
Next we prove (1).
Since**
[TABLE]
by (H4) and Lemma 2.7, we see that
[TABLE]
by (H1).
Therefore (1) follows from the definition of ξk+1.
Next we prove (4).
Let C be an arbitrary maximal chain in P.
If C∋xk+1, then by the definition of ξk+1, we see that
[TABLE]
by (H4).
If C∋xk+1, then
[TABLE]
by the definition of ξk+1.
Now we prove (3).
First,
we see by (1) and (H3) that
[TABLE]
In order to prove the converse inequality, take a saturated chain
yi=z0<⋅⋯<⋅zs<⋅∞ from yi to ∞
with
ξk+1+↑(yi)=∑ℓ=0sξk+1(zℓ).
If xk+1∈{z0,…,zs}, then
[TABLE]
by (H3) and the definition of ξk+1.
Now suppose that xk+1∈{z0,…,zs} and set xk+1=zu.
Then, since yk>xk+1≥yi>xi+1, we see by condition N’ that
k≤(i+1)−2, i.e., k≥i.
(In fact, i≤k−1, but we do not use this fact.)
Since ξk(z)≥ϵ for any z∈P, we see by Lemma 2.7 that
[TABLE]
Therefore, by (H5), (1) and (4), we see that
[TABLE]
Thus, we see that
[TABLE]
Finally, we prove (5).
By (4) and Lemma 2.7, we see that
[TABLE]
Thus,
[TABLE]
for any i.
If i≤k, then by (H5), we see that
[TABLE]
In order to prove the case where i=k+1, take a saturated chain
xk+1=z0<⋅⋯<⋅zs<⋅zs+1=∞
with
ξk+1+↑(xk+1)=∑ℓ=0sξk+1(zℓ).
Take minimal u with 1≤u≤s+1 and zu∈{y0,…,yt}
and set zu=yj.
Then
[TABLE]
by (3) and Lemma 2.6 (1).
We claim here that j=k or j=k+1.
In fact, by condition N’, we see that j≥k.
If j≥k+2, then, since y0, x1, …, yt−1, xt is q(ϵ)-reduced,
we see that
[TABLE]
Thus,
by (4.5), (3) and Lemma 2.7, we see that
[TABLE]
This is a contradiction.
Therefore, j=k or j=k+1 and
[TABLE]
Therefore, we see by (4.5) that
[TABLE]
by (3).
Further, since
ξk+1(z)≥ϵ for any z, we see that
ξk+1+′↑(xk+1)≥ξk+1+↑(yk+1)+q(ϵ)dist(xk+1,yk+1)−ϵ
by Lemma 2.6 (3).
Thus,
[TABLE]
Since
[TABLE]
by the definition of ξk+1, we see that
[TABLE]
and therefore,
[TABLE]
By Lemmas 4.13 and 4.14 and induction,
we see that ξt is defined and satisfies
- (1)
ξt(z)≥ϵ for any z∈P,
2. (2)
ξt(z)=ϵ if z∈{x1,…,xt,y0,…,yt−1}.
3. (3)
ξt+(C)≤d−ϵ for any maximal chain C in P and
4. (4)
ξt+↓(xi)+q(ϵ)dist(xi,yi)+ξt+↑(yi)=d
for 0≤i≤t,
where we set ξt+↓(x0)=ξt+↑(yt)=0.
Example 4.15
Let ϵ=1 and let P and y0, x1, y1, x2 be as follows.
[TABLE]
Then d=6,
[TABLE]
Let ϵ=1 and let P and y0, x1, y1, x2 be as follows.
[TABLE]
Then d=7,
[TABLE]
Let i be an integer with 1≤i≤t−1.
Take a saturated chain xi=z0<⋅z1<⋅⋯<⋅zu=yi
with uϵ=q(ϵ)dist(xi,yi).
Then z1, …, zu−1∈{x1,…,xt,y0,…,yt−1}.
In fact, if there is zℓ∈{x1,…,xt,y0,…,yt−1}
with 1≤ℓ≤u−1, then
zℓ=xi+1 or zℓ=yi−1 by condition N’ and Lemma 4.2.
If zℓ=xi+1, then
q(ϵ)dist(xi,xi+1)=ℓϵ
and q(ϵ)dist(xi+1,yi)=(u−ℓ)ϵ and therefore
[TABLE]
This contradicts to the assumption that y0, x1, …, yt−1, xt is
q(ϵ)-reduced.
Therefore, zℓ=xi+1.
We see that zℓ=yi−1 by the same way.
Thus, zℓ∈{x1,…,xt,y0,…,yt−1}
and therefore ξt(zℓ)=ϵ for 1≤ℓ≤u−1
by (2).
Take saturated chains
−∞<⋅z1′<⋅⋯<⋅zu′′=xi and
yi=z0′′<⋅⋯<⋅zu′′′<⋅∞
with
ξt+↓(xi)=∑ℓ=1u′ξt(zℓ′) and ξt+↑(yi)=∑ℓ=0u′′ξt(zℓ′′).
Then Ci:={z1′,…,zu′′,z1,…,zu−1,z0′′,…,zu′′′′}
is a maximal chain in P with xi, yi∈Ci and
ξt(z)=ϵ for any z∈Ci∩(xi,yi).
Further,
[TABLE]
by (5) above.
By a similar way, we can take maximal chains C0 and Ct with
ξt+(C0)=ξt+(Ct)=d−ϵ
and for ξt(z)=ϵ for any z∈(C0∩(−∞,y0))∪(Ct∩(yt,∞)).
Define ξ:P−→Z by
[TABLE]
Then by the facts above and Proposition 4.10,
we see the following.
Proposition 4.16
Let y0, x1, …, yt−1, xt
be a q(ϵ)-reduced sequence with condition N’ in P.
Set x0:=−∞ and yt:=∞.
Then there exists ξ∈S(ϵ) such that
Tξ is a generator of ω(ϵ) and
[TABLE]
Now we state characterizations of level and anticanonical level
properties of K[C(P)].
Theorem 4.17
The following conditions are equivalent.
- (1)
K[C(P)]* is level (resp. anticanonical level).*
2. (2)
q(1)-reduced (resp. q(−1)-reduced) sequence with condition N’ is the empty sequence only.
3. (3)
For any sequence y0, x1, …, yt−1, xt
with condition N’,
[TABLE]
(resp. q(−1)(x0,y0,…,xt,yt)≤q(−1)dist(x0,yt)),
where we set x0:=−∞ and yt:=∞.
Let ϵ=1 or −1.
We prove the level case and the anticanonical level case simultaneously
by setting ϵ=1 when considering the level case and ϵ=−1
when considering the anticanonical level case.
The contraposition of (1)⇒(2)
follows from the fact that
q(ϵ)(−∞,y0,x1,⋯,yt−1,xt,∞)>q(ϵ)dist(−∞,∞) for any nonempty q(ϵ)-reduced sequence y0, x1, …, yt−1, xt with condition N’,
since by
Proposition 4.16 and
Corollary 3.3,
there are generators of ω(ϵ) with degrees
q(ϵ)(−∞,y0,x1,⋯,yt−1,xt,∞) and
q(ϵ)dist(−∞,∞) respectively.
We next show (2)⇒(1).
Let Tξ, ξ∈S(ϵ) be an arbitrary generator of ω(ϵ) and set
d:=degTξ.
Then by Proposition 4.10, we see that there exists a q(ϵ)-reduced sequence
y0, x1, …, yt−1, xt with condition N’ and
C0, C1, …, Ct∈Cξ[d−ϵ]
satisfying conditions of (3) of Proposition 4.10.
By assumption t=0. Therefore ξ(z)=ϵ for any z∈C0.
Thus, ϵ(#C0)=ξ+(C0)=d−ϵ.
On the other hand, since
C0∪{−∞,∞} is a saturated chain from −∞ to ∞,
we see that d=ϵ(#C0)+ϵ=ϵ(#C0+1)≤q(ϵ)dist(−∞,∞).
Therefore, d=q(ϵ)dist(−∞,∞) by Corollary 3.3.
(3)⇒(2)**** is trivial.
In order to prove (2)⇒(3),
let y0, x1, …, yt−1, xt be an arbitrary sequence with condition N’.
If there are i, j with i<j and xi<yj
and
[TABLE]
then by setting xu′:=xu for 1≤u≤i,
xu′:=xu−j+i for i<u≤t−j+i,
yu′:=yu for 0≤u<i and
yu′:=yu−j+i for i≤u<t−j+i,
we get a sequence
y0′, x1′, …yt−j+i−1′, xt−j+i′
with condition N’
and
[TABLE]
where we set x0=x0′=−∞ and yt=yt−j+i′=∞.
Repeating this argument, we see that there is a q(ϵ)-reduced sequence
y0′′, x1′′, …, yt′′−1′′, xt′′′′ with condition N’
such that
[TABLE]
where we set x0′′:=−∞ and yt′′′′:=∞.
Since q(ϵ)-reduced sequence with condition N’ is the empty sequence only by assumption,
we see that t′′=0, i.e.,
[TABLE]
Note that if one replaces condition N’ to condition N in (2)
and (3) of Theorem 4.17, one obtains a criterion
of level (resp. anticanonical level) property of K[O(P)] [Miy1, Miy2].
Since condition N’ is a weaker condition than condition N, we see the following.
Corollary 4.18
If K[C(P)] is level (resp. anticanonical level), then so is K[O(P)].
The converse of this corollary does not hold.
Example 4.19
Let n, m1, m2 be integers with n≥4, m1, m2≥n−2
and let
P={a1, …, an, b1, …, bm1, c1, …, cm2, d}
be a poset with covering relations
a1<⋅⋯<⋅an,
b1<⋅⋯<⋅bm1<⋅d<⋅c1<⋅⋯<⋅cm2
and
a1<⋅d<⋅an.
[TABLE]
Then K[O(P)] is level and K[C(P)] is not.
In fact, it is easily verified that there is no q(1)-reduced sequence with condition N except the empty sequence.
Thus, K[O(P)] is level.
However, d, a1, an, d is a q(1)-reduced sequence with condition N’.
Further, if we define ξ:P−→Z by
[TABLE]
then Tξ is a generator of ω with
degTξ=m1+m2+n−1,
while the minimal degree of the generators of ω is
q(1)dist(−∞,∞)=m1+m2+2<m1+m2+n−1,
since n≥4.
Example 4.20
Let n be a positive integer
and let
P={a1, …, an+3, b1, …, bn, c1, …, cn, d1, d2, d3}
be a poset with covering relations
a1<⋅⋯<⋅an+3, d1<⋅d2<⋅d3,
a1<⋅b1<⋅⋯<⋅bn<⋅d2<⋅c1<⋅⋯<⋅cn<⋅an+3.
[TABLE]
Then K[O(P)] is anticanonical level and K[C(P)] is not.
In fact, it is easily verified that there is no q(−1)-reduced sequence with condition N except the empty sequence.
Thus, K[O(P)] is anticanonical level.
However, d2, a1, an+3, d2 is a q(−1)-reduced sequence with condition N’.
Further, if we set
ξ:P−→Z by
[TABLE]
then Tξ is a generator of ω(−1) with degree n−4,
while the minimal degree of the generators of ω(−1) is
q(−1)dist(−∞,∞)=−4.
5 Degrees of the generators of canonical and anticanonical ideals
In this section, we show that the degrees of generators of ω and ω(−1)
are consecutive integers.
Since the cases of ω and ω(−1) are similar, we set ϵ=1 or −1
and treat the cases of ω and ω(−1) simultaneously.
Recall that the minimal degree of the generators of ω(ϵ) is q(ϵ)dist(−∞,∞)
by Corollary 3.3.
We first note the following fact.
Lemma 5.1
Let ξ∈S(ϵ) and d=ξ(−∞).
Suppose that C1, C2∈Cξ[d−ϵ] and
z∈C1∩C2.
Then
(C1∩(−∞,z])∪(C2∩(z,∞))∈Cξ[d−ϵ].
Set
C=(C1∩(−∞,z])∪(C2∩(z,∞)) and
C′=(C2∩(−∞,z])∪(C1∩(z,∞)).
Then, it is easily verified that C and C′ are maximal chains in P.
Further,
[TABLE]
and
[TABLE]
Since
∑c∈C1∩(−∞,z]ξ(w)+∑c∈C1∩(z,∞)ξ(w)=ξ+(C1)=d−ϵ
and
∑c∈C2∩(−∞,z]ξ(w)+∑c∈C2∩(z,∞)ξ(w)=ξ+(C2)=d−ϵ,
we see that
[TABLE]
**On the other hand, since ξ∈S(ϵ), we see that ξ+(C′′)≤d−ϵ
for any maximal chain C′′ in P.
Thus, we see that
ξ+(C)=ξ(C′)=d−ϵ.
**
Next we show the following fact.
Lemma 5.2
Let ξ be an element of S(ϵ) with d=ξ(−∞)>q(ϵ)dist(−∞,∞).
Then for any C∈Cξ[d−ϵ], there exists z∈C such that ξ(z)>ϵ.
**Assume the contrary and take C∈Cξ[d−ϵ] with ξ(c)≤ϵ for any
c∈C.
Since ξ∈S(ϵ), we see that ξ(c)=ϵ for any c∈C.
Therefore,
d−ϵ=ξ+(C)=ϵ(#C)=ϵ(#(C∪{−∞,∞})−1)−ϵ≤q(ϵ)dist(−∞,∞)−ϵ.
This contradicts to the assumption that d>q(ϵ)dist(−∞,∞).
**
Now we prove the following.
Lemma 5.3
Let ξ be an element of S(ϵ) such that Tξ is a generator of ω(ϵ) with
degree d>q(ϵ)dist(−∞,∞).
Define ξ1:P−→Z by
[TABLE]
Then ξ1∈S(ϵ) and Tξ1 is a generator of ω(ϵ) with degree d−1.
First we show that ξ1∈S(ϵ).
It is clear that ξ1(z)≥ϵ for any z∈P by the definition of ξ1.
Let C be an arbitrary maximal chain in P.
Then ξ+(C)≤d−ϵ since ξ∈S(ϵ).
If ξ+(C)≤d−ϵ−1, then ξ1+(C)≤d−ϵ−1, since
ξ1(z)≤ξ(z) for any z∈P.
Suppose that C∈Cξ[d−ϵ].
Then by Lemma 5.2, we see that there is z∈C
with ξ(z)>ϵ.
Therefore, if we set z=max{c∈C∣ξ(c)>ϵ}, then
ξ1(z)=ξ(z)−1.
Thus, we see that
[TABLE]
Now we show that Tξ1 is a generator of ω(ϵ).
Since Tξ is a generator of ω(ϵ), we see by Proposition 4.10
that there is a q(ϵ)-reduced sequence y0, x1, …, yt−1, xt with condition N’
and C0, C1, …, Ct∈Cξ[d−ϵ]
which satisfy the conditions of (3) of Proposition 4.10.
If t=0, then C0∈Cξ[d−ϵ] and ξ(z)=ϵ for any z∈C0.
This contradicts to Lemma 5.2.
Thus, we see that t>0.
Further, we see that
{c∈Ci∣ξ(c)>ϵ}=∅ for 0≤i≤t.
In particular, {c∈Ci∣ξ1(c)=ξ(c)−1}=∅ for 0≤i≤t.
Set zi:=min{c∈Ci∣ξ1(c)=ξ(c)−1} for 0≤i≤t.
Since ξ(c)=ϵ for any c∈Ct∩(xt,∞),
we see that zt≤xt.
Set j:=min{i∣zi≤xi}.
Then j>0.
Further, for any i with 0≤i<j, zi≥yi.
For i with 0≤i≤j, take Ci′∈Cξ[d−ϵ] with
zi=max{c∈Ci′∣ξ(c)>ϵ}.
Then by Lemma 5.1, we see that
[TABLE]
and moreover, by the definition of zi, and the choice of Ci′,
{c∈Ci′′∣ξ1(c)=ξ(c)}={zi}.
In particular, ξ1+(Ci′′)=d−ϵ−1 for 0≤i≤j since ξ1(zi)=ξ(zi)−1.
**Since
y0>x1<y1>x2<⋯<yj−1>zj,
y0∈C0′′, zj∈Cj′′, xi, yi∈Ci′′ for 1≤i≤j−1
and
Ci′′∈Cξ1[d−1−ϵ] for 0≤i≤j
and
ξ1(z)=ϵ for any z∈Ci′′∩(xi,yi) for i with 0≤i≤j−1
and z∈Cj′′∩(zj,∞),
we see by Proposition 4.10 that Tξ1 is a generator of ω(ϵ).
**
Now we show the following.
Theorem 5.4
Let P be a finite poset.
Set d0:=q(1)dist(−∞,∞)
(resp. d0:=q(−1)dist(−∞,∞))
and
dmax:=max{∑ℓ=0tq(1)(x0,y0,…,xt,yt)∣y0, x1, …,
yt−1, xt is a q(1)-reduced sequence with condition N’, where x0=−∞ and yt=∞}
(resp. dmax:=max{∑ℓ=0tq(−1)(x0,y0,…,xt,yt)∣y0, x1, …,
yt−1, xt is a q(−1)-reduced sequence with condition N’, where x0=−∞ and yt=∞}).
Then for any integer d with d0≤d≤dmax, there exists a generator of ω
(resp. ω(−1)) of degree d.
**We prove the assertions of ω and ω(−1) simultaneously by setting
ϵ=1 or −1.
By Corollary 3.3, we see that arbitrary generator of ω(ϵ) has degree
greater than or equals to d0.
Further, by Corollary 4.11, we see that any generator of ω(ϵ)
has degree less than or equals to dmax.
On the other hand, we see by Proposition 4.16 that there is a generator
of ω(ϵ) with degree dmax.
Thus, by Lemma 5.3 and the backward induction, we see the result.
**
By the same argument as the end of §3, we see the following fact.
Corollary 5.5
Let G be a finite graph.
Suppose that each odd cycle of G has a triangular chord.
Then the degree of the generators of the canonical and anticanonical ideals of the Ehrhart ring of
the stable set polytope of G are consecutive integers.