\givenname
Yago
\surnameAntolín
\urladdr
\givennameLuis
\surnameParis
\urladdr
\subjectprimarymsc200020F36, 20F10
\volumenumber
\issuenumber
\publicationyear
\papernumber
\startpage
\endpage
\MR
\Zbl
\published
\publishedonline
\proposed
\seconded
\corresponding
\editor
\version
Transverse properties of parabolic subgroups of Garside groups
Yago Antolín
Departamento de Matemáticas, Facultad de Ciencias, Universidad Autónoma de Madrid, 28049 Madrid, Spain
[email protected]
Luis Paris
IMB, UMR 5584, CNRS, Univ. Bourgogne Franche-Comté, 21000 Dijon, France
[email protected]
Abstract
Let G be a Garside group endowed with the generating set \SS of non-trivial simple elements, and let H be a parabolic subgroup of G.
We determine a transversal T of H in G such that each θ∈T is of minimal length in its right-coset, Hθ, for the word length with respect to \SS.
We show that there exists a regular language L on \SS∪\SS−1 and a bijection ev:L→T satisfying lg(U)=lg\SS(ev(U)) for all U∈L.
¿From this we deduce that the coset growth series of H in G is rational.
Finally, we show that G has fellow projections on H but does not have bounded projections on H.
1 Introduction
Let S be a finite set.
A Coxeter matrix over S is defined to be a square matrix M=(ms,t)s,t∈S indexed by the elements of S, with coefficients in N∪{∞}, such that ms,s=1 for all s∈S, and ms,t=mt,s≥2 for all s,t∈S, s=t.
For each s,t∈S, s=t, and each integer m≥2, we set Π(s,t,m)=(st)2m if m is even and Π(s,t,m)=(st)2m−1s if m is odd.
In other words, Π(s,t,m) denotes the word sts⋯ of length m.
The Artin group associated with the above Coxeter matrix M is the group A=AM defined by the presentation
[TABLE]
The Coxeter group associated with M, denoted by W=WM, is the quotient of A by the relations s2=1, s∈S.
Artin groups were introduced by Tits [24] as extensions of Coxeter groups.
There are few known results valid for all Artin groups, and most of the work in the subject concerns particular families of them.
The family concerned by the present paper is the one of Artin groups of spherical type, that is, the Artin groups whose associated Coxeter groups are finite.
Seminal work on these groups are Brieskorn [2, 3], Brieskorn–Saito [4] and Deligne [13] in relation with the so-called discriminant varieties.
They are involved in several subjects such as singularities, Hecke algebras, hyperplane arrangements, mapping class groups, and there is an extensive literature on them.
The leading examples of spherical type Artin groups are the braid groups.
Let G be a group and let M be a submonoid of G such that M∩M−1={1}.
Then we have two partial orders ≤L and ≤R on G defined by α≤Lβ if α−1β∈M, and α≤Rβ if βα−1∈M.
For each a∈M we set DivL(a)={b∈M∣b≤La} and DivR(a)={b∈M∣b≤Ra}.
An element a∈M is called balanced if DivL(a)=DivR(a).
In this case we set Div(a)=DivL(a)=DivR(a).
On the other hand, we say that M is Noetherian if, for each a∈M, there exists an integer n≥1 such that a cannot be decomposed as a product of more than n non-trivial factors.
Let G be a group, let M be a submonoid of G such that M∩M−1={1}, and let Δ be a balanced element of M.
We say that G is a Garside group with Garside structure (G,M,Δ) if:
M is Noetherian;
Div(Δ) is finite, it generates M as a monoid, and it generates G as a group;
(G,≤L) is a lattice.
In this case Δ is called the Garside element and the elements of Div(Δ) are called the simple elements of G for the given Garside structure.
The lattice operations of (G,≤L) are denoted by ∧L and ∨L, where for α,β∈G,
[TABLE]
and
[TABLE]
Remark that if α,β∈M, then 1≤Lα and 1≤Lβ and therefore 1≤L(α∧Lβ)≤L(α∨Lβ) and thus, ∧L and ∨L restrict to lattice operations of (M,≤L).
On the other hand, the ordered set (G,≤R) is also a lattice and its lattice operations are denoted by ∧R and ∨R and these operations also restrict to lattice operations of (M,≤R).
This definition is due to Dehornoy–Paris [12].
It is inspired by the work of Garside [16], Epstein et al. [14], Charney [6, 7] and others on braid groups and, more generally, on Artin groups of spherical type.
It isolates certain combinatorial characteristics of the braid groups and of the spherical type Artin groups that suffice to show certain algebraic properties such as the existence of a solution to the conjugacy problem, or the bi-automaticity.
By Brieskorn–Saito [4] and Deligne [13], the Artin groups of spherical type are Garside groups, and a large part of the study of these groups is made now in terms of Garside groups.
We refer to Dehornoy et al. [11] for a full account on the theory.
Let A be an Artin group associated with a Coxeter matrix M=(ms,t)s,t∈S.
The subgroup AX of A generated by a subset X of S is called a (standard) parabolic subgroup of A.
By van der Lek [21] we know that AX is itself an Artin group, associated with the Coxeter matrix MX=(ms,t)s,t∈X.
Parabolic subgroups play a prominent role in the study of Artin groups in general and in that of Artin groups of spherical type in particular.
For example, they are one the main ingredients in the definition/construction of the Salvetti complex for Artin groups, which is one of the most important tools in the study of the K(π,1) conjecture for Artin groups (see for example Godelle–Paris [19] and Paris [22]) and in the calculation of the cohomology of these groups (see for example De Concini–Salvetti [8] and Callegaro–Moroni–Salvetti [5]).
The notion of parabolic subgroup was extended to Garside groups by Godelle [17, 18] as follows.
Let (G,M,Δ) be a Garside structure on a Garside group G and let δ be a balanced element in M.
Let Gδ (resp. Mδ) denote the subgroup of G (resp. the submonoid of M) generated by Div(δ).
Then we say that (Gδ,Mδ,δ) is a parabolic substructure if Div(δ)=Div(Δ)∩Mδ.
Note that this condition implies that δ∈Div(Δ).
In this case we say that Gδ is a parabolic subgroup of G and that Mδ is a parabolic submonoid of M.
In this paper a parabolic subgroup will be always assumed to be non-trivial.
Let A be an Artin group of spherical type, let S be the standard generating set of A, and let X be a subset of S.
Then, by Brieskorn–Saito [4], the subgroup AX of A generated by X is a parabolic subgroup in Godelle’s sense, and all parabolic subgroups of A are of this form.
Remark**.**
Let H be a parabolic subgroup of a Garside group G with Garside structure (G,M,Δ).
Then there is a unique parabolic substructure (Gδ,Mδ,δ) such that H=Gδ.
Indeed, the balanced element δ which defines this parabolic substructure is the greatest element of Div(Δ)∩H for the ordering ≤L, hence H determines δ.
Similarly, if N is a parabolic submonoid of M, then there is a unique parabolic substructure (Gδ,Mδ,δ) such that N=Mδ, where δ is the greatest element of Div(Δ)∩N for the ordering ≤L.
So, we can speak of a parabolic subgroup and/or of a parabolic submonoid without necessarily mentioning the balanced element δ or the triple (Gδ,Mδ,δ).
The results of the present paper are new for Artin groups of spherical type and even for braid groups and, as often now in the theory, the whole study is done in terms of Garside groups.
Let G be a Garside group with Garside structure (G,M,Δ).
As often in the theory the generating set of G that will be considered in the present paper is the set \SS=Div(Δ)∖{1} of non-trivial simple elements.
For each α∈G we denote by lg(α)=lg\SS(α) the word length of α with respect to \SS.
Let H be a parabolic subgroup of G.
Recall that a right-coset of H in G is a subset of G of the form Hα={βα∣β∈H}, with α∈G.
Recall also that a (right) transversal of H in G is a subset T of G such that C∩T is a singleton for every right-coset C of H in G.
On the other hand, we define the length of a right-coset C of H in G to be lg(C)=min{lg(β)∣β∈C}.
In a first step we will determine an explicit transversal T of H in G which satisfies lg(θ)=lg(Hθ) for all θ∈T (see Theorem 3.2 and Theorem 3.3).
We denote by ev:(\SS∪\SS−1)∗→G the map which sends each word U to the element of G that it represents.
In a second step we will determine a regular language L over (\SS∪\SS−1)∗ satisfying ev(L)=T, the restriction ev:L→T is a bijective correspondence, and lg(U)=lg(ev(U)) for all U∈L (see Theorem 4.2).
The notion of regular language will be recalled in Section 4.
For each n∈N we denote by e(n)=eG,H,\SS(n) the number of right-cosets of H in G of length n.
The coset growth series of H in G is defined to be the formal series GrG,H,\SS(t)=∑n=0∞e(n)tn.
By the above e(n) is the number of words of length n in the regular language L.
So, GrG,H,\SS(t) is equal to the growth series of L.
As we know that the growth series of a regular language is rational (see Flajolet–Sedgewick [15] for example), the formal series GrG,H,\SS(t) is rational.
The starting point of this work was the paper [1] where the first author studies the triples (G,\SS,H) where G is a group, \SS a finite generating set of G and H is a subgroup of G such that (G,\SS) has the falsification by fellow traveller property and has fellow projections and/or bounded projections on H.
These notions will be recalled in Section 5.
In particular, it is proved in Antolín [1] that, if (G,\SS) has the falsification by fellow traveller property and has fellow projections on H, then the language Geo(H\G,\SS)={U∈(\SS∪\SS−1)∗∣lg(U)=lg(Hev(U))} is regular.
It is also proved in Antolín [1] that, if (G,\SS) has the falsification by fellow traveller property and has bounded projections on H, then the coset growth series GrG,H,\SS(t) is rational.
Let G be a Garside group, \SS=Div(Δ)∖{1} and let H be a parabolic subgroup of G.
We know by Holt [20] that (G,\SS) has the falsification by fellow traveller property.
So, it is natural to ask whether G has fellow projections and/or bounded projections on H.
In the present paper we show that (G,\SS) has fellow projections but does not have bounded projections on H (if H=G) (see Corollary 5.4 and Theorem 5.5).
This is the first known example of a triple (G,\SS,H) where (G,\SS) has the falsification by fellow traveller property, has fellow projections on H, and does not have bounded projections on H.
On the other hand, note that, by the results of Section 4, the coset growth series GrG,H,\SS(t) is rational in our case, and we do not know if there exists such an example with a non-rational coset growth series.
Note also that the transversal T defined and studied in Section 3 is an important tool in the proof of Theorem 5.5.
2 Preliminaries
Let G be a Garside group with Garside structure (G,M,Δ).
Recall that \SS=Div(Δ)∖{1} is the generating system of G that will be considered in the present paper and lg=lg\SS denotes the word length with respect to \SS.
The left greedy normal form of an element a∈M is defined to be the unique expression a=u1u2⋯up of a over \SS such that up=1 and (ui⋯up)∧LΔ=ui for all i∈{1,…,p}.
We define the right greedy normal form of a in a similar way.
The following two theorems contain fundamental results on Garside groups.
Theorem 2.1** (Dehornoy–Paris [12], Dehornoy [9]).**
Let a∈M, let a=u1u2⋯up be its left greedy normal form and let a=uq′⋯u2′u1′ be its right greedy normal form.
Then p=q=lg(a).
Let α∈G.
There exists a unique pair (a,b)∈M×M such that α=b−1a and a∧Lb=1.
Similarly, there exists a unique pair (a′,b′)∈M×M such that α=a′b′−1 and a′∧Rb′=1.
In this case we have lg(α)=lg(a)+lg(b)=lg(a′)+lg(b′).
The expressions α=b−1a and α=a′b′−1 given in Theorem 2.1 (2) are called left orthogonal form of α and right orthogonal form of α, respectively.
Let α∈G and let α=b−1a be its left orthogonal form.
Let a=u1u2⋯up and b=v1v2⋯vq be the left greedy normal forms of a and b, respectively.
Then the expression α=vq−1⋯v2−1v1−1u1u2⋯up is called the left greedy normal form of α.
Note that, by Theorem 2.1, lg(α)=p+q.
We define the right greedy normal form of an element of G in a similar way.
An element a∈M is called unmovable if Δ≤La or, equivalently, if Δ≤Ra.
On the other hand, we denote by Φ:G→G, α↦ΔαΔ−1, the conjugation by Δ.
Note that Φ(\SS)=\SS and Φ(M)=M, and therefore Φ preserves ≤L and ≤R and thus, it commutes with ∧L, ∨L, ∧R and ∨R.
Theorem 2.2** (Dehornoy–Paris [12], Dehornoy [9]).**
Let α∈G.
There exists a unique pair (a,k)∈M×Z such that a is unmovable and α=Δka.
Similarly, there exists a unique pair (a′,k′)∈M×Z such a′ is unmovable and α=a′Δk′, where k′=k and a′=Φk(a).
The expressions α=Δka and α=a′Δk′ given in Theorem 2.2 are called the left Δ-form of α and the right Δ-form of α, respectively.
Note that a′Δk′=Φ−k(Δka).
We denote by σ:Div(Δ)→Div(Δ) the map such that Δ=uσ(u) for all u∈Div(Δ).
Note that σ(Δ)=1 and σ(1)=Δ.
The following is proved in Picantin [23, Lemma 5.1].
Proposition 2.3** (Picantin [23]).**
Let α∈G and let α=vq−1⋯v2−1v1−1u1u2⋯up be its left greedy normal form.
Suppose that q=0.
Let r∈{0,1,…,p} such that ur=Δ and ur+1=Δ.
Set c=ur+1⋯up.
Then the left Δ-form of α is α=Δrc, and the left greedy normal form of c is c=ur+1⋯up.
Suppose that p=0.
Let r∈{0,1,…,q} such that vr=Δ and vr+1=Δ.
For each i∈{r+1,…,q} we set wi=Φi(σ(vi)).
Let c=wq⋯wr+1.
Then the left Δ-form of α is α=Δ−qc, and the left greedy normal form of c is c=wq⋯wr+1.
Suppose that p≥1 and q≥1.
For each i∈{1,…,q} we set wi=Φi(σ(vi)).
Let c=wq⋯w1u1⋯up.
Then the left Δ-form of α is α=Δ−qc, and the left greedy normal form of c is c=wq⋯w1u1⋯up.
Each of the cases of the proposition above correspond to each of the cases of the corollary below.
Corollary 2.4**.**
Let α∈G and let α=Δpa be its left Δ-form.
If p≥0, then lg(α)=lg(a)+p.
If p≤−lg(a), then lg(α)=−p.
If −lg(a)≤p≤0, then lg(α)=lg(a).
Summarizing lg(α)=max(lg(a)+p,−p,lg(a)).
The following theorem contains fundamental results on parabolic subgroups of Garside groups.
Theorem 2.5** (Godelle [17]).**
Let (H,N,δ) be a parabolic substructure of (G,M,Δ).
N=H∩M.
H* is a Garside group with Garside structure (H,N,δ).*
Let a∈N, let a=u1u2⋯up be its left greedy normal form, and let a=up′⋯u2′u1′ be its right greedy normal form with respect to (G,M,Δ).
Then ui,ui′∈Div(δ) for all i∈{1,…,p}, a=u1u2⋯up is the left greedy normal form of a with respect to (H,N,δ), and a=up′⋯u2′u1′ is its right greedy normal form with respect to (H,N,δ).
Let α,β∈H and γ∈G.
If α≤Lγ≤Lβ, then γ∈H.
Similarly, if α≤Rγ≤Rβ, then γ∈H.
Let α,β∈H.
Then α∧Lβ,α∨Lβ∈H and α∧Rβ,α∨Rβ∈H.
Let α∈H and let α=b−1a (resp. α=a′b′−1) be its left orthogonal form (resp. be its right orthogonal form) with respect to (G,M,Δ).
Then a,b∈N (resp. a′,b′∈N) and α=b−1a (resp. α=a′b′−1) is the left orthogonal form (resp. the right orthogonal form) of α with respect to (H,N,δ).
The following fact will be used frequently.
Remark**.**
Let (H,N,δ) be a parabolic substructure of (G,M,Δ).
Let a,b∈M such that ab∈N, then a,b∈N.
Indeed, since ab∈N, 1≤La≤Lab and by the above a∈H∩M=N.
Similarly, b≤Rab and 1≤Rb≤Rab and therefore b∈H∩M=N.
3 Transversal
¿From now on we fix a Garside group G with Garside structure (G,M,Δ) and a parabolic substructure (H,N,δ).
Our goal in the present section is to define a set T, to show that T is a transversal of H in G, and to show that lg(θ)=lg(Hθ) for all θ∈T.
In order to define the set T we need the following.
Lemma 3.1** (Dehornoy [10]).**
Let a∈M.
There exists a unique b∈N such that {c∈N∣c≤La}={c∈N∣c≤Lb}.
The element b of Lemma 3.1 is called the N-tail of a and is denoted by b=τN(a)=τ(a).
We say that a is N-reduced if τN(a)=1.
Note that a is N-reduced if and only if a∧Lb=1 for all b∈N, or, equivalently, if and only if a∧Lδ=1.
On the other hand we set ω=δ−1Δ∈M.
This element will play a key role in our study.
Recall that Φ:G→G, α↦ΔαΔ−1, denotes the conjugation by Δ.
Furthermore, we denote by φ:H→H, β↦δβδ−1, the conjugation by δ in H.
Note that ω−1βω=(Φ−1∘φ)(β) for all β∈H.
In particular, ω−1Nω=Φ−1(N)⊂M.
Let α∈G and let α=aΔp be its right Δ-form.
We say that α is (H,N)-reduced if a is N-reduced and either p=0 or (p<0 and ω≤La).
Define T to be the set of (H,N)-reduced elements of G.
The purpose of the present section is to prove the following two theorems.
Theorem 3.2**.**
The set T is a right transversal of H in G.
Theorem 3.3**.**
We have lg(θ)=lg(Hθ) for all θ∈T.
The following three lemmas are preliminaries to the proofs of Theorem 3.2 and Theorem 3.3.
Lemma 3.4**.**
Let b∈N.
Then b∧Lω=1 and b∨Lω=bω=ωb′, where b′=(Φ−1∘φ)(b).
Proof.
Let x=b∧Lω.
First observe that 1≤Lx≤Lb and hence x∈N and δx∈N⊆M.
Since x≤Lω, we have δx≤Lδω=Δ, hence δx∈Div(Δ)∩N=Div(δ).
As δx∈Div(δ) implies that x−1∈N, we obtain that x∈N∩N−1={1}.
This finish the proof of the first claim.
Now, let y=b∨Lω.
As previously observed, b′=(Φ−1∘φ)(b)=ω−1bω, hence bω=ωb′.
In particular, b,ω≤Lbω=ωb′ and hence y≤Lbω=ωb′.
Let y1′∈M such that ωy1′=y.
Since y≤Lωb′, we have y1′≤Lb′, hence there exists y2′∈M such that y1′y2′=b′.
We have b′∈Φ−1(N) and Φ−1(N) is a parabolic submonoid, hence y1′,y2′∈Φ−1(N).
Let y1=(φ−1∘Φ)(y1′) and y2=(φ−1∘Φ)(y2′).
Then y1,y2∈N and b=y1y2.
We have b=y1y2≤Ly=ωy1′=y1ω, hence y2≤Lω.
Since y2∈N and, by the above, y2∧Lω=1, it follows that y2=1, hence y1=b, and therefore y=bω.
∎
The following is a direct consequence of Dehornoy–Paris [12, Lemma 8.6, Lemma 8.7].
Lemma 3.5**.**
Let a,b1,b2∈M.
Then lg(b1ab2)≥lg(a).
Lemma 3.6**.**
Let c be a N-reduced element in M, let k≥0 be an integer, and let d=ω1ω2⋯ωkΦ−k(c), where ωi=Φ−i+1(ω) for all i∈{1,…,k}.
Then d is N-reduced.
Remark**.**
Let k≥0 and let ωi=Φ−i+1(ω) for all i∈{1,…,k} as in the above statement.
Then ω1⋯ωk=δ−kΔk.
This equality will be often used in the remainder of the paper.
Proof.
We argue by induction on k.
The case k=0 being trivial, we can assume that k≥1 and that the inductive hypothesis holds.
Note that, if k≥1, then ω≤Ld.
Let b∈N such that b≤Ld.
In particular, b∨Lω≤d.
By Lemma 3.4, b∨Lω=ω(Φ−1∘φ)(b)≤Lω1ω2⋯ωkΦ−k(c), hence (Φ−1∘φ)(b)≤Lω2⋯ωkΦ−k(c), and therefore φ(b)≤Lω1⋯ωk−1Φ−k+1(c).
Recall that φ(N)=N.
By induction it follows that φ(b)=1, hence b=1.
∎
Proof of Theorem 3.2.
We start by showing that each right-coset C of H in G contains an element of T.
Suppose first that C contains an element a∈M.
Let c∈M such that a=τ(a)c.
Then c∈T and C=Ha=Hc.
Now, we assume that C contains no element of M and note that elements not in M have right Δ-form aΔ−p with p≥1.
Let α∈C and let α=aΔ−p be the right Δ-form of α.
We choose α so that p is minimal.
Let c∈M such that a=τ(a)c.
Set θ=cΔ−p.
Since C=Hα=Hθ, it suffices to show that θ∈T.
The element c is unmovable since c≤Ra and a is unmovable.
Furthermore, c is N-reduced since a=τ(a)c.
Suppose that ω≤Lc.
Let c′∈M such that c=ωc′.
Then δθ=δωc′Δ−p=Φ(c′)Δ−p+1∈Hθ=C, which contradicts the minimality of p.
So, ω≤Lc, thus θ=cΔ−p∈T.
Now, we take two elements θ1,θ2∈T, we suppose that there exists β∈H such that βθ1=θ2, and we prove that β=1 and θ1=θ2.
Let θ1=c1Δ−p1 and θ2=c2Δ−p2 be the right Δ-forms of θ1 and θ2, respectively.
By definition, ci is N-reduced, pi≥0, and ω≤Lci if pi≥1, for i∈{1,2}.
We can assume without loss of generality that p1≥p2.
Let β=b2−1b1 be the left orthogonal form of β.
Then b1c1=b2c2Δp1−p2.
Suppose first that p1−p2>0.
In particular, p1>0, hence ω≤Lc1.
Since Δ≤Rb1c1 in this case, we have Δ≤Lb1c1, hence ω≤Lb1c1, thus, by Lemma 3.4, ω∨Lb1=b1ω≤Lb1c1, and therefore ω≤Lc1: contradiction.
So, p1=p2 and b1c1=b2c2.
Let y=b1∨Lb2.
We have y∈N, since b1,b2∈N and N is a parabolic submonoid.
Let y1∈M such that y=b1y1.
Here again, y1∈N, since N is a parabolic submonoid.
We have y=b1y1≤Lb1c1, since b1c1=b2c2, hence y1≤Lc1.
It follows that y1=1, since c1 is N-reduced, hence y=b1.
Similarly, y=b2, hence b1=b2=1, because b1∧Lb2=1.
So, β=1, and θ1=θ2.
∎
Given θ∈T and β∈H we will need to understand βθ.
The following three lemmas are the cases for θ∈T, and β∈H that will appear in the proofs of Theorems 3.3 and 5.5.
Lemma 3.7**.**
Let c∈T∩M and β∈H. Let β=b2−1b1 be the left orthogonal form of β. Then 1=b2∧L(b1c) and therefore b2−1(b1c) is the left orthogonal form of βθ.
Proof.
Recall that b1,b2∈N, since H is a parabolic subgroup.
Set y1=b2∧L(b1c).
We have y1∈N since y1≤Lb2.
Let y2=b1∨Ly1.
We have y2∈N since y1,b1∈N.
Moreover, we have y2≤Lb1c since b1≤Lb1c and y1≤Lb1c.
Let y3∈M such that y2=b1y3.
We have y3∈N (since y2∈N), y3≤Lc and c is N-reduced, hence y3=1.
So, y2=b1, which implies that y1≤Lb1.
We also have y1≤Lb2 and b1∧Lb2=1, hence y1=1.
∎
Lemma 3.8**.**
Let θ=cΔ−p∈T∖M in right Δ-form with p≥1 and β=b∈N.
Then bc is unmovable and bcΔ−p is the right Δ-form of βθ.
Proof.
Notice that c is unmovable and N-reduced, ω≤Lc, and p≥1.
If we had Δ≤Lbc, then we would have ω≤Lbc, hence, by Lemma 3.4, we would have b∨Lω=bω≤Lbc, and therefore we would have ω≤Lc: contradiction.
So, bc is unmovable.
∎
Lemma 3.9**.**
Let θ=cΔ−p∈T∖M in right Δ-form with p≥1 and β=bδ−k∈H∖N in right δ-form with k≥1.
Then the right Δ-form of βθ is bω1…ωkΦ−k(c)Δ−k−p, where ωi=Φ−i+1 for all i∈{1,…,k}.
Proof.
As θ∈T, c is unmovable and N-reduced, ω≤Lc, and p≥1.
By using the equality δ−1=ωΔ−1 it is easily seen that βθ=bω1ω2⋯ωkΦ−k(c)Δ−p−k, where ωi=Φ−i+1(ω) for all i∈{1,…,k}.
By Lemma 3.6 we have τ(bω1⋯ωkΦ−k(c))=b.
Thus, if Δ≤Lbω1⋯ωkΦ−k(c), then δ≤Lbω1⋯ωkΦ−k(c), hence δ≤Lb: contradiction.
So, Δ≤Lbω1⋯ωkΦ−k(c).
∎
Proof of Theorem 3.3.
We take θ∈T and β∈H and we show that lg(βθ)≥lg(θ).
Suppose first that θ=c∈M.
Let β=b2−1b1 be the left orthogonal form of β.
Lemma 3.7 imples that b2−1(b1c) is the left orthogonal form of βθ.
By applying Theorem 2.1 and Lemma 3.5 we finally obtain lg(βθ)=lg(b2)+lg(b1c)≥lg(c)=lg(θ).
Assume that θ∈M and β=b∈N.
We write θ in the form θ=cΔ−p, where c is unmovable and N-reduced, ω≤Lc, and p≥1.
By Lemma 3.8 bc is unmovable and bcΔ−p is the right Δ-form of βθ.
By Corollary 2.4 it follows that lg(βθ)=max(lg(bc),p)≥max(lg(c),p)=lg(θ).
Assume that θ∈M and β∈N.
As before, we write θ in the form θ=cΔ−p, where c is unmovable and N-reduced, ω≤Lc, and p≥1.
On the other hand we write β in the form β=bδ−k, where b∈N, δ≤Lb, and k≥1.
By Lemma 3.9, the right Δ-form of βθ is bω1⋯ωkΦ−k(c)Δ−k−p, where ωi=Φ−i+1 for all i∈{1,…,k}.
By Corollary 2.4 and Lemma 3.5 it follows that lg(βθ)=max(lg(bω1⋯ωkΦ−k(c)),p+k)≥max(lg(c),p)=lg(θ).
∎
4 Regular language
A finite state automaton is defined to be a quintuple F=(X,A,μ,Y,x0), where X is a finite set, called the set of states, A is a finite set, called the alphabet, μ:X×A→X is a function, called the transition function, Y is a subset of X, called the set of accepted states, and x0 is an element of X, called the initial state.
For x∈X and U=u1u2⋯up∈A∗ we define μ(x,U)∈X by induction on p as follows.
[TABLE]
Then the set LF={U∈A∗∣μ(x0,U)∈Y} is called the language recognized by F.
A regular language is a language recognized by a finite state automaton.
Recall that G is a given Garside group with Garside structure (G,M,Δ), that (H,N,δ) is a parabolic substructure, and that T is the transversal of H in G defined in Section 3.
The following is used to understand the language defined by the automaton below.
Recall that σ:Div(Δ)→Div(Δ) is the function such that Δ=uσ(u) for all u∈Div(Δ).
Theorem 4.1** (Dehornoy–Paris [12]).**
Let u1,…,up,v1,…,vq∈\SS.
Then vq−1⋯v2−1v1−1u1u2⋯up is a left greedy normal form if and only if σ(ui)∧Lui+1=1 for all i∈{1,…,p−1}, σ(vj)∧Lvj+1=1 for all j∈{1,…,q−1}, and u1∧Lv1=1.
We define a finite state automaton F=(X,A,μ,Y,x0) as follows.
We set A=\SS∪\SS−1, X=A∪{x0,x1}, Y=A∪{x0}, and we define μ:X×A→X as follows.
Let u,v∈\SS.
[TABLE]
Recall that ev:A∗→G is the map that sends each word U to the element of G that it represents.
The purpose of the present section is to prove the following.
Theorem 4.2**.**
We have ev(LF)=T, the restriction ev:LF→T is a bijective correspondence, and lg(U)=lg(ev(U)) for all U∈LF.
Recall that for each n∈N we denote by e(n)=eG,H,\SS(n) the number of right cosets of H in G of length n.
Recall also that the coset growth series of H in G is GrG,H,\SS(t)=∑n=0∞e(n)tn.
By Theorem 3.2, Theorem 3.3 and Theorem 4.2 e(n) is equal to the number of words of length n in the regular language LF.
In other words, GrG,H,\SS(t) is the growth series of LF.
Since we know that the growth series of a regular language is rational (see Flajolet–Sedgewick [15], for example), it follows that:
Corollary 4.3**.**
The formal series GrG,H,\SS(t) is rational.
Proof of Theorem 4.2.
Set T′=ev(LF).
By Theorem 4.1 the restriction ev:LF→T′ is a bijective correspondence, and T′ is the set of elements θ=vq−1⋯v2−1v1−1u1u2⋯up written in left greedy normal form such that:
if q=0 and p≥1, then u1∧Lδ=1,
if q≥1, then either vq=Δ or (σ(vq)∧Lδ=1 and ω≤Lσ(vq)).
Moreover, by Theorem 2.1, we have lg(U)=lg(ev(U)) for all U∈LF.
So, it remains to show that T′=T.
Let θ=vq−1⋯v2−1v1−1u1u2⋯up be an element of G written in left greedy normal form.
Suppose first that q=0.
Then θ=u1u2⋯up.
If p=0, then θ=1∈T∩T′.
So, we can assume that p≥1.
Since δ∈Div(Δ), we have θ∧Lδ=(θ∧LΔ)∧Lδ=u1∧Lδ, hence
[TABLE]
Suppose that p=0 and q≥1.
Then θ=vq−1⋯v2−1v1−1.
Let r∈{0,1,…,q} such that vi=Δ for all i∈{1,…,r} and vr+1=Δ.
Set wj=Φ−j+1(σ(vq−j+1)) for j∈{1,…,q−r} and c=w1⋯wq−r.
Then, by Proposition 2.3 and Theorem 2.2, θ=cΔ−q, c is unmovable, and c=w1⋯wq−r is the left greedy normal form of c.
Notice that w1=σ(vq).
If vq=Δ, then c=1 and θ=Δ−q∈T∩T′.
So, we can assume that vq=Δ, that is, q>r and c=1.
As above, since δ∈Div(Δ), we have c∧Lδ=w1∧Lδ=σ(vq)∧Lδ.
On the other hand, since ω∈Div(Δ), we have ω≤Lc if and only if ω≤Lw1=σ(vq).
So,
[TABLE]
Suppose that p≥1 and q≥1.
Then θ=vq−1⋯v2−1v1−1u1u2⋯up.
Since u1u2⋯up∧Lv1v2⋯vq=1, we have ui=Δ for all i∈{1,…,p} and vj=Δ for all j∈{1,…,q}.
Set wj=Φ−j+1(σ(vq−j+1)) for all j∈{1,…,q} and wj=Φ−q(uj−q) for all j∈{q+1,…,q+p}.
Let c=w1⋯wq+p.
Then, by Proposition 2.3 and Theorem 2.2, θ=cΔ−q, c is unmovable, and c=w1⋯wq+p is the left greedy normal form of c.
By applying the same reasoning as in the previous case, we then obtain
[TABLE]
∎
5 Projections
Let G be a group generated by a finite set \SS.
We set A=\SS∪\SS−1 and, as before, we denote by ev:A∗→G the map which sends each word U∈A∗ to the element of G that it represents.
We denote by lg=lg\SS the word length in G with respect to \SS and by d:G×G→N the distance function induced by lg.
Recall that d(α,β)=lg(α−1β) for all α,β∈G.
Recall also that, for α∈G and X⊂G, the distance from α to X is d(α,X)=min{d(α,β)∣β∈X}.
The diameter of a subset X⊂G is diam(X)=max{d(α,β)∣α,β∈X}.
A word U∈A∗ is called a geodesic (or a reduced word) if lg(U)=lg(ev(U)).
For a word U=x1x2⋯xℓ of length ℓ and i∈N we set U(i)=x1⋯xi if i≤ℓ and U(i)=U if i>ℓ.
Let K be a positive constant.
We say that two words U,V∈A∗ K-fellow travel if d(ev(U(i)),ev(V(i)))≤K for all i∈N.
We say that (G,\SS) has the falsification by K-fellow traveller property if for each non-geodesic word U∈A∗ there exists a strictly shorter word V∈A∗ such that ev(U)=ev(V) and U,V K-fellow travel.
Let H be a subgroup of G.
The projection of an element α∈G in H is defined to be πH(α)={β∈H∣d(α,β)=d(α,H)}.
Let K be a positive constant.
We say that (G,\SS) has K-fellow projections on H if, for each α1,α2∈G such that d(α1,α2)=1 and each β1∈πH(α1), there exists β2∈πH(α2) such that d(β1,β2)≤K.
We say that (G,\SS) has K-bounded projections on H if, for each α1,α2∈G such that d(α1,α2)=1, we have diam(πH(α1)∪πH(α2))≤K.
Note that, if G has K-bounded projections on H, then G has K-fellow projections on H.
As pointed out in the introduction, the starting point of our study was the following two theorems.
Theorem 5.1** (Antolín [1]).**
Let G be a group generated by a finite set \SS, let A=\SS∪\SS−1, and let H be a subgroup of G.
Assume that (G,\SS) has the falsification by fellow traveller property and has fellow projections on H.
Then:
The language Geo(H\G,\SS)={U∈A∗∣lg(U)=lg(Hev(U))} is regular.
If, furthermore, (G,\SS) has bounded projections on H, then the coset growth series GrG,H,\SS(t) of H in G is rational.
Theorem 5.2** (Holt [20]).**
Let G be a Garside group with Garside structure (G,M,Δ), and let \SS=Div(Δ)∖{1}.
Then G endowed with the generating set \SS has the falsification by fellow traveller property.
Let G be a Garside group with Garside structure (G,M,Δ) and let (H,N,δ) be a parabolic substructure.
So, it is natural to ask whether (G,\SS) has bounded projections on H and, if not, whether it has fellow projections.
The answer is “NO” for the first question (see Corollary 5.4), and is “YES” for the second question (see Theorem 5.5).
As pointed out in the introduction, this is the first example we know of a triple (G,\SS,H), where G is a group, \SS a finite generating set and H is a subgroup of G such that (G,\SS) has the falsification by fellow traveller property, it has fellow projections on H, but it does not have bounded projections on H.
¿From now on G denotes a given Garside group with Garside structure (G,M,Δ) and (H,N,δ) denotes a given parabolic substructure.
Recall that ω=δ−1Δ, and Φ:G→G, α↦ΔαΔ−1, denotes the conjugation by Δ.
The fact that G does not have bounded projections on H (if H=G) is a direct consequence of the following.
Lemma 5.3**.**
Suppose that H=G.
Let k≥1 and let dk=ω1ω2⋯ωk, where ωi=Φ−i+1(ω) for all i∈{1,…,k}.
Then diam(πH(dk))≥k.
Proof.
By Lemma 3.6 the element dk is N-reduced, hence dk∈T, and therefore, by Theorem 3.3, lg(Hdk)=lg(dk).
It follows that d(dk,H)=lg(dk), 1∈πH(dk), and β∈πH(dk) if and only if lg(β−1dk)=lg(dk) and β∈H.
We have δΔ=Δσ(ω), hence σ(ω)=Φ−1(δ), and therefore σ(ωi)=Φ−i(δ) for all i∈{1,…,k}.
Let i∈{1,…,k−1}.
Then ωi+1=Φ−i(ω) and, by Lemma 3.4, δ∧Lω=1, hence σ(ωi)∧Lωi+1=Φ−i(δ)∧LΦ−i(ω)=1.
It follows by Theorem 4.1 that ω1ω2⋯ωk is the greedy normal form of dk, hence lg(dk)=k.
On the other hand, δkdk=Δk, hence, by Corollary 2.4, lg(Δk)=k.
Since δk∈H, this shows that δ−k∈πH(dk).
Finally, by Corollary 2.4, δk has length k with respect to Div(δ)∖{1}, hence, by Theorem 2.5, lg(δ−k)=lg(δk)=k.
So, diam(πH(dk))≥k.
∎
Corollary 5.4**.**
Suppose that H=G (and H=1).
Then G does not have bounded projections on H.
Proof.
For each k≥1 we choose αk∈G such that d(dk,αk)=1.
Then, by Lemma 5.3, diam(πH(dk)∪πH(αk))≥diam(πH(dk))≥k, hence there is no K>0 such that diam(πH(dk)∪πH(αk))≤K for all k∈N.
∎
The rest of the section is dedicated to the proof of the following.
Theorem 5.5**.**
The group G has 5-fellow projections on H with respect to \SS.
The following three lemmas are preliminaries to the proof of Theorem 5.5.
Lemma 5.6 is known to experts but to our knowledge is nowhere explicitly written in the literature.
Lemma 5.6**.**
Let a,b∈M and let a=um⋯u2u1 and b=vn⋯v2v1 be the right greedy normal forms of a and b, respectively.
If a≤Rb, then m≤n and for all i∈{1,…,m}, one has that uiui−1⋯u1≤Rvivi−1⋯v1.
Proof.
We already know by Theorem 2.1 and Lemma 3.5 that m=lg(a)≤lg(b)=n.
It remains to show that ui⋯u1≤Rvi⋯v1 for all i∈{1,…,m}.
We argue by induction on i.
Note that for x,y∈M, if x≤Ry then (x∧RΔ)≤R(y∧RΔ).
Therefore, the case i=1 is true by definition of a right greedy normal form.
So, we can assume that i≥2 and that the inductive hypothesis holds.
By induction we have ui−1⋯u1≤Rvi−1⋯v1.
Let c∈M such that cui−1⋯u1=vi−1⋯v1.
We have ui≤RΔ, um⋯ui≤Rvn⋯vi+1vic and, by Dehornoy [9, Lemme 3.10], (vn⋯vi+1vic)∧RΔ=(vic)∧RΔ, hence ui≤Rvic, and therefore uiui−1⋯u1≤Rvivi−1⋯v1.
∎
Lemma 5.7**.**
Let a be an element of M which can be written in the form a=ω1ω2⋯ωkc, where ωi=Φ−i+1(ω) for all i∈{1,…,k}, Φ−k(ω)≤Lc, and c is Φ−k(N)-reduced.
Then lg(a)=lg(c)+k.
Proof.
We argue by induction on k.
The case k=0 being trivial, we can assume that k≥1 and that the inductive hypothesis holds.
It suffices to show that a∧LΔ=ω=ω1.
Indeed, in that case, by Theorem 2.1, we have lg(a)=lg(ω2⋯ωkc)+1. Since Φ(\SS)=\SS, Φ preserves lg, thus lg(ω2⋯ωkc)=lg(ω1ω2⋯ωk−1Φ(c)) and Φ(c) is Φ−k+1(N)-reduced. By induction, lg(ω2⋯ωkc)=lg(c)+k−1, hence lg(a)=lg(c)+k.
Set x=a∧LΔ.
Since ω=ω1≤La and ω≤LΔ, we have ω≤Lx.
Let x1∈M such that x=ωx1.
We have ωx1σ(x)=xσ(x)=Δ=ωδ1, where δ1=Φ−1(δ), hence x1≤Lδ1, thus x1∈Φ−1(N), since Φ−1(N) is a parabolic submonoid of M.
We also have x1≤Lω2⋯ωkc and ω2⋯ωkc is Φ−1(N)-reduced by Lemma 3.6, hence x1=1 and x=ω.
∎
Lemma 5.8**.**
Let α∈G, ℓ=lg(Hα) and Min(α)={γ∈Hα∣lg(γ)=ℓ}.
Then ℓ=d(α,H) and we have a bijective map Min(α)→πH(α) which sends γ to αγ−1 for all γ∈Min(α).
Proof.
If β∈H, then d(β,α)=lg(β−1α)≥ℓ.
On the other hand, if γ∈Min(α) and β=αγ−1, then β∈H and d(β,α)=lg(β−1α)=lg(γ)=ℓ.
So, ℓ=d(α,H) and β∈πH(α).
Reciprocally, if β∈πH(α) and γ=β−1α∈Hα, then lg(γ)=d(β,α)=ℓ and γ∈Min(α).
∎
The proof of Theorem 5.5 is divided into three cases, each case being treated in one of the following three lemmas.
Lemma 5.9**.**
Let α∈G, β∈πH(α) and u∈\SS.
Denote by θ the element of T such that Hα=Hθ and assume that θ=c∈M.
Then there exists β′∈πH(αu) such that d(β,β′)≤3.
Proof.
Set ℓ=lg(Hα).
By Theorem 3.3, lg(θ)=ℓ and c=θ∈Min(α).
By Lemma 5.8 there exists γ∈Min(α) such that β=αγ−1.
Let β1∈H such that β1θ=γ.
Let b1′−1b1 be the left orthogonal form of β1.
By Lemma 3.7 we have that b1′∧L(b1c)=1.
Thus, by Theorem 2.1, ℓ=lg(γ)=lg(b1′)+lg(b1c) and, by Lemma 3.5, lg(b1c)≥lg(c).
Since ℓ=lg(c), it follows that b1′=1, β1=b1∈N and γ=b1c∈M.
Set b2=τN(cu)∈N and denote by c′ the element of M such that cu=b2c′.
Note that c′ is N-reduced, hence c′∈T.
Note also that Hc′=Hαu, hence θ′=c′ is the element of T which lies in Hαu, and, by Theorem 3.3, lg(Hαu)=lg(c′).
Since c is N-reduced, we have b2∧Lc=1, hence, by Theorem 2.1, lg(b2−1c)=lg(b2)+lg(c).
So,
[TABLE]
hence lg(b2)≤2.
It follows that
[TABLE]
Now we show that there exist b3,b4∈N such that b3b4=b1b2, lg(b4c′)=lg(c′) and lg(b3)≤3.
Set n=lg(b1b2c′) and m=lg(c′).
We have
[TABLE]
Let b1b2c′=vn⋯v2v1 be the right greedy normal form of b1b2c′.
Then c′≤Rvn⋯v2v1.
Set d=vm⋯v2v1.
Since lg(c′)=m, by Lemma 5.6 we have c′≤Rd and, by Theorem 2.1, m=lg(d).
Let b4∈M such that b4c′=d, and let b3=vn⋯vm+1.
We have b3b4c′=b1b2c′, hence b3b4=b1b2, therefore b3,b4∈N since b1b2∈N and N is a parabolic submonoid.
By the above we also have lg(b3)=n−m≤3 and lg(b4c′)=lg(d)=lg(c′).
Set γ′=b4c′ and β′=(αu)γ′−1.
By the above, γ′∈Min(αu), hence, by Lemma 5.8, β′∈πH(αu).
Moreover,
[TABLE]
hence d(β,β′)=lg(b3)≤3.
∎
Lemma 5.10**.**
Let α∈G, β∈πH(α) and u∈\SS.
Denote by θ the element of T such that Hθ=Hα and assume that θ∈M−1∖{1}.
Then there exists β′∈πH(αu) such that d(β,β′)≤3.
Proof.
Let θ=cΔ−t be the right Δ-form of θ and ℓ=lg(θ).
By Theorem 3.3, ℓ=lg(Hα) and θ∈Min(α).
Since θ∈M−1 and θ=1, by Proposition 2.3 (2), t≥lg(c) and Corollary 2.4, ℓ=t≥lg(c) and ℓ≥1.
Moreover, since θ∈T, the element c is N-reduced and ω≤Lc.
By Lemma 5.8, there exists γ∈Min(α) such that β=αγ−1.
Let β1∈H such that β1θ=γ.
We show that β1=b1∈N.
Suppose instead that β1∈N.
Then β1 is written β1=b1δ−k where k≥1 and δ≤Lb1.
By Lemma 3.9, the right Δ-form of γ is γ=b1ω1ω2⋯ωkΦ−k(c)Δ−k−ℓ, where ωi=Φ−i+1(ω).
By Corollary 2.4 and Lemma 5.7 it follows that
[TABLE]
contradiction.
So, β1=b1∈N and γ=(b1c)Δ−ℓ.
By Lemma 3.8, b1c is unmovable, hence γ=(b1c)Δ−ℓ is the right Δ-form of γ and, by Corollary 2.4, ℓ=lg(γ)=max(lg(b1c),ℓ).
Thus, lg(c)≤lg(b1c)≤ℓ.
We have θu=cΔ−ℓu=cu1Δ−ℓ, where u1=Φ−ℓ(u)∈\SS.
Let b2=τ(cu1)∈N and let c1∈M such that cu1=b2c1.
We write c1 in the form c1=ω1ω2⋯ωpc2, where ωi=Φ−i+1(ω) for all i∈{1,…,p}, and Φ−p(ω)≤Lc2.
We show that p≤1.
Assume instead that p≥2.
Let u1′∈Div(Δ) such that u1′u1=Δ.
Recall that φ:H→H denotes the conjugation by δ in H.
Then
[TABLE]
Observe that for x∈M one has that Δi≤LxΔi and Δi≤RΔix. We have that
[TABLE]
contradiction.
So, p≤1.
Let b1′=ωp−1⋯ω1−1b1ω1⋯ωp∈Φ−p(N) and b2′=ωp−1⋯ω1−1b2ω1⋯ωp∈Φ−p(N).
Then b1cu1=b1b2c1=b1b2ω1⋯ωpc2=ω1⋯ωpb1′b2′c2.
We show that there exist b3′,b4′∈Φ−p(N) such that b3′b4′=b1′b2′, lg(b4′c2)≤max(ℓ−p,lg(c2)) and lg(b3′)≤2.
Set n=lg(b1′b2′c2) and m=max(ℓ−p,lg(c2)).
We have
[TABLE]
hence ℓ−p≤m≤ℓ−p+2.
So,
[TABLE]
Let b1′b2′c2=vn⋯v2v1 be the right greedy normal form of b1′b2′c2.
Suppose first that m≥n.
Set b3′=1 and b4′=b1′b2′.
Then lg(b4′c2)=lg(b1′b2′c2)=n≤m=max(ℓ−p,lg(c2)) and lg(b3′)=0≤2.
Suppose now that m<n.
Let d=vm⋯v2v1.
Since lg(c2)≤m, by Lemma 5.6 we have that c2≤Rd.
Let b4′∈M such that b4′c2=d, and let b3′=vn⋯vm+1.
Then lg(b3′)≤n−m≤2, lg(b4′c2)≤m=max(ℓ−p,lg(c2)), b3′b4′=b1′b2′, since b3′b4′c2=b1′b2′c2, and b3′,b4′∈Φ−p(N), since b3′b4′=b1′b2′∈Φ−p(N) and Φ−p(N) is a parabolic submonoid.
Let c′=Φp(c2) and θ′=c′Δ−ℓ+p.
We have Φ−p(ω)≤Lc2, hence ω≤Lc′.
Since ω≤LΔ, this also implies that Δ≤Lc′, that is, c′ is unmovable.
Let b′∈Φ−p(N).
Set b=ω1⋯ωpb′ωp−1⋯ω1−1∈N.
If b′≤Lc2, then ω1⋯ωpb′=bω1⋯ωp≤Lω1⋯ωpc2=c1, hence b≤Lc1.
Since c1 is N-reduced, it follows that b=1, hence b′=1.
This shows that c2 is Φ−p(N)-reduced, hence c′ is N-reduced.
Finally, since ℓ≥1 and p≤1, we have ℓ−p≥0.
So, θ′∈T.
On the other hand,
[TABLE]
hence θ′ is the element of T which lies in Hαu.
Set b3=Φp(b3′) and b4=Φp(b4′).
Then b3,b4∈N,lg(b3)≤2, and lg(b4c′)=lg(b4′c2)≤max(ℓ−p,lg(c2))=max(ℓ−p,lg(c′))=lg(θ′).
Let γ′=(b4c′)Δ−ℓ+p=b4θ′.
If we had Δ≤Lb4c′, then we would have ω≤Lb4c′, hence we would have ω∨Lb4=b4ω≤Lb4c′, and therefore ω≤Lc′: contradiction.
So, b4c′ is unmovable, hence (b4c′)Δ−ℓ+p is the right Δ-form of γ′.
By Corollary 2.4 and the above it follows that lg(γ′)=max(lg(b4c′),ℓ−p)=max(lg(c′),ℓ−p)=lg(θ′), hence, since θ′∈Min(αu), we have γ′∈Min(αu).
Let β′=αuγ′−1.
We have β′∈πH(αu) by Lemma 5.8.
Moreover,
[TABLE]
So, d(β,β′)=lg(δ−pb3)≤p+lg(b3)≤3.
∎
Lemma 5.11**.**
Let α∈G, β∈πH(α) and u∈\SS.
Denote by θ the element of T such that Hθ=Hα and assume that θ∈M∪M−1.
Then there exists β′∈πH(αu) such that d(β,β′)≤5.
Proof.
Let θ=cΔ−ℓ be the right Δ-form of θ.
Since θ∈M∪M−1, by Proposition 2.3 and Corollary 2.4, we have 1≤ℓ<lg(c) and lg(θ)=lg(c).
Furthermore, by Theorem 3.3, lg(Hα)=lg(θ) and so θ∈Min(α).
Moreover, since θ∈T, the element c is N-reduced and ω≤Lc.
By Lemma 5.8 there exists γ∈Min(α) such that β=αγ−1.
Let β1∈H such that β1θ=γ.
We show that β1=b1∈N.
Suppose instead that β1∈N.
Then β1 is written β1=b1δ−k where k≥1, b1∈N, and δ≤Lb1.
By Lemma 3.9, the right Δ-form of γ is γ=b1ω1ω2⋯ωkΦ−k(c)Δ−k−ℓ, where ωi=Φ−i+1(ω).
Then, by Corollary 2.4 and Lemma 5.7, lg(γ)=max(lg(b1ω1⋯ωkΦ−k(c)),k+ℓ)≥max(lg(ω1⋯ωkΦ−k(c)),k+ℓ)=max(lg(c)+k,k+ℓ)>lg(c)=lg(θ): contradiction.
So, β1=b1∈N and γ=(b1c)Δ−ℓ.
By Lemma 3.8, b1c is unmovable, hence γ=(b1c)Δ−ℓ is the right Δ-form of γ.
By Corollary 2.4, lg(c)=lg(θ)=lg(γ)=max(lg(b1c),ℓ)≥lg(b1c) and, by Lemma 3.5, lg(b1c)≥lg(c), hence lg(c)=lg(b1c).
We have θu=cΔ−ℓu=cu1Δ−ℓ, where u1=Φ−ℓ(u)∈\SS.
Let b2=τ(cu1)∈N and let c1∈M such that cu1=b2c1.
Since c is N-reduced, we have b2∧Lc=1, hence, by Theorem 2.1, lg(b2−1c)=lg(b2)+lg(c).
It follows that
[TABLE]
hence lg(b2)≤2.
We write c1 in the form c1=ω1ω2⋯ωpc2, where ωi=Φ−i+1(ω) for all i∈{1,…,p}, and Φ−p(ω)≤Lc2.
We show that p≤1 in the same way as in the proof of Lemma 5.10.
Moreover, by the above,
[TABLE]
Let b1′=ωp−1⋯ω1−1b1ω1⋯ωp∈Φ−p(N) and b2′=ωp−1⋯ω1−1b2ω1⋯ωp∈Φ−p(N).
Then b1cu1=b1b2c1=b1b2ω1⋯ωpc2=ω1⋯ωpb1′b2′c2.
We show now that there exist b3′,b4′∈Φ−p(N) such that b3′b4′=b1′b2′, lg(b4′c2)=lg(c2) and lg(b3′)≤4.
Set n=lg(b1′b2′c2) and m=lg(c2).
We have n≥m by Lemma 3.5 and, by the above,
[TABLE]
Let b1′b2′c2=vn⋯v2v1 be the right greedy normal form of b1′b2′c2.
Set d=vm⋯v2v1.
By Lemma 5.6 we have c2≤Rd.
Let b4′∈M such that b4′c2=d and let b3′=vn⋯vm+1.
We have b3′b4′c2=b1′b2′c2, hence b3′b4′=b1′b2′.
In particular, b3′,b4′∈Φ−p(N), since b1′b2′∈Φ−p(N) and Φ−p(N) is a parabolic submonoid.
Furthermore, by the above, lg(b3′)=n−m≤4 and lg(b4′c2)=lg(d)=m=lg(c2).
Let c′=Φp(c2) and let θ′=c′Δ−ℓ+p.
We show in the same way as in the proof of Lemma 5.10 that θ′=c′Δ−ℓ+p is the right Δ-form of θ′, that ω≤Lc′, that θ′∈T, and that θ′∈Hαu.
Set b3=Φp(b3′) and b4=Φp(b4′).
Then b3,b4∈N, lg(b3)≤4, and lg(b4c′)=lg(b4′c2)=lg(c2)=lg(c′).
Let γ′=(b4c′)Δ−ℓ+p=b4θ′.
If we had Δ≤Lb4c′, then we would have ω≤Lb4c′, hence we would have ω∨Lb4=b4ω≤Lb4c′, and therefore ω≤Lc′: contradiction.
So, b4c′ is unmovable, hence (b4c′)Δ−ℓ+p is the right Δ-form of γ′.
By Corollary 2.4 and the above it follows that lg(γ′)=max(lg(b4c′),ℓ−p)=max(lg(c′),ℓ−p)=lg(θ′).
So, since θ′∈Min(αu), we have γ′∈Min(αu).
Let β′=αuγ′−1.
We have β′∈πH(αu) by Lemma 5.8.
Furthermore,
[TABLE]
Thus, d(β,β′)=lg(δ−pb3)≤p+lg(b3)≤5.
∎
Proof of Theorem 5.5.
Follows directly from Lemma 5.9, Lemma 5.10 and Lemma 5.11.
∎
Acknowledgments
The first author acknowledges partial
support from the Spanish Government through grant number MTM2017-82690-P and through the ”Severo Ochoa Programme for Centres of Excellence in R&D” (SEV–2015–0554)