Theorem 8.2.1. The functor factors through and induces an isomorphism of differential pointed categories .
8.2. Gluing
8.2.1. Construction
Consider two injective morphisms of curves and where and are unoriented. We assume that is outgoing for , that is incoming for and that . We write instead of and instead of , for .
Let be a subset of .
Fix an oriented diffeomorphism and let be its composition with the inclusion map. Similarly, fix an oriented diffeomorphism and let be its composition with the inclusion map.
Consider . Let be the -bimodule given by
Note that and , but is not isomorphic to in general.
There is an action of on given by
for , and .
There is a map given by
This map is compatible with the action of via the canonical embeddings and . We have .
So, we have defined a bimodule lax bi--representation on .
Let , where the gluing is done along the maps and . Note that is a -dimensional space and it comes with an injective open morphism of -dimensional spaces . We endow with a curve structure by setting and by endowing with its usual orientation. We extend the curve structure on by endowing with the curve structure of . Note that .
Given and , , we put .
We consider the differential pointed category with objects those of and with
We define a differential pointed functor . It is the identity on objects and defined on maps by
Example 8.2.2. We give below an illustration of the gluing data.
![]() |
Example 8.2.3. The pictures below give two examples of description of . The first picture corresponds to the gluing of two intervals to form an interval. The second picture corresponds to the self-gluing of an interval to form a circle.
![]() |
![]() |
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 .
Lemma 8.2.4. Let .
Given , the following assertions are equivalent
- (1)
- (2)
- (3)
- (4)
- (5)
.
There exists such that if and only if .
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.
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 .
Lemma 8.2.5. We have an isomorphism .
In particular, we have an isomorphism and .
Proof. Let . We have where and . If , then (cf the beginning of ยง7.4.10). Now has an inverse given by . โ
Remark 8.2.6. Consider and . There is an isomorphism that is the identity on and on . This provides an isomorphism . It induces isomorphisms
This restricts to isomorphisms between (resp. , , , ) for and (resp. , , , ) for .
- โข
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 .
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. โ
8.2.3. Gluing map
We define a morphism of -bimodules :
Let . We put and . We define inductively and for by and .
Note that , hence since .
Note that and .
Define
for . We define
We put if .
Assume now , hence . Let and . Let and .
Given , we have .
Note in particular that .
Let , and . Put . We have
Given a decomposition with and , we have and .
The next lemma is immediate.
Lemma 8.2.8. The map defines a morphism of -bimodules and .
Given and , we have .
Lemma 8.2.9. The restrictions of to and to are injective.
Proof. Let be a non-zero element of . Let . Given , we put . We put .
Let be two distinct elements of and let .
If , then .
Assume and . We have where
We have
Ir follows that .
Assume finally and . We have where
We have
It follows that .
It follows from Remark 7.4.11 that .
Define and as above. Let . We have and for in .
Given in with , we have .
Consider now another non-zero element of and assume . We have and . The discussion above shows that for . Note also that for . As a consequence, if .
Let , , , and . Since , it follows that , , , and . We deduce that for .
We proceed now by induction on to show that determines , for .
Assume there is such that . Let and . We have . Define an element of as follows. Given , we put if , if . Given , we put . Given , we put . This defines an element of . Furthermore, .
We define similarly , , and starting with and . We have and , hence also . We have , hence by induction. Since and , it follows that .
Assume for all . We have . Note that for . Let be the unique increasing bijection. We define and an element of as follows. We put for , for and for .
Let , and . We have
Define similarly, starting with instead of . We have . By induction, we deduce that , hence .
This completes the proof that the restriction of to is injective.
We deduce that the restriction of to is injective using Remark 8.2.6 โ
Lemma 8.2.10. The restrictions of to and to are surjective.
Proof. Let . Let . We show by induction on that there exists such that .
Assume . Let such that . There is a decomposition as in ยง7.4.6. We define by for , and . We have and .
Assume now . Consider a decomposition as in Lemma 7.4.27. There exists and such that and . Let . We have .
Let . We have . Let and . If , then . Assume . We have . Since , it follows that . Since , we deduce that .
The case of follows from that of applied to , cf Remark 8.2.6. โ
8.2.4. Equivalence relation
We define an equivalence relation on as the transitive, symmetric and reflexive closure of the relation for and and if .
Lemma 8.2.11. Let . There exists and such that .
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. โ
Lemma 8.2.12. Let . We have if and only if .
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 . โ
8.2.5. Complement
We provide here a more direct description of the equivalence relation on .
Corollary 8.2.13. We have and .
We define an equivalence relation on as the relation generated by for and .
Lemma 8.2.14. Let and
If , then and .
If , then and .
Proof. Put and assume . There are , and such that .
Lemma 8.2.4 shows that . We have . It follows from Lemma 8.2.4 that . Since , it follows that , hence .
Assume . We have for some by Lemma 8.2.4. Since , we have . We deduce that , hence (Corollary 8.2.13). So, .
Assume now , i.e., . We have and (Corollary 8.2.13).
Assume . There is such that (Lemma 8.2.4). Since , we have , hence also . As a consequence, . We deduce that . We have and , hence and . We have . Since and , it follows that , by applying Lemma 8.2.4 to . Since , we deduce that , hence (using Lemma 8.2.4 for again).
Assume now . It follows that , hence .
There are with . Let for . Consider minimal such that .
Define and .
Let . Define and to be the domain and codomain of , intersected with . Note that . Let and define by
Lemma 7.4.35 shows that and are braids and . We have and we deduce that , where . We have . This completes the proof of the first statement of the lemma.
The second statement of the lemma follows from the first one applied to thanks to Remark 8.2.6. โ
Proposition 8.2.15. Let . We have if and only if .
Proof. It is clear that implies . The converse follows from Lemma 8.2.14. โ
Corollary 8.2.16. We have .
8.2.6. Large enough
We assume in ยง8.2.6 that has no maximum and has no minimum. Fix an increasing sequence of points of and a decreasing sequence of points of such that for all and for all .
Lemma 8.2.17. We have a canonical isomorphism .
Let us define as the composition of the injective map (cf Lemma 8.2.5) with the inverse of the isomorphism of the lemma above.
Under the assumptions above, we have a simpler version of Theorem 8.2.1.
Theorem 8.2.18. The functor factors through and induces an isomorphism of differential pointed categories .
Proof. Every element of is of the form for some admissible class of paths starting at and a braid starting at .
Every element of is of the form for some braid starting at .
It follows that every element of is of the form
for some and an admissible class of paths starting at for . The image by of such an element is
It follows that is injective, hence it induces an isomorphism .
Remark 8.2.19. Consider the singular curve quotient of oriented by the identification of two points. Take to be the single exceptional point of . The construction above applied to gives a category where going twice around the circle, avoiding the loop, is non-zero (cf picture below), while it is not represented by a smooth path in . Theorem 8.2.18 does not hold because is too small.
![]() |
8.2.7. Functoriality
Consider a morphism of curves and assume is outgoing for and is incoming for .
The morphism extends uniquely to a morphism of curves .
The functor can be equipped with a structure of morphism of -representations and of morphism of -representations (Lemma 8.1.7 and ยง8.1.5), and it induces a differential pointed functor (cf ยง4.3.4)
where is the analog of the map for .
We obtain a commutative diagram of differential pointed functors
| (8.2.1) |
Assume is strict. It follows that is strict. The functor can be equipped with a structure of morphism of -representations and of morphism of -representations (Lemma 8.1.4 and ยง8.1.5), and it induces a differential functor (cf ยง4.3.4)
We obtain a commutative diagram of differential functors commuting with coproducts
| (8.2.2) |
Original source: arXiv:2009.09627v2
![[Uncaptioned image]](/assets/author-raster/W000055/c51e312c3dfc3c3a5156efe511a78d8033db1c088fbb70833ab218e770ec806e.png)
![[Uncaptioned image]](/assets/author-raster/W000055/edf30fa0253abf953b3babc3c9689d9e6e5b5cb8f0470612750db406e966d91b.png)
![[Uncaptioned image]](/assets/author-raster/W000055/7bd28adf0bacbbdec3beabc560b16c807a0b9e1600d9e1590441e14723e3adc8.png)
![[Uncaptioned image]](/assets/author-raster/W000055/b6ee967e3e9f15914c866ccedf41231bd792dd6cd6b54e840240b6fa703deba4.png)