Remark 4.4.1. The structure of objects in can be described graphically as follows:
![]() |
Consider two actions of given by and on and a closed morphism of functors such that diagrams (4.2.1) commute. As in Β§4.2.1, we have maps .
We define a differential category . Its objects are pairs where and , , satisfies that
for all , we have
for all .
We define to be the differential submodule of of elements such that for all , the following diagram commutes
The composition of maps is defined to be that of .
Remark 4.4.1. The structure of objects in can be described graphically as follows:
![]() |
Remark 4.4.2. The maps make into a monoid in the monoidal category of endofunctors of , when has enough direct sums. If has enough colimits, we have an induced monoid . Now, the category is the category of -modules in .
Remark 4.4.3. Let us define a lax bi--representation on as deduced from the one defined in Β§4.2.1 by applying the swap automorphism of (cf Remark 4.2.3).
There is a faithful differential functor .
We assume has a right adjoint and denote by and the counit and unit of the adjunction. We denote by the endomorphism of corresponding by adjunction to the endomorphism of . The pair provides an action of on .
Remark 4.4.4. The maps , , the relations they satisfy, and , and are described graphically as:
![]() |
We denote by the composition
| (4.4.1) |
and by the composition
| (4.4.2) |
The diagram (4.3.1) is commutative.
Lemma 4.4.5. We have
Proof. We have
We have
β
Let be the strict monoidal pointed category generated by objects for and maps for with relations and
Lemma 4.4.6. We have a pointed faithful strict monoidal functor
Given , the non-zero elements of are those with such that for all with and , we have .
Proof. Given the defining relations for , the construction of the lemma does define (uniquely) a monoidal functor .
Fix . Given such that , we put . Note that is well-defined if and only if , hence if and only if is well-defined. As a consequence, given such that and are well-defined and , then we have . This shows the faithfulness of .
Consider such that is well-defined and non-zero. Let . We show by induction on that given , we have .
Let . Put and . Since , we have . We have by Lemma 3.2.3. We have a well-defined map from . It follows by induction that given , we have . Since (Lemma 3.2.3), we deduce that for all .
Consider now such that given , we have . Let be a reduced decomposition of . We show by induction on that is well-defined. As before, we define and . By induction on , the element gives a well-defined map from . Since , it follows that , hence is a well-defined map from . We deduce that . This shows that is in the image of . β
Given and satisfying the assumptions of Lemma 4.4.6, we put .
We denote by the strict monoidal -linear category obtained from by adding maps and and relations
There is a monoidal duality, i.e. a monoidal equivalence given by
Lemma 4.4.7. Let . We have
and
Proof. We have
It follows that the first statement of the lemma holds when . Consider now . We prove the first statement of the lemma by induction on . We have
The second statement of the lemma follows by applying the duality of . β
Given and satisfying the assumptions of Lemma 4.4.6, we still denote by the element .
Lemma 4.4.7 has the following consequence.
Lemma 4.4.8. Let . We have
and
Let . Let be the composition
Note that is also equal to the composition
since and .
The pair defines an object of . We obtain a faithful differential functor .
Remark 4.4.9. The construction of from is illustrated below.
![]() |
We define now a differential functor .
Let . Let where . Given , we define
Lemma 4.4.10. is an object of .
Proof. We have
We have
where
and
So and .
We have shown that ,
Fix . We put .
Consider .
If , we have
If , we have
We have
We have shown that .
We have
Similarly,
So .
Let . We have
where and for , and for and .
We have
where for , for , and for .
It follows that .
Given , we put . We denote by the permutation of given by for and for .
Consider . We have
Consider . We have
It follows that for all , we have . β
Remark 4.4.11. The graphical description of is the following:
![]() |
Given , we put .
Lemma 4.4.12. We have . The construction makes into a differential endofunctor of .
Proof. The lemma follows from the commutativity of the following diagram:
β
Lemma 4.4.13. We have .
Proof. Let . We have where and is given in Β§4.3.2. We have where
It follows that . β
We assume in Β§4.4.5 that is invertible.
Given , write . The formula (4.3.3) defines an endomorphism of .
Lemma 4.4.14. Given , we have .
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.
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 .
Proposition 4.4.16. The functor induces a morphism of -representations.
Original source: arXiv:2009.09627v2