8.2.2. Bimodules
If , then there is
such that
,
where .
When , we put .
We define a partial order on the component of containing
. We define if there exists an admissible path
in whose support does not contain .
We consider the map of §7.4.6 for the curve
and its point .
Given , we put .
0PCZ
Lemma 8.2.4. Let .
Given , the following assertions are equivalent
- (1)
- (2)
- (3)
- (4)
- (5)
There exists such that if
and only if .
0PD0
Proof. The equivalence between (1) and (2) follows from Lemma 7.4.20.
Assume (2). We deduce that , hence
. So (3) holds.
Assume (3). Writing , we deduce from
Lemma 7.4.35 that (4) holds.
The implication (4)(5) is immediate.
Asssume (5). We have
by Remark 7.4.11. Lemma 7.4.9 shows that
, hence (2) holds.
Assume now . It follows
from Lemma 7.4.20 that there is with
, hence . This shows
the last statement of the lemma.
∎
There is a map
given by
|
|
|
|
|
|
We have
|
|
|
for .
The multiplication map on defines
a map , hence gives
a morphism
compatible with multiplication.
We define -subbimodules
, , , , and of . Let
.
We have
- •
if for
- •
if there exists with
- •
if it is in the image of
- •
if for
- •
if and
.
- •
if and
.
We put , , etc.
Note that .
We have .
0PD1
Lemma 8.2.5. We have an isomorphism .
In particular, we have an isomorphism
and .
0PD2
Proof. Let . We have
where
and
.
If , then
(cf the beginning of §7.4.10).
Now has an inverse given by
.
∎
0PD4
- •
Lemma 8.2.7. and are stable under the action of
.
- •
is stable under the action of and
is stable under the action of .
- •
and are stable under multiplication
- •
Given and , we have
and .
0PD5
Proof. Let and .
Assume .
If there is with
and , then .
Assume now for all
. We deduce that
, hence
(cf Lemma 8.2.4), a contradiction.
Using Remark 8.2.6, we deduce that
.
The other assertions of the lemma are immediate.
∎