text:
# Untitled Document

Artin monoids inject in their groups

Luis Paris

January 31, 2001

Abstract

We prove that the natural homomorphism from an Artin monoid to its associated Artin group is always injective.

AMS Subject Classification: Primary 20F36; Secondary 20F55.

1. Introduction

Let $`S`$ be a finite set. A Coxeter matrix over $`S`$ is a matrix $`M=(m_{s,t})_{s,tS}`$ indexed by the elements of $`S`$ and such that:

$``$ $`m_{s,s}=1`$ for all $`sS`$;

$``$ $`m_{s,t}=m_{t,s}\{2,3,4,\mathrm{},+\mathrm{}\}`$ for all $`s,tS,st`$.

A Coxeter matrix $`M=(m_{s,t})_{s,tS}`$ is usually represented by its Coxeter graph $`\mathrm{\Gamma }`$. This is defined by the following data:

$``$ S is the set of vertices of $`\mathrm{\Gamma }`$;

$``$ two vertices $`s,tS`$ are joined by an edge if $`m_{s,t}3`$;

$``$ the edge which joines $`s`$ and $`t`$ is labelled by $`m_{s,t}`$ if $`m_{s,t}4`$.

The Coxeter system associated with $`\mathrm{\Gamma }`$ is the pair $`(W,S)`$, where $`W`$ is the group presented by

$$W=S|s^2=1\mathrm{for}sS,(st)^{m_{s,t}}=1\mathrm{for}s,tS,st,m_{s,t}<+\mathrm{}.$$

The group $`W`$ is called the Coxeter group associated with $`\mathrm{\Gamma }`$.

Let $`\mathrm{\Sigma }=\{\sigma _s;sS\}`$ be an abstract set in one-to-one correspondence with $`S`$. For two objects $`a,b`$ and $`m𝐍`$ we write

$$\mathrm{prod}(a,b;m)=\{\begin{array}{cc}(ab)^{\frac{m}{2}}& \mathrm{if}m\mathrm{is}\mathrm{even}\\ (ab)^{\frac{m1}{2}}a& \mathrm{if}m\mathrm{is}\mathrm{odd}\end{array}$$

The Artin system associated with $`\mathrm{\Gamma }`$ is the pair $`(G_\mathrm{\Gamma },\mathrm{\Sigma })`$, where $`G_\mathrm{\Gamma }`$ is the group presented by

$$G_\mathrm{\Gamma }=\mathrm{\Sigma }|\mathrm{prod}(\sigma _s,\sigma _t;m_{s,t})=\mathrm{prod}(\sigma _t,\sigma _s;m_{s,t})\mathrm{for}s,tS,st,m_{s,t}<+\mathrm{}.$$

The group $`G_\mathrm{\Gamma }`$ is called the Artin group associated with $`\mathrm{\Gamma }`$.

Recall that a monoid is a semigroup with a unity, and a homomorphism of monoids is a map $`\varphi :MM^{}`$ which satisfies $`\varphi (fg)=\varphi (f)\varphi (g)`$ for all $`f,gM`$, and $`\varphi (1)=1`$. The Artin monoid associated with $`\mathrm{\Gamma }`$ is the monoid $`G_\mathrm{\Gamma }^+`$ presented by the same generators and relations as $`G_\mathrm{\Gamma }`$. Let $`\iota :G_\mathrm{\Gamma }^+G_\mathrm{\Gamma }`$ denote the canonical homomorphism from $`G_\mathrm{\Gamma }^+`$ to $`G_\mathrm{\Gamma }`$. The goal of this paper is to prove the following.

Theorem 1.1. The homomorphism $`\iota :G_\mathrm{\Gamma }^+G_\mathrm{\Gamma }`$ is injective for all Coxeter graphs.

It seems that the authorship of the Artin groups, also called generalized braid groups, has to be attributed to Jacques Tits, in spite of the fact that his name does not always appear in the references. Furthermore, it is in a paper of him \[Tit2\] where these groups appeared for the first time. However, it was Brieskorn and Saito who proposed in \[BS\] the question of the study of all these groups (Deligne’s paper \[Del\], which appeared at the same time, is concerned only with spherical type Artin groups, namely, those Artin groups for which $`W`$ is finite). Some families of Artin groups are well understood, but, since the paper of Brieskorn and Saito in 1972, very few results concerning all Artin groups have been published. In particular, Theorem 1.1 above was known only for some particular classes, namely, for the spherical type Artin groups (see \[BS\] and \[Del\]), for the two-dimensional Artin groups (see \[ChP\] and \[Cha\]), and for the FC-type Artin groups (see \[Alt\] and \[Cha\]). It was unknown, for example, for the so-called affine type Artin groups.

Our proof of Theorem 1.1 is independent of the previous approachs of the problem. Note first that, in order to prove Theorem 1.1, it suffices to show that there exists an injective homomorphism $`\psi :G_\mathrm{\Gamma }^+G`$, where $`G`$ is a group, not necessarily equal to $`G_\mathrm{\Gamma }`$.

We say that a Coxeter graph $`\mathrm{\Gamma }`$ is of small type if $`m_{s,t}\{2,3\}`$ for all $`s,tS`$, $`st`$. We say that $`\mathrm{\Gamma }`$ has no triangle if there is no triple $`\{s,t,r\}`$ in $`S`$ such that $`m_{s,t},m_{s,r},m_{t,r}3`$. The first ingredient in our proof is to show that, for any Coxeter graph $`\mathrm{\Gamma }`$, there exists an injective homomorphism $`\varphi :G_\mathrm{\Gamma }^+G_{\stackrel{~}{\mathrm{\Gamma }}}^+`$, where $`G_{\stackrel{~}{\mathrm{\Gamma }}}^+`$ is an Artin monoid associated to a Coxeter graph $`\stackrel{~}{\mathrm{\Gamma }}`$ of small type with no triangle. The homomorphism $`\varphi `$ is obtained by a “folding” as described in \[Cri\], its construction is essentially the same as the one given in \[CrP, Sec. 6\], and the proof of the injectivity is a direct application of \[Cri, Thm. 1.3\]. This construction is given in Section 5.

So, in order to prove Theorem 1.1, it suffices to consider only Coxeter graphs of small type with no triangle. Take such a Coxeter graph, $`\mathrm{\Gamma }`$. We construct in Section 3 a homomorphism $`\psi :G_\mathrm{\Gamma }^+\mathrm{Gl}(V)`$, where $`V`$ is a (infinite dimensional) vector space over $`𝐐(x,y)`$, and we prove in Section 4 that $`\psi `$ is injective.

If $`\mathrm{\Gamma }=A_n`$, then $`G_{A_n}`$ is the braid group on $`n+1`$ strings, and $`\psi :G_{A_n}^+\mathrm{Gl}(V)`$ is equivalent to the representation constructed by Bigelow and Krammer in \[Big\], \[Kra1\] and \[Kra2\]. In this case, $`V`$ has finite dimension, and the injectivity of $`\psi `$ implies the injectivity of the induced representation $`G_{A_n}\mathrm{Gl}(V)`$. More generally, if $`\mathrm{\Gamma }`$ is of spherical and small type, then the representation $`\psi :G_\mathrm{\Gamma }^+\mathrm{Gl}(V)`$ is equivalent to the ones constructed independently by Digne \[Dig\], and by Cohen and Wales \[CW\]. In this case again, $`V`$ has finite dimension and the induced representation $`G_\mathrm{\Gamma }\mathrm{Gl}(V)`$ is injective. We do not know whether the representation $`G_\mathrm{\Gamma }\mathrm{Gl}(V)`$ induced by $`\psi `$ is injective for all Coxeter graphs of small type with no triangle. The construction of $`\psi `$ and the proof of the injectivity are based on a (non always easy) generalization of the methods of Krammer, Digne, Cohen and Wales.

Acknoledgements. I would like to thank John Crisp for many useful conversations during the preparation of this work, and for drawing my attention to the results of \[Cri\] which are one of the main tools of the proof of Theorem 1.1.

2. Preliminaries

We summarize in this section some well known results on Artin monoids, Coxeter groups and root systems, and give definitions and some basic properties of closed sets. The closed sets have been introduced by Krammer in \[Kra2\] for Artin groups of type $`A_n`$. This notion has been extended to the Artin groups of small and spherical type by Digne \[Dig\], Cohen and Wales \[CW\]. Here we extend it to all small type Artin groups.

Let $`\mathrm{\Gamma }`$ be a Coxeter graph. It is shown in \[BS\] that the Artin monoid $`G_\mathrm{\Gamma }^+`$ is cancellative, namely, if $`fg_1h=fg_2h`$, then $`g_1=g_2`$. We say that $`h`$ is a multiple of $`g`$ and write $`g<h`$ if there exists $`fG_\mathrm{\Gamma }^+`$ such that $`gf=h`$. The relation $`<`$ is a partial ordering on $`G_\mathrm{\Gamma }^+`$.

Let $`\theta :G_\mathrm{\Gamma }^+W`$ be the homomorphism which sends $`\sigma _s`$ to $`s`$ for all $`sS`$. Then $`\theta `$ has a natural set-section $`\tau :WG_\mathrm{\Gamma }^+`$ defined as follows. Let $`wW`$. We choose a reduced expression $`w=s_1\mathrm{}s_l`$ for $`w`$ and we set $`\tau (w)=\sigma _{s_1}\mathrm{}\sigma _{s_l}`$. By Tits’ solution of the word problem for Coxeter groups \[Tit1\], the definition of $`\tau (w)`$ does not depend on the choice of the reduced expression.

Let $`l:W𝐍`$ and $`l:G_\mathrm{\Gamma }^+𝐍`$ denote the word length functions of $`W`$ and $`G_\mathrm{\Gamma }^+`$ with respect to $`S`$ and $`\mathrm{\Sigma }`$, respectively. Define a partial ordering on $`W`$ by $`u<v`$ if $`l(v)=l(u)+l(u^1v)`$. Then $`l(\tau (w))=l(w)`$ for all $`wW`$, and one has $`u<v`$ if and only if $`\tau (u)<\tau (v)`$.

The proof of the following proposition is essentially the same as the one of \[Del, Pro. 1.14\] and \[Mic, Lem. 1.4\].

Proposition 2.1. Let $`E`$ be a finite subset of $`W`$ such that:

$``$ if $`u<v`$ and $`vE`$, then $`uE`$;

$``$ if $`vW`$ and $`s,tS`$ are such that $`l(vs)=l(vt)=l(v)+1`$ and $`vs,vtE`$, then $`m_{s,t}<+\mathrm{}`$ and $`v\mathrm{prod}(s,t;m_{s,t})E`$.

Then there exists $`w_0W`$ such that $`E=\{vW;v<w_0\}`$.

The next proposition is part of \[Mic, Prop. 2.1\]. It is also a direct consequence of \[BS, Lem. 2.1 and Prop. 2.3\].

Proposition 2.2. Let $`fG_\mathrm{\Gamma }^+`$ and let $`E=\{wW;\tau (w)<f\}`$. Then $`E`$ satisfies:

$``$ if $`u<v`$ and $`vE`$, then $`uE`$;

$``$ if $`vW`$ and $`s,tS`$ are such that $`l(vs)=l(vt)=l(v)+1`$ and $`vs,vtE`$, then $`m_{s,t}<+\mathrm{}`$ and $`v\mathrm{prod}(s,t;m_{s,t})E`$.

Definition. Let $`fG_\mathrm{\Gamma }^+`$. By Propositions 2.1 and 2.2, there exists a unique $`w_0W`$ such that $`\{vW;\tau (v)<f\}=\{vW;v<w_0\}`$. We set

$$L(f)=w_0.$$

The next proposition is also part of \[Mic, Prop. 2.1\]

Proposition 2.3. Let $`f,gG_\mathrm{\Gamma }^+`$. Then

$$L(fg)=L(f(\tau L)(g)).$$

Let $`\mathrm{\Pi }=\{\alpha _s;sS\}`$ be an abstract set in one-to-one correspondence with $`S`$. The elements of $`\mathrm{\Pi }`$ are called simple roots. Let $`U`$ denote the real vector space having $`\mathrm{\Pi }`$ as a basis, and let $`,:U\times U𝐑`$ be the symmetric bilinear form on $`U`$ defined by

$$\alpha _s,\alpha _t=\{\begin{array}{cc}2\mathrm{cos}(\pi /m_{s,t})& \mathrm{if}m_{s,t}<+\mathrm{}\\ 2& \mathrm{if}m_{s,t}=+\mathrm{}\end{array}$$

There is a faithful representation $`W\mathrm{Gl}(U)`$ which is defined by

$$s(x)=x\alpha _s,x\alpha _s,xU,sS,$$

and which preserves the bilinear form $`,`$. This representation is called the canonical representation of $`W`$.

The set $`\mathrm{\Phi }=\{w\alpha _s;sS,wW\}`$ is called the root system of $`W`$. The subsets $`\mathrm{\Phi }^+=\{_{sS}\lambda _s\alpha _s\mathrm{\Phi };\lambda _s0`$ for all $`sS\}`$ and $`\mathrm{\Phi }^{}=\{\beta \mathrm{\Phi };\beta \mathrm{\Phi }^+\}`$ are the sets of positive roots and negative roots, respectively. For $`wW`$ we set $`\mathrm{\Phi }_w=\{\beta \mathrm{\Phi }^+;w^1\beta \mathrm{\Phi }^{}\}`$.

We list in the following proposition some well known results on root systems (see \[Hil\] and \[Deo\]).

Proposition 2.4. (1) $`\mathrm{\Phi }=\mathrm{\Phi }^+\mathrm{\Phi }^{}`$.

(2) $`|\mathrm{\Phi }_w|=l(w)`$ for all $`wW`$.

(3) For all $`u,vW`$ such that $`u<v`$, one has $`\mathrm{\Phi }_v=\mathrm{\Phi }_uu\mathrm{\Phi }_{u^1v}`$.

(4) For all $`wW`$ and $`sS`$,

$$l(sw)=\{\begin{array}{cc}l(w)+1& \mathrm{𝑖𝑓}w^1\alpha _s\mathrm{\Phi }^+\\ l(w)1& \mathrm{𝑖𝑓}w^1\alpha _s\mathrm{\Phi }^{}\end{array}$$

(5) Let $`\beta =w\alpha _s\mathrm{\Phi }^+`$, and let $`r_\beta =wsw^1`$. Then $`r_\beta `$ acts on $`U`$ by

$$r_\beta (x)=xx,\beta \beta ,xU.$$

Let $`\beta \mathrm{\Phi }^+`$. Define the depth of $`\beta `$ to be

$$\mathrm{dp}(\beta )=\mathrm{min}\{l𝐍;\mathrm{there}\mathrm{exists}wW\mathrm{such}\mathrm{that}w\beta \mathrm{\Phi }^{}\mathrm{and}l(w)=l\}.$$

Lemma 2.5. Let $`\beta \mathrm{\Phi }^+`$. Then

$$\mathrm{dp}(\beta )=\mathrm{min}\{l𝐍;\mathrm{𝑡ℎ𝑒𝑟𝑒}\mathrm{𝑒𝑥𝑖𝑠𝑡}wW\mathrm{𝑎𝑛𝑑}sS\mathrm{𝑠𝑢𝑐ℎ}\mathrm{𝑡ℎ𝑎𝑡}\beta =w^1\alpha _s\mathrm{𝑎𝑛𝑑}l=l(w)+1\}.$$

Proof. Let $`d_1=\mathrm{min}\{l𝐍`$; there exists $`wW`$ such that $`w\beta \mathrm{\Phi }^{}`$ and $`l(w)=l\}`$ and $`d_2=\mathrm{min}\{l𝐍;`$ there exist $`wW`$ and $`sS`$ such that $`\beta =w^1\alpha _s`$ and $`l=l(w)+1\}`$.

Let $`wW`$ and $`sS`$ such that $`\beta =w^1\alpha _s`$ and $`l(w)=d_21`$. Since $`\beta \mathrm{\Phi }^+`$, by Proposition 2.4, $`l(sw)=l(w)+1=d_2`$. Moreover, $`sw\beta =s\alpha _s=\alpha _s\mathrm{\Phi }^{}`$. This shows that $`d_2d_1`$.

Let $`wW`$ such that $`w\beta \mathrm{\Phi }^{}`$ and $`l(w)=d_1`$. Let $`sS`$ such that $`l(sw)=l(w)1`$. Let $`v=sw`$ and $`\gamma =v\beta `$. By the minimality of $`l(w)=d_1`$, one has $`\gamma \mathrm{\Phi }^+`$. Moreover, $`s\gamma =w\beta \mathrm{\Phi }^{}`$, thus $`\gamma =\alpha _s`$ and $`\beta =v^1\alpha _s`$. This shows that $`d_1d_2`$.

The following proposition is proved in \[BH, Lem. 1.7\].

Proposition 2.6. Let $`sS`$ and $`\beta \mathrm{\Phi }^+\{\alpha _s\}`$. Then

$$\mathrm{dp}(s\beta )=\{\begin{array}{cc}\mathrm{dp}(\beta )1& \mathrm{𝑖𝑓}\alpha _s,\beta >0\\ \mathrm{dp}(\beta )& \mathrm{𝑖𝑓}\alpha _s,\beta =0\\ \mathrm{dp}(\beta )+1& \mathrm{𝑖𝑓}\alpha _s,\beta <0\end{array}$$

From now on and till the end of the section, we assume that $`\mathrm{\Gamma }`$ is a Coxeter graph of small type, namely, that $`m_{s,t}\{2,3\}`$ for all $`s,tS`$, $`st`$. Note that, under this assumption, all the roots can be written $`\beta =_{sS}\lambda _s\alpha _s`$, with $`\lambda _s𝐙`$, and one has $`\beta ,\gamma 𝐙`$ for all $`\beta ,\gamma \mathrm{\Phi }`$.

Definition. A subset $`A\mathrm{\Phi }^+`$ is a closed subset if:

$``$ $`A`$ is finite;

$``$ if $`\alpha ,\beta A`$, then $`\alpha ,\beta 1`$;

$``$ if $`\alpha ,\beta A`$ and $`\alpha ,\beta =1`$, then $`\alpha +\beta =r_\alpha (\beta )=r_\beta (\alpha )A`$.

Lemma 2.7. Let $`wW`$. Then $`\mathrm{\Phi }_w`$ is a closed subset.

Proof. Let $`\alpha ,\beta \mathrm{\Phi }^+`$. A direct calculation shows that: if $`\alpha ,\beta 2`$, then $`(r_\alpha r_\beta )^l(\alpha )`$ is a positive root of the form $`a_l\alpha +b_l\beta `$, where $`a_l,b_l0`$, for all $`l𝐍`$, and $`(r_\alpha r_\beta )^l(\alpha )(r_\alpha r_\beta )^k(\alpha )`$ for $`lk`$. This implies that: if $`\alpha ,\beta 2`$, then there are infinitely many positive roots of the form $`a\alpha +b\beta `$, with $`a,b0`$.

The set $`\mathrm{\Phi }_w`$ is finite since $`|\mathrm{\Phi }_w|=l(w)`$. Let $`\alpha ,\beta \mathrm{\Phi }_w`$. If $`\gamma =a\alpha +b\beta `$, with $`a,b0`$, is a positive root, then $`\gamma \mathrm{\Phi }_w`$, since $`w^1\gamma =aw^1\alpha +bw^1\beta `$ is a negative root. By the above considerations, this implies that $`\alpha ,\beta 1`$ and that $`\alpha +\beta \mathrm{\Phi }_w`$ if $`\alpha ,\beta =1`$.

Proposition 2.8. Let $`A`$ be a closed subset of $`\mathrm{\Phi }^+`$ and let $`E=\{wW;\mathrm{\Phi }_wA\}`$. Then $`E`$ satisfies:

$``$ $`E`$ is finite;

$``$ if $`u<v`$ and $`vE`$, then $`uE`$;

$``$ if $`vW`$ and $`s,tS`$ are such that $`l(vs)=l(vt)=l(v)+1`$ and $`vs,vtE`$, then $`v\mathrm{prod}(s,t;m_{s,t})E`$.

Proof. If $`\mathrm{\Phi }_wA`$, then $`l(w)=|\mathrm{\Phi }_w||A|`$. Since $`A`$ is finite, it follows that $`l(w)`$ is bounded for all $`wE`$, thus $`E`$ is finite.

Suppose $`u<v`$ and $`vE`$. Then, by Proposition 2.4, $`\mathrm{\Phi }_u\mathrm{\Phi }_vA`$, thus $`uE`$.

Let $`vW`$ and $`s,tS`$ such that $`l(vs)=l(vt)=l(v)+1`$ and $`vs,vtE`$. By Proposition 2.4, one has $`\mathrm{\Phi }_{vs}=\mathrm{\Phi }_v\{v\alpha _s\}`$ and $`\mathrm{\Phi }_{vt}=\mathrm{\Phi }_v\{v\alpha _t\}`$. Let $`w=v\mathrm{prod}(s,t;m_{s,t})`$. If $`m_{s,t}=2`$ then $`\mathrm{\Phi }_w=\mathrm{\Phi }_v\{v\alpha _s,v\alpha _t\}A`$, thus $`wE`$. If $`m_{s,t}=3`$, then $`v\alpha _s,v\alpha _t=\alpha _s,\alpha _t=1`$, thus $`v\alpha _s+v\alpha _t=v(\alpha _s+\alpha _t)A`$. It follows that $`\mathrm{\Phi }_w=\mathrm{\Phi }_v\{v\alpha _s,v\alpha _t,v(\alpha _s+\alpha _t)\}A`$, thus $`wE`$.

Definition. Let $`A`$ be a closed subset of $`\mathrm{\Phi }^+`$. By Propositions 2.1 and 2.8, there exists a unique $`w_0W`$ such that $`\{wW;\mathrm{\Phi }_wA\}=\{wW;w<w_0\}`$. We set

$$C(A)=w_0.$$

Note that $`C(\mathrm{\Phi }_w)=w`$ for all $`wW`$.

3. The representation

Throughout this section, $`\mathrm{\Gamma }`$ is assumed to be a Coxeter graph of small type with no triangle, namely, $`m_{s,t}\{2,3\}`$ for all $`s,tS`$, $`st`$, and there is no triple $`\{s,t,r\}`$ in $`S`$ such that $`m_{s,t}=m_{s,r}=m_{t,r}=3`$. Our aim here is to construct a (infinite dimensional) linear representation $`\psi :G_\mathrm{\Gamma }^+\mathrm{Gl}(V)`$. We will prove in Section 4 that this linear representation is faithful. This will imply that $`\iota :G_\mathrm{\Gamma }^+G_\mathrm{\Gamma }`$ is injective.

Let $`=\{e_\beta ;\beta \mathrm{\Phi }^+\}`$ be an abstract set in one-to-one correspondence with $`\mathrm{\Phi }^+`$, let $`𝐊=𝐐(x,y)`$ denote the field of rationnal functions on two variables over $`𝐐`$, and let $`V`$ be the $`𝐊`$-vector space having $``$ as a basis.

For all $`sS`$, we define a linear transformation $`\phi _s:VV`$ by

$$\phi _s(e_\beta )=\{\begin{array}{cc}0& \mathrm{if}\beta =\alpha _s\\ e_\beta & \mathrm{if}\alpha _s,\beta =0\\ ye_{\beta a\alpha _s}& \mathrm{if}\alpha _s,\beta =a>0\mathrm{and}\beta \alpha _s\\ (1y)e_\beta +e_{\beta +a\alpha _s}& \mathrm{if}\alpha _s,\beta =a<0\end{array}$$

A direct (case by case) calculation shows that

$`\phi _s\phi _t`$ $`=\phi _t\phi _s`$ $`\mathrm{if}m_{s,t}=2`$  $`\phi _s\phi _t\phi _s`$ $`=\phi _t\phi _s\phi _t`$ $`\mathrm{if}m_{s,t}=3`$

So:

Proposition 3.1. The mapping $`\sigma _s\phi _s`$, $`sS`$, induces a homomorphism $`\phi :G_\mathrm{\Gamma }^+\mathrm{End}(V)`$.

Now, for all $`sS`$ and all $`\beta \mathrm{\Phi }^+`$, take a polynomial $`T(s,\beta )𝐐[y]`$ and define $`\psi _s:VV`$ by

$$\psi _s(e_\beta )=\phi _s(e_\beta )+xT(s,\beta )e_{\alpha _s}.$$

The goal of this section is to prove the following:

Theorem 3.2. There is a choice of polynomials $`T(s,\beta )`$, $`sS`$ and $`\beta \mathrm{\Phi }^+`$, so that the mapping $`\sigma _s\psi _s`$, $`sS`$, induces a homomorphism $`\psi :G_\mathrm{\Gamma }^+\mathrm{Gl}(V)`$.

Let $`sS`$ and $`\beta \mathrm{\Phi }^+`$. We define the polynomial $`T(s,\beta )`$ by induction on $`\mathrm{dp}(\beta )`$. Assume first that $`\mathrm{dp}(\beta )=1`$. There exists $`tS`$ such that $`\beta =\alpha _t`$. Then we set

| (D1) | $`T(s,\alpha _t)=`$ | $`y^2`$ | $`\mathrm{if}t=s`$ |
| --- | --- | --- | --- |
| (D2) | $`T(s,\alpha _t)=`$ | $`0`$ | $`\mathrm{if}ts`$ |

Now, assume that $`\mathrm{dp}(\beta )2`$. We choose $`tS`$ such that $`\mathrm{dp}(t\beta )=\mathrm{dp}(\beta )1`$. By Proposition 2.6, one has $`\alpha _t,\beta =b>0`$.

Case 1: $`\alpha _s,\beta =a>0`$. Then we set

| (D3) | $`T(s,\beta )`$ = | $`y^{\mathrm{dp}(\beta )}(y1)`$ |
| --- | --- | --- |

Case 2: $`\alpha _s,\beta =0`$. Then we set

| (D4) | $`T(s,\beta )`$ = | $`yT(s,\beta b\alpha _t)`$ | $`\mathrm{if}\alpha _s,\alpha _t=0`$ |
| --- | --- | --- | --- |
| (D5) | $`T(s,\beta )`$ = | $`(y1)T(s,\beta b\alpha _t)+yT(t,\beta b\alpha _sb\alpha _t)`$ | $`\mathrm{if}\alpha _s,\alpha _t=1`$ |

Case 3: $`\alpha _s,\beta =a<0`$. Then we set

| (D6) | $`T(s,\beta )`$ = | $`yT(s,\beta b\alpha _t)`$ | $`\mathrm{if}\alpha _s,\alpha _t=0`$ |
| --- | --- | --- | --- |
| (D7) | $`T(s,\beta )`$ = | $`(y1)T(s,\beta b\alpha _t)+yT(t,\beta (ba)\alpha _sb\alpha _t)`$ | $`\mathrm{if}\alpha _s,\alpha _t=1\mathrm{and}b>a`$ |
| (D8) | $`T(s,\beta )`$ = | $`T(t,\beta b\alpha _t)+(y1)T(s,\beta b\alpha _t)`$ | $`\mathrm{if}\alpha _s,\alpha _t=1\mathrm{and}b=a`$ |
| (D9) | $`T(s,\beta )`$ = | $`yT(s,\beta b\alpha _t)+T(t,\beta b\alpha _t)+y^{\mathrm{dp}(\beta )1}(1y)`$ | $`\mathrm{if}\alpha _s,\alpha _t=1\mathrm{and}b<a`$ |

The proofs of the following lemmas 3.3 and 3.4 are long and tedious case by case verifications and they are not very instructive for the remainder of the paper. So, we put them in a separate section at the end of the paper and continue with the proof of Theorem 3.2.

Lemma 3.3. Let $`sS`$ and $`\beta \mathrm{\Phi }^+`$ such that $`\mathrm{dp}(\beta )2`$ and $`\alpha _s,\beta =0`$. Then the definition of $`T(s,\beta )`$ does not depend on the choice of the $`tS`$ such that $`\mathrm{dp}(t\beta )=\mathrm{dp}(\beta )1`$.

Lemma 3.4. Let $`sS`$ and $`\beta \mathrm{\Phi }^+`$ such that $`\mathrm{dp}(\beta )2`$ and $`\alpha _s,\beta =a<0`$. Then the definition of $`T(s,\beta )`$ does not depend on the choice of the $`tS`$ such that $`\mathrm{dp}(t\beta )=\mathrm{dp}(\beta )1`$.

Lemma 3.5. Let $`s,tS`$ and $`\beta \mathrm{\Phi }^+`$ such that $`\alpha _s,\alpha _t=1`$, $`\alpha _s,\beta =0`$, and $`\alpha _t,\beta =0`$. Then

$$T(s,\beta )=T(t,\beta ).$$

Proof. We argue by induction on $`\mathrm{dp}(\beta )`$. Assume first that $`\mathrm{dp}(\beta )=1`$. There exists $`rS`$ such that $`\beta =\alpha _r`$. One has $`rs`$ and $`rt`$ since $`\alpha _s,\beta =\alpha _t,\beta =0`$. Then, by (D2),

$$T(s,\beta )=T(s,\alpha _r)=0=T(t,\alpha _r)=T(t,\beta ).$$

Now, assume that $`\mathrm{dp}(\beta )2`$. We choose $`rS`$ such that $`\mathrm{dp}(r\beta )=\mathrm{dp}(\beta )1`$. By Proposition 2.6, one has $`\alpha _r,\beta =c>0`$.

Case 1: $`\alpha _s,\alpha _r=0`$ and $`\alpha _t,\alpha _r=0`$. Then

$`T(s,\beta )`$ $`yT(s,\beta c\alpha _r)`$ by (D4)   $`yT(t,\beta c\alpha _r)`$ by induction   $`T(t,\beta )`$ by (D4)

Case 2: $`\alpha _s,\alpha _r=0`$ and $`\alpha _t,\alpha _r=1`$. We cannot have $`\mathrm{dp}(\beta )3`$ in this case. Suppose $`\mathrm{dp}(\beta )4`$. Then

$`T(s,\beta )`$ $`yT(s,\beta c\alpha _r)`$ by (D4)   $`y(y1)T(s,\beta c\alpha _tc\alpha _r)+y^2T(t,\beta c\alpha _sc\alpha _tc\alpha _r)`$ by (D5)   $`y^{\mathrm{dp}(\beta )1}(y1)^2+y^2T(t,\beta c\alpha _sc\alpha _tc\alpha _r)`$ by (D3)   $`y^{\mathrm{dp}(\beta )1}(y1)^2+y^2T(r,\beta c\alpha _sc\alpha _tc\alpha _r)`$ by induction   $`(y1)T(t,\beta c\alpha _r)+yT(r,\beta c\alpha _tc\alpha _r)`$ by (D3) and (D4)   $`T(t,\beta )`$ by (D5).

Since $`\mathrm{\Gamma }`$ has no triangle, we cannot have $`\alpha _s,\alpha _r=1`$ and $`\alpha _t,\alpha _r=1`$ ( because $`\alpha _s,\alpha _t=1`$). So, Case 1 and Case 2 are the only possible cases.

Lemma 3.6. Let $`s,tS`$ such that $`m_{s,t}=2`$. Then $`\psi _s\psi _t=\psi _t\psi _s`$.

Proof. Let $`\beta \mathrm{\Phi }^+`$. We compute $`(\psi _s\psi _t)(e_\beta )`$ and $`(\psi _t\psi _s)(e_\beta )`$ replacing $`T(s,\alpha _s)`$ and $`T(t,\alpha _t)`$ by $`y^2`$, and replacing $`T(s,\alpha _t)`$ and $`T(t,\alpha _s)`$ by $`0`$, and we compare both expressions. This can be easily made with a computer.

Case 1: $`\beta =\alpha _s`$. Then we directly obtain $`(\psi _s\psi _t)(e_\beta )=(\psi _t\psi _s)(e_\beta )`$.

Case 2: $`\alpha _s,\beta =0`$ and $`\alpha _t,\beta =0`$. Then we directly obtain $`(\psi _s\psi _t)(e_\beta )=(\psi _t\psi _s)(e_\beta )`$.

Case 3: $`\alpha _s,\beta =0`$ and $`\alpha _s,\beta =b>0`$. Then the equality $`(\psi _s\psi _t)(e_\beta )=(\psi _t\psi _s)(e_\beta )`$ is equivalent to

$$T(s,\beta )=yT(s,\beta b\alpha _t).$$

This equality follows from (D4).

Case 4: $`\alpha _s,\beta =0`$ and $`\alpha _t,\beta =b<0`$. Then the equality $`(\psi _s\psi _t)(e_\beta )=(\psi _t\psi _s)(e_\beta )`$ is equivalent to

$$T(s,\beta +b\alpha _t)=yT(s,\beta ).$$

This equality follows from (D4).

Case 5: $`\alpha _s,\beta =a>0`$ and $`\alpha _t,\beta =b>0`$. Then the equality $`(\psi _s\psi _t)(e_\beta )=(\psi _t\psi _s)(e_\beta )`$ is equivalent to

$$\begin{array}{c}\text{ }T(s,\beta )=yT(s,\beta b\alpha _t),\text{ }\hfill \\ \text{ }T(t,\beta )=yT(t,\beta a\alpha _s).\text{ }\hfill \end{array}$$

These two equalities follow from (D3).

Case 6: $`\alpha _s,\beta =a>0`$ and $`\alpha _t,\beta =b<0`$. Then the equality $`(\psi _s\psi _t)(e_\beta )=(\psi _t\psi _s)(e_\beta )`$ is equivalent to

$$\begin{array}{c}\text{ }T(s,\beta +b\alpha _t)=yT(s,\beta ),\text{ }\hfill \\ \text{ }T(t,\beta )=yT(t,\beta a\alpha _s).\text{ }\hfill \end{array}$$

The first equality follows from (D3) and the second one from (D6).

Case 7: $`\alpha _s,\beta =a<0`$ and $`\alpha _t,\beta =b<0`$. Then the equality $`(\psi _s\psi _t)(e_\beta )=(\psi _t\psi _s)(e_\beta )`$ is equivalent to

$$\begin{array}{c}\text{ }T(s,\beta +b\alpha _t)=yT(s,\beta ),\text{ }\hfill \\ \text{ }T(t,\beta +a\alpha _s)=yT(t,\beta ).\text{ }\hfill \end{array}$$

These two equalities follow from (D6).

Lemma 3.7. Let $`s,tS`$ such that $`m_{s,t}=3`$. Then $`\psi _s\psi _t\psi _s=\psi _t\psi _s\psi _t`$.

Proof. Let $`\beta \mathrm{\Phi }^+`$. We conpute $`(\psi _s\psi _t\psi _s)(e_\beta )`$ and $`(\psi _t\psi _s\psi _t)(e_\beta )`$ replacing $`T(s,\alpha _s)`$ and $`T(t,\alpha _t)`$ by $`y^2`$, replacing $`T(s,\alpha _t)`$ and $`T(t,\alpha _s)`$ by $`0`$, and replacing $`T(s,\alpha _s+\alpha _t)`$ and $`T(t,\alpha _s+\alpha _t)`$ by $`y^2(y1)`$, and we compare both expressions.

Case 1: $`\beta =\alpha _s`$. Then we directly obtain $`(\psi _s\psi _t\psi _s)(e_\beta )=(\psi _t\psi _s\psi _t)(e_\beta )`$.

Case 2: $`\beta =\alpha _s+\alpha _t`$. Then we directly obtain $`(\psi _s\psi _t\psi _s)(e_\beta )=(\psi _t\psi _s\psi _t)(e_\beta )`$.

Case 3: $`\alpha _s,\beta =0`$ and $`\alpha _t,\beta =0`$. Then the equality $`(\psi _s\psi _t\psi _s)(e_\beta )=(\psi _t\psi _s\psi _t)(e_\beta )`$ is equivalent to

$$T(s,\beta )=T(t,\beta ).$$

This equality follows from Lemma 3.5.

Case 4: $`\alpha _s,\beta =0`$ and $`\alpha _t,\beta =b>0`$. Then the equality $`(\psi _s\psi _t\psi _s)(e_\beta )=(\psi _t\psi _s\psi _t)(e_\beta )`$ is equivalent to

$$\begin{array}{c}\text{ }T(t,\beta )=yT(s,\beta b\alpha _t),\text{ }\hfill \\ \text{ }(1y)T(t,\beta )+yT(s,\beta )=y^2T(t,\beta b\alpha _sb\alpha _t).\text{ }\hfill \end{array}$$

The first equality follows from (D3) and the second one follows from the first one and from (D5).

Case 5: $`\alpha _s,\beta =0`$ and $`\alpha _t,\beta =b<0`$. Then the equality $`(\psi _s\psi _t\psi _s)(e_\beta )=(\psi _t\psi _s\psi _t)(e_\beta )`$ is equivalent to

$$\begin{array}{c}\text{ }(1y)T(s,\beta )+T(s,\beta +b\alpha _t)=T(t,\beta ),\text{ }\hfill \\ \text{ }yT(s,\beta )=(1y)T(t,\beta +b\alpha _t)+T(t,\beta +b\alpha _s+b\alpha _t).\text{ }\hfill \end{array}$$

The first equality follows from (D8) and the second one from (D5).

Case 6: $`\alpha _s,\beta =a>0`$ and $`\alpha _t,\beta =b>0`$. Then the equality $`(\psi _s\psi _t\psi _s)(e_\beta )=(\psi _t\psi _s\psi _t)(e_\beta )`$ is equivalent to

$$\begin{array}{c}\text{ }yT(s,\beta a\alpha _s(a+b)\alpha _t)=(1y)T(s,\beta b\alpha _t)+T(t,\beta ),\text{ }\hfill \\ \text{ }(1y)T(t,\beta a\alpha _s)+T(s,\beta )=yT(t,\beta (a+b)\alpha _sb\alpha _t),\text{ }\hfill \\ \text{ }T(t,\beta a\alpha _s)=T(s,\beta b\alpha _t).\text{ }\hfill \end{array}$$

These three equalities follow from (D3).

Case 7: $`\alpha _s,\beta =a>0`$, $`\alpha _t,\beta =b<0`$, and $`a>b`$. Then the equality $`(\psi _s\psi _t\psi _s)(e_\beta )=(\psi _t\psi _s\psi _t)(e_\beta )`$ is equivalent to

$$\begin{array}{c}\text{ }y^2T(s,\beta a\alpha _s(ab)\alpha _t)=(1y)^2T(s,\beta )+(1y)T(s,\beta +b\alpha _t)+yT(t,\beta ),\text{ }\hfill \\ \text{ }T(s,\beta )=T(t,\beta (ab)\alpha _s+b\alpha _t),\text{ }\hfill \\ \text{ }yT(t,\beta a\alpha _s)=(1y)T(s,\beta )+T(s,\beta +b\alpha _t).\text{ }\hfill \end{array}$$

The second and third equalities follow from (D3), and the first one follows from the third one and from (D7).

Case 8: $`\alpha _s,\beta =a>0`$, $`\alpha _s,\beta =b<0`$, and $`a=b`$. Then the equality $`(\psi _s\psi _t\psi _s)(e_\beta )=(\psi _t\psi _s\psi _t)(e_\beta )`$ is equivalent to

$$\begin{array}{c}\text{ }yT(s,\beta a\alpha _s)=(1y)^2T(s,\beta )+(1y)T(s,\beta +a\alpha _t)+yT(t,\beta ),\text{ }\hfill \\ \text{ }T(t,\beta +a\alpha _t)=yT(s,\beta ),\text{ }\hfill \\ \text{ }yT(t,\beta a\alpha _s)=(1y)T(s,\beta )+T(s,\beta +a\alpha _t).\text{ }\hfill \end{array}$$

The second equality follows from (D3), the third one follows from (D5), and the first one follows from the third one and from (D8).

Case 9: $`\alpha _s,\beta =a>0`$, $`\alpha _t,\beta =b<0`$, and $`a<b`$. Then the equality $`(\psi _s\psi _t\psi _s)(e_\beta )=(\psi _t\psi _s\psi _t)(e_\beta )`$ is equivalent to

$$\begin{array}{c}\text{ }y(1y)T(s,\beta a\alpha _s)+yT(s,\beta a\alpha _s+(ba)\alpha _t)=(1y)^2T(s,\beta )+(1y)T(s,\beta +b\alpha _t)+yT(t,\beta ),\text{ }\hfill \\ \text{ }yT(s,\beta )=(1y)T(t,\beta +b\alpha _t)+T(t,\beta +(ba)\alpha _s+b\alpha _t),\text{ }\hfill \\ \text{ }yT(t,\beta a\alpha _s)=(1y)T(s,\beta )+T(s,\beta +b\alpha _t).\text{ }\hfill \end{array}$$

The second equality follows from (D3), the third one follows from (D7), and the first one follows from the third one and from (D9).

Case 10: $`\alpha _s,\beta =a<0`$ and $`\alpha _t,\beta =b<0`$. Then the equality $`(\psi _s\psi _t\psi _s)(e_\beta )=(\psi _t\psi _s\psi _t)(e_\beta )`$ is equivalent to

$$\begin{array}{c}\text{ }(1y)T(s,\beta +a\alpha _s)+T(s,\beta +a\alpha _s+(a+b)\alpha _t)=yT(t,\beta ),\text{ }\hfill \\ \text{ }yT(s,\beta )=(1y)T(t,\beta +b\alpha _t)+T(t,\beta +(a+b)\alpha _s+b\alpha _t),\text{ }\hfill \\ \text{ }(1y)T(t,\beta )+T(t,\beta +a\alpha _s)=(1y)T(s,\beta )+T(s,\beta +b\alpha _t).\text{ }\hfill \end{array}$$

The first and second equalities follow from (D7), and the third one follows from (D9).

Lemma 3.8. Let $`sS`$. Then $`\psi _s`$ is invertible.

Proof. Let $`\rho _s:VV`$ be the linear transformation defined by

$$\rho _s(e_\beta )=\{\begin{array}{cc}x^1y^2e_{\alpha _s}& \mathrm{if}\beta =\alpha _s\\ e_\beta y^2T(s,\beta )e_{\alpha _s}& \mathrm{if}\alpha _s,\beta =0\\ (1y^1)e_\beta +e_{\beta a\alpha _s}y^2T(s,\beta a\alpha _s)e_{\alpha _s}\\ +y^2(y^11)T(s,\beta )e_{\alpha _s}& \mathrm{if}\alpha _s,\beta =a>0\mathrm{and}\beta \alpha _s\\ y^1e_{\beta +a\alpha _s}y^3T(s,\beta +a\alpha _s)e_{\alpha _s}& \mathrm{if}\alpha _s,\beta =a<0\end{array}$$

A direct case by case calculation shows that $`\psi _s\rho _s=\rho _s\psi _s=\mathrm{Id}_V`$. So, $`\psi _s`$ is invertible.

This finishes the proof of Theorem 3.2.

4. Faithfulness

Throughout this section, $`\mathrm{\Gamma }`$ is again assumed to be a Coxeter graph of small type with no triangle. Our goal here is to prove the following.

Theorem 4.1. The representation $`\psi :G_\mathrm{\Gamma }^+\mathrm{Gl}(V)`$ defined in Section 3 is faithful.

Since $`\mathrm{Gl}(V)`$ is a group, it follows:

Corollary 4.2. The homomorphism $`\iota :G_\mathrm{\Gamma }^+G_\mathrm{\Gamma }`$ is injective.

Let $`V_+=_{\beta \mathrm{\Phi }^+}𝐐[x,y]e_\beta `$ denote the free $`𝐐[x,y]`$-module having $`=\{e_\beta ;\beta \mathrm{\Phi }^+\}`$ as a basis. The coefficients of $`\psi (g)`$ lie in $`𝐐[x,y]`$, for all $`gG_\mathrm{\Gamma }^+`$, thus $`V_+`$ is invariant by the action of $`G_\mathrm{\Gamma }^+`$. We denote by $`\psi _+:G_\mathrm{\Gamma }^+\mathrm{End}(V_+)`$ the restriction of $`\psi `$ to $`V_+`$.

Let $`V_0=_{\beta \mathrm{\Phi }^+}𝐑e_\beta `$ denote the real vector space having $``$ as a basis. Replacing $`x`$ by $`0`$ and $`y`$ by a value $`0<y_0<1`$, the homomorphism $`\psi _+`$ induces a homomorphism $`\psi _0:G_\mathrm{\Gamma }^+\mathrm{End}(V_0)`$.

Let $``$ denote the Hilbert space of series $`_{\beta \mathrm{\Phi }^+}\lambda _\beta e_\beta `$ such that $`_{\beta \mathrm{\Phi }^+}\lambda _\beta ^2<+\mathrm{}`$, and let $`()`$ denote the space of continuous linear transformations of $``$. Remark that $`V_0`$ is dense in $``$. For all $`sS`$ and all $`\beta \mathrm{\Phi }^+`$, one has

$$\psi _0(\sigma _s)(e_\beta )=\{\begin{array}{cc}0& \mathrm{if}\beta =\alpha _s\\ e_\beta & \mathrm{if}\alpha _s,\beta =0\\ y_0e_{\beta a\alpha _s}& \mathrm{if}\alpha _s,\beta =a>0\mathrm{and}\beta \alpha _s\\ (1y_0)e_\beta +e_{\beta +a\alpha _s}& \mathrm{if}\alpha _s,\beta =a<0\end{array}$$

The hypothesis $`0<y_0<1`$ implies that $`\psi _0(\sigma _s)(e_\beta )_2\sqrt{2}`$ for all $`\beta \mathrm{\Phi }^+`$, thus $`\psi _0(\sigma _s)()`$. So, $`\psi _0:G_\mathrm{\Gamma }^+\mathrm{End}(V_0)`$ induces a homomorphism $`\psi _{\mathrm{}}:G_\mathrm{\Gamma }^+()`$.

Definition. Let $`A`$ be a subset of $`\mathrm{\Phi }^+`$. Then $`U_A`$ denotes the set of series $`\lambda _\beta e_\beta `$ such that:

$``$ $`\lambda _\beta 0`$ for all $`\beta \mathrm{\Phi }^+`$;

$``$ $`\lambda _\beta =0`$ if and only if $`\beta A`$.

Note that $`U_A`$ is nonempty, even if $`\mathrm{\Phi }^+A`$ is infinite, and one has $`U_AU_B=\mathrm{}`$ if $`AB`$.

Lemma 4.3. Let $`A\mathrm{\Phi }^+`$ and $`gG_\mathrm{\Gamma }^+`$. There exists a unique subset $`B\mathrm{\Phi }^+`$ such that $`\psi _{\mathrm{}}(g)U_AU_B`$.

Proof. The hypothesis $`0<y_0<1`$ implies that the coefficients of $`\psi _{\mathrm{}}(\sigma _s)`$ are $`0`$ for all $`sS`$, thus the coefficients of $`\psi _{\mathrm{}}(g)`$ are $`0`$. Let $`\psi _{\mathrm{}}(g)(e_\beta )=_{\gamma \mathrm{\Phi }^+}a_{\gamma ,\beta }e_\gamma `$, and let $`\mathrm{Supp}_g(e_\beta )`$ denote the set of $`\gamma \mathrm{\Phi }^+`$ such that $`a_{\gamma ,\beta }>0`$. Let

$$A^{}=\mathrm{\Phi }^+A,B^{}=_{\beta A^{}}\mathrm{Supp}_g(e_\beta ),B=\mathrm{\Phi }^+B^{}.$$

Then $`\psi _{\mathrm{}}(g)U_AU_B`$.

Definition. Let $`A\mathrm{\Phi }^+`$ and $`gG_\mathrm{\Gamma }^+`$. Then $`gA=B`$ denotes the unique subset $`B\mathrm{\Phi }^+`$ such that $`\psi _{\mathrm{}}(g)U_AU_B`$.

Lemma 4.4. Let $`A\mathrm{\Phi }^+`$ and $`sS`$. Then

$`\sigma _sA=\{\alpha _s\}`$ $`\{\beta \mathrm{\Phi }^+;\alpha _s,\beta =0\mathrm{𝑎𝑛𝑑}\beta A\}`$   $`\{\beta \mathrm{\Phi }^+;\alpha _s,\beta =a>0,\beta \alpha _s,\mathrm{𝑎𝑛𝑑}\beta a\alpha _sA\}`$   $`\{\beta \mathrm{\Phi }^+;\alpha _s,\beta =a<0,\beta A,\mathrm{𝑎𝑛𝑑}\beta +a\alpha _sA\}.`$

Proof. Let $`\beta \mathrm{\Phi }^+`$. Then

$$\mathrm{Supp}_{\sigma _s}(e_\beta )=\{\begin{array}{cc}\mathrm{}& \mathrm{if}\beta =\alpha _s\\ \{e_\beta \}& \mathrm{if}\alpha _s,\beta =0\\ \{e_{\beta a\alpha _s}\}& \mathrm{if}\alpha _s,\beta =a>0\mathrm{and}\beta \alpha _s\\ \{e_\beta ,e_{\beta +a\alpha _s}\}& \mathrm{if}\alpha _s,\beta =a<0\end{array}$$

Let $`A^{}=\mathrm{\Phi }^+A`$ and $`B^{}=_{\beta A^{}}\mathrm{Supp}_{\sigma _s}(e_\beta )`$. Then

$`B^{}=`$  $`\{\beta \mathrm{\Phi }^+;\alpha _s,\beta =0\mathrm{and}\beta A^{}\}`$   $``$ $`\{\beta \mathrm{\Phi }^+;\alpha _s,\beta =a>0,\beta \alpha _s,\mathrm{and}\beta a\alpha _sA^{}\}`$   $``$ $`\{\beta \mathrm{\Phi }^+;\alpha _s,\beta =a<0,\mathrm{and}\mathrm{either}\beta A^{}\mathrm{or}\beta +a\alpha _sA^{}\}`$

thus

$`\sigma _sA=`$ $`B=\mathrm{\Phi }^+B^{}`$  $`=`$ $`\{\alpha _s\}`$ $`\{\beta \mathrm{\Phi }^+;\alpha _s,\beta =0\mathrm{and}\beta A\}`$    $`\{\beta \mathrm{\Phi }^+;\alpha _s,\beta =a>0,\beta \alpha _s,\mathrm{and}\beta a\alpha _sA\}`$    $`\{\beta \mathrm{\Phi }^+;\alpha _s,\beta =a<0,\beta A,\mathrm{and}\beta +a\alpha _sA\}.\text{ }\text{ }\text{ }\text{ }\text{ }`$

Remark. Let $`A\mathrm{\Phi }^+`$ and $`sS`$. Then

$`s(A\{\alpha _s\})=`$  $`\{\beta \mathrm{\Phi }^+;\alpha _s,\beta =0\mathrm{and}\beta A\}`$   $``$ $`\{\beta \mathrm{\Phi }^+;\alpha _s,\beta =a>0,\beta \alpha _s,\mathrm{and}\beta a\alpha _sA\}`$   $``$ $`\{\beta \mathrm{\Phi }^+;\alpha _s,\beta =a<0\mathrm{and}\beta +a\alpha _sA\}.`$

In particular, one has

$$\sigma _sA\{\alpha _s\}s(A\{\alpha _s\}).$$

Lemma 4.5. Let $`A`$ be a closed subset of $`\mathrm{\Phi }^+`$ and $`sS`$. Then $`\sigma _sA`$ is also a closed subset.

Proof. Since $`A`$ is finite, $`\sigma _sA`$ is also finite. Now, we take $`\beta _1,\beta _2\sigma _sA`$ and we prove:

$``$ $`\beta _1,\beta _21`$;

$``$ if $`\beta _1,\beta _2=1`$, then $`\beta _1+\beta _2\sigma _sA`$.

Assume first that $`\beta _1=\alpha _s`$. If $`\alpha _s,\beta _2=a<0`$, then $`\beta _2,\beta _2+a\alpha _sA`$ (by Lemma 4.4), thus

$$\beta _2,\beta _2+a\alpha _s=\beta _2,\beta _2+a\beta _2,\alpha _s=2a^21$$

(since $`A`$ is closed), therefore $`a=1`$. This shows that $`\alpha _s,\beta _21`$. Suppose $`\alpha _s,\beta _2=1`$. Then $`\alpha _s,\beta _2+\alpha _s=1`$ and $`\beta _2A`$ (by Lemma 4.4), thus, by Lemma 4.4, $`\beta _2+\alpha _s\sigma _sA`$.

Assume now that $`\beta _1\alpha _s`$ and $`\beta _2\alpha _s`$. One has $`\beta _1,\beta _2s(A\{\alpha _s\})`$, thus $`s(\beta _1),s(\beta _2)A`$, therefore $`\beta _1,\beta _2=s(\beta _1),s(\beta _2)1`$ (since $`A`$ is closed). Suppose now that $`\beta _1,\beta _2=1`$.

Case 1: $`\alpha _s,\beta _1=0`$ and $`\alpha _s,\beta _2=0`$. Then $`\alpha _s,\beta _1+\beta _2=0`$. Moreover, one has $`\beta _1,\beta _2A`$ (by Lemma 4.4), thus $`\beta _1+\beta _2A`$ (since $`A`$ is closed), therefore $`\beta _1+\beta _2\sigma _sA`$ (by Lemma 4.4).

Case 2: $`\alpha _s,\beta _1=0`$ and $`\alpha _s,\beta _2=b>0`$. Then $`\alpha _s,\beta _1+\beta _2=b>0`$. Moreover, one has $`\beta _1,\beta _2b\alpha _sA`$ (by Lemma 4.4) and $`\beta _1,\beta _2b\alpha _s=1`$, thus $`\beta _1+\beta _2b\alpha _sA`$ (since $`A`$ is closed), therefore $`\beta _1+\beta _2\sigma _sA`$ (by Lemma 4.4).

Case 3: $`\alpha _s,\beta _1=0`$ and $`\alpha _s,\beta _2=b<0`$. Then $`\alpha _s,\beta _1+\beta _2=b<0`$. Moreover, one has $`\beta _1,\beta _2,\beta _2+b\alpha _sA`$ (by Lemma 4.4) and $`\beta _1,\beta _2=\beta _1,\beta _2+b\alpha _s=1`$, thus $`\beta _1+\beta _2,\beta _1+\beta _2+b\alpha _sA`$ (since $`A`$ is closed), therefore $`\beta _1+\beta _2\sigma _sA`$ (by Lemma 4.4).

Case 4: $`\alpha _s,\beta _1=a>0`$ and $`\alpha _s,\beta _2=b>0`$. Then $`\alpha _s,\beta _1+\beta _2=a+b>0`$. Moreover, one has $`\beta _1a\alpha _s,\beta _2b\alpha _sA`$ (by Lemma 4.4) and $`\beta _1a\alpha _s,\beta _2b\alpha _s=1`$, thus $`\beta _1+\beta _2(a+b)\alpha _sA`$ (since $`A`$ is closed), therefore $`\beta _1+\beta _2\sigma _sA`$ (by Lemma 4.4).

Case 5: $`\alpha _s,\beta _1=a>0`$ and $`\alpha _s,\beta _2=b<0`$. Note first that $`\beta _2,\beta _2+b\alpha _sA`$ (by Lemma 4.4), thus $`\beta _2,\beta _2+b\alpha _s=2b^21`$ (since $`A`$ is closed), therefore $`b=1`$.

Suppose $`a=1`$. Then $`\alpha _s,\beta _1+\beta _2=0`$. One has $`\beta _1\alpha _s,\beta _2+\alpha _sA`$ (by Lemma 4.4) and $`\beta _1\alpha _s,\beta _2+\alpha _s=1`$, thus $`\beta _1+\beta _2A`$ (since $`A`$ is closed), therefore $`\beta _1+\beta _2\sigma _sA`$ (by Lemma 4.4).

Suppose $`a2`$. Then $`\alpha _s,\beta _1+\beta _2=a1>0`$. One has $`\beta _1a\alpha _s,\beta _2+\alpha _sA`$ (by Lemma 4.4) and $`\beta _1a\alpha _s,\beta _2+\alpha _s=1`$, thus $`\beta _1+\beta _2(a1)\alpha _sA`$ (since $`A`$ is closed), therefore $`\beta _1+\beta _2\sigma _sA`$ (by Lemma 4.4).

Case 6: $`\alpha _s,\beta _1=a<0`$ and $`\alpha _s,\beta _2=b<0`$. Then $`\beta _1,\beta _2+b\alpha _sA`$ (by Lemma 4.4) and $`\beta _1,\beta _2+b\alpha _s=1ab<1`$. This contradicts the definition of a closed subset, thus this case does not hold.

Corollary 4.6. Let $`A`$ be a closed subset of $`\mathrm{\Phi }^+`$ and $`gG_\mathrm{\Gamma }^+`$. Then $`gA`$ is also a closed subset.

Lemma 4.7. Let $`wW`$ and $`sS`$ such that $`l(sw)=l(w)1`$, and let $`A`$ be a closed subset of $`\mathrm{\Phi }^+`$. One has $`\mathrm{\Phi }_w\{\alpha _s\}s(A\{\alpha _s\})`$ if and only if $`w<L(\sigma _s(\tau C)(A))`$.

Proof. The equality $`l(sw)=l(w)1`$ implies, by Proposition 2.4, that $`\mathrm{\Phi }_w=\{\alpha _s\}s\mathrm{\Phi }_{sw}`$. So, the inclusion $`\mathrm{\Phi }_w\{\alpha _s\}s(A\{\alpha _s\})`$ is equivalent to $`s(\mathrm{\Phi }_{sw})s(A\{\alpha _s\})`$, which is equivalent to $`\mathrm{\Phi }_{sw}A`$ (we may not have $`\alpha _s\mathrm{\Phi }_{sw}`$ because $`l(sw)<l(w)`$). This inclusion is equivalent to $`sw<C(A)`$, which is equivalent to $`\tau (sw)<(\tau C)(A)`$, which is equivalent to $`\sigma _s\tau (sw)=\tau (w)<\sigma _s(\tau C)(A)`$, which is equivalent to $`w<L(\sigma _s(\tau C)(A))`$.

Lemma 4.8. Let $`A`$ and $`B`$ be two closed subsets of $`\mathrm{\Phi }^+`$ and $`sS`$. If $`\{\alpha _s\}B\{\alpha _s\}s(A\{\alpha _s\})`$, then $`B\sigma _sA`$.

Proof. By Lemma 4.4, it suffices to show that: if $`\beta B`$ is such that $`\alpha _s,\beta =a<0`$, then $`\beta A`$. One has $`\alpha _s,\beta B`$ and $`B`$ is a closed subset, thus $`\alpha _s,\beta =1`$ and $`\beta +\alpha _sB`$. It follows that $`s(\beta )=\alpha _s+\beta B\{\alpha _s\}s(A\{\alpha _s\})`$, thus $`\beta A`$.

Lemma 4.9. Let $`A`$ be a closed subset of $`\mathrm{\Phi }^+`$ and $`gG_\mathrm{\Gamma }^+`$. Then

$$C(gA)=L(g(\tau C)(A)).$$

Proof. We argue by induction on $`l(g)`$. Assume first that $`l(g)=1`$. Then $`g=\sigma _s`$ for some $`sS`$. Let $`w_1=C(\sigma _sA)`$ and $`w_2=L(\sigma _s(\tau C)(A))`$. Since $`\alpha _s\sigma _sA`$, one has $`\mathrm{\Phi }_s=\{\alpha _s\}\sigma _sA`$, thus $`s<w_1`$, namely, $`l(sw_1)=l(w_1)1`$. Moreover, $`\mathrm{\Phi }_{w_1}\sigma _sA\{\alpha _s\}s(A\{\alpha _s\})`$, thus, by Lemma 4.7, $`w_1<w_2`$. One has $`\tau (s)=\sigma _s<\sigma _s(\tau C)(A)`$, thus $`s<w_2`$, namely, $`l(sw_2)=l(w_2)1`$. By Lemma 4.7, it follows that $`\{\alpha _s\}\mathrm{\Phi }_{w_2}\{\alpha _s\}s(A\{\alpha _s\})`$ and so, by Lemma 4.8, $`\mathrm{\Phi }_{w_2}\sigma _sA`$. This implies that $`w_2<w_1`$.

Assume now that $`l(g)2`$. We write $`g=\sigma _sg_1`$ where $`sS`$ and $`l(g_1)=l(g)1`$. Then, by induction and by Proposition 2.3,

$$C(gA)=C(\sigma _s(g_1A))=L(\sigma _s(\tau C)(g_1A))=L(\sigma _s(\tau L)(g_1(\tau C)(A)))=L(g(\tau C)(A)).\text{ }\text{ }\text{ }\text{ }\text{ }\text{ }$$

Definition. Let $`𝒞`$ denote the set of closed subsets of $`\mathrm{\Phi }^+`$. For $`wW`$ we set

$$𝒰_w=\underset{A𝒞,C(A)=w}{}U_A.$$

Note that $`𝒰_w\mathrm{}`$ (since it contains $`U_{\mathrm{\Phi }_w}`$), and one has $`𝒰_u𝒰_v=\mathrm{}`$ if $`uv`$.

Lemma 4.10. Let $`gG_\mathrm{\Gamma }^+`$ and $`wW`$. Then

$$\psi _{\mathrm{}}(g)𝒰_w𝒰_{L(g\tau (w))}.$$

Proof. Let $`A𝒞`$ such that $`C(A)=w`$. One has $`\psi _{\mathrm{}}(g)U_AU_{gA}`$, and, by Lemma 4.9, $`C(gA)=L(g(\tau C)(A))=L(g\tau (w))`$, thus $`\psi _{\mathrm{}}(g)U_A𝒰_{L(g\tau (w))}`$. This shows that $`\psi _{\mathrm{}}(g)𝒰_w𝒰_{L(g\tau (w))}`$.

Proof of Theorem 4.1. Let $`f,gG_\mathrm{\Gamma }^+`$ such that $`\psi (f)=\psi (g)`$. We write $`f=\tau (u)f_1`$ and $`g=\tau (v)g_2`$, where $`u=L(f)`$, $`v=L(g)`$, and $`f_1,g_1G_\mathrm{\Gamma }^+`$. Note that $`u=1`$ if and only if $`f=1`$, and $`v=1`$ if and only if $`g=1`$. Lemma 4.10 implies that $`\psi _{\mathrm{}}(f)𝒰_1𝒰_{L(f)}=𝒰_u`$, and that $`\psi _{\mathrm{}}(g)𝒰_1𝒰_{L(g)}=𝒰_v`$. Since $`\psi _{\mathrm{}}(f)=\psi _{\mathrm{}}(g)`$, and since $`𝒰_u𝒰_v=\mathrm{}`$ if $`uv`$, it follows that $`u=v`$.

We prove now that $`f=g`$ by induction on $`l(f)`$. If $`l(f)=0`$, then $`f=1`$, thus $`u=v=1`$, therefore $`g=1`$. Suppose $`l(f)>0`$. Then $`l(f_1)<l(f)`$ and

$$\psi (f_1)=\psi (\tau (u))^1\psi (f)=\psi (\tau (v))^1\psi (g)=\psi (g_1).$$

By the inductive hypothesis, it follows that $`f_1=g_1`$, thus $`f=\tau (u)f_1=\tau (v)g_1=g`$.

5. The general case

Now, we assume that $`\mathrm{\Gamma }`$ is any Coxeter graph. The goal of this section is to prove the following.

Theorem 5.1. There exists an injective homomorphism $`\varphi :G_\mathrm{\Gamma }^+G_{\stackrel{~}{\mathrm{\Gamma }}}^+`$ from $`G_\mathrm{\Gamma }^+`$ to an Artin monoid $`G_{\stackrel{~}{\mathrm{\Gamma }}}^+`$ associated to a Coxeter graph $`\stackrel{~}{\mathrm{\Gamma }}`$ of small type with no triangle.

Since we already know by Corollary 4.2 that $`\iota :G_{\stackrel{~}{\mathrm{\Gamma }}}^+G_{\stackrel{~}{\mathrm{\Gamma }}}`$ is injective, Theorem 5.1 finishes the proof of Theorem 1.1.

We start summarizing some well known properties of $`G_\mathrm{\Gamma }^+`$ that can be found in \[BS\] and \[Mic\].

We say that $`gG_\mathrm{\Gamma }^+`$ is a common multiple of a finite subset $`F=\{f_1,\mathrm{},f_n\}G_\mathrm{\Gamma }^+`$ if $`f_i<g`$ for all $`i=1,\mathrm{},n`$. If $`F=\{f_1,\mathrm{},f_n\}`$ has a common multiple, then it has a least common multiple, which is obviously unique, and which will be denoted by $`f_1\mathrm{}f_n`$.

Let $`s,tS`$. The subset $`\{\sigma _s,\sigma _t\}`$ has a common multiple if and only if $`m_{s,t}<+\mathrm{}`$. In that case, one has $`\sigma _s\sigma _t=\mathrm{prod}(\sigma _s,\sigma _t;m_{s,t})`$. More generally, for a subset $`TS`$, the set $`\mathrm{\Sigma }_T=\{\sigma _t;tT\}`$ has a common multiple if and only if the subgroup $`W_T`$ of $`W`$ generated by $`T`$ is finite. In that case, the least common multiple of $`\mathrm{\Sigma }_T`$ is denoted by $`\mathrm{\Delta }_T`$. It is equal to $`\tau (w_T)`$, where $`w_T`$ denotes the element of maximal length in $`W_T`$. If $`W`$ is finite, namely, if $`\mathrm{\Gamma }`$ is of spherical type, then we will denote by $`\mathrm{\Delta }=\mathrm{\Delta }(\mathrm{\Gamma })`$ the least common multiple of $`\mathrm{\Sigma }=\{\sigma _s;sS\}`$.

Let $`TS`$ and $`f,gG_\mathrm{\Gamma }^+`$. If $`f`$ and $`g`$ have a common multiple and both lie in the submonoid generated by $`\mathrm{\Sigma }_T=\{\sigma _t;tT\}`$, then $`fg`$ also lies in this submonoid.

Definition. Let $`\mathrm{\Gamma }`$ and $`\mathrm{\Gamma }^{}`$ be two Coxeter graphs, let $`S`$ be the set of vertices of $`\mathrm{\Gamma }`$, and let $`\varphi :G_\mathrm{\Gamma }^+G_\mathrm{\Gamma }^{}^+`$ be a homomorphism. We say that $`\varphi `$ respects lcm’s if

$``$ $`\varphi (\sigma _s)1`$ for all $`sS`$;

$``$ $`\{\varphi (\sigma _s),\varphi (\sigma _t)\}`$ has a common multiple if and only if $`m_{s,t}<+\mathrm{}`$;

$``$ if $`m_{s,t}<+\mathrm{}`$, then $`\varphi (\sigma _s\sigma _t)=\varphi (\sigma _s)\varphi (\sigma _t)`$.

The following theorem can be found in \[Cri, Thm. 1.3\].

Theorem 5.2 (Crisp). If a homomorphism $`\varphi :G_\mathrm{\Gamma }^+G_\mathrm{\Gamma }^{}^+`$ between Artin monoids respects lcm’s, then it is injective.

Proof of Theorem 5.1. Let $`A_n`$ be the Coxeter graph of Figure 1. Let $`f,g`$ be the elements of $`G_{A_n}^+`$ defined by $`f=\sigma _1\sigma _3\sigma _5\mathrm{}`$ and $`g=\sigma _2\sigma _4\sigma _6\mathrm{}`$. It is shown in \[BS, Lem. 5.8\] that

$$\mathrm{prod}(f,g;n+1)=\mathrm{prod}(g,f;n+1)=\mathrm{\Delta }(A_n).$$
$`(1)`$
Figure 1: The Coxeter graph $`A_n`$

Let $`m3`$, and let $`\mathrm{\Gamma }(m)`$ denote the Coxeter graph illustrated in Figure 2. It is a bipartite graph whose set of vertices is the disjoint union $`IJ`$, where $`|I|=|J|=m1`$. As a Coxeter graph, $`\mathrm{\Gamma }(m)`$ is the disjoint union of two copies of $`A_{m1}`$. Let $`f,g`$ be the elements of $`G_{\mathrm{\Gamma }(m)}^+`$ defined by $`f=_{iI}\sigma _i`$ and $`g=_{jJ}\sigma _j`$. Then, by (1), one has

$$\mathrm{prod}(f,g;m)=\mathrm{prod}(g,f;m)=\mathrm{\Delta }(\mathrm{\Gamma }(m)).$$
$`(2)`$
Figure 2: The Coxeter graph $`\mathrm{\Gamma }(m)`$

Let $`k𝐍`$. We denote by $`k\mathrm{\Gamma }(m)`$ the disjoint union of $`k`$ copies of $`\mathrm{\Gamma }(m)`$. It is a bipartite graph whose set of vertices is the disjoint union $`kIkJ`$, where $`kI`$ denotes the disjoint union of $`k`$ copies of $`I`$, and $`kJ`$ denotes the disjoint union of $`k`$ copies of $`J`$. Let $`f,g`$ be the elements of $`G_{k\mathrm{\Gamma }(m)}^+`$ defined by $`f=_{ikI}\sigma _i`$ and $`g=_{jkJ}\sigma _j`$. Then, by (2), one has

$$\mathrm{prod}(f,g;m)=\mathrm{prod}(g,f;m)=\mathrm{\Delta }(k\mathrm{\Gamma }(m)).$$
$`(3)`$
Let $`\mathrm{\Gamma }(\mathrm{})`$ denote the Coxeter graph illustrated in Figure 3. It is bipartite graph whose set of vertices is the disjoint union $`IJ`$, where $`I=\{i_1,i_2\}`$ and $`J=\{j_1,j_2\}`$. Let $`f,g`$ be the elements of $`G_{\mathrm{\Gamma }(\mathrm{})}^+`$ defined by $`f=\sigma _{i_1}\sigma _{i_2}`$ and $`g=\sigma _{j_1}\sigma _{j_2}`$. A common multiple of $`f`$ and $`g`$ would be a common multiple of $`\{\sigma _{i_1},\sigma _{i_2},\sigma _{j_1},\sigma _{j_2}\}`$. But $`\mathrm{\Gamma }(\mathrm{})`$ is not of spherical type, thus such a common multiple may not exist. So, $`f`$ and $`g`$ have no common multiple.

Let $`k𝐍`$. We denote by $`k\mathrm{\Gamma }(\mathrm{})`$ the disjoint union of $`k`$ copies of $`\mathrm{\Gamma }(\mathrm{})`$. It is a bipartite graph whose set of vertices is the disjoint union $`kIkJ`$, where $`kI`$ denotes the disjoint union of $`k`$ copies of $`I`$, and $`kJ`$ denotes the disjoint union of $`k`$ copies of $`J`$. Let $`f`$ and $`g`$ be the elements of $`G_{k\mathrm{\Gamma }(\mathrm{})}^+`$ defined by $`f=_{ikI}\sigma _i`$ and $`g=_{jkJ}\sigma _j`$. Then, as before, $`f`$ and $`g`$ have no common multiple.

Figure 3: The Coxeter graph $`\mathrm{\Gamma }(\mathrm{})`$

Now, let $`\mathrm{\Gamma }`$ be any Coxeter graph. Let $`N`$ be the least common multiple of $`\{m_{s,t}1;s,tS,st,m_{s,t}<+\mathrm{}\}`$. For all $`sS`$ we take an abstract set $`I(s)`$ with $`2N`$ elements. We construct a Coxeter graph of small type $`\mathrm{\Gamma }^{}`$ as follows.

$``$ The set of vertices of $`\mathrm{\Gamma }^{}`$ is the disjoint union of the $`I(s)`$, $`sS`$.

$``$ If $`m_{s,t}=2`$, then there is no edge joining two vertices in $`I(s)I(t)`$.

$``$ If $`3m_{s,t}<+\mathrm{}`$, then the full subgraph of $`\mathrm{\Gamma }^{}`$ generated by $`I(s)I(t)`$ is isomorphic to $`\left(\frac{2N}{m_{s,t}1}\right)\mathrm{\Gamma }(m_{s,t})`$ with an isomorphism which takes $`I(s)`$ to $`\left(\frac{2N}{m_{s,t}1}\right)I`$ and $`I(t)`$ to $`\left(\frac{2N}{m_{s,t}1}\right)J`$.

$``$ If $`m_{s,t}=+\mathrm{}`$, then the full subgraph of $`\mathrm{\Gamma }^{}`$ generated by $`I(s)I(t)`$ is isomorphic to $`N\mathrm{\Gamma }(\mathrm{})`$ with an isomorphism which takes $`I(s)`$ to $`NI`$ and $`I(t)`$ to $`NJ`$.

Such a graph always exists but is not unique in general. By the above considerations, there is a well defined homomorphism $`\varphi :G_\mathrm{\Gamma }^+G_\mathrm{\Gamma }^{}^+`$ which sends $`\sigma _s`$ to $`_{iI(s)}\sigma _i`$ for all $`sS`$, and this homomorphism respects lcm’s, so, is injective by Theorem 5.2. Note also that: if $`\mathrm{\Gamma }`$ is of small type, then $`\mathrm{\Gamma }^{}`$ is a bibartite graph, thus has no triangle.

So, applying twice the above construction, one gets a Coxeter graph $`\stackrel{~}{\mathrm{\Gamma }}`$ of small type with no triangle and a monomorphism $`\varphi :G_\mathrm{\Gamma }^+G_{\stackrel{~}{\mathrm{\Gamma }}}^+`$.

6. Two lemmas

Lemma 3.3. Let $`sS`$ and $`\beta \mathrm{\Phi }^+`$ such that $`\alpha _s,\beta =0`$ and $`\mathrm{dp}(\beta )2`$. Then the definition of $`T(s,\beta )`$ does not depend on the choice of the $`tS`$ such that $`\mathrm{dp}(t\beta )=\mathrm{dp}(\beta )1`$.

Proof. We argue by induction on $`\mathrm{dp}(\beta )`$. We take $`t,rS`$, $`tr`$, such that $`\mathrm{dp}(t\beta )=\mathrm{dp}(r\beta )=\mathrm{dp}(\beta )1`$. By Proposition 2.6, we can write $`\alpha _t,\beta =b>0`$ and $`\alpha _t,\beta =c>0`$.

Case 1: $`\alpha _s,\alpha _t=0`$, $`\alpha _s,\alpha _r=0`$, and $`\alpha _t,\alpha _r=0`$. We cannot have $`\mathrm{dp}(\beta )=2`$ in this case. Suppose $`\mathrm{dp}(\beta )3`$. Then, by induction,

$`yT(s,\beta b\alpha _t)`$ $`=y^2T(s,\beta b\alpha _tc\alpha _r)`$ by (D4)   $`=yT(s,\beta c\alpha _r)`$ by (D4)

Case 2: $`\alpha _s,\alpha _t=0`$, $`\alpha _s,\alpha _r=0`$, and $`\alpha _t,\alpha _r=1`$. Suppose $`\mathrm{dp}(\beta )=2`$. Then $`\beta =\alpha _t+\alpha _r`$, $`b=c=1`$, and

$$yT(s,\beta \alpha _t)=yT(s,\alpha _r)=0=yT(s,\alpha _t)=yT(s,\beta \alpha _r)\mathrm{by}(\mathrm{D2})$$

We cannot have $`\mathrm{dp}(\beta )=3`$ in this case. Suppose $`\mathrm{dp}(\beta )4`$. Then, by induction

$`yT(s,\beta b\alpha _t)`$ $`=y^2T(s,\beta b\alpha _t(b+c)\alpha _r)`$ by (D4)   $`=y^3T(s,\beta (b+c)\alpha _t(b+c)\alpha _r)`$ by (D4)   $`=yT(s,\beta c\alpha _r)`$ by symmetry

Case 3: $`\alpha _s,\alpha _t=0`$, $`\alpha _s,\alpha _r=1`$, and $`\alpha _t,\alpha _r=0`$. We cannot have $`\mathrm{dp}(\beta )3`$ in this case. Suppose $`\mathrm{dp}(\beta )4`$. Then, by induction,

$`yT(s,\beta b\alpha _t)`$ $`=y(y1)T(s,\beta b\alpha _tc\alpha _r)+y^2T(r,\beta c\alpha _sb\alpha _tc\alpha _r)`$ by (D5)   $`=y^{\mathrm{dp}(\beta )1}(y1)^2+y^2T(r,\beta c\alpha _sb\alpha _tc\alpha _r)`$ by (D3)   $`=(y1)T(s,\beta c\alpha _r)+yT(r,\beta c\alpha _sc\alpha _r)`$ by (D3) and (D4)

Case 4: $`\alpha _s,\alpha _t=0`$, $`\alpha _s,\alpha _r=1`$, and $`\alpha _t,\alpha _r=1`$. We cannot have $`\mathrm{dp}(\beta )5`$ in this case. Suppose $`\mathrm{dp}(\beta )6`$. Then, by induction,

$`yT(s,\beta b\alpha _t)`$   $`=`$ $`y(y1)T(s,\beta b\alpha _t(b+c)\alpha _r)+y^2T(r,\beta (b+c)\alpha _sb\alpha _t(b+c)\alpha _r)`$ by (D5)  $`=`$ $`y^{\mathrm{dp}(\beta )1}(y1)^2+y^2(y1)T(r,\beta (b+c)\alpha _s(b+c)\alpha _t(b+c)\alpha _r)`$    $`+y^3T(t,\beta (b+c)\alpha _s(b+c)\alpha _t(b+2c)\alpha _r)`$ by (D3) and (D5)  $`=`$ $`y^{\mathrm{dp}(\beta )1}(y1)^2+y^{\mathrm{dp}(\beta )2}(y1)^2+y^3T(t,\beta (b+c)\alpha _s(b+c)\alpha _t(b+2c)\alpha _r)`$ by (D3)  $`=`$ $`y^{\mathrm{dp}(\beta )1}(y1)^2+y(y1)T(r,\beta c\alpha _s(b+c)\alpha _tc\alpha _r)`$    $`+y^2T(t,\beta c\alpha _s(b+c)\alpha _t(b+2c)\alpha _r)`$ by (D3) and (D4)  $`=`$ $`(y1)T(s,\beta c\alpha _r)+yT(r,\beta c\alpha _sc\alpha _r)`$ by (D3) and (D5)

Case 5: $`\alpha _s,\alpha _t=1`$, $`\alpha _s,\alpha _r=1`$, and $`\alpha _t,\alpha _r=0`$. We cannot have $`\mathrm{dp}(\beta )5`$ in this case. Suppose $`\mathrm{dp}(\beta )6`$. Then, by induction,

$`(y1)T(s,\beta b\alpha _t)+yT(t,\beta b\alpha _sb\alpha _t)`$   $`=`$ $`y^{\mathrm{dp}(\beta )1}(y1)^2+y^2T(t,\beta b\alpha _sb\alpha _t(b+c)\alpha _r)`$ by (D3) and (D4)  $`=`$ $`y^{\mathrm{dp}(\beta )1}(y1)^2+y^2(y1)T(t,\beta (b+c)\alpha _sb\alpha _t(b+c)\alpha _r)`$    $`+y^3T(s,\beta (b+c)\alpha _s(b+c)\alpha _t(b+c)\alpha _r)`$ by (D5)  $`=`$ $`y^{\mathrm{dp}(\beta )1}(y1)^2+y^{\mathrm{dp}(\beta )2}(y1)^2+y^3T(s,\beta (b+c)\alpha _s(b+c)\alpha _t(b+c)\alpha _r)`$ by (D3)  $`=`$ $`(y1)T(s,\beta c\alpha _r)+yT(r,\beta c\alpha _sc\alpha _r)`$ by symmetry.

Lemma 3.4. Let $`sS`$ and $`\beta \mathrm{\Phi }^+`$ such that $`\mathrm{dp}(\beta )2`$ and $`\alpha _s,\beta =a<0`$. Then the definition of $`T(s,\beta )`$ does not depend on the choice of the $`tS`$ such that $`\mathrm{dp}(t\beta )=\mathrm{dp}(\beta )1`$.

Proof. We argue by induction on $`\mathrm{dp}(\beta )`$. We take $`t,rS`$, $`tr`$, such that $`\mathrm{dp}(t\beta )=\mathrm{dp}(r\beta )=\mathrm{dp}(\beta )1`$. By Proposition 2.6, we can write $`\alpha _t,\beta =b>0`$ and $`\alpha _r,\beta =c>0`$.

Case 1: $`\alpha _s,\alpha _t=0`$, $`\alpha _s,\alpha _r=0`$, and $`\alpha _t,\alpha _r=0`$. We cannot have $`\mathrm{dp}(\beta )=2`$ in this case. Suppose $`\mathrm{dp}(\beta )3`$. Then, by induction,

$`yT(s,\beta b\alpha _t)`$ $`=y^2T(s,\beta b\alpha _tc\alpha _r)`$ by (D6)   $`=yT(s,\beta c\alpha _r)`$ by (D6)

Case 2: $`\alpha _s,\alpha _t=0`$, $`\alpha _s,\alpha _r=0`$, and $`\alpha _t,\alpha _r=1`$. We cannot have $`\mathrm{dp}(\beta )3`$ in this case. Suppose $`\mathrm{dp}(\beta )4`$. Then, by induction,

$`yT(s,\beta b\alpha _t)`$ $`=y^2T(s,\beta b\alpha _t(b+c)\alpha _r)`$ by (D6)   $`=y^3T(s,\beta (b+c)\alpha _t(b+c)\alpha _r)`$ by (D6)   $`=yT(s,\beta c\alpha _r)`$ by symmetry

Case 3: $`\alpha _s,\alpha _t=0`$, $`\alpha _s,\alpha _r=1`$, $`\alpha _t,\alpha _r=0`$, and $`c>a`$. We cannot have $`\mathrm{dp}(\beta )3`$ in this case. Suppose $`\mathrm{dp}(\beta )4`$. Then, by induction,

$`yT(s,\beta b\alpha _t)`$   $`=`$ $`y(y1)T(s,\beta b\alpha _tc\alpha _r)+y^2T(r,\beta (ca)\alpha _sb\alpha _tc\alpha _r)`$ by (D7)  $`=`$ $`y^{\mathrm{dp}(\beta )1}(y1)^2+y^2T(r,\beta (ca)\alpha _sb\alpha _tc\alpha _r)`$ by (D3)  $`=`$ $`(y1)T(s,\beta c\alpha _r)+yT(r,\beta (ca)\alpha _sc\alpha _r)`$ by (D3) and (D6)

Case 4: $`\alpha _s,\alpha _t=0`$, $`\alpha _s,\alpha _r=1`$, $`\alpha _t,\alpha _r=0`$, and $`c=a`$. We cannot have $`\mathrm{dp}(\beta )=2`$ in this case. Suppose $`\mathrm{dp}(\beta )3`$. Then, by induction,

$`yT(s,\beta b\alpha _t)`$   $`=`$ $`yT(r,\beta b\alpha _ta\alpha _r)+y(y1)T(s,\beta b\alpha _ta\alpha _r)`$ by (D8)  $`=`$ $`T(r,\beta a\alpha _r)+(y1)T(s,\beta a\alpha _r)`$ by (D6) and (D4)

Case 5: $`\alpha _s,\alpha _t=0`$, $`\alpha _s,\alpha _r=1`$, $`\alpha _t,\alpha _r=0`$, and $`c<a`$. We cannot have $`\mathrm{dp}(\beta )=2`$ in this case. Suppose $`\mathrm{dp}(\beta )3`$. Then, by induction,

$`yT(s,\beta b\alpha _t)`$   $`=`$ $`y^2T(s,\beta b\alpha _tc\alpha _r)+yT(r,\beta b\alpha _tc\alpha _r)+y^{\mathrm{dp}(\beta )1}(1y)`$ by (D9)  $`=`$ $`yT(s,\beta c\alpha _r)+T(r,\beta c\alpha _r)+y^{\mathrm{dp}(\beta )1}(1y)`$ by (D6)

Case 6: $`\alpha _s,\alpha _t=0`$, $`\alpha _s,\alpha _r=1`$, $`\alpha _t,\alpha _r=1`$, and $`c>a`$. We cannot have $`\mathrm{dp}(\beta )5`$ in this case. Suppose $`\mathrm{dp}(\beta )6`$. Then, by induction,

$`yT(s,\beta b\alpha _t)`$   $`=`$ $`y(y1)T(s,\beta b\alpha _t(b+c)\alpha _r)+y^2T(r,\beta (b+ca)\alpha _sb\alpha _t(b+c)\alpha _r)`$ by (D7)  $`=`$ $`y^{\mathrm{dp}(\beta )1}(y1)^2+y^2(y1)T(r,\beta (b+ca)\alpha _s(b+c)\alpha _t(b+c)\alpha _r)`$    $`+y^3T(t,\beta (b+ca)\alpha _s(b+c)\alpha _t(b+2ca)\alpha _r)`$ by (D3) and (D7)  $`=`$ $`y^{\mathrm{dp}(\beta )1}(y1)^2+y^{\mathrm{dp}(\beta )2}(y1)^2`$    $`+y^3T(t,\beta (b+ca)\alpha _s(b+c)\alpha _t(b+2ca)\alpha _r)`$ by (D3)  $`=`$ $`y^{\mathrm{dp}(\beta )1}(y1)^2+y(y1)T(r,\beta (ca)\alpha _s(b+c)\alpha _tc\alpha _r)`$    $`+y^2T(t,\beta (ca)\alpha _s(b+c)\alpha _t(b+2ca)\alpha _r)`$ by (D3) and (D6)  $`=`$ $`(y1)T(s,\beta c\alpha _r)+yT(r,\beta (ca)\alpha _sc\alpha _r)`$ by (D3) and (D7)

Case 7: $`\alpha _s,\alpha _t=0`$, $`\alpha _s,\alpha _r=1`$, $`\alpha _t,\alpha _r=1`$, and $`c=a`$. Suppose $`\mathrm{dp}(\beta )=2`$. Then $`a=b=c=1`$, $`\beta =\alpha _t+\alpha _r`$, and

$`yT(s,\beta \alpha _t)=`$ $`yT(s,\alpha _r)=0`$ by (D2)  $`T(r,\beta \alpha _r)+(y1)T(s,\beta \alpha _r)=`$ $`T(r,\alpha _t)+(y1)T(s,\alpha _t)=0`$ by (D2)

We cannot have $`\mathrm{dp}(\beta )\{3,4\}`$ in this case. Suppose $`\mathrm{dp}(\beta )5`$. Then, by induction,

$`yT(s,\beta b\alpha _t)`$   $`=`$ $`y(y1)T(s,\beta b\alpha _t(b+a)\alpha _r)+y^2T(r,\beta b\alpha _sb\alpha _t(b+a)\alpha _r)`$ by (D7)  $`=`$ $`y^{\mathrm{dp}(\beta )1}(y1)^2+y^2T(t,\beta b\alpha _s(b+a)\alpha _t(b+a)\alpha _r)`$    $`+y^2(y1)T(r,\beta b\alpha _s(b+a)\alpha _t(b+a)\alpha _r)`$ by (D3) and (D8)  $`=`$ $`y^{\mathrm{dp}(\beta )2}(y1)^2+y^2T(t,\beta b\alpha _s(b+a)\alpha _t(b+a)\alpha _r)+y^{\mathrm{dp}(\beta )2}(y1)^3`$    $`+y^2(y1)T(r,\beta b\alpha _s(b+a)\alpha _t(b+a)\alpha _r)`$   $`=`$ $`y^{\mathrm{dp}(\beta )2}(y1)^2+y^2T(t,\beta b\alpha _s(b+a)\alpha _t(b+a)\alpha _r)`$    $`+y(y1)^2T(s,\beta (b+a)\alpha _t(b+a)\alpha _r)`$    $`+y^2(y1)T(r,\beta b\alpha _s(b+a)\alpha _t(b+a)\alpha _r)`$ by (D3)  $`=`$ $`y^{\mathrm{dp}(\beta )2}(y1)^2+y^2T(t,\beta b\alpha _s(b+a)\alpha _t(b+a)\alpha _r)`$    $`+y(y1)T(s,\beta (b+a)\alpha _ta\alpha _r)`$ by (D5)  $`=`$ $`(y1)T(r,\beta (b+a)\alpha _ta\alpha _r)+yT(t,\beta (b+a)\alpha _t(b+a)\alpha _r)`$    $`+y(y1)T(s,\beta (b+a)\alpha _ta\alpha _r)`$ by (D3) and (D6)  $`=`$ $`T(r,\beta a\alpha _r)+(y1)T(s,\beta a\alpha _r)`$ by (D7) and (D4)

Case 8: $`\alpha _s,\alpha _t=0`$, $`\alpha _s,\alpha _r=1`$, $`\alpha _t,\alpha _r=1`$, $`c<a`$, and $`b+c>a`$. We cannot have $`\mathrm{dp}(\beta )4`$ in this case. Suppose $`\mathrm{dp}(\beta )5`$. Then, by induction,

$`yT(s,\beta b\alpha _t)`$   $`=`$ $`y(y1)T(s,\beta b\alpha _t(b+c)\alpha _r)+y^2T(r,\beta (b+ca)\alpha _sb\alpha _t(b+c)\alpha _r)`$ by (D7)  $`=`$ $`y^{\mathrm{dp}(\beta )1}(y1)^2+y^3T(r,\beta (b+ca)\alpha _s(b+c)\alpha _t(b+c)\alpha _r)`$    $`+y^2T(t,\beta (b+ca)\alpha _s(b+c)\alpha _t(b+c)\alpha _r)+y^{\mathrm{dp}(\beta )2}(1y)`$ by (D3) and (D9)  $`=`$ $`y^{\mathrm{dp}(\beta )1}(y1)^2+y^3T(r,\beta (b+ca)\alpha _s(b+c)\alpha _t(b+c)\alpha _r)`$    $`+y^{\mathrm{dp}(\beta )2}(y1)^2`$    $`+y^2T(t,\beta (b+ca)\alpha _s(b+c)\alpha _t(b+c)\alpha _r)+y^{\mathrm{dp}(\beta )1}(1y)`$   $`=`$ $`y^2(y1)T(s,\beta (b+c)\alpha _t(b+c)\alpha _r)`$    $`+y^3T(r,\beta (b+ca)\alpha _s(b+c)\alpha _t(b+c)\alpha _r)+y^{\mathrm{dp}(\beta )2}(y1)^2`$    $`+yT(t,\beta (b+c)\alpha _t(b+c)\alpha _r)+y^{\mathrm{dp}(\beta )1}(1y)`$ by (D3) and (D6)  $`=`$ $`y^2T(s,\beta (b+c)\alpha _tc\alpha _r)+(y1)T(r,\beta (b+c)\alpha _tc\alpha _r)`$    $`+yT(t,\beta (b+c)\alpha _t(b+c)\alpha _r)+y^{\mathrm{dp}(\beta )1}(1y)`$ by (D7) and (D3)  $`=`$ $`yT(s,\beta c\alpha _r)+T(r,\beta c\alpha _r)+y^{\mathrm{dp}(\beta )1}(1y)`$ by (D6) and (D7)

Case 9: $`\alpha _s,\alpha _t=0`$, $`\alpha _s,\alpha _r=1`$, $`\alpha _t,\alpha _r=1`$, $`c<a`$, and $`b+c=a`$. We cannot have $`\mathrm{dp}(\beta )3`$ in this case. Suppose $`\mathrm{dp}(\beta )4`$. Then, by induction,

$`yT(s,\beta b\alpha _t)`$   $`=`$ $`yT(r,\beta b\alpha _ta\alpha _r)+y(y1)T(s,\beta b\alpha _ta\alpha _r)`$ by (D8)  $`=`$ $`y^2T(r,\beta a\alpha _ta\alpha _r)+yT(t,\beta a\alpha _ta\alpha _r)+y^{\mathrm{dp}(\beta )2}(1y)`$    $`+y^2(y1)T(s,\beta a\alpha _ta\alpha _r)`$ by (D9) and (D4)  $`=`$ $`y^2T(r,\beta a\alpha _ta\alpha _r)+y^2(y1)T(s,\beta a\alpha _ta\alpha _r)+y^{\mathrm{dp}(\beta )2}(y1)^2`$    $`+yT(t,\beta a\alpha _ta\alpha _r)+y^{\mathrm{dp}(\beta )1}(1y)`$   $`=`$ $`y^2T(s,\beta a\alpha _tc\alpha _r)+(y1)T(r,\beta a\alpha _tc\alpha _r)`$    $`+yT(t,\beta a\alpha _ta\alpha _r)+y^{\mathrm{dp}(\beta )1}(1y)`$ by (D8) and (D3)  $`=`$ $`yT(s,\beta c\alpha _r)+T(r,\beta c\alpha _r)+y^{\mathrm{dp}(\beta )1}(1y)`$ by (D6) and (D7)

Case 10: $`\alpha _s,\alpha _t=0`$, $`\alpha _s,\alpha _r=1`$, $`\alpha _t,\alpha _r=1`$, $`c<a`$, and $`b+c<a`$. We cannot have $`\mathrm{dp}(\beta )3`$ in this case. Suppose $`\mathrm{dp}(\beta )4`$. Then, by induction,

$`yT(s,\beta b\alpha _t)`$   $`=`$ $`y^2T(s,\beta b\alpha _t(b+c)\alpha _r)+yT(r,\beta b\alpha _t(b+c)\alpha _r)+y^{\mathrm{dp}(\beta )1}(1y)`$ by (D9)  $`=`$ $`y^3T(s,\beta (b+c)\alpha _t(b+c)\alpha _r)+y^2T(r,\beta (b+c)\alpha _t(b+c)\alpha _r)`$    $`+yT(t,\beta (b+c)\alpha _t(b+c)\alpha _r)+y^{\mathrm{dp}(\beta )2}(1y)+y^{\mathrm{dp}(\beta )1}(1y)`$ by (D6) and (D9)  $`=`$ $`y^3T(s,\beta (b+c)\alpha _t(b+c)\alpha _r)+y^2T(r,\beta (b+c)\alpha _t(b+c)\alpha _r)`$    $`+y^{\mathrm{dp}(\beta )1}(1y)+y^{\mathrm{dp}(\beta )2}(y1)^2`$    $`+yT(t,\beta (b+c)\alpha _t(b+c)\alpha _r)+y^{\mathrm{dp}(\beta )1}(1y)`$   $`=`$ $`y^2T(s,\beta (b+c)\alpha _tc\alpha _r)+(y1)T(r,\beta (b+c)\alpha _tc\alpha _r)`$    $`+yT(t,\beta (b+c)\alpha _t(b+c)\alpha _r)+y^{\mathrm{dp}(\beta )1}(1y)`$ by (D9) and (D3)  $`=`$ $`yT(s,\beta c\alpha _r)+T(r,\beta c\alpha _r)+y^{\mathrm{dp}(\beta )1}(1y)`$ by (D6) and (D7)

Case 11: $`\alpha _s,\alpha _t=1`$, $`\alpha _s,\alpha _r=1`$, $`\alpha _t,\alpha _r=0`$, $`b>a`$, and $`c>a`$. We cannot have $`\mathrm{dp}(\beta )5`$ in this case. Suppose $`\mathrm{dp}(\beta )6`$. Then, by induction,

$`(y1)T(s,\beta b\alpha _t)+yT(t,\beta (ba)\alpha _sb\alpha _t)`$   $`=`$ $`y^{\mathrm{dp}(\beta )1}(y1)^2+y^2T(t,\beta (ba)\alpha _sb\alpha _t(b+ca)\alpha _r)`$ by (D3) and (D6)  $`=`$ $`y^{\mathrm{dp}(\beta )1}(y1)^2+y^2(y1)T(t,\beta (b+ca)\alpha _sb\alpha _t(b+ca)\alpha _r)`$    $`+y^3T(s,\beta (b+ca)\alpha _s(b+ca)\alpha _t(b+ca)\alpha _r)`$ by (D7)  $`=`$ $`y^{\mathrm{dp}(\beta )1}(y1)^2+y^{\mathrm{dp}(\beta )2}(y1)^2`$    $`+y^3T(s,\beta (b+ca)\alpha _s(b+ca)\alpha _t(b+ca)\alpha _r)`$ by (D3)  $`=`$ $`(y1)T(s,\beta c\alpha _r)+yT(r,\beta (ca)\alpha _sc\alpha _r)`$ by symmetry

Case 12: $`\alpha _s,\alpha _t=1`$, $`\alpha _s,\alpha _r=1`$, $`\alpha _t,\alpha _r=0`$, and $`b>c=a`$. We cannot have $`\mathrm{dp}(\beta )4`$ in this case. Suppose $`\mathrm{dp}(\beta )5`$. Then, by induction,

$`(y1)T(s,\beta b\alpha _t)+yT(t,\beta (ba)\alpha _sb\alpha _t)`$   $`=`$ $`y^{\mathrm{dp}(\beta )1}(y1)^2+y^2T(t,\beta (ba)\alpha _sb\alpha _tb\alpha _r)`$ by (D3) and (D6)  $`=`$ $`y^{\mathrm{dp}(\beta )1}(y1)^2+y^2T(s,\beta b\alpha _sb\alpha _tb\alpha _r)+y^2(y1)T(t,\beta b\alpha _sb\alpha _tb\alpha _r)`$ by (D8)  $`=`$ $`y^{\mathrm{dp}(\beta )2}(y1)^2+y^2T(s,\beta b\alpha _sb\alpha _tb\alpha _r)+y^{\mathrm{dp}(\beta )2}(y1)^3`$    $`+y^2(y1)T(t,\beta b\alpha _sb\alpha _tb\alpha _r)`$   $`=`$ $`y(y1)T(r,\beta b\alpha _sb\alpha _ta\alpha _r)+y^2T(s,\beta b\alpha _sb\alpha _tb\alpha _r)+y^{\mathrm{dp}(\beta )2}(y1)^3`$    $`+y(y1)T(t,\beta b\alpha _sb\alpha _ta\alpha _r)`$ by (D3) and (D4)  $`=`$ $`yT(r,\beta b\alpha _ta\alpha _r)+(y1)^2T(s,\beta b\alpha _ta\alpha _r)`$    $`+y(y1)T(t,\beta b\alpha _sb\alpha _ta\alpha _r)`$ by (D7) and (D3)  $`=`$ $`T(r,\beta a\alpha _r)+(y1)T(s,\beta a\alpha _r)`$ by (D6) and (D5)

Case 13: $`\alpha _s,\alpha _t=1`$, $`\alpha _s,\alpha _r=1`$, $`\alpha _t,\alpha _r=0`$, and $`b>a>c`$. We cannot have $`\mathrm{dp}(\beta )3`$ in this case. Suppose $`\mathrm{dp}(\beta )4`$. Then, by induction,

$`(y1)T(s,\beta b\alpha _t)+yT(t,\beta (ba)\alpha _sb\alpha _t)`$   $`=`$ $`y^{\mathrm{dp}(\beta )1}(y1)^2+y^2T(t,\beta (ba)\alpha _sb\alpha _t(b+ca)\alpha _r)`$ by (D3) and (D6)  $`=`$ $`y^{\mathrm{dp}(\beta )1}(y1)^2+y^3T(t,\beta (b+ca)\alpha _sb\alpha _t(b+ca)\alpha _r)`$    $`+y^2T(s,\beta (b+ca)\alpha _sb\alpha _t(b+ca)\alpha _r)+y^{\mathrm{dp}(\beta )2}(1y)`$ by (D9)  $`=`$ $`y^{\mathrm{dp}(\beta )1}(y1)^2+y^3T(t,\beta (b+ca)\alpha _sb\alpha _t(b+ca)\alpha _r)+y^{\mathrm{dp}(\beta )2}(y1)^2`$    $`+y^2T(s,\beta (b+ca)\alpha _sb\alpha _t(b+ca)\alpha _r)+y^{\mathrm{dp}(\beta )1}(1y)`$   $`=`$ $`y^{\mathrm{dp}(\beta )1}(y1)^2+y^2T(t,\beta (b+ca)\alpha _sb\alpha _tc\alpha _r)`$    $`+y(y1)T(r,\beta (b+ca)\alpha _sb\alpha _tc\alpha _r)`$    $`+y^2T(s,\beta (b+ca)\alpha _sb\alpha _t(b+ca)\alpha _r)+y^{\mathrm{dp}(\beta )1}(1y)`$ by (D6) and (D3)  $`=`$ $`y(y1)T(s,\beta b\alpha _tc\alpha _r)+y^2T(t,\beta (b+ca)\alpha _sb\alpha _tc\alpha _r)`$    $`+yT(r,\beta b\alpha _tc\alpha _r)+y^{\mathrm{dp}(\beta )1}(1y)`$ by (D3) and (D7)  $`=`$ $`yT(s,\beta c\alpha _r)+T(r,\beta c\alpha _r)+y^{\mathrm{dp}(\beta )1}(1y)`$ by (D7) and (D6)

Case 14: $`\alpha _s,\alpha _t=1`$, $`\alpha _s,\alpha _r=1`$, $`\alpha _t,\alpha _r=0`$, and $`a=b=c`$. We cannot have $`\mathrm{dp}(\beta )3`$ in this case. Suppose $`\mathrm{dp}(\beta )4`$. Then, by induction,

$`T(t,\beta a\alpha _t)+(y1)T(s,\beta a\alpha _t)`$   $`=`$ $`yT(t,\beta a\alpha _ta\alpha _r)+(y1)^2T(s,\beta a\alpha _ta\alpha _r)`$    $`+y(y1)T(r,\beta a\alpha _sa\alpha _ta\alpha _r)`$ by (D6) and (D5)  $`=`$ $`yT(s,\beta a\alpha _sa\alpha _ta\alpha _r)+y(y1)T(t,\beta a\alpha _sa\alpha _ta\alpha _r)`$    $`+y^{\mathrm{dp}(\beta )2}(y1)^3+y(y1)T(r,\beta a\alpha _sa\alpha _ta\alpha _r)`$ by (D8) and (D3)  $`=`$ $`T(r,\beta a\alpha _r)+(y1)T(s,\beta a\alpha _r)`$ by symmetry

Case 15: $`\alpha _s,\alpha _t=1`$, $`\alpha _s,\alpha _r=1`$, $`\alpha _t,\alpha _r=0`$, and $`a=b>c`$. We cannot have $`\mathrm{dp}(\beta )3`$ in this case. Suppose $`\mathrm{dp}(\beta )4`$. Then, by induction,

$`T(t,\beta a\alpha _t)+(y1)T(s,\beta a\alpha _t)`$   $`=`$ $`yT(t,\beta a\alpha _tc\alpha _r)+(y1)^2T(s,\beta a\alpha _tc\alpha _r)`$    $`+y(y1)T(r,\beta c\alpha _sa\alpha _tc\alpha _r)`$ by (D6) and (D5)  $`=`$ $`y^2T(t,\beta c\alpha _sa\alpha _tc\alpha _r)+yT(s,\beta c\alpha _sa\alpha _tc\alpha _r)+y^{\mathrm{dp}(\beta )2}(1y)`$    $`+y^{\mathrm{dp}(\beta )2}(y1)^3+y(y1)T(r,\beta c\alpha _sa\alpha _tc\alpha _r)`$ by (D9) and (D3)  $`=`$ $`y^{\mathrm{dp}(\beta )1}(y1)^2+y^2T(t,\beta c\alpha _sa\alpha _tc\alpha _r)+yT(s,\beta c\alpha _sa\alpha _tc\alpha _r)`$    $`+y(y1)T(r,\beta c\alpha _sa\alpha _tc\alpha _r)+y^{\mathrm{dp}(\beta )1}(1y)`$   $`=`$ $`y(y1)T(s,\beta a\alpha _tc\alpha _r)+y^2T(t,\beta c\alpha _sa\alpha _tc\alpha _r)`$    $`+yT(r,\beta a\alpha _tc\alpha _r)+y^{\mathrm{dp}(\beta )1}(1y)`$ by (D3) and (D8)  $`=`$ $`yT(s,\beta c\alpha _r)+T(r,\beta c\alpha _r)+y^{\mathrm{dp}(\beta )1}(1y)`$ by (D7) and (D6)

Case 16: $`\alpha _s,\alpha _t=1`$, $`\alpha _s,\alpha _r=1`$, $`\alpha _t,\alpha _r=0`$, $`a>b`$, $`a>c`$, and $`b+c>a`$. We cannot have $`\mathrm{dp}(\beta )3`$ in this case. Suppose $`\mathrm{dp}(\beta )4`$. Then, by induction,

$`yT(s,\beta b\alpha _t)+T(t,\beta b\alpha _t)+y^{\mathrm{dp}(\beta )1}(1y)`$   $`=`$ $`y(y1)T(s,\beta b\alpha _tc\alpha _r)+y^2T(r,\beta (b+ca)\alpha _sb\alpha _tc\alpha _r)`$    $`+yT(t,\beta b\alpha _tc\alpha _r)+y^{\mathrm{dp}(\beta )1}(1y)`$ by (D7) and (D6)  $`=`$ $`y^{\mathrm{dp}(\beta )1}(y1)^2+y^2T(r,\beta (b+ca)\alpha _sb\alpha _tc\alpha _r)`$    $`+y^2T(t,\beta (b+ca)\alpha _sb\alpha _tc\alpha _r)`$    $`+yT(s,\beta (b+ca)\alpha _sb\alpha _tc\alpha _r)+y^{\mathrm{dp}(\beta )2}(1y)+y^{\mathrm{dp}(\beta )1}(1y)`$ by (D3) and (D9)  $`=`$ $`yT(s,\beta c\alpha _r)+T(r,\beta c\alpha _r)+y^{\mathrm{dp}(\beta )1}(1y)`$ by symmetry

Case 17: $`\alpha _s,\alpha _t=1`$, $`\alpha _s,\alpha _r=1`$, $`\alpha _t,\alpha _r=0`$, and $`a=b+c`$. We cannot have $`\mathrm{dp}(\beta )=2`$ in this case. Suppose $`\mathrm{dp}(\beta )3`$. Then, by induction,

$`yT(s,\beta b\alpha _t)+T(t,\beta b\alpha _t)+y^{\mathrm{dp}(\beta )1}(1y)`$   $`=`$ $`yT(r,\beta b\alpha _tc\alpha _r)+y(y1)T(s,\beta b\alpha _tc\alpha _r)`$    $`+yT(t,\beta b\alpha _tc\alpha _r)+y^{\mathrm{dp}(\beta )1}(1y)`$ by (D8) and (D6)  $`=`$ $`yT(s,\beta c\alpha _r)+T(r,\beta c\alpha _r)+y^{\mathrm{dp}(\beta )1}(1y)`$ by symmetry

Case 18: $`\alpha _s,\alpha _t=1`$, $`\alpha _s,\alpha _r=1`$, $`\alpha _t,\alpha _r=0`$, and $`a>b+c`$. We cannot have $`\mathrm{dp}(\beta )=2`$ in this case. Suppose $`\mathrm{dp}(\beta )3`$. Then, by induction,

$`yT(s,\beta b\alpha _t)+T(t,\beta b\alpha _t)+y^{\mathrm{dp}(\beta )1}(1y)`$   $`=`$ $`y^2T(s,\beta b\alpha _tc\alpha _r)+yT(r,\beta b\alpha _tc\alpha _r)+y^{\mathrm{dp}(\beta )1}(1y)`$    $`+yT(t,\beta b\alpha _tc\alpha _r)+y^{\mathrm{dp}(\beta )1}(1y)`$ by (D9) and (D6)  $`=`$ $`yT(s,\beta c\alpha _r)+T(r,\beta c\alpha _r)+y^{\mathrm{dp}(\beta )1}(1y)`$ by symmetry.

References

\[Alt\] J. Altobelli, The word problem for Artin groups of FC type, J. Pure Appl. Algebra 129 (1998), 1–22.

\[Big\] S. Bigelow, Braid groups are linear, J. Amer. Math. Soc., to appear.

\[BS\] E. Brieskorn, K. Saito, Artin-Gruppen und Coxeter-Gruppen, Invent. Math. 17 (1972), 245–271.

\[BH\] B. Brink, R.B. Howlett, A finiteness property and an automatic structure for Coxeter groups, Math. Ann. 296 (1993), 179–190.

\[Cha\] R. Charney, Injectivity of the positive monoid for some infinite type Artin groups, Cossey, John (ed.) et al., Geometric group theory down under. Proceedings of a special year in geometric group theory, Camberra, Australia, July 14–19, 1996. De Gruyter, Berlin, 1999, pp. 103–118.

\[ChP\] J.R. Cho, S.J. Pride, Embedding semigroups into groups, and the asphericity of semigroups, Int. J. Algebra Comput. 3 (1993), 1–13.

\[CW\] A.M. Cohen, D.B. Wales, Linearity of Artin groups of finite type, preprint.

\[Cri\] J. Crisp, Injective maps between Artin groups, Cossey, John (ed.) et al., Geometric group theory down under. Proceedings of a special year in geometric group theory, Camberra, Australia, July 14–19, 1996. De Gruyter, Berlin, 1999, pp. 119–137.

\[CrP\] J. Crisp, L. Paris, The solution to a conjecture of Tits on the subgroup generated by the squares of the generators of an Artin group, Invent. Math., to appear.

\[Del\] P. Deligne, Les immeubles des groupes de tresses généralisés, Invent. Math. 17 (1972), 273–302.

\[Deo\] V.V. Deodhar, On the root system of a Coxeter group, Commun. Algebra 10 (1982), 611–630.

\[Dig\] F. Digne, On the linearity of Artin braid groups, preprint.

\[Hil\] H. Hiller, Geometry of Coxeter groups, Research Notes in Mathematics, 54. Pitman Advanced Publishing program, Boston-London-Melbourn, 1982.

\[Kra1\] D. Krammer, The braid group $`B_4`$ is linear, Invent. Math. 142 (2000), 451–486.

\[Kra2\] D. Krammer, Braid groups are linear, preprint.

\[Mic\] J. Michel, A note on words in braid monoids, J. Algebra 215 (1999), 366–377.

\[Tit1\] J. Tits, Le problème des mots dans les groupes de Coxeter, Sympos. Math., Roma 1, Teoria Gruppi, Dic. 1967 e Teoria Continui Polari, Aprile 1968, Academic Press, London, 1969, pp.175–185.

\[Tit2\] J. Tits, Normalisateurs de tores. I: Groupes de Coxeter étendus, J. Algebra 4 (1966), 96–116.

| Luis Paris |
| --- |
| Laboratoire de Topologie |
| Université de Bourgogne |
| UMR 5584 du CNRS, BP 47870 |
| 21078 Dijon cedex |
| FRANCE |
| lparis@u-bourgogne.fr |