We define an equivalence relation on as the transitive, symmetric
and reflexive closure of the relation
for and and
if .
0PDC
Proof. If , then and we are done.
Assume now . We proceed by induction
on and then on
if
to show that there exists
with .
If , then and we are
done. Assume now . By Lemma 8.2.4, there are
and such that , and
we choose maximal with this property, so that
.
We have . If then we are done.
We assume now .
We have .
If , then
, hence
. By induction, there is
with , hence .
Assume now there are with
and .
Since , we have
. Since , we have
and .
We have . On the other
hand, (cf Lemma 7.4.20), hence
. We conclude by induction.
The case of follows by applying Remark 8.2.6.
∎
0PDF
Proof of Theorem 8.2.1. Lemma 8.2.12 shows that factors through an isomorphism
. Since the restriction of to
is surjective (Lemma 8.2.10), it follows that
induces an isomorphism .
Recall that
has image , hence induces an isomorphism
.
As a consequence,
the canonical surjective map factors through a surjective map
. Since the restriction
of to factors through , we deduce that
we have an isomorphism .
∎