4.4.5. -arrows
We assume in §4.4.5 that is invertible.
Given , write .
The formula (4.3.3) defines an endomorphism
of .
0P6P
Lemma 4.4.14. Given , we have
.
0P6Q
Proof. Let and .
We have
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
We have
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
We deduce that and the lemma follows.
∎
Lemma 4.4.14 shows that defines an endomorphism of for
all .
The functor is faithful, (Lemma 4.4.13) and
commutes with . It follows that is functorial.
Theorem 4.3.8 has the following consequence.
0P6R
Theorem 4.4.15. The data is an idempotent-complete
strongly pretriangulated -representation.
The following proposition is a consequence of Lemma 4.4.13 and the construction of .
0P6S
Proposition 4.4.16. The functor induces a morphism of
-representations.