Conjectures P1-P15 for hyperbolic Coxeter groups of rank 3
Jianwei Gao
Beijing International Center for Mathematical Research, Peking University, Beijing 100871, China
[email protected]
and
Xun Xie
School of Mathematics and Statistics, Beijing Institute of Technology, Beijing 100081, China
[email protected]
Abstract.
We prove Lusztig’s conjectures P1-P15 for hyperbolic Coxeter groups of rank 3.
Our proof enables us to give a description of the a-function and Kazhdan-Lusztig cells for these Coxeter groups.
Key words and phrases:
a-functions, two-sided cells, Conjectures P1-P15, Coxeter groups of rank 3
2010 Mathematics Subject Classification:
Primary 20C08; Secondary 20F55
Contents
- 1 Introduction
- 2 Preliminaries
- 3 Coxeter groups of dimension 2
- 4 Dihedral groups
- 5 Expansions of some products
- 6 Conditions for the equality
- 7 A property of length adding
- 8 Estimation of degrees
- 9 Conclusions
1. Introduction
Lusztig proposed a series of conjectures, called P1-P15, on Hecke algebras with unequal parameters in [Lus03, §14]. They are stated in a very general form, i.e. for any finitely generated Coxeter group and any positive weight function. These conjectures predict that there are nice relations between a-functions and cells, and one can define a kind of asymptotic rings.
Lusztig proved these conjectures for constant weight functions (the equal parameter case) by assuming the boundedness conjecture about the a-function [Lus03, §13.4] and the positivity of the Kazhdan-Lusztig basis. The positivity has been proved by [EW14], using some deep ideas from the Hodge theory. However, there is no positivity for the unequal parameter case, and the problem becomes mysterious. Up to now we have no efficient way to prove P1-P15 for arbitrary parameters.
The main difficulty probably lies in computing a-functions.
In [Lus03], Lusztig proved P1-P15 for infinite dihedral groups and the quasi-split case.
For P1-P15 of finite Weyl groups, only the case of type Bn with “non-asymptotic parameters” remains open, see [Gec11] and references therein. The universal Coxeter group case is proved in [SY15]. Recently, the case of affine Weyl groups of rank 2 is proved in [GP18, GP19], by studying cell representations
and a connection with the Plancherel formula.
This paper is a subsequent work of [Xie19], where the second named author proved P1-P15 for Coxeter groups with complete graph and right-angled Coxeter groups. The aim of this paper is to complete the proof of conjectures P1-P15 for all Coxeter groups of rank 3. The cases of finite and affine types are known, see [Bon17, 25A.1] and [GP18, GP19].
Thus we focus on hyperbolic Coxeter groups of rank 3.
Since the cases of Coxeter groups with complete graph and right-angled Coxeter groups have been proved in [Xie19], we only need to consider Coxeter groups (W,S)
such that S={r,s,t}, mrt=2, mrs1+mrs1<21, and at least one of mrs, mst is not ∞.
These groups are divided into three classes in our proofs:
∞=mrs>mst≥3;
∞>mrs,mst≥4 but (mrs,mst)=(4,4);
∞>mrs≥7,mst=3.
Their Coxeter graphs look like
r$$s$$t$$m_{rs}$$m_{st}
.
The main methods of proving P1-P15 in [Xie19] are applying decreasing induction on a-values and proving a kind of decomposition formula for some Kazhdan-Lusztig basis elements in a quotient algebra.
In this paper, we prove P1-P15 for Coxeter groups in (1) (2) and (3) by similar methods.
However, the proofs of some key properties become complicated. In fact all the sections 4–8 of this paper are devoted to prove them. Once we obtain these properties, we can repeat arguments in [Xie19] to prove P1-P15, see [Xie19, §9].
The proofs in sections 6-8 depend on some explicit expansions of products in the Hecke algebra (section 5). Since results from section 5 are discrete, we have to verify case by case in sections 6-8.
The ideas of the proofs are simple, and for most cases the verification is easy.
The a-functions and cells are often not easy to determine, even for equal parameter cases. A benefit of our proof of P1-P15 is that we have a description of the a-functions and left (right) cells, see Theorem 9.2. In the complete graph case, each WN (the set of elements of W with a-value N) is either empty or a two-sided cell. However this is not correct in our present situation. We give a complete list of cases where WN contains more than one two-sided cells, see Theorem 9.6. As a corollary, we conclude that, in the equal parameter case, a non-empty WN is always a two-sided cell. This confirms [BGS14, Conj. 3.1] in the case of rank 3. At last, we give some examples to show how the cell partitions depend on the parameters, which should be helpful for understanding the semi-continuity conjecture formulated in
[Bon09].
This article is organized as follows.
In section 2, we prepare some notations and basic facts.
In section 3, we state Conjecture 3.1 for Coxeter groups of dimension 2, and then claim that it implies P1-P15 (Theorem 3.2).
A more general form of Conjecture 3.1 is given in [Xie19, §9].
In section 4, we prepare some facts about dihedral groups that we will use. In section 5, we give explicit expansions of some products, which are fundamental in our proof of key properties. The main goal of sections 6-8 is to prove Conjecture 3.1 for those Coxeter groups listed above, see Proposition 6.1, Lemma 7.1, and Proposition 8.1. In the section 9, we arrive at our main result and determine two-sided cells.
2. Preliminaries
Let us fix some notations. Let (W,S) be a Coxeter group with ∣S∣<∞. For s,t∈S, mst∈N∪{∞} is the order of st in W. The neutral element of W is denoted by e. We have the length function l:W→N. For I⊆S, the parabolic subgroup generated by I is denoted by WI. If I is finite, the longest element is denoted by wI. For s,t∈S with s=t, we use notation Wst instead of W{s,t} and wst instead of w{s,t}. If x∈W can be expressed as a product x1x2…xk of some elements xi∈W with l(x)=∑1≤i≤kl(xi), then we say x1x2…xk is a reduced product. We use the notation x1⋅x2⋅…⋅xk to indicate that x1x2…xk is a reduced product. For x,y∈W, we say x appears in y, if there exist w,z∈W such that y=w⋅x⋅z. For x∈W,
L(x)={s∈S∣sx<x},R(x)={s∈S∣xs<x}.
Let L:W→N be a weight function on W. In other words, L satisfies L(xy)=L(x)+L(y) for any x,y∈W with l(xy)=l(x)+l(y). Unless otherwise stated, L is assumed to be positive, i.e. L(s)>0 for any s∈S. We call (W,S,L) a (positively) weighted Coxeter group. Let A=Z[q,q−1] be the ring of Laurent polynomials in indeterminate q. The Hecke algebra H of (W,S,L) is a unital associative algebra over A with A-basis {Tw∣w∈W} subject to relations:
[TABLE]
[TABLE]
For 0=a=∑iαiqi∈A with αi∈Z, we define dega=max{i∣αi=0}. For 0∈A, we define deg0=−∞. For h=∑w∈WawTw∈H with aw∈A, we define degh=max{degaw∣w∈W}. This gives a function deg:H→Z∪{−∞}.
Denote by Cw, w∈W the Kazhdan-Lusztig basis of H. We have Cw=∑y≤wpy,wTy with py,w∈A<0=q−1Z[q−1] for y<w and pw,w=1. Moreover, Cw is invariant under the bar involution q of H such that q=q−1 and Tw=Tw−1−1. Using Kazhdan-Lusztig basis, one can define preorders ≺L, ≺R, ≺LR and equivalence relations ∼L, ∼R, ∼LR on W. The associated equivalence classes are called respectively left cells, right cells and two-sided cells. Let fx,y,z and hx,y,z be elements of A given by
[TABLE]
For w∈W, define
[TABLE]
Then a:W→N∪{∞} is called Lusztig’s a-function. Define γx,y,z−1∈Z to be the coefficient of qa(z) in hx,y,z.
For w∈W, integers Δ(w) and nw are
defined by
[TABLE]
Let D={z∈W∣a(z)=Δ(z)}.
For N∈N, we set
[TABLE]
[TABLE]
and similarly define W≤N, W<N. Let D≥N=D∩W≥N, and similarly define DN etc. The boundedness conjecture says that
[TABLE]
This conjecture holds for Coxeter groups of rank 3 by [Zho13, Gao19].
Conjecture 2.1**.**
Let N∈N.
(P1)≥N. For any w∈W≥N, we have a(w)≤Δ(w).
(P2)≥N. If z∈D≥N and x,y∈W such that γx,y,z=0, then x=y−1.
(P3)≥N. If y∈W≥N, there exists a unique z∈D such that γy−1,y,z=0.
(P4)≥N. If w′≺LRw with w∈W≥N, then a(w′)≥a(w).
(P5)≥N. If z∈D≥N, y∈W, γy−1,y,z=0, then γy−1,y,z=nz=±1.
(P6)≥N. For any z∈D≥N, we have z2=e.
(P7)≥N. For any x,y,z∈W with one of them belonging to W≥N, we have γx,y,z=γy,z,x=γz,x,y.
(P8)≥N. For any x,y,z∈W with one of them belonging to W≥N, then γx,y,z=0 implies that x∼Ly−1, y∼Lz−1, z∼Lx−1.
(P9)≥N. If w′≺Lw with w∈W≥N and a(w′)=a(w), then w′∼Lw.
(P10)≥N. If w′≺Rw with w∈W≥N and a(w′)=a(w), then w′∼Rw.
(P11)≥N. If w′≺LRw with w∈W≥N and a(w′)=a(w), then w′∼LRw.
(P12)≥N. For any I⊆S and y∈WI∩W≥N, the a-value of y in WI is equal to that in W.
(P13)≥N. Any left cell Γ⊆W≥N contains a unique element z in D. And for such z, Γ, and any y∈Γ, we have γy−1,y,z=0.
(P14)≥N. For any w∈W≥N, we have w∼LRw−1.
(P15)≥N. For w,w′∈W and x,y∈W≥N such that a(x)=a(y), we have
[TABLE]
These conjectures are referred to as (P1-P15)≥N. Similarly, by replacing ≥N by >N (resp. N) in Conjecture 2.1, we get (P1-P15)>N (resp. (P1-P15)N).
Since W≥0=W, (P1-P15)≥0 is just Lusztig’s conjectures P1-P15 from [Lus03, §14.2].
Assume that N is an integer such that W>N is ≺LR-closed. Then we can form a quotient algebra H≤N of H by the subspace H>N spanned by {Cw∣w∈W>N} over A. For any w∈W, the image of Tw (resp. Cw) in H≤N is denoted by NTw (resp. NCw), and {NTw∣w∈W≤N} and {NCw∣w∈W≤N} form two A-basis of H≤N, see [Xie19, Lem. 3.2 and 3.3]. For h=∑z∈W≤NbzNTz∈H≤N, we define
[TABLE]
This gives rise to a function deg:H≤N→N∪{−∞}. Note that NCz=0 and
deg(NTz)<0 for z∈W>N.
For x,y,z∈W≤N, let Nfx,y,z be the element of A given by
[TABLE]
By [Xie19, Lem. 3.4], for any x,y∈W≤N, we always have
[TABLE]
and
[TABLE]
If we further assume (P1)>N, (P4)>N, (P8)>N hold, then
[TABLE]
3. Coxeter groups of dimension 2
In this section, (W,S) is a Coxeter group such that all its finite parabolic subgroups have rank 1 or 2, and at least one of them has rank 2.
We say that this kind of Coxeter group has dimension 2, because its Davis complex has dimension 2. For example, infinite Coxeter groups of rank 3 have dimension 2.
Let
[TABLE]
Let a′:D→N be the function given by
[TABLE]
For N∈N, we define
[TABLE]
For N∈N and d∈DN, we define
[TABLE]
Conjecture 3.1**.**
Assume that W is a Coxeter group of dimension 2, and N is an integer such that W>N=Ω>N and W>N is ≺LR-closed. Then we have the following properties.
The equality in (2.2) holds only if y∈Ω≥N.
For any d∈DN, b∈Bd, y∈Ud, we have
l(bdy)=l(b)+l(d)+l(y).
If d∈DN, x∈Ud−1, y∈Ud, w≤d, then
[TABLE]
If moreover x∈Bd, w<d, then
[TABLE]
Theorem 3.2**.**
If Conjecture 3.1 and the boundedness conjecture (2.1) hold for (W,S) and its all parabolic subgroups, then P1-P15 hold for (W,S).
Proof.
See [Xie19, §9].
∎
Thus for the aim of this paper it suffices to prove Conjecture 3.1 for those Coxeter groups that are listed in section 1. We first prepare some results in the following two sections.
4. Dihedral groups
In this section, (WI,I,L) is a weighted dihedral group with I={s,t} and 2≤mst≤∞.
If mst≥4 is even and L(s)=L(t), we set I={s1,s2} with L(s1)>L(s2), dI=s2wI, dI′=s1wI, and define a (nonpositive) weight function L′:WI→Z by L′(s1)=L(s1) and L′(s2)=−L(s2).
4.1. Possible monomials in fu,v,w
For u,v,w∈WI, fu,v,w is a polynomial of ξs and ξt with nonnegative coefficients. We view ξs and ξt as variables, and say ξsmξtn appears in fu,v,w if the coefficient of ξsmξtn in fu,v,w is nonzero. (It is possible that ξs=ξt, but this does not affect the following statements.)
Lemma 4.1**.**
Assume ∞=mst≥3.
For u,v∈WI∖{wI}, consider possible monomials that appear in fu,v,sts. At least one of the following (maybe overlapped) situations happens:
fu,v,sts=0* or has a nonzero constant term;*
ξs* appears in fu,v,sts, and (u,v) is one of the following pairs:*
(s⋅u′,u′−1⋅sts)* for some u′∈WI;*
(twI,wIs);
(sts⋅u′,u′−1⋅s)* for some u′∈WI;*
(swI,wIt);
ξt* appears in fu,v,sts, and (u,v) is one of the following pairs:*
(st⋅u′,u′−1⋅ts)* for some u′∈WI;*
(swI,wIs).
Proof.
Assume first ξs=ξt.
We consider the product TstsTu since fu,v,sts=fsts,u,v−1. If ξs2ξt or ξsξt or ξs2 appears in fu,v,w, it is easy to see u=wI or v=wI, which contradicts with the assumption u,v=wI.
Suppose ξs appears in fu,v,sts=fsts,u,v−1 and consider the product TstsTu. If the third factor of sts gives ξs, then L(u)={s}, stu=v−1. Thus,
if t⋅u<wI, then (u,v)=(s⋅u′,u′−1⋅sts) for some u′∈WI;
if t⋅u=wI, then (u,v)=(twI,wIs).
Similarly if the first factor of sts gives ξs, then s∈L(tsu) and tsu=v−1. Since u,v=wI, we have two cases:
if L(u)={s}, then (u,v)=(sts⋅u′,u′−1⋅s) for some u′∈WI;
if L(u)={t}, then (u,v)=(swI,wIt) for some u′∈WI.
Suppose ξt appears in fu,v,sts=fsts,u,v−1. Then we have t∈L(su) and u=v−1.
If L(u)={s}, then u=st⋅u′=v−1 for some u′∈WI. If L(u)={t},
then su=wI, and u=swI=v−1.
Now the lemma follows for ξs=ξt. But for ξs=ξt similar arguments shows that the same statement is valid: at least one of (1)(2)(3) happens.
∎
Similarly, we have following three lemmas.
Lemma 4.2**.**
Assume that mst=∞. For u,v∈WI, consider possible monomials that appear in fu,v,sts. We must be in (at least) one of the following situations.
fu,v,sts=0* or has a nonzero constant term;*
ξs* appears in fu,v,sts, su<u and vs<v;*
ξt* appears in fu,v,sts, and (u,v)=(st⋅u′,u′−1⋅ts) for some u′∈WI.*
Lemma 4.3**.**
Assume ∞=mst≥2.
For u,v∈WI, consider possible monomials that appear in fu,v,st. We must be in one of the following situations:
fu,v,st=0* or has a nonzero constant term;*
ξsξt* appears in fu,v,st, and (u,v)=(wI,wI);*
ξs* appears in fu,v,st, and (u,v) is one of the following pairs:*
(u,v)=(s⋅u′,u′−1⋅st),
(u,v)=(wI,wIt);
ξt* appears in fu,v,st, and (u,v) is one of the following pairs:*
(u,v)=(st⋅v′,v′−1⋅t),
(u,v)=(swI,wI).
Lemma 4.4**.**
Assume that mst=∞. For u,v∈WI, consider possible monomials that appear in fu,v,st. We must be in one of the following situations.
fu,v,st=0* or has a nonzero constant term;*
ξs* appears in fu,v,st, and (u,v)=(s⋅u′,u′−1⋅st) for some u′∈WI;*
ξt* appears in fu,v,st, and (u,v)=(st⋅u′,u′−1⋅t) for some u′∈WI.*
4.2. Possible degrees of δ
In this subsection, 3≤mst<∞.
Lemma 4.5**.**
Let u,v∈WI. If fu,v,wI=0, then degfu,v,wI=L(u)+L(v)−L(wI).
Proof.
See [Xie19, Lem.4.6].
∎
Lemma 4.6**.**
Assume that u,v∈WI∖{wI}. For δ=degfu,v,wIpsts,wI, we must be in one of the following situations.
δ≤0;
L(s)=L(t), δ=L(s), and l(u)=l(v)=mst−1;
L(s)=L(t), δ=L(t), and u=v=swI;
L(s)=L(t), δ=L(s), and {u,v}={dI,dI′};
L(s)=L(t), δ=2L(s)−L(t)>0, and u=v=twI;
L(s)>L(t), δ=L(s)−L(t), and u=dI, L(v)=L(wI)−L(st);
L(s)>L(t), δ=L(s)−2L(t), and u=dI, L(v)=L(wI)−L(tst).
Proof.
Assume δ>0. By Lemma 4.5, we have
[TABLE]
Assume L(s)=L(t). Then the possible values of L(wI)−L(u) are L(s), 2L(s), 3L(s),⋯. Thus δ=L(s) and l(u)=l(v)=l(wI)−1.
Assume L(t)>L(s). Then the possible values of L(wI)−L(u) (resp. L(wI)−L(v)) are
[TABLE]
Then
δ=L(t),L(s),2L(s)−L(t),
and we are in one of the following situations:
δ=L(t), and u=v=dI;
δ=L(s), and {u,v}={dI′,dI};
δ=2L(s)−L(t)>0, and u=v=dI′.
Similarly, if L(s)>L(t), then we are in one of the following situations:
δ=2L(s)−L(t), and u=v=dI;
δ=L(s), and {u,v}={dI′,dI};
δ=L(t), and u=v=dI′;
δ=L(s)−L(t), and u=dI, L(v)=L(wI)−L(st);
δ=L(s)−2L(t), and u=dI, L(v)=L(wI)−L(tst).
This completes the proof.
∎
Corollary 4.7**.**
Assume that u,v∈WI∖{wI}. For δ=degfu,v,wIpsts,wI, we must be in one of the following situations.
δ≤0;
su<u* or vs<v, and δ<2L(s);*
tu<u* and vt<v, and δ=L(t).*
Similarly, one can prove the following lemma, see also [Xie19, Lem.4.7].
Lemma 4.8**.**
Assume that u,v∈WI∖{wI}. For δ=degfu,v,wIpst,wI, we must be in one of the following situations.
δ≤0;
L(s)=L(t), δ=∣L(s)−L(t)∣, and u=v=dI.
4.3. Possible degrees of γ
In this subsection, 3≤mst<∞.
Lemma 4.9**.**
Assume L(s)=L(t). For any w≤dI, we have
[TABLE]
Proof.
See [Xie19, Lem.4.4].
∎
Lemma 4.10**.**
Assume L(t)>L(s).
Let u,v∈WI∖{wI}, and write
[TABLE]
Then
if vs<v, then F(u,v)=−q−L(s)F(u,vs);
if su<u, then F(u,v)=−q−L(s)F(su,v);
if su>u and vs>v, then
if l(u)+l(v)<2m−1, F(u,v)=0,
if l(u)+l(v)=2m−1, F(u,v)=1,
if l(u)+l(v)=2m,
[TABLE]
if l(u)+l(v)>2m, then degF(u,v)=L′(u)+L′(v)−L′(dI).
Proof.
See [Xie19, Lem.4.8].
∎
Corollary 4.11**.**
Assume that L(s)=L(t) and u,v,sts∈WI∖{wI,dI}. For γ:=deg(fu,v,dI−fu,v,wIpdI,wI)psts,dI, we must be in one of the following situations.
γ≤0.
L(s)>L(t), su<u, vs<v, and γ≤L(t).
Proof.
If L(t)>L(s), then by Lemma 4.10, we have γ≤L(t)−2L(s)−2(L(t)−L(s))=−L(t).
If L(s)>L(t), then γ≤2L(s)−L(t)−2(L(s)−L(t))=L(t). Note that sts=dI implies that mst≥6. By Lemma 4.10, if tu<u or vt<v, then we have γ≤0.
Thus, if γ>0, then we have su<u and vs<v. Note that by Lemma 4.10 we have γ≤0 if u=e or v=e.
∎
Similarly, we have the following corollary, see also [Xie19, Lem.4.10].
Corollary 4.12**.**
Assume that L(s)=L(t) and u,v,st∈WI∖{wI,dI}. For γ:=deg(fu,v,dI−fu,v,wIpdI,wI)pst,dI, we always have
γ≤0.
Corollary 4.13**.**
Let u,v∈WI∖{wI} and w∈W with l(w)≥2. Then we have
degfu,v,w<L(w).
degfu,v,wIpw,wI<L(w).
Moreover, if L(s)=L(t), then we have
deg(fu,v,dI−fu,v,wIpdI,wI)pw,dI<L(w).
Proof.
(1) First we have degfu,v,w≤L(w). If the equality holds, since fu,v,w=fw−1,u,v−1 and l(w)≥2, we must have u=wI, a contradiction.
(2) If fu,v,wI=0, there is nothing to prove. If fu,v,wI=0, by Lemma 4.5, we have
[TABLE]
(3) If w≰dI, it is obvious. If w≤dI, by Lemma 4.9 and Lemma 4.10, we have
[TABLE]
∎
5. Expansions of some products
In sections 5, 6, 7, 8, we assume (W,S) is a Coxeter group of rank 3 from section 1. We have S={r,s,t} and mrt=2.
Definition 5.1**.**
For x,w,y,x′,w′,y′∈W, we call (x′,w′,y′) the transpose of (x,w,y) if
[TABLE]
Definition 5.2**.**
For x,w,y,x′,y′∈W, we say (x′,w,y′) is a reduced extension of (x,w,y) if there exists u,v∈W such that
x′=u⋅x,
y′=y⋅v,
l(uzv)=l(u)+l(z)+l(v)* for any z∈W such that fx,y,z=0.*
5.1. The case of ∞=mrs>mst≥3.
Lemma 5.3**.**
Let w,x,y∈W.
There is no w1,w2∈W such that w=w1⋅r=w2⋅s.
If w=w1⋅st, then r∈/R(w).
If w=w1⋅rs, then R(w)={s}.
If w∈Wrs, l(w)≥4, R(x), L(y)⊆{t}, then l(xwy)=l(x)+l(w)+l(y).
If R(x), L(y)⊆{s}, then l(xrty)=l(x)+l(y)+2.
If w∈Wst, l(w)≥2, R(x), L(y)⊆{r}, then l(xwy)=l(x)+l(w)+l(y).
Proof.
See [Gao19, 3.1, 3.2].
∎
Lemma 5.4**.**
Assume that I⊆S, ∣I∣=2, w∈WI, l(w)≥2 and R(x)∪L(y)⊆S∖I.
If l(xwy)<l(x)+l(w)+l(y), then (x,w,y) or its transpose is in the following cases.
w=srs, x=x′⋅wsts, y=swst⋅y′ for some x′,y′∈W with R(x′),L(y′)⊆{r}. In this case we have
[TABLE]
w=rs, x=x′⋅t, y=swst⋅y′ for some x′,y′∈W with R(x′)⊆{s}, L(y′)⊆{r}. We have
[TABLE]
Proof.
Since l(xwy)<l(x)+l(w)+l(y), by Lemma 5.3(4)(5)(6), we must have I={r,s} and 2≤l(w)≤3.
If w=srs, we claim that R(xs)={s,t}. Otherwise, R(xs)={s}, and then R(xsr)={r}.
We assume y=y1⋅y2 for some y1∈Wst∖{e} and y2∈W with L(y2)⊆{r}. Since s⋅y1∈Wst and l(sy1)≥2, by Lemma 5.3(6), we have
[TABLE]
It is a contradiction. Similarly, we can prove L(sy)={s,t}. Now we assume x=x′⋅wsts, y=swst⋅y′ for some x′,y′∈W with R(x′),L(y′)⊆{r}.
Since L(r⋅twst⋅y′)={r}, by Lemma 5.3(6), we have
[TABLE]
If w=rsr, we assume x=x′⋅t for some x′∈W with R(x′)⊆{s}. By Lemma 5.3(3), we know L(sr⋅y)={s}, so we have
[TABLE]
At last, we consider w=rs and the case of w=sr is similar. We assume x=x′⋅t for some x′∈W with R(x′)⊆{s}.
If L(sy)={s}, then l(x)+l(rs)+l(y)=l(x′)+l(rt)+l(sy)=l(xrsy) by Lemma 5.3(5). So we must have L(sy)={s,t}. We assume y=swst⋅y′ for some y′∈W with L(y′)⊆{r}.
Since R(x′r)={r}, by Lemma 5.3(6), we have
[TABLE]
This completes the proof.
∎
5.2. The case of ∞>mrs,mst≥4 but (mrs,mst)=(4,4)
Lemma 5.5**.**
Let w,x,y∈W.
If w=w1⋅ts, then r∈/R(w).
If w=w1⋅rs, then t∈/R(w).
If w=w1⋅st, R(w1s)={s}, then r∈/R(w).
If w=w1⋅sr, R(w1s)={s}, then t∈/R(w).
If w=w1⋅tst, then r∈/R(w).
If w=w1⋅rsr, then t∈/R(w).
There is no w1,w2∈W such that w=w1⋅st=w2⋅sr.
If L(w)⊆{r}, then L(r⋅twst⋅w)={r}.
If L(w)⊆{t}, then L(t⋅rwrs⋅w)={t}.
If w∈Wst, l(w)≥4, R(x),L(y)⊆{r},
then l(xwy)=l(x)+l(w)+l(y).
If w∈Wrs, l(w)≥4, R(x),L(y)⊆{t},
then l(xwy)=l(x)+l(w)+l(y).
If R(x),L(y)⊆{s}, R(xt)={t}, R(xr)={r},
then l(xtry)=l(x)+l(y)+2.
If R(x),L(y)⊆{r}, R(xs)={s} or L(sy)={s},
then l(xstsy)=l(x)+l(y)+3.
If R(x),L(y)⊆{t}, R(xs)={s} or L(sy)={s},
then l(xsrsy)=l(x)+l(y)+3.
If mrs≥5, R(x),L(y)⊆{r}, then l(xtsty)=l(x)+l(y)+3.
If mst≥5, R(x),L(y)⊆{t}, then l(xrsry)=l(x)+l(y)+3.
Note that the lemmas are still correct after exchanging r and t.
Proof.
See [Gao19, 4.1, 4.2].
∎
Lemma 5.6**.**
Assume that I⊆S, ∣I∣=2, w∈WI, l(w)≥2 and R(x)∪L(y)⊆S∖I.
If l(xwy)<l(x)+l(w)+l(y), then (x,w,y), or its transpose, or the one with r, t exchanged, is in one of the following cases:
w=srs, x=x′⋅wsts, y=swst⋅y′ for some x′,y′∈W with R(x′),L(y′)⊆{r}. We have
[TABLE]
w=rsr, mst=4, x=x′′⋅wrsr⋅t and y=t⋅rwrs⋅y′′ for some x′′,y′′∈W with R(x′′),L(y′′)⊆{t}. We have
[TABLE]
w=rt, x=x′⋅wrsr, y=twst⋅y′ for some x′,y′∈W with R(x′)⊆{t}, L(y′)⊆{r}. We have
[TABLE]
w=rs.
- 1
x=x′′⋅wrsr⋅t, y=swst⋅y′ for some x′′,y′∈W with R(x′′)⊆{t}, L(y′)⊆{r}, L(stwsty′)={t}. We have
[TABLE]
2. 2
mst=4, x=x′′⋅wrsr⋅t, y=swst⋅swrs⋅y′′ for some x′′,y′′∈W with R(x′′)⊆{t}, L(y′′)⊆{t}. We have
[TABLE]
3. 3
x=x′⋅t, y=swst⋅y′ for some x′,y′∈W with R(x′)⊆{s}, R(x′r)={r}, L(y′)⊆{r}.
At least one of mst≥5, R(x′rs)={s} and L(sy′)={s} holds. We have
[TABLE]
4. 4
mst=4, x=x′′⋅wrssr⋅t, y=swst⋅swrs⋅y′′ for some x′′,y′′∈W with R(x′′)⊆{t}, L(y′′)⊆{t}. We have
[TABLE]
5. 5
x=x′′⋅(wrsr)⋅t, y=stwst⋅y′′ for some x′′,y′′∈W with R(x′′)⊆{t}, L(y′′)⊆{r}. We have
[TABLE]
Proof.
If l(w)≥4, then I={s,r} or I={s,t}. By Lemma 5.5(10)(11), we have l(xwy)=l(x)+l(w)+l(y).
If l(w)=3, we may assume I={s,r} because the case of I={s,t} is similar. Firstly we consider w=srs. Since R(x),L(y)⊆{t}, by Lemma 5.5(1),
we get R(xs)={s} or {s,t}, L(sy)={s} or {s,t}. If R(xs)={s} or L(sy)={s}, then we have l(xwy)=l(x)+l(w)+l(y) by Lemma 5.5(14).
If R(xs)={s,t} and L(sy)={s,t}, we assume x=x′⋅wsts and y=swst⋅y′ for some x′,y′∈W with R(x′),L(y′)⊆{r}.
Then by Lemma 5.5(8)(10), we have
[TABLE]
By Lemma 5.5(7)(8), we have L(r⋅twst⋅y′)={r} and L(sr⋅twst⋅y′)={s}. Then by Lemma 5.5(10)(13), we get
[TABLE]
Secondly we consider w=rsr. If mst≥5, we have l(xwy)=l(x)+l(w)+l(y) by Lemma 5.5(16). If mst=4, then mrs≥5. We assume y=t⋅y′ for some y′∈W with L(y′)⊆{s}.
By Lemma 5.5(2)(6), we know R(xrs)={s} and R(xrsr)={r}. Since l(x)+l(w)+l(y)=l(xrs)+l(rt)+l(y′)<l(xrsrty′), by Lemma 5.5(12), we must have R(xrst)={s,t}.
We assume xrst=x′⋅wst for some x′∈W with R(x′)⊆{r}, then xt⋅r=x′⋅s, so we have R(xt⋅r)={s,r}. Similarly, we can prove R(r⋅ty)={s,r}.
Now we assume x=x′′⋅wrsr⋅t and y=t⋅rwrs⋅y′′ for some x′′,y′′∈W with R(x′′),L(y′′)⊆{t}.
Since L(tst⋅swrs⋅y′′)={t}, by Lemma 5.5(11), we have
[TABLE]
Now we consider w=rt. If R(xr)={r} and R(xt)={t}, we have l(xwy)=l(x)+l(w)+l(y) by Lemma 5.5(12). If R(xr)={r,s} and L(ty)={t}, we have l(xwy)=l(x)+l(w)+l(y) by Lemma 5.5(11). If R(xt)={s,t} and L(ry)={r}, we have l(xwy)=l(x)+l(w)+l(y) by Lemma 5.5(10). Summarizing the arguments above, we must have R(xr)={r,s}, L(ty)={s,t} or R(xt)={s,t}, L(ry)={r,s}. We only consider the former case and assume x=x′⋅wrsr, y=twst⋅y′ for some x′,y′∈W with R(x′)⊆{t}, L(y′)⊆{r}. Then by Lemma 5.5(10)(11), we have
[TABLE]
At last, we consider w=rs and the case of w=sr is similar. Since l(xwy)<l(x)+l(w)+l(y), we have l(x)≥1, so we may assume x=x′⋅t for some x′∈W with R(x′)⊆{s}. We get
[TABLE]
If L(sy)={s,t}, we assume y=swst⋅y′ for some y′∈W with L(y′)⊆{r}. Then we have
[TABLE]
We consider the following 4 cases.
1
R(x′r)={r,s}, L(stwsty′)={t}.
Then we assume x′=x′′⋅wrsr for some x′′∈W with R(x′′)⊆{t}. By Lemma 5.5(10)(11)(16), we have
[TABLE]
2
R(x′r)={r,s}, L(stwsty′)={r,t}.
Then mst=4 and L(sy′)={r,s}. We assume x′=x′′⋅wrsr, y′=swrs⋅y′′ for some x′′,y′′∈W with R(x′′),L(y′′)⊆{t}.
By Lemma 5.5(10)(11), we have
[TABLE]
3
R(x′r)={r}. At least one of mst≥5, R(x′rs)={s} and L(sy′)={s} holds.
Since L(y′)⊆{r}, by Lemma 5.5(10)(13), we have
[TABLE]
4
R(x′r)={r}, mst=4, R(x′rs)=L(sy′)={r,s}.
We assume x′=x′′⋅wrssr, y′=swrs⋅y′′ for some x′′,y′′∈W with R(x′′),L(y′′)⊆{t}.
Since R(x′′⋅wrsr⋅t)={t}, by Lemma 5.5(11), we have
[TABLE]
If L(sy)={s}, since R(x′)⊆{s} and R(x′t)={t}, by the discussion for w=rt, we must have
5
R(x′r)={r,s} and L(tsy)={s,t}. Now we assume x=x′′⋅(wrsr)⋅t, y=stwst⋅y′′ for some x′′,y′′∈W with R(x′′)⊆{t}, L(y′′)⊆{r}.
Since R(x′′⋅wrss)={r}, L(swst⋅y′′)={t}, by Lemma 5.5(10)(11), we have
[TABLE]
This completes the proof.∎
5.3. The case of ∞>mrs≥7,mst=3
Lemma 5.7**.**
Let w,x,y∈W.
There is no w1,w2∈W such that w=w1⋅st=w2⋅sr.
If w=w1⋅srs, then t∈/R(w).
If w=w1⋅srsr, then t∈/R(w).
If w=w1⋅ts, then r∈/R(w).
If w=w1⋅tsr, then s∈/R(w).
If R(x),L(y)⊆{t}, w∈Wrs, l(w)≥6 or w=srsrs, then l(xwy)=l(x)+l(w)+l(y), R(xwy)=R(wy), L(xwy)=L(xw).
If R(x),L(y)⊆{r}, R(xs)={s} or L(sy)={s}, then TxstsTy=Txstsy.
If R(x),L(y)⊆{s}, R(xr)={r}, R(xt)={t}, R(xrs)={s}, then TxtrTy=Txtry.
If R(x)⊆{s}, L(y)⊆{r}, then degTx⋅rtTsts⋅y≤L(rsrs).
Proof.
See [Gao19, 5.1, 5.2, 5.3, 5.4, 5.8].
∎
Lemma 5.8**.**
Assume that I⊆S, ∣I∣=2, w∈WI, l(w)≥2 and R(x)∪L(y)⊆S∖I.
If l(xwy)<l(x)+l(w)+l(y), then (x,w,y) or its transpose is a reduced extension of that (x,w,y) in the following cases.
w=rsrsr, x=wrsr⋅t, y=t⋅rwrs. In this case, we have
[TABLE]
w=rsrs, x=wrsr⋅t, y=ts. In this case, we have
[TABLE]
w=srs.
- 1
x=st, y=ts. In this case, we have
[TABLE]
2. 2
mrs=8, x=wrss⋅tsrst, y=tsrst⋅swrs. In this case, we have
[TABLE]
3. 3
mrs=7, x=wrss⋅tsrst, y=tsrst⋅swrs. In this case, we have
[TABLE]
4. 4
mrs=7, x=wrss⋅tsrst, y=tsrst. In this case, we have
[TABLE]
w=rsr.
- 1
x=wrssr⋅t, y=t⋅rswrs. In this case, we have
[TABLE]
2. 2
x=wrsr⋅t, y=t⋅rwrs. In this case, we have
[TABLE]
3. 3
x=wrssr⋅t, y=t⋅rwrs. In this case, we have
[TABLE]
4. 4
x=t, y=t⋅rwrs. In this case, we have
[TABLE]
w=sts, x=wrss, y=swrs. In this case, we have
[TABLE]
w=rt.
- 1
x=wrsr, y=st. In this case, we have
[TABLE]
2. 2
x=wrsr, y=st⋅swrs. In this case, we have
[TABLE]
3. 3
x=wrssr, y=st⋅swrs. In this case, we have
[TABLE]
w=st.
- 1
x=wrsrs, y=rst. In this case, we have
[TABLE]
2. 2
x=wrsrs, y=rst⋅swrs. In this case, we have
[TABLE]
3. 3
x=wrssrs, y=rst⋅swrs. In this case, we have
[TABLE]
4. 4
x=wrss, y=r. In this case, we have
[TABLE]
5. 5
x=wrss, y=rst. In this case, we have
[TABLE]
6. 6
mrs=7, x=wrsr⋅t⋅wrss, y=rst⋅srwrs. In this case, we have
[TABLE]
7. 7
x=wrss, y=rst⋅swrs. In this case, we have
[TABLE]
8. 8
mrs=7, x=wrsr⋅t⋅wrss, y=rst⋅swrs. In this case, we have
[TABLE]
w=rs.
- 1
x=wrsr⋅t, y=t. In this case, we have
[TABLE]
2. 2
x=t, y=ts. In this case, we have
[TABLE]
3. 3
x=wrsrsr⋅t, y=tsrst. In this case, we have
[TABLE]
4. 4
x=wrsrsr⋅t, y=tsrst⋅swrs. In this case, we have
[TABLE]
5. 5
x=wrssrsr⋅t, y=tsrst⋅swrs. In this case, we have
[TABLE]
6. 6
x=wrssr⋅t, y=tsr. In this case, we have
[TABLE]
7. 7
x=wrssr⋅t, y=tsrst. In this case, we have
[TABLE]
8. 8
mrs=7, x=wrsr⋅t⋅wrssr⋅t, y=tsrst⋅srwrs. In this case, we have
[TABLE]
9. 9
x=wrssr⋅t, y=tsrst⋅swrs. In this case, we have
[TABLE]
10. 10
mrs=7, x=wrsr⋅t⋅wrssr⋅t, y=tsrst⋅swrs. In this case, we have
[TABLE]
11. 11
x=wrsr⋅t, y=ts. In this case, we have
[TABLE]
12. 12
x=wrsr⋅t, y=tsr. In this case, we have
[TABLE]
13. 13
x=wrsr⋅t, y=tsrst. In this case, we have
[TABLE]
14. 14
mrs=8, x=wrsr⋅t⋅wrsr⋅t, y=tsrst⋅srwrs. In this case, we have
[TABLE]
15. 15
mrs=7, x=st⋅wrsr⋅t, y=tsrst⋅srwrs. In this case, we have
[TABLE]
16. 16
mrs=7, x=wrsr⋅t⋅wrsr⋅t, y=tsrst⋅srwrs. In this case, we have
[TABLE]
17. 17
x=x′⋅wrsr⋅t, y=tsrst⋅swrs⋅y′ for some x′,y′∈W with R(x′),L(y′)⊆{t}. In this case, we have degTxTrsTy≤L(rsrs).
Proof.
If l(w)≥6 or w=srsrs, then we have l(xwy)=l(x)+l(w)+l(y) by Lemma 5.7(6). We consider the following cases.
(1) If w=rsrsr, we assume x=x′⋅t and y=t⋅y′ for some x′,y′∈W with R(x′),L(y′)⊆{s}, then we have TxTrsrsrTy=Tx′TrtTsrsrty′.
Since L(rsrsrty′)={r}, L(srsrsrty′)={s}, by Lemma 5.7(8), we must have L(tsrsrty′)={s,t}. Thus we get L(ry′)={r,s}. Similarly, we can prove R(x′r)={r,s}.
Now we assume x′=x′′⋅wrsr, y′=rwrs⋅y′′ for some x′′,y′′∈W with R(x′′),L(y′′)⊆{t}.
By Lemma 5.7(6), we have L(tsrst⋅swrs⋅y′′)=L(tsrst⋅swrs)={t}, and then
[TABLE]
(2) Now we consider w=rsrs. Since l(xwy)<l(x)+l(w)+l(y), we have l(y)≥2, so we assume y=ts⋅y′ for some y′∈W with L(y′)⊆{r}. Thus, we get TxTrsrsTy=TxrsrTstsTy′.
Since L(sy′)={s}, by Lemma 5.7(7), we must have R(xrsr)={r,t}, so we have x=x′⋅wrsr⋅t for some x′∈W with R(x′)⊆{t}.
Since L(tsrst⋅y′)={t},
by Lemma 5.7(6), we have
[TABLE]
(3) If w=srs, since l(x)≥2, l(y)≥2, we assume x=x′⋅st, y=ts⋅y′ for some x′,y′∈W with R(x′),L(y′)⊆{r}. Then by Lemma 5.7(7), we have
[TABLE]
If Tx′⋅tsTrTst⋅y′=Tx′⋅tsrst⋅y′, then
1
(x,srs,y) is a reduced extension of (st,sts,ts).
Now we consider when deg (Tx′⋅tsTrTst⋅y′)>0. We must have l(x)≥4 and l(y)≥4, so we assume x=x′′⋅srst, y=tsrs⋅y′′ for some x′′,y′′∈W. Then
[TABLE]
By the proof of the case w=rsrsr, we must have R(x′′⋅st)=L(ts⋅y′′)={s,t}, so we assume x=x′′′⋅tsrst, y=tsrst⋅y′′′ for some x′′′,y′′′∈W with R(x′′′),L(y′′′)⊆{r}. Then
[TABLE]
When deg (Tx′′′⋅stTsrsrsrsTts⋅y′′′)>0, by Lemma 5.7(6), we must be in the following cases.
2
mrs=8, R(x′′′⋅st)=L(ts⋅y′′′)={r,t}. In this case, (x,srs,y) is a reduced extension of (wrss⋅tsrst,srs,tsrst⋅swrs).
3
mrs=7, R(x′′′⋅st)=L(ts⋅y′′′)={r,t}. In this case, (x,srs,y) is a reduced extension of (wrss⋅tsrst,srs,tsrst⋅swrs).
4
mrs=7, R(x′′′⋅st)={r,t}, L(ts⋅y′′′)={t}, or R(x′′′⋅st)={t}, L(ts⋅y′′′)={r,t}. In this case, (x,srs,y) or its transpose is a reduced extension of (wrss⋅tsrst,srs,tsrst).
(4) If w=rsr, since l(x)≥1, l(y)≥1, we assume x=x′⋅t, y=t⋅y′ for some x′,y′∈W with R(x′),L(y′)⊆{s}. Then
[TABLE]
First we assume R(x′r)=L(ry′)={r}. By Lemma 5.7(7), we have R(x′rs)=L(sry′)={r,s} since l(xwy)<l(x)+l(w)+l(y). We assume x′=x′′⋅wrssr,
y′=rswrs⋅y′′ for some x′′,y′′∈W with R(x′′),L(y′′)⊆{t}. Then by Lemma 5.7(6),
1
(x,rsr,y) is a reduced extension of (wrssr⋅t,rsr,t⋅rswrs), and
[TABLE]
If R(x′r)={r,s} or L(ry′)={r,s}, we only consider the latter case. We assume y=t⋅rwrs⋅y′′ for some y′′∈W with L(y′′)⊆{t}. Then we have
[TABLE]
By Lemma 5.7(6), we have the following 3 cases.
2
R(x′r)={r,s}. In this case, (x,rsr,y) is a reduced extension of (wrsr⋅t,rsr,t⋅rwrs).
3
R(x′r)={r}, R(x′rs)={r,s}. In this case, (x,rsr,y) is a reduced extension of (wrssr⋅t,rsr,t⋅rwrs).
4
R(x′r)={r}, R(x′rs)={s}. In this case, (x,rsr,y) is a reduced extension of (t,rsr,t⋅rwrs).
Then TxTrsrTy can be easily computed in all these cases.
(5) If w=sts, by Lemma 5.7(7), we must have R(xs)=L(sy)={r,s}. We assume x=x′⋅wrss, y=swrs⋅y′ for some x′,y′∈W with R(x′),L(y′)⊆{t}.
By Lemma 5.7(6), we have
[TABLE]
(6) Now we consider the case of w=rt. By Lemma 5.7(8), we must have R(xr)={r,s} or R(xt)={s,t} or R(xrs)={r,s}.
(i) R(xr)={r,s}. We assume x=x′⋅wrsr for some x′∈W with R(x′)⊆{t}. If L(ty)={t}, then TxTrtTy=Txrty by Lemma 5.7(6). If L(ty)={s,t}, we assume y=st⋅y′ for some y′∈W with L(y′)⊆{r}. Thus we have
[TABLE]
If L(ts⋅y′)={t}, then by Lemma 5.7(6),
1
(x,rt,y) is a reduced extension of (wrsr,rt,st), and
[TABLE]
If L(ts⋅y′)={r,t}, we assume y′=swrs⋅y′′ for some y′′∈W with L(y′′)⊆{t}. Then by Lemma 5.7(6),
2
(x,rt,y) is a reduced extension of (wrsr,rt,st⋅swrs), and
[TABLE]
(ii) R(xrs)={r,s}. We assume x=x′⋅wrssr for some x′∈W with R(x′)⊆{t}, thus TxTrtTy=Tx′⋅wrssTty. Since l(xwy)<l(x)+l(w)+l(y), we must have
L(ty)⊆{s,t}, we assume y=st⋅y′ for some y′∈W with L(y′)⊆{r} , then TxTrtTy=Tx′⋅wrsTtsy′. By Lemma 5.7(6), we have
L(tsy′)⊆{r,t} since l(xwy)<l(x)+l(w)+l(y). Now we assume y′=swrs⋅y′′ for some y′′∈W with L(y′′)⊆{t}. Then by Lemma 5.7(6),
3
(x,rt,y) is a reduced extension of (wrssr,rt,st⋅swrs), and
[TABLE]
(iii) R(xt)={s,t}. We assume x=x′⋅ts for some x′∈W with R(x′)⊆{r}, thus TxTrtTy=Tx′TstsTry. If L(ry)={r,s}, we may consider the transpose of (x,rt,y), then we are in case (i). If L(ry)={r}, by Lemma 5.7(7), we must have R(x′s)=L(sry)={r,s}. We consider the transpose of (x,rt,y), then we are in case (ii).
(7) If w=st, since l(y)≥1, we assume y=ry′ for some y′∈W with L(y′)⊆{s}, thus TxTstTy=TxsTrtTy′. If R(xs)={s}, by the case of w=rt, we must be in the following cases if l(xwy)<l(x)+l(w)+l(y).
1
(x,st,y) is a reduced extension of (wrsrs,st,rst).
2
(x,st,y) is a reduced extension of (wrsrs,st,rst⋅swrs).
3
(x,st,y) is a reduced extension of (wrssrs,st,rst⋅swrs).
Then TxTstTy can be easily computed in all these cases. If R(xs)={r,s}, we assume x=x′⋅wrss for some x′∈W with R(x′)⊆{t}. Then
[TABLE]
If L(ty′)={t}, then by Lemma 5.7(6), we have
[TABLE]
so
4
(x,st,y) is a reduced extension of (wrss,st,r).
If L(ty′)={s,t}, we assume y′=st⋅y′′ for some y′′∈W with L(y′′)⊆{r}. Then
[TABLE]
If L(tsy′′)={t}, by Lemma 5.7(6) and the case of w=rsrsr, we we must be in the following cases.
5
(x,st,y) is a reduced extension of (wrss,st,rst).
6
mrs=7, (x,st,y) is a reduced extension of (wrsr⋅t⋅wrss,st,rst⋅srwrs).
If L(tsy′′)={r,t}, we assume y′′=swrs⋅y′′′ for some y′′′∈W with L(y′′′)⊆{t}. By Lemma 5.7(6), we have
[TABLE]
By Lemma 5.7(6), we must be in the following cases.
7
(x,st,y) is a reduced extension of (wrss,st,rst⋅swrs).
8
mrs=7, (x,st,y) is a reduced extension of (wrsr⋅t⋅wrss,st,rst⋅swrs).
(8) At last, we consider the case of w=rs. Since l(x)≥1, we assume x=x′t for some x′∈W with R(x′)⊆{s}, thus TxTrsTy=Tx′TrtTsy. If L(sy)={s}, by the case of w=rt, if l(xwy)<l(x)+l(w)+l(y), we must have
1
(x,rs,y) is a reduced extension of (wrsr⋅t,rs,t).
If L(sy)={s,t}, we assume y=ts⋅y′, for some y′∈W with L(y′)⊆{r}, then we have
[TABLE]
First we consider L(x′r)={r}. By Lemma 5.7(7), we have Tx′rTstsy′=Tx′⋅rsts⋅y′. By the case of w=st, we must be in the following cases.
2
(x,rs,y) is a reduced extension of (t,rs,ts).
3
(x,rs,y) is a reduced extension of (wrsrsr⋅t,rs,tsrst).
4
(x,rs,y) is a reduced extension of (wrsrsr⋅t,rs,tsrst⋅swrs).
5
(x,rs,y) is a reduced extension of (wrssrsr⋅t,rs,tsrst⋅swrs).
6
(x,rs,y) is a reduced extension of (wrssr⋅t,rs,tsr).
7
(x,rs,y) is a reduced extension of (wrssr⋅t,rs,tsrst).
8
mrs=7, (x,rs,y) is a reduced extension of (wrsr⋅t⋅wrssr⋅t,rs,tsrst⋅srwrs).
9
(x,rs,y) is a reduced extension of (wrssr⋅t,rs,tsrst⋅swrs).
10
mrs=7, (x,rs,y) is a reduced extension of (wrsr⋅t⋅wrssr⋅t,rs,tsrst⋅swrs).
Then we consider L(x′r)={r,s}. We assume x′=x′′⋅wrsr for some x′′∈W with R(x′′)⊆{t}, thus by Lemma 5.7(6), we have
[TABLE]
If y′=e, then
11
(x,rs,y) is a reduced extension of (wrsr⋅t,rs,ts).
If y′=e, we assume y′=ry′′ for some y′′∈W with L(y′′)⊆{s}, thus
[TABLE]
If L(ty′′)={t}, then
12
(x,rs,y) is a reduced extension of (wrsr⋅t,rs,tsr).
If L(ty′′)={s,t}, we assume y′′=sty′′′ for some y′′′∈W with L(y′′′)⊆{r}, thus
[TABLE]
If L(tsy′′′)={t}, then we must be in the following cases.
13
(x,rs,y) is a reduced extension of (wrsr⋅t,rs,tsrst).
14
mrs=8, (x,rs,y) is a reduced extension of (wrsr⋅t⋅wrsr⋅t,rs,tsrst⋅srwrs).
15
mrs=7, (x,rs,y) is a reduced extension of (st⋅wrsr⋅t,rs,tsrst⋅srwrs).
16
mrs=7, (x,rs,y) is a reduced extension of (wrsr⋅t⋅wrsr⋅t,rs,tsrst⋅srwrs).
If L(tsy′′′)={r,t}, we assume y′′′=swrs⋅y′′′′ for some y′′′′∈W with L(y′′′′)⊆{t}, thus
17
x=x′⋅wrsr⋅t, y=tsrst⋅swrs⋅y′ for some x′′,y′′′′∈W with R(x′′),L(y′′′′)⊆{t}.
We have degTxTrsTy≤L(rsrs) by (5.1) and Lemma 5.7(9).
This completes the proof.
∎
The following corollary follows from Lemma 5.8 and (2.2).
Corollary 5.9**.**
Let N∈N, w∈Wrs and x,y∈W with R(x),L(y)⊆{t}.
Assume l(w)≥2. If mrs≥8, then
[TABLE]
If mrs=7, then
[TABLE]
Assume l(w)≤1. Then we have
[TABLE]
6. Conditions for the equality
In sections 6, 7, 8, we prove Conjecture 3.1 for Coxeter groups of rank 3 that are listed in section 1.
In these sections, we assume that W>N=Ω>N, and W>N is ≺LR closed.
By assumption, W≤N=Ω≤N. We will frequently use the argument: if d∈D appears in z∈W≤N, then we have d∈D≤N. Otherwise, d∈D>N implies that z∈Ω>N=W>N, a contradiction with z∈W≤N.
Proposition 6.1**.**
For any x,y∈W≤N, we have degNTxNTy≤N, and the equality holds only if x,y∈Ω≥N.
The proof will occupy the rest of this section.
The first half of this proposition is known by (2.2). The key point is to prove x,y∈Ω≥N when the equality holds.
For this, we use induction on l(y). It is easy to check the proposition for l(y)=0,1. Now assume l(y)≥2 and that
[TABLE]
Let t1∈L(y), t2∈L(t1y), I={t1,t2}.
Write x=x1⋅u and y=v⋅y1 with u,v∈WI, x1,y1∈W and R(x1),L(y1)⊆S∖I. We have
[TABLE]
Thus for our purpose, it suffices to prove that, for every w∈(WI)≤N,
[TABLE]
If l(x1wy1)=l(x1)+l(w)+l(y1), then the equality in claim (6.2) holds only if degNfu,v,w=N, which implies that u,v∈Ω≥N and hence x,y∈Ω≥N (see case (i) of the proof of [Xie19, Prop.6.3]).
For the case of w with l(w)≤1, we refer the reader to cases (iii)(iv) of the proof of [Xie19, Prop. 6.3].
In the rest of the proof, we assume that l(w)≥2 and l(x1wy1)<l(x1)+l(w)+l(y1).
Note that Nfu,v,w has following 3 cases.
(WI)>N=∅, and Nfu,v,w=fu,v,w;
(WI)>N={wI}, and Nfu,v,w=fu,v,w−fu,v,wIpw,wI;
L(t1)=L(t2), (WI)>N={dI,wI}, and
[TABLE]
A general procedure.
Let Tx1TwTy1=∑zαzTz with αz∈A. Claim (6.2) will follow from the following three steps.
Step I. The goal of this step is to prove that deg(fu,v,wNTx1NTwNTy1)≤N and the equality holds only if x,y∈Ω≥N.
Let ξ be a monomial that appears in fu,v,w (with positive coefficient).
Then for this step it suffice to prove
[TABLE]
and that the equality holds only if x,y∈Ω≥N.
If degξ≤0, then we can use induction hypothesis (6.1), and hence we focus on the case of degξ>0.
By subsection 4.1, we have a condition R1 on u,v. Then condition R1, together with x=x1u,y=vy1∈W≤N=Ω≤N, gives a restriction R2 on L(r),L(s),L(t). Using R2, we have an inequality R3.
Then we prove degξ+degαz+degNTz≤N for any z and that the equality holds only if x,y∈Ω≥N. This will complete Step I.
Step II. Assume that WI is finite and wI∈(WI)>N, i.e. N<L(wI). The goal of this step is to prove that
[TABLE]
and the equality holds only if x,y∈Ω≥N.
Let δ=degfu,v,wIpw,wI. If δ≤0, then we apply induction hypothesis (6.1) to NTx1wNTy1. If δ>0, then by subsection 4.2, we have a restriction J1 on u,v,δ, which, together with x1u,vy1∈Ω≤N, gives a restriction J2 on L(r), L(s), L(t). This restriction J2 gives an inequality J3, and then implies δ+degαz+degNTz≤N for any z and the condition of taking equality. This will complete Step II.
Step III. Assume that WI is finite, dI,wI∈(WI)>N and w≤dI.
The goal of this step is to prove that
[TABLE]
and the equality holds only if x,y∈Ω≥N.
Let γ=(fu,v,dI−fu,v,wIpdI,wI)pw,dI. If γ≤0, then we apply induction hypothesis (6.1) to NTx1wNTy1. If γ>0, then by results from subsection 4.3, we have a restriction K1 on u,v,δ and γ, which, together with x1u,vy1∈Ω≤N, gives a restriction K2 on L(r), L(s), L(t). This restriction K2 gives an inequality K3, and then implies γ+degαz+degNTz≤N for any z and the condition of taking equality. This will complete Step III.
6.1. The case of ∞=mrs>mst≥3
According to Lemma 5.4, the proof is divided into two cases as follows.
Since Wrs is an infinite group, we only need to consider Step I when w∈Wrs.
Case (1)
w=srs, x1=x2⋅wsts, y1=swst⋅y2 for some x2,y2∈W and
[TABLE]
Apply the general procedure. According to Lemma 4.2, we have two cases for Step I. (Substitute ξ, R1, R2, R3 of the following table into the general procedure outlined above.)
[TABLE]
Case (2)
w=rs, x1=x2⋅t, y1=swst⋅y2 for some x2,y2∈W and
[TABLE]
According to Lemma 4.4, we have two cases for Step I.
[TABLE]
Note that we also need to verify the transpose cases, but the proofs are similar.
Hereafter, we always omit the transpose cases.
6.2. The case of 4≤mrs,mst<∞ with (mrs,mst)=(4,4)
Since 2L(r)+2L(s)≤L(wrs) and 2L(s)+2L(t)≤L(wst) and at most one of them holds, we have
[TABLE]
In the following this property is often used without mention.
According to Lemma 5.6, this case is divided into the following ones. (In addition to the transpose ones, the cases with r,t exchanged are omitted.)
Case (1)
w=srs, x1=x2⋅wsts, y1=swst⋅y2 for some x2,y2∈W and
[TABLE]
We have I={s,r}. We follow the general procedure.
Step I. If u=wI or v=wI, then wrs,wst∈D≤N, so we have
[TABLE]
If u=wI and v=wI, we have the following cases according to Lemma 4.1.
[TABLE]
Step II. wI∈(WI)>N. By Corollary 4.7, for δ>0 we have the following cases.
[TABLE]
(Substitute J1, J2, J3 into Step II of the general procedure.)
Step III. {dI,wI}⊆(WI)>N. For γ>0, by Corollary 4.11, we have
[TABLE]
[TABLE]
(Substitute K1, K2, K3 into Step III of the general procedure.)
Case (2) w=rsr, mst=4, x1=x2⋅wrsr⋅t and y1=t⋅rwrs⋅y2 for some x2,y2∈W, and
[TABLE]
We have I={s,r}. We follow the general procedure.
Step I. If u=wI or v=wI, then wrs∈D≤N, so we have
[TABLE]
If u=wI and v=wI, we have the following cases according to Lemma 4.1.
ξ=ξr.
[TABLE]
[TABLE]
ξs appears in fu,v,w, and (u,v)=(rs⋅u′,u′−1⋅sr) or (rwI,wIr).
The first case implies that L(wrs)≤N since y∈W≤N, hence 2L(s)<N.
In the second case, i.e. (u,v)=(rwI,wIr) we need to prove
[TABLE]
and that the equality holds only if x,y∈Ω≥N. If L(wrs)≤N, it is obvious. Hence we assume L(wrs)>N, so x2⋅wrs⋅tst⋅swrsy2∈/W≤N and (mst=4)
[TABLE]
For every z<wrs, we will prove that
[TABLE]
and the equality holds only if x,y∈Ω≥N.
Assume first l(z)≥4, then x2⋅(wrss)⋅tst⋅z⋅y2 is reduced by Lemma 5.5(11). We have
[TABLE]
[TABLE]
and the equality holds only if x,y∈Ω≥N since s appears in x and y. (Note that mrs≥5 due to mst=4.)
Assume now l(z)≤3, by induction hypothesis, we have
[TABLE]
and the equality holds only if y2∈Ω≥N. If mrs=6 or w=srs, then 2L(s)+degpz,wrs≤0, so (6.5) holds. Assume mrs=6 and w=srs. If x2⋅(wrss)⋅tst⋅z⋅y2 is reduced, then L(s)−2L(r)<N.
If x2⋅(wrss)⋅tst⋅z⋅y2 is not reduced, by Lemma 5.6(1), we have degNTx2⋅(wrss)⋅tst⋅zNTy2≤L(s) and y2=swst⋅y′ for some y′ and hence wst appears in y∈W≤N. We get
[TABLE]
Step II. wI∈(WI)>N.
According to Corollary 4.7, for δ>0, we have the following cases.
J1:ru<u or vr<v and δ<2L(s),
[TABLE]
su<u, vs<v, and δ=L(s). Then we need to prove L(s)+deg(NTx1NTrsr NTy1)≤N and that the equality holds only if x,y∈Ω≥N. For this, see (6.4).
Step III. {dI,wI}⊆(WI)>N.
According to Corollary 4.11, we have
K1: L(r)>L(s), ru<u and vr<v, and γ≤L(s),
[TABLE]
Case (3) w=rt, x1=x2⋅wrsr, y2=twst⋅y2 for some x2,y2∈W, and
[TABLE]
In this case, I={r,t}. Since w=rt∈(WI)≤N, and mrt=2, we only need to consider step I. We have the following cases.
[TABLE]
Case (4) w=rs.
We have I={r,s}. By Corollary 4.12, γ≤0 since l(w)=2. Thus we only consider Step I and II.
Here we only give the proof of case
1
of Lemma 5.6(4) and the other cases are similar.
In this case, x1=x2⋅wrsr⋅t, y1=swst⋅y2 for some x2,y2∈W, and
[TABLE]
Step I. By Lemma 4.3, we have following 3 cases.
ξ=ξrξs. R1: u=v=wrs.
R2:wrs,wst∈D≤N. R3:L(r)+2L(s)+L(t)<N.
ξr appears in fu,v,w and ru<u.
Then x∈W≤N implies that L(wrs)≤N and L(rt)≤N.
If L(t)≤L(s), we have L(r)+L(s)+L(t)≤2L(s)+L(r)<N.
It is similar for L(t)≤L(r). For the case of L(wst)≤N, it is also easy.
In the following we assume that L(t)>L(s), L(t)>L(r) and L(wst)>N. Thus by Lemma 4.3(3), (u,v)=(wrs,wrss).
mrs≥5. Since L(t)>L(s), then the fact that swst appears in y implies that 2L(t)−L(s)≤N, i.e. L(t)−21L(s)≤21N. Since mrs≥5, we have 3L(s)+2L(r)≤N, i.e. 23L(s)+L(r)≤21N. Then we obtain L(s)+L(r)+L(t)≤N, and the equality holds only if x,y∈Ω≥N.
mrs=4.
We will
prove
[TABLE]
and that the equality holds only if x,y∈Ω≥N.
Then we consider
[TABLE]
It suffices to prove that
[TABLE]
and the equality holds only if x,y∈Ω≥N.
Note that mst≥6, since L(s)=L(t) and (mrs,mst)=(4,4). We have two cases.
If l(z)≤2 or z=sts, we have L(rst)+degpz,wst<0. Then (6.6) follows since degNTx2⋅wrss⋅zNTy2≤N.
If l(z)≥4 or z=tst, then x2⋅wrss⋅z⋅y2 is reduced111Assume x2⋅wrss⋅z⋅y2 is not reduced. By applying Lemma 5.6 (with r,t exchanged) to (x2⋅wrss,z,y2), we have z=tst and x2⋅wrss=x2′⋅wstt⋅r for some x2′. Since mrs=4, we have
x2⋅r=x2′⋅wstts, a contradiction with Lemma 5.5(5)., and we have degpz,wst≤−L(s).
Then (6.6) follows and the equality holds only if L(rt)=N, which implies x,y∈Ω≥N.
ξ=ξs. R1:sv<v. R2:wst∈D≤N. R3:2L(s)+L(t)<N.
Step II. wI∈(WI)>N. By Lemma 4.8, for δ>0, we have
[TABLE]
If L(r)>L(s),
then wrs appears in x∈x1u∈W≤N, a contradiction with wI∈(WI)>N.
If L(r)<L(s), then vs<v and wst∈D≤N, which implies that δ+L(st)<2L(s)+L(t)<N.
6.3. The case of mrs≥7,mst=3
One important feature of this case is that L(s)=L(t).
According to Lemma 5.8, the proof is divided into the following cases.
Case (1) w=rsrsr. We have I={r,s}.
If L(wrs)≤N, then we have Nfu,v,w=fu,v,w, thus
[TABLE]
If L(wrs)>N, then u=wrs and v=wrs since u,v∈(WI)≤N. We have x1=x2⋅wrsr⋅t, y1=t⋅rwrs⋅y2 for some y1,y2∈W with R(x2),L(y2)⊆{t}, and
[TABLE]
In WI we have
degNfu,v,w≤N,\mboxandtheequalityholdsonlyifu,v∈Ω≥N.
Then by Corollary 5.9(1), we obtain
[TABLE]
and the equality holds only if x,y∈Ω≥N.
On the other hand, by Corollary 4.13, we have
degNfu,v,w<L(w).
Then by Corollary 5.9(2), we obtain
[TABLE]
Case (2) w=rsrs. Take the same method as the case (1).
Case (3) w=srs. We have I={r,s}.
Step I.
By Lemma 5.8(3), we have degTx1TsrsTy1≤L(rs). Hence
[TABLE]
Thus if L(wrs)≤N, then we are done. In the following, we assume L(wrs)>N. Thus u,v=wrs. For case
1
of Lemma 5.8(3), we have the following cases.
[TABLE]
For cases
2
and
3
, we only need to consider the case of u=v−1=swrs, then apply Corollary 5.9. For case
4
, we have the following cases.
[TABLE]
Step II. wI∈(WI)>N. Assume δ>0. For cases
1
of Lemma 5.8(3), we have the following cases.
[TABLE]
For cases
2
and
3
, we only need to consider the case of ru<u, vr<v, and δ=L(r), then apply Corollary 5.9. For case
4
, we have the following cases.
[TABLE]
Step III. dI,wI∈(WI)>N. For γ>0, by Corollary 4.11, we have
L(s)>L(r), su<u, vs<v, γ≤L(r). Since mrs is even and L(wrs)>N, we must be in case
1
of Lemma 5.8(3). Then it is obvious.
Case (4) w=rsr. We have I={r,s}.
Step I. If wrs∈D≤N, then degfu,v,wNTx1NTwNTy1<N. Assume in the rest of this step that L(wrs)>N. Thus u,v=wrs.
For cases
1
4
of Lemma 5.8(4) we use Corollary 5.9.
Consider case
2
of Lemma 5.8(4). If ru<u or vr<v, then wrs∈D≤N. By Lemma 4.1, it remains to consider the case
u=rwrs=v−1, ξ=ξt. Then we have
degξt(ξs2ξrNTx2⋅wrsr⋅t⋅wrs⋅y2+ξsξrNTx2⋅wrsr⋅t⋅swrs⋅y2+ξsξrNTx2⋅wrss⋅t⋅rwrs⋅y2) <N using Corollary 5.9,
3L(s)≤N with the equality holding only if x,y∈Ω≥N,
L(rt)≤N with the equality holding only if x,y∈Ω≥N.
Consider case
3
of Lemma 5.8(4). If vr<v, then wrs∈D≤N. By Lemma 4.1, it remains to consider the cases
(i) u=swrs,v=wrsr,ξ=ξr and (ii)
u=rwrs=v−1, ξ=ξt. Then they are proved as the above case
2
.
Step II. wI∈(WI)>N. Assume δ>0.
By Corollary 4.7, we have the following two cases:
ru<u or vr<v, and δ<2L(r);
su<u and vs<v, and δ=L(s).
For cases
1
4
of Lemma 5.8(4), using Corollary 5.9 to conclude that degfu,v,w NTx1NTwNTy1≤N and the equality holds only if x,y∈Ω≥N.
For
2
of Lemma 5.8(4), we can exclude (i). For (ii) we using Corollary 5.9 again.
For
3
of Lemma 5.8(4), we must have vs<v. By Lemma 4.6, (i) can be refined as (i’) : ru<u,vs<v,δ≤L(r). Then we apply Corollary 5.9.
Step III. {dI,wI}⊆(WI)>N. For γ>0, by Corollary 4.11, we have
L(r)>L(s), ru<u, vr<r, γ≤L(s). Since L(wrs)>N, we must be in case
1
of Lemma 5.8(4). Thus degTx1TrsTy1≤L(r). We obtain
[TABLE]
The equality holds only if L(rt)=N, which implies x,y∈Ω≥N.
Case (5) w=sts.
In this case, I={s,t}, (x1,sts,y1) is a reduced extension of (wrss,sts,swrs), and degTx1TstsTy1=L(r). Since L(s)=L(t), by Corollary 4.7 and Lemma 4.6, we only need to consider Step I.
If su<u or vs<v, then wrs appears in x1u or vy1, and hence
[TABLE]
According to Lemma 4.1, it remains to prove that case u=v−1=ts, ξ=ξt. In this case, we have
[TABLE]
and the equality holds only if x,y∈Ω≥N.
Case(6) w=rt.
In this case, I={r,t}, mrt=2. Since rt∈(W)≤N, we only need to do Step I.
Assume first that L(wrs)≤N. We have
[TABLE]
Then we are done. Assume in the rest that L(wrs)>N.
Consider
1
of Lemma 5.8(6). If ru<u, then wrs appears in x1u. It remains to consider the case u=t,v=rt, fu,v,w=ξt. Then we have degfu,v,wNTx1NTrtNTy1≤2L(s)<N.
Consider
2
of Lemma 5.8(6). If degfu,v,w>0 we have ru<u or vt<v, and hence wrs appears in x1u or vy1.
Consider
3
of Lemma 5.8(6). If vt<v, then wrs appears in vy1. It remains to consider the case u=rt,v=r,fu,v,w=ξr. Then we use Corollary 5.9 to obtain degfu,v,wNTx1NTwNTy1<N.
Case(7) w=st.
In this case, I={s,t}. Since L(s)=L(t), we only need to consider Step I and Step II.
Step I.
Assume first that L(wrs)≤N. We have
[TABLE]
Then we are done. Assume in the rest of this step that L(wrs)>N.
Consider
1
of Lemma 5.8 (7). According to Lemma 4.3, if deg fu,v,w>0, then u=wst or vt<v. Thus sts∈(W)≤N. Therefore
[TABLE]
The equality holds only if L(sts)=N and u=v=sts, which implies x,y∈Ω≥N.
Consider
2
3
of Lemma 5.8(7). If vt<v, then wrs appears in y. Since we assume L(wrs)>N, by Lemma 4.3, it remains to consider the case of u=sts, v=ts, fu,v,w=ξt. Then we conclude degfu,v,wNTx1NTwNTy1<N using Corollary 5.9 and 2L(s)<N.
Consider
4
5
6
of Lemma 5.8(7). If su<u, then wrs appears in x. Since we assume L(wrs)>N, by Lemma 4.3, it remains to consider the case of u=ts, v=sts, fu,v,w=ξs. Then we conclude degfu,v,wNTx1NTwNTy1<N using Corollary 5.9 and 2L(s)<N. (In the case of
5
, we also need L(rt)≤N and the equality holds only if y∈Ω≥N.)
Consider
7
8
of Lemma 5.8(7).
If degfu,v,w>0, then by Lemma 4.3, we have u=wst or vt<v, and then wrs always appears in x1u or vy1 in these two cases.
Step II. Since L(s)=L(t), by Lemma 4.8, we always have δ≤0.
Case (8) w=rs.
In this case, we have I={r,s} and by Corollary 4.12, we only need to do Step I and Step II. By Lemma 5.8, we have degTx1TrsTy1≤L(rsrs).
Step I.
Assume first that L(wrs)≤N. We have
[TABLE]
Then we are done. Assume in the rest of this step that L(wrs)>N, thus u,v=wrs. According to Lemma 4.3, if degfu,v,rs>0, then ru<u and vs<v,
so we are in case
2
3
6
7
8
of Lemma 5.8(8), and we have L(rt)≤N and L(sts)≤N. If mrs is odd, then we obtain
[TABLE]
If mrs is even, then we are in case
2
3
6
7
of Lemma 5.8(8). Here we only give the proof of case
7
and the other cases are similar. In this case, we assume x1=x2⋅wrssr⋅t, y1=tsrst⋅y2 for some x2,y2∈W with R(x2)⊆{t}, L(y2)⊆{r}, then
[TABLE]
It is easy to see
[TABLE]
By Corollary 5.9, we have
[TABLE]
If L(s)≥L(r), then degq−2L(s)fu,v,rsξrNTx2⋅wrss⋅ts⋅y2≤0<N. If L(r)>L(s), then dI appears in x1, thus
[TABLE]
Step II. wI∈(WI)>N. Let δ>0. We have mrs=2m is even, L(r)=L(s) and u=v=dI, and δ=∣L(r)−L(s)∣ by Lemma 4.8.
We only need to consider cases
1
–
7
,
9
,
11
–
14
of Lemma 5.8(8). Since mrs is even, we exclude
8
10
15
16
. We exclude
17
because wI appears in x1u or vy1.
If we are in cases
2
3
5
6
7
and L(r)>L(s), then we have degTx1Trs Ty1≤L(r) and δ=L(r)−L(s). Hence
[TABLE]
If we are in case
4
and L(r)>L(s), then x1=x2⋅wrsrsr⋅t, y1=tsrst⋅swrs⋅y2 for some x2,y2∈W
with R(x2),L(y2)⊆{t}, and
[TABLE]
By Corollary 5.9, we have
[TABLE]
Then we conclude that δ+degNTx1NTwNTy1<N.
If we are in case
9
and L(r)>L(s), then x1=x2⋅wrssr⋅t, y1=tsrst⋅swrs⋅y2 for some x2,y2∈W
with R(x2),L(y2)⊆{t}, and
[TABLE]
Then, as the case of
4
, we conclude that δ+degNTx1NTwNTy1<N.
If we are in cases
2
–
7
,
9
, and L(s)>L(r), then we only need to consider
2
3
6
7
; other cases are excluded using wrs∈D>N. We have degTx1TrsTy1≤L(rs), δ=L(s)−L(r), and sts appears in vy1. Thus
[TABLE]
If we are in case
1
or
11
14
, then we must have L(s)>L(r); otherwise, wrs∈D>N appears in x1v∈Ω≤N, a contradiction. We have degTx1TrsTy1≤L(srs) and δ=L(s)−L(r). Then
[TABLE]
The equality holds only if we are in case
13
or
14
, L(sts)=N and sts appears in x and y, which implies x,y∈Ω≥N.
This completes the proof of Proposition 6.1.
7. A property of length adding
Lemma 7.1**.**
For any d∈DN, x∈Bd, y∈Ud, we have
[TABLE]
Proof.
If d=e, then N=0 and x=y=e, the result is obvious. If d∈S, we have d,xd,dy∈ΩN and x∈Ω<N. Thus, x∈WS∖{d} and L(dy)={d}. Then we get l(xdy)=l(x)+l(d)+l(y).
Now suppose l(d)≥2. Then d=wJ for some J⊆S with ∣J∣=2, or d=r2wr1r2 for some r1,r2∈S with mr1r2≥4 and L(r1)>L(r2).
We have following 3 cases.
Case (1) ∞=mrs>mst≥3. We have d=rt or wst or swst or twst. Then by Lemma 5.3(5)(6),
we have l(xdy)=l(x)+l(d)+l(y).
Case (2) 4≤mrs,mst<∞ with (mrs,mst)=(4,4). Without loss of generality, we assume mrs≥mst. Thus mrs≥5. By Lemma 5.5(10)(11)(15), we only need to verify the case of d=rt and the case of d=sts with mst=4 and L(s)>L(t). If d=rt and l(xdy)<l(x)+l(d)+l(y), then by Lemma 5.6(3), one of
{R(xr),L(ty)} and {R(xt),L(ry)} is {{r,s},{s,t}}. Thus L(wrs)≤N and L(wst)≤N, so L(rt)<N, which contradicts with rt∈DN. If d=sts, mst=4, L(s)>L(t) and l(xdy)<l(x)+l(d)+l(y), by Lemma 5.6(1), we have R(xs)=L(sy)={r,s} and hence L(wrs)≤N, which contradicts with sts∈DN.
Case (3) ∞>mrs≥7,mst=3. Note that L(s)=L(t). By Lemma 5.7(6), we only need to verify the case of d=rt and the case of d=sts. If d=rt and l(xdy)<l(x)+l(d)+l(y), then by Lemma 5.8(6), wrs appears in xd or dy, so L(wrs)≤N, which contradicts with rt∈DN. If d=sts and l(xdy)<l(x)+l(d)+l(y), by Lemma 5.8(5), wrs appears in xd and dy, and hence L(wrs)≤N, which contradicts with sts∈DN.
∎
Remark 7.2**.**
From the above proof, one can see that if d∈DN with l(d)≥2, and x∈Ud−1, y∈Ud, then we have
[TABLE]
For l(d)=1, it is easy to find a counterexample.
8. Estimation of degrees
The aim of this section is to prove a stronger version of Conjecture 3.1(3) for the Coxeter groups that are listed in section 1.
Proposition 8.1**.**
For d∈DN, x∈Ud−1, y∈Ud, w≤d, we have
[TABLE]
If furthermore w<d and one of x∈Bd,y∈Bd−1,l(w)≥2 holds, then
[TABLE]
The proof will occupy the rest of this section.
If w=e, then −degpw,d=N and it follows from Proposition 6.1.
Assume that w=r′ for some r′∈S. By (2.2), deg(NTxr′NTr′y)≤N and deg(NTxNTr′y)≤N. Since Txr′Tr′y=ξr′Txr′Ty+TxTy,
we have deg(ξr′NTxr′NTy)≤N. This implies
[TABLE]
Assume furthermore w<d and x∈Bd (the proof is similar for y∈Bd−1). If r′d<d, then we have x,xr′∈Ω<N since r′<d, and hence by Proposition 6.1, deg(NTxr′NTr′y)<N and deg(NTxNTr′y)<N. Then we have
[TABLE]
If r′d>d, then d=dI with I={r′,s′} and L(s′)>L(r′) for some s′∈S. Then
deg(NTxr′NTy)≤N−L(r′)<N+L(r′)=−degpr′,d by Lemma 4.9. This proves the proposition for l(w)=1.
If l(xwy)=l(x)+l(w)+l(y), then deg(NTxNTwNTy)≤0, and the proposition follows since degpw,d<0 when w<d.
In the remainder we assume l(d)≥l(w)≥2 and l(xwy)<l(x)+l(w)+l(y), and prove the strict inequality in the proposition.
If mrs=∞ and 3≤mst<∞, then by Lemma 5.4 nothing needs to prove.
8.1. The case of 4≤mrs,mst<∞ with (mrs,mst)=(4,4)
According to Lemma 5.6, the proof is divided into the following cases.
We omit the transpose cases and the ones with r, t exchanged.
Case (1) w=srs, x=x2⋅wsts, y=swst⋅y2 for some x2,y2∈W, and
[TABLE]
Assume d=wrs. Since xd∈ΩN, we have L(wst)≤N=L(wrs). We obtain
[TABLE]
The second inequality follows from (6.3).
Assume d=dI with I={r,s}. If L(r)>L(s), then xd∈ΩN implies that L(rt)≤N=L′(dI). Thus
[TABLE]
If L(s)>L(r), then xd∈ΩN implies that L(wst)≤N=L′(dI). Thus
[TABLE]
Case (2) w=rsr, mst=4, x=x2⋅wrsr⋅t and y=t⋅rwrs⋅y2 for some x2,y2∈W, and
[TABLE]
Assume d=wrs. Then we have L(wrs)=N with mrs≥5. We obtain
[TABLE]
Assume d=dI with I={r,s} and mrs≥6. Since L(wrs)>L′(dI)=N, we must have L(s)>L(r). Then
[TABLE]
Case (3) w=rt, x=x2⋅wrsr, y=twst⋅y2 for some x2,y2∈W, and
[TABLE]
We must have d=w=rt. Then xd,dy∈ΩN imply that L(wrs),L(wst)≤N. Thus L(rt)<N, a contradiction with d∈DN. This case cannot happen.
Case (4) w=rs. There are 5 sub-cases as follows.
1
x=x2⋅wrsr⋅t, y=swst⋅y2 for some x2,y2∈W, and
[TABLE]
Assume d=wrs. Then dy∈ΩN implies that L(wst)≤N=L(wrs). Thus
[TABLE]
Assume d=dI with I={r,s}. Since L(wrs)>L′(dI)=N, we must have L(s)>L(r). Then dy∈ΩN implies that L(wst)≤N=L′(dI). Hence
[TABLE]
2
mst=4, x=x2⋅wrsr⋅t, y=swst⋅swrs⋅y2 for some x2,y2∈W, and
[TABLE]
We have mrs≥5.
Assume d=wrs. Since dy∈ΩN, we have L(wst)≤N=L(wrs). Then we obtain
[TABLE]
Assume d=dI with I={r,s}. Then xd,dy∈ΩN imply that L(wrs)≤N, thus L′(dI)<N, contradict with d∈DN. So this case cannot happen.
3
x=x2⋅t, y=swst⋅y2 for some x2,y2∈W, and
[TABLE]
Assume d=wrs. Since dy∈ΩN, we have L(wst)≤N=L(wrs). Then we obtain
[TABLE]
The second inequality follows from (6.3).
Assume d=dI with I={r,s}. If L(r)>L(s), then xd∈ΩN implies that L(rt)≤N=L′(dI), so we obtain
[TABLE]
If L(s)>L(r), then dy∈ΩN implies that L(wst)≤N=L′(dI). Thus
[TABLE]
4
mst=4, x=x2⋅wrssr⋅t, y=swst⋅swrs⋅y2 for some x2,y2∈W, and
[TABLE]
We have mrs≥5.
Assume d=wrs. Then dy∈ΩN implies that L(wst)≤N=L(wrs), so we obtain
[TABLE]
Assume d=dI with I={r,s}. Then mrs≥6. Since L(wrs)>L′(dI)=N, we must have L(r)>L(s). Then xd∈ΩN implies that L(rt)≤N, so we obtain
[TABLE]
5
x=x2⋅(wrsr)⋅t, y=stwst⋅y2 for some x2,y2∈W, and
[TABLE]
Assume d=wrs. Then we have
[TABLE]
Assume d=dI with I={r,s}. Since L(wrs)>L′(dI)=N, we must have L(s)>L(r), so we obtain
[TABLE]
8.2. The case of mrs≥7,mst=3
According to Lemma 5.8, the proof is divided into the following cases. The transpose cases are omitted.
If d=wrs∈DN, then deg(NTxNTwNTy)<−degpw,d follows directly from Corollary 5.9(1). Thus in the following we assume d=wrs.
Case (1) w=rsrsr.
We have d=dI with I={r,s}.
Since L(wrs)>L′(dI)=N and wrs appears in xr, we must have L(s)>L(r). Then xd,dy∈ΩN imply L(sts)≤N=L′(dI). Thus
[TABLE]
Case (2) w=rsrs.
We have d=dI with I={r,s}. As the last case we must have L(s)>L(r). Then xd,dy∈ΩN imply L(sts)≤N=L′(dI). Thus
[TABLE]
Case (3) w=srs.
We have d=dI with I={r,s}. Then we are in case
1
or
2
of Lemma 5.8(3). If L(r)>L(s), then
[TABLE]
If L(s)>L(r), then we must be in case
1
of Lemma 5.8(3) since L(wrs)>L′(dI)=N. Then xd,dy∈ΩN imply L(sts)≤N=L′(dI). Thus
[TABLE]
Case (4) w=rsr.
We have d=dI with I={r,s}. If L(r)>L(s), then we must be in case
1
of Lemma 5.8(4) since L(wrs)>L′(dI)=N.
We have x=x′⋅wrssr⋅t, y=t⋅rswrs⋅y′ for some x′,y′∈W with R(x′),L(y′)⊆{t}, and
[TABLE]
Let mrs=2m.
By Corollary 5.9 and the assumption L(r)>L(s), we have
[TABLE]
If L(s)>L(r), then xd,dy∈ΩN imply L(sts)≤N=L′(dI), and hence
[TABLE]
Case (5) w=sts.
We must have d=w=sts. Then xd,dy∈ΩN imply that L(wrs)≤N. Thus L(sts)<N, a contradiction with d∈DN. This case cannot happen.
Case (6) w=rt.
We must have d=w=rt. Then xd,dy∈ΩN imply that L(wrs)≤N. Thus L(rt)<N, a contradiction with d∈DN. This case cannot happen.
Case (7) w=st.
We must have d=sts. Since L(wrs)>L(sts)=N, we must be in case
1
of Lemma 5.8(7). Thus
[TABLE]
The first inequality is due to deg(NTx′⋅wrs⋅ts⋅y′)<0.
Case (8) w=rs.
We have d=dI with I={r,s}. If L(r)>L(s), then we must be in cases
2
3
4
5
6
7
9
of Lemma 5.8(8) since L(wrs)>L′(dI)=N and mrs=7.
Here we only give details for case
9
and the other cases are similar. In this case, x=x′⋅wrssr⋅t, y=tsrst⋅swrs⋅y′ for some x′,y′∈W with R(x′),L(y′)⊆{t}, and
[TABLE]
Let mrs=2m for some m≥4. Using Corollary 5.9 and the assumption L(r)>L(s)=L(t), we have
[TABLE]
If L(s)>L(r), then we must be in cases
1
2
3
6
7
11
12
13
14
of Lemma 5.8(8) since L(wrs)>L′(dI)=N and mrs=7. Here we only give details for case
14
and the other cases are similar. In this case, mrs=8. We assume x=x′⋅wrsr⋅t⋅wrsr⋅t, y=tsrst⋅srwrs⋅y′ for some x′,y′∈W with R(x′),L(y′)⊆{t}, then
[TABLE]
Using Corollary 5.9 and the assumption L(s)>L(r), mrs=8, we have
[TABLE]
This completes the proof of the proposition.
9. Conclusions
9.1. P1-P15
Now we arrive at the following main result.
Theorem 9.1**.**
Conjectures P1-P15 hold for any weighted Coxeter group of rank 3.
Proof.
First note that the boundedness conjecture for Coxeter groups of rank 3 has been proved in [Zho13, Gao19].
Assume (W,S) is an irreducible Coxeter group with S={r,s,t}. If mrs, mst, mrt are all odd, then (W,S) only admits a constant weight function, and P1-P15 hold by [Lus03, §16]. The only irreducible finite Coxeter group which admits unequal parameters is of type B3, and P1-P15 can be proved directly as noted by [Bon17, 25.1A]. For affine Weyl groups of type B~2 and G~2, P1-P15 are proved by Guilhot and Parkinson in [GP19, GP18]. For the case of mrs=2, mst=2, mrt=2 and the case of mrt=2, mrs=mst=∞, P1-P15 follow from [Xie19]. The remaining cases are those Coxeter groups listed in section 1, and P1-P15 follow from Theorem 3.2 and Propositions 6.1, 8.1 and Lemma 7.1.
∎
9.2. Kazhdan-Lusztig Cells
The cell partitions of affine Weyl groups of type B~2 and G~2 are due to [Gui10, Gui08]. The cell partitions for Coxeter groups with complete graph are also clear by [Xie19, §8] in certain sense.
In the remainder of this section we assume that S={r,s,t} with mrt=2 and mrs1+mst1<21, 2<mrs≤∞, 2<mst≤∞, and discuss the cell partitions.
We use the notations from section 3. First, we have the following results on a-functions and cells.
Theorem 9.2**.**
Let A={N∈N∣DN=∅}.
For any d∈D, a(d)=a′(d) .
For any N∈N, WN=ΩN.
For any N∈A, the following are decompositions into right cells
[TABLE]
[TABLE]
For any N∈A, the set Ω≤N is ≺LR-closed, and hence ΩN is a union of some two-sided cells. For any d∈DN, BddUd is contained in a two-sided cell.
Proof.
See Theorem 3.2 and [Xie19, Thm. 6.13]. Here we only show that BddUd is contained in a two-sided cell. If z∈BddUd, then z≺LRd and a(z)=a(d). By P11, we get z∼LRd. Thus z∼LRd∼LRz′ for any z,z′∈BddUd.
∎
Lemma 9.3**.**
If Bd=Ud−1 with d∈D, then BddUd is a two-sided cell.
Proof.
By Theorem 9.2, BddUd is contained in a two-sided cell. Assume z∈Ωa(d) satisfies z∼LRd. By the definition of ∼LR, there exists z1,…,zn∈W such that z1=z, zn=d, and zi≺Lzi+1 or zi≺Rzi+1 for any 1≤i≤n−1. By P4, we have
a(z1)≥…≥a(zn) and hence a(z1)=…=a(zn). By P9, P10, we get zi∼Lzi+1 or zi∼Rzi+1 for any 1≤i≤n−1. Since Bd=Ud−1, BddUd is stable by taking inverse. Thus BddUd is a union of some right cells and in the same time a union of some left cells. Hence all the zi and in particular z belong to BdUd. This proves the lemma.
∎
Contrary to the complete graph case, it is possible that ΩN contains more than one two-sided cells.
Example 9.4**.**
Assume that mrt=2, mrs=4, mst=5, and L(r)=5, L(s)=L(t)=1. Then we have
[TABLE]
[TABLE]
Since L(rt)=6>5, we have Bwst=Uwst={e}. By Lemma 9.3, {wst} is a two-sided cell. Therefore, Ω5 contains 2 two-sided cells: {wst} and BrrUr.
Lemma 9.5**.**
Assume that d1,d2∈DN and there exists some w in ΩN such that w=d1⋅x=y⋅d2 for some x,y∈W. Then we have d∼LRd2.
Proof.
We have w≺Ld2, w≺Rd1 and a(d1)=a(d2)=a(w)=N. By P9, P10, d1∼Rw∼Ld2.
∎
When mrs (resp. mst) is even, we often set mrs=2m (resp. mst=2n). Let a=L(r), b=L(s), c=L(t).
Keep assumptions that mrt=2 and mrs1+mst1<21, where 2<mrs≤∞, 2<mst≤∞.
Theorem 9.6**.**
Assume that d1,d2 belong to DN for some N and lie in different two-sided cells. Then this happens if and only if {d1,d2} is in one of the following cases, or the ones with r,t (resp. a,c) exchanged:
{wrs,t};
{r,t}* with b>a.*
{swrs,t}* with a>b;*
{swrs,twst}* with a>b>c and a+c>N;
*
{swrs,swst}* with a>b<c, and a+c>N;
*
{rwrs,rt}* with a<b, mst=3.*
Note that a(d1)=a(d2) is a hidden restriction on a,b,c.
Proof.
The set D is a union of A1 and A2 with
[TABLE]
where drs={rwrsswrs if b>a if b<a,
dst={swsttwst if b<c if b>c.
When mrs (resp. mst) is ∞, we ignore wrs (resp. wst). When a=b (resp. b=c), we ignore drs (resp. dst). This does not affect the following proof.
In the following, we take any d1,d1∈D, assume that d1,d2∈DN for some N, and check whether
there is an element w∈ΩN such that w=d1⋅y=x⋅d2 for some x,y∈W, which will imply that d1,d2 are in the same two-sided cell by Lemma 9.5,
or d1,d2 lie in different two-sided cells.
If d1,d2∈A1∩DN, then (i) holds except cases {d1,d2}={wrs,t},{r,wst} and {r,t} with b>a+c. For example, if d1=wrs,d2=wst, then L(r)+2L(s)≤2N and L(t)+2L(s)≤2N, which implies that rt∈D<N and w=d1sd2∈ΩN.
For the exceptional cases, (ii) holds by Lemma 9.3.
It remains to consider the cases where one of d1,d2, say d1, belongs to A2. By the symmetric role of r,t, we may only consider the case of d1=drs. Accordingly possible choices of d2 are t,wst,rt,dst due to a(d1)=a(d2).
Case(1) a>b.
If d2=t, we have Bd1=Ud1={e}. Thus by Lemma 9.5 d1 and t are always in different two-sided cells.
Assume d2=wst. In this case, we will prove a(rt)<N=a(d1)=a(d2) and that (i) holds.
If mrs=4 and mst=3, then we take w=d1tsrd2. Since 3a−2b≤N and 2b+2c≤N, we have a+c<N. Then we have w∈ΩN.
If mst=3 (mrs≥8), then we take w=d1tsrsrd2. Since 4a−3b≤N and 3b=N, we have a+c=a+b<2a≤N. Hence w∈ΩN.
If mrs=4 (mst≥5), we take w=d1tstsrstsrd2. Since 2a−b=N, 3b+2c≤N, we have a+c<a+b+c≤N, and hence w∈ΩN.
If d2=rt, then we take w=d1t and (i) holds.
Assume d2=dst with b<c. If a+c≤N, then we take w=d1d2 and (i) holds.
Otherwise, Bd2=Ud2={e}, and hence {d2} is a two-sided cell.
Since
N=ma−(m−1)b=nc−(n−1)b, then a+c>N is equivalent to 1<a/b<mn−m−nmn−m. This indeed could happen.
Assume d2=dst with b>c. If a+c≤N, then (i) holds by taking
w=d1tsrd2 if mrs≥6;
w=d1tstsrd2 if mrs=4 (mst≥6).
Then we consider the situation a+c>N. It implies that {d1} is a two-sided cell and hence d1,d2 are in different two-sided cells. Since
N=ma−(m−1)b=nb−(n−1)c, a+c>N is equivalent to 1<a/b<mn−n+1mn. This indeed could happen.
Case(2) a<b. Then d1=rwrs.
If d2=t, then we take w=d1t.
Let d2=wst. We have 2b−a≤N and 2c+b≤N, and hence a+c<23b−21a+c≤N. Take w=d1sd2 and (i) follows.
Let d2=rt.
If mst=3. Then one can check that Bd1−1=Ud1={e,t}. Then Bd1d1Ud1 is a two-sided cell by Lemma 9.5, and d1,d2 lie in different two-sided cells.
If mst=4, then mrs≥6, and we take w=d1tsrsd2.
If mst≥5, we take w=d1tsd2.
Let d2=dst.
If b>c, then we take w=d1sd2.
If b<c, then this can be reduced to the last one of Case(1) by exchanging r, t.
This completes the proof.
∎
Corollary 9.7**.**
Assume that (W,S) is an irreducible hyperbolic Coxeter group of rank 3 with L constant. Then for any N∈A, ΩN is precisely a two-sided cell.
This corollary confirms [BGS14, Conj. 3.1] in the case of rank 3, see the homepage of Paul Gunnells for some beautiful figures about cells partitions in the equal parameter case.
Theorem 9.8**.**
There are at most three elements in DN, and ∣DN∣=3 occurs in one of the following situations:
DN={r,s,t}, a=b=c;
(For other cases, mrs=2m, mst=2n for some m,n∈N.)
DN={rwrs,rt,swst}, (a/b,c/b)=(mn−m+1(m−1)(n−1),mn−m+1mn);
DN={rwrs,rt,twst}, (a/b,c/b)=(mn−1(m−1)n,mn−1m(n−1));
DN={swrs,rt,swst}, (a/b,c/b)=(mn−m−nm(n−1),mn−m−n(m−1)n);
DN={swrs,rt,twst}, (a/b,c/b)=(mn−n+1mn,mn−n+1(m−1)(n−1)).
If ∣DN∣=3, DN is contained in a two-sided cell.
Proof.
The proof is straightforward by choosing three elements d1,d2,d3 from the set
[TABLE]
and then using a(d1)=a(d2)=a(d3) to determine the a/b,c/b. Note that when mrs or mst is ∞, we need to ignore some elements. We omit the details.
∎
9.3. Examples, I
Assume that b=c, mrs=2m and k=mst for some m,k∈N.
The cell partition is determined by a/b∈R>0.
Let d1,d2∈D with a(d1)=a(d2). This equation on a,b gives a value h of a/b. We call h a critical value when d1,d2 are in the same two-sided cell. By definition of ΩN and Theorem 9.2, the cell partition is completely determined by the relative position of a/b with all such critical values.
By Theorem 9.6, the possible critical values are given by equations
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Thus possible critical values of a/b are
[TABLE]
For the hyperbolic Coxeter group 245, i.e. m=2, k=5, the critical values are
21,1,23,2,3,4.
a/b[math]\frac{1}{2}$$1$$\frac{3}{2}$$2$$3$$4
The critical values for the hyperbolic Coxeter group 238 are
31,1,23,34,2.
a/b[math]\frac{1}{3}$$1$$\frac{3}{2}$$2$$\frac{4}{3}
9.4. Examples, II
Assume that mrs=2m, mst=2n for some m, n∈N.
Then (W,S) admits three parameters.
We can draw the points (a/b,c/b)∈R>02 such that there exists some elements d1=d2 of D with a(d1)=a(d2) and d1,d2 are in the same two-sided cell. These form a partition of R>02 by some linear hyperplanes (see Figure 1). We call them critical hyperplanes.
By definition of ΩN and Theorem 9.2,
the cell partition of (W,S) is completely determined by the relative position of (a/b,c/b) with critical hyperplanes 222These hyperplanes should be the ones in Bonnafé’s semi-continuity conjecture, see [Bon09].. This visualizes how the cell partitions depend on parameters. Note that, for example, if d1=rwrs, we need to require a<b, i.e. 0<a/b<1.
Let us consider the example with mrs=4 and mst=6. See Figure 1 for critical hyperplanes.
The points with more than 3 hyperplanes passing are
O(1,1), A(52, 56), B(53, 54), C(23, 21), D(2,1), E(4,3).
The furthest point with two hyperplanes passing is F(14,8).
By writing down DN, one can see that only for points O,A,B,C,E there exists N such that ∣DN∣≥3, which is consistent with Theorem 9.8. See Figure 2 for cell partitions for points A,B,C,E. For the point D, taking (a,b,c)=(2,1,1), we have D1={s,t}, D2={r}, D3={rt,rsr}, D6={rsrs,ststst}. For the point F, taking (a,b,c)=(14,1,8), we have D1={s}, D8={t}, D14={r}, D22={tstst}, D27={rsr,ststst}, D30={rsrs}.
Acknowledgments
We would like to thank Gaston Burrull for helping us color cells in alcoves, thank Paul Gunnells for the beautiful pictures on his homepage about cells, and thank Mikhail Belolipetsky for helpful email correspondence.
The second named author would like to thank the University of Sydney and Sydney Mathematical Research Institute for hospitality during his visit, and he is supported by NSFC Grant No.11601116, No. 11801031 and Beijing Institute of Technology Research Fund Program for Young Scholars.