0P4Y
Lemma 3.2.2. Let and .
Assume
.
Let such that
and .
Let and
.
We have and
.
0P4Z
Proof. Multiplying if necessary and by a power of
, we can assume , and are in
.
Let and be two reduced decompositions. The Exchange Lemma
[Hu, Theorem 5.8] shows that there is such that
.
If , then and this contradicts
. So, .
We have
. We deduce that has length and the lemma follows.
∎