8.3.2. Setting
Let be defined as in (4.4.1).
0PDU
Lemma 8.3.2. The morphism is invertible. Given
and , we have
|
|
|
Given and , we have
|
|
|
0PDV
Proof. We have
|
|
|
We have
, hence
. As a consequence, it is enough to prove the
first statement of the lemma assuming that .
In that case, the composition above is given by
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
It is immediate to check that the formula for does produce an inverse.
∎
Consider the map defined in §4.4.2.
0PDW
Lemma 8.3.3. Given and ,
we have
|
|
|
where
if and
and otherwise.
0PDX
Proof. Assume first and
.
We have
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
where .
Since is a morphism of -bimodules, the general
result follows using the decompositions
and
.
∎