0P4M
Proof. Define and , so that .
We have .
Let . There is a unique decomposition where
, and
[Hu, Proposition 1.10]. Furthermore,
unless . We have .
There is a unique decomposition with
, and has minimal
length in . We have where
and has minimal length in . Furthermore,
if and only if and .
It follows that
|
|
|
This shows the first statement of the lemma.
We have , hence
|
|
|
This shows the second statement of the lemma.
Let . We have .
Since is a linear combination of elements with
and , it follows that if
, then is a linear combination of elements
with and , hence
of elements with . So, if , then
.
Assume now . We have because
. We deduce
that .
This shows the third statement of the lemma.
Let . We have .
Let . Note that
or
is a linear combination of ’s with
.
It follows that if if
or and . We have also
.
Since is a free right -module with basis ,
we deduce that is surjective.
Since is an -module morphism between free -modules
of the same finite rank, it follows that it is an isomorphism.
This shows the fifth statement of the lemma.
Let and . Let .
If , then and
.
If , then .
If , then .
So, we have shown that .
It follows by induction on that
for all
.
Consider now commuting with . Let .
We have
|
|
|
It follows that , hence . This completes the proof
of the lemma.
∎