Entwining Structures in Monoidal Catrgories
Bachuki Mesablishvili

TL;DR
This paper generalizes the concept of entwining structures and modules within monoidal categories using distributive law formalism, extending their basic properties beyond traditional settings.
Contribution
It introduces a formalism to extend entwining modules to arbitrary monoidal categories, broadening their theoretical framework.
Findings
Generalization of entwining structures to monoidal categories
Extension of basic properties of entwining modules
Use of distributive law formalism in this context
Abstract
Interpreting entwining structures as special instances of J. Beck's distributive law, the concept of entwining module can be generalized for the setting of arbitrary monoidal category. In this paper, we use the distributive law formalism to extend in this setting basic properties of entwining modules.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Materials and Mechanics · Modular Robots and Swarm Intelligence · Cellular transport and secretion
\amsclass
16W30, 18D10, 18 D35
††thanks: Supported by the research project ”Algebraic and Topological Structures in Homotopical and Categorical Algebra, K-theory and Cyclic Homology“, with financial support of the grant GNSF/ST06/3-004. \[email protected]
Entwining structures in monoidal categories
B. Mesablishvili
Abstract
Interpreting entwining structures as special instances of J. Beck’s distributive law, the concept of entwining module can be generalized for the setting of arbitrary monoidal category. In this paper, we use the distributive law formalism to extend in this setting basic properties of entwining modules.
keywords:
Entwining module, (braided) monoidal category, Hopf algebra
1 Introduction
The important notion of entwining structures has been introduced by T. Brzeziński and S. Majid in [4]. An entwining structure (over a commutative ring ) consists of a -algebra , a -coalgebra and a certain -homomorphism satisfying some axioms. Associated to there is the category of entwining modules whose objects are at the same time -modules and -comodules, with compatibility relation given by .
The algebra can be identified with the monad whose Eilenberg-Moore category of algebras, , is (isomorphic to) the category of right -modules. Similarly, can be identified with the comonad , and the corresponding Eilenberg-Moore category of coalgebras with the category of -comodules. It turns out that to give an entwining structure is to give a mixed distributive law from the monad to the comonad G in the sense of J. Beck [2], which are in bijective corresondence with liftings (or extensions) of the comonad to the category ; or, equivalently, liftings of the monad to the category . Moreover, the categories , and are isomorphic. Thus, the (mixed) distributive law formalism can be used to study entwining structures and the corresponding category of modules. In this article -based on this formalism- we extend in the context of monoidal categories some of basic results on entwining structures that appear in the literature (see, for example, [5], [6], [11]).
The paper is organized as follows. After recalling the notion of Beck’s mixed distributive law and the basic facts about it, we define in Section 3 an entwining structure in any monoidal category. In Section 4, we prove some categorical results that are needed in the next section, but may also be of independent interest. Finally, in the last section we present our main results.
We refer to M. Barr and C. Wells [1], S. MacLane [9] and F. Borceux [3] for terminology and general results on (co)monads, and to T. Brzeziński and R. Wisbauer [5] for coring and comodule theory.
2 Mixed distributive laws
Let be a monad and a comonad on a category . A mixed distributive law from to is a natural transformation
[TABLE]
for which the diagrams
[TABLE]
[TABLE]
commute.
Given a monad on , write for the Eilenberg-Moore category of T-algebras, and write for the corresponding forgetful-free adjunction. Dually, if is comonad on , then write for the category of G-coalgebras, and write for the corresponding forgetful-cofree adjunction.
Theorem 2.1**.**
(* see [12] ) Let be a monad and a comonad on a category . Then the following structures are in bijective correspondences:*
- •
mixed distributive laws ;
- •
comonads on that extend G in the sense that , and ;
- •
monads on that extend T in the sense that , and .
These correspondences are constructed as follows:
- •
Given a mixed distributive law
[TABLE]
then , , , for any ; and , , for any .
- •
If is a comonad on extending the comonad , then the corresponding distributive law
[TABLE]
is given by
[TABLE]
where is the counit of the adjunction .
- •
If is a monad on extending , then the corresponding mixed distributive law is given by
[TABLE]
where is the unit of the adjunction
It follows from this theorem that if
[TABLE]
is a mixed distributive law, then . We write for this category. An object of this category is a three-tuple , where , , for which . A morphism in is a morphism in such that and .
3 Entwining structures in monoidal categories
Let be a monoidal category with coequalizers such that the tensor product preserves the coequalizer in both variables. Then for all algebras and and all , and , the tensor product exists and the canonical morphism is an isomorphism. Using MacLane’s coherence theorem (see, [9], XI.5), we may assume without loss of generality that is strict.
It is well known that every algebra in defines a monad on by
- •
,
- •
,
- •
,
and that is (isomorphic to) the category of right -modules.
Dually, if is a coalgebra (=comonoid) in , then one defines a comonad on by
- •
,
- •
- •
,
and is (isomorphic to) the category of right -comodules.
Quite obviously, if is a mixed distributive law from to , then the morphism
[TABLE]
makes the following diagrams commutative:
[TABLE]
[TABLE]
Conversely, if is a morphism for which the above diagrams commute, then the natural transformation
[TABLE]
is a mixed distributive law from the monad to the comonad . It is easy to see that . When is a regular generator in and the tensor product preserves all colimits in both variables, it is not hard to show that . When this is the case, then the correspondences and are inverses of each other.
Definition 3.1**.**
An entwining structure consists of an algebra and a coalgebra in and a morphism such that the natural transformation
[TABLE]
is a mixed distributive law from the monad to the comonad .
Let be be an entwining structure and let be the comonad on that extends . Then we know that, for any ,
[TABLE]
In particular, since , is a right -module with right action
[TABLE]
Lemma 3.2**.**
View as a left -module through . Then is an --bimodule.
Proof 3.3**.**
Clearly Moreover, since , it follows from the associativity of that the diagram
[TABLE]
is commutative, which just means that is an --bimodule.
Since and are morphisms of right -modules, and since and U_{A}(\bar{\delta}_{(A,m_{A})})=\delta_{\mathbb{C}}=$$(A\otimes C\stackrel{{\scriptstyle A\otimes\delta_{\mathbb{C}}}}{{\longrightarrow}}A\otimes C\otimes C), it follows that and are both morphisms of right -modules. Clearly they are also morphisms of left -modules with the obvious left -module structures arising from the multiplication , and hence morphisms of --bimodules. Since is a coalgebra in , it follows that the triple , where and , is an -coring. Since, for any the comonad is isomorphic to the comonad . Thus, any entwining structure defines a right -module structure on such that is an --bimodule and the triple is an -coring. Moreover, when this is the case, the comonad on extends the comonad . It follows that
Conversely, let be an algebra and a coalgebra in , and suppose that has the structure of a right -module such that the triple
[TABLE]
is an -coring. Then it is easy to see that the comonad on extends the comonad on , and thus defines an entwining structure .
Summarising, we have
Theorem 3.4**.**
Let be an algebra and a coalgebra in . Then there exists a bijection between right -module structures making an -bimodule for which the triple (1) is an -coring and entwining structures , given by:
[TABLE]
with inverse given by
[TABLE]
Under this equivalence .
4 Some categorical results
Let be a comonad on a category , and let be the forgetful functor. Fix a functor , and consider a functor making the diagram
[TABLE]
commutative. Then for some . Consider the natural transformation
[TABLE]
whose -component is .
It is proved in [7] that:
Theorem 4.1**.**
Suppose that has a right adjoint with unit and counit . Then the composite
[TABLE]
is a morphism from the comonad generated by the adjunction to the comonad G. Moreover, the assignment
[TABLE]
yields a one to one correspondence between functors making the diagram (2) commutative and morphisms of comonads .
Write for the composite \lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 6.95901pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&&\crcr}}}\ignorespaces{\hbox{\kern-6.95901pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 3.0pt\raise 0.0pt\hbox{\textstyle{U\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces\ignorespaces\ignorespaces{\hbox{\kern 11.44986pt\raise 6.07222pt\hbox{{}\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 3.0pt\hbox{\hbox{\kern 0.0pt\raise-1.71112pt\hbox{\scriptstyle{\eta U}}}}\kern 3.0pt}}}}}}\ignorespaces{\hbox{\kern 30.95901pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 30.95901pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 3.0pt\raise 0.0pt\hbox{\textstyle{UFU\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces\ignorespaces\ignorespaces{\hbox{\kern 63.57933pt\raise 6.52722pt\hbox{{}\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 3.0pt\hbox{\hbox{\kern 0.0pt\raise-1.25612pt\hbox{\scriptstyle{Ut_{\bar{F}}}}}}\kern 3.0pt}}}}}}\ignorespaces{\hbox{\kern 84.61453pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 84.61453pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 3.0pt\raise 0.0pt\hbox{\textstyle{UG}}}}}}}}\ignorespaces}}}}\ignorespaces.
Proposition 4.2**.**
The equalizer , if it exists, of the following diagram
[TABLE]
where is the unit of the adjunction is right adjoint to .
Proof 4.3**.**
Let be a functor making (2) commutative and let be the corresponding morphism of comonads. Consider the following composition
[TABLE]
where
- •
is the Eilenberg-Moore comparison functor for the comonad .
- •
is the functor
[TABLE]
induced by the morphism of comonads
Lemma 4.4**.**
The diagram
[TABLE]
is commutative.
Proof 4.5**.**
Let . Then and Since is the composite
[TABLE]
and since by naturality of , the diagram
[TABLE]
commutes, we have
[TABLE]
Thus
[TABLE]
which just means that .
We are now ready to prove the following
Theorem 4.6**.**
Let G be a comonad on a category , an adjunction and a functor with . Then the following are equivalent:
- (i)
The functor is an equivalence.
- (ii)
The functor is comonadic and the morphism of comonads
[TABLE]
is an isomorphism.
Proof 4.7**.**
Suppose that is an equivalence of categories. Then is isomorphic to the comonadic functor and thus is comonadic. Hence the comparison functor is an equivalence and it follows from the commutative diagram (4) that is also an equivalence, and since the diagram
[TABLE]
is commutative, is an isomorphism of comonads. So .
Suppose now that is an isomorphism of comonads and is comonadic. Then
- •
* is an equivalence, since is comonadic.*
- •
* is an equivalence, since is an isomorphism.*
And it now follows from the commutative diagram (4) that is also an equivalence. Thus . This completes the proof of the theorem.
Remark 4.8**.**
In [8], J. Gómez-Torrecillas has proved that is an equivalence of categories iff is an isomorphism of comonads, is conservative, and for any , preserves the equalizer of the pair of parallel morphisms
[TABLE]
When is an isomorphism of comonads, to say that preserves the equalizer of the pair of morphisms is to say that preserves the equalizer of the pair of morphisms
[TABLE]
which we can rewrite as
[TABLE]
Since is an isomorphism of comonds, is an equivalence of categories, and thus each object is isomorphic to the -coalgebra , where . It follows that when is an isomorphism of comonds, to say that preserves the equalizer of for each is to say that preserves the equalizer of for each . Thus, when is an isomorphism of comonds, is an equivalence of categories iff is conservative and preserves the equalizer of for each , which according to (the dual of) Beck’s theorem (see [9]), is to say that the functor is comonadic. Hence our theorem 4.4 is equivalent to Theorem 1.7 of [8].
5 Some applications
Let be an entwining structure in a monoidal category , and let be a group-like element of . (Recall that a morphism is said to be a group-like element of if the following diagrams
[TABLE]
are commutative.)
Proposition 5.1**.**
If has a group-like element , then is a right -comodule through the morphism
[TABLE]
Proof 5.2**.**
Consider the diagram
[TABLE]
The triangle is commutative by (1) of the definition of and the square is commutative by the definition of (see the second commutative diagram in the definition of entwining structures).
Now, we have to show that the following diagram
[TABLE]
is also commutative, which it is since
[TABLE]
by the definition of and since the diagram (2) of definition of group-like elements is commutative.
Suppose now that admits equalizers. For any , write for the equalizer of the morphisms
[TABLE]
Proposition 5.3**.**
* is an algebra in and is an algebra morphism.*
Proof 5.4**.**
Consider the diagram
[TABLE]
Since
[TABLE]
is a natural transformation, the diagram
[TABLE]
is commutative. Similarly, since is a natural transformation, the following diagram is also commutative:
[TABLE]
Now we have:
[TABLE]
[TABLE]
Thus there exists a unique morphism for which
Since
- •
the diagram
[TABLE]
is commutative by naturality of ;
- •
* by the definition of ;*
- •
, since is an equalizer of and ;
- •
the diagram
[TABLE]
is commutative by naturality of ,
we have
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Thus the morphism equalizes the morphisms and , and hence there is a unique morphism
[TABLE]
such that the diagram
[TABLE]
commutes. It is now straightforward to show that the triple is an algebra in ; moreover, the triangle of the diagram and the diagram show that is an algebra morphism.
Proposition 5.5**.**
**
Proof 5.6**.**
Since and , it only remains to show that the following diagram is commutative:
[TABLE]
By the definition of , we can rewrite it as
[TABLE]
But this diagram is commutative, since
- •
the middle square commutes because of naturality of ;
- •
the right square commutes because of the definition of .
The algebra morphism makes an --bimodule and thus induces the extension-of-scalars functor
[TABLE]
[TABLE]
and the forgetful functor
[TABLE]
[TABLE]
which is right adjoint to . The corresponding comonad on makes into an -coring with the following counit and comultiplication:
[TABLE]
(where is the canonical morphism) and
[TABLE]
We write for this -coring.
Lemma 5.7**.**
For any , the triple
[TABLE]
is an object of the category
Proof 5.8**.**
Clearly and . Moreover, by (9), the following diagram
[TABLE]
is commutative. Thus,
The lemma shows that the assignment
[TABLE]
yields a functor
[TABLE]
It is clear that , where is the underlying functor. It now follows from Theorem 3.1 that the composite
[TABLE]
is a morphism of -corings We write can for this morphism. We say that is -Galois if can is an isomorphism of -corings.
Applying Theorem 4.4 the commutative diagram
[TABLE]
we get:
Theorem 5.9**.**
Let be an entwining structure, and let be a group-like element of . Then the functor
[TABLE]
is an equivalence if and only if is -Galois and the functor is comonadic.
Let and be algebras in and let . We call (resp. )
- •
flat, if the functor (resp. ) preserves equalizers;
- •
faithfully flat, if the functor (resp. ) is conservative and flat (equivalently, preserves and reflects equalizers);
Theorem 5.10**.**
Let be an entwining structure, and let be a group-like element of . If is flat, then the following are equivalent
- (i)
The functor
[TABLE]
is an equivalence of categories.
- (ii)
* is -Galois and is faithfully flat.*
Proof 5.11**.**
Since any left adjoint functor that is conservative and preserves equalizers is comonadic by a simple and well-known application (of the dual of) Beck’s theorem, one direction is clear from Therem 5.5; so suppose that is an equivalence of categories. Then, by Theorem 4.5, is -Galois and the functor is comonadic. Since any comonadic functor is conservative, is also conservative. Thus, it only remains to show that is flat.
Since is flat by our assumption, is also flat. It follows that the underlying functor of the comonad on preserves equalizers. We recall (for example, from [3]) that if is a comonad on a category , and if has some type of limits preserved by , then the category has the same type of limits and these are preserved by the underlying functor . Thus the functor preserves equalizers, and since is an equivalence of categories, the functor also preserves equalizers, which just means that is flat. This completes the proof.
From now on we suppose at all times that our is a strict braided monoidal category with braiding . Then the tensor product of two (co)algebras in is again a (co)algebra; the multiplication and the unit of the tensor product of two algebras and are given through
[TABLE]
and
[TABLE]
A bialgebra in is an algebra and a coalgebra , where and are algebra morphisms, or, equivalently, and are coalgebra morphisms.
A Hopf algebra in is a bialgebra with a morphism , called the antipode of , such that
[TABLE]
Recall that for any bialgebra , the category is monoidal: The tensor product of two right -comodules and is their tensor product in with the coaction
[TABLE]
The unit object for this tensor product is with trivial -comodule structure
Proposition 5.12**.**
Let be a bialgebra in . For any algebra in , the following conditions are equivalent:
- •
* is an algebra in the monoidal category ;*
- •
* is an -comodule algebra; that is, is a right -comodule and the -comodule coaction is a morphism of algebras in from the algebra to the algebra .*
Suppose now that is a right -comodule algebra with -coaction . By the previous proposition, is an algebra in the monoidal category , and thus defines a monad on as follows:
- •
;
- •
- •
.
It is easy to see that the monad extends the monad ; and it follows from Theorem 2.1 that there exists a distributive law from the monad to the comonad , and hence an entwining structure , where .
Therefore we have:
Theorem 5.13**.**
Every right -comodule algebra defines an entwining structure .
Proposition 5.14**.**
Let be a right -comodule algebra. Then the entwining structure is given by the composite:
[TABLE]
Proof 5.15**.**
Since the pair , where is the composite
[TABLE]
is also an object of , and it follows from Theorem 1.1 that is the composite
[TABLE]
Consider now the following diagram
[TABLE]
Since in this diagram
- •
the triangle commutes because is the counit for ;
- •
the left square commutes by naturality of ;
- •
the right square commutes because is a bifunctor,
it follows that
[TABLE]
Note that the morphism is a group-like element for the coalgebra .
Proposition 5.16**.**
Let be a bialgebra in , and let be a right -comodule algebra. Then the right -comodule structure on corresponding to the group-like element as in Proposition 4.1 coincides with .
Proof 5.17**.**
We have to show that
[TABLE]
But since
- •
clearly
- •
* *
- •
* ,*
we have that
[TABLE]
[TABLE]
[TABLE]
[TABLE]
It now follows from Proposition 5.3 that
Proposition 5.18**.**
**
Recall that for any , the algebra is the equalizer of the morphisms
[TABLE]
Applying Theorem 5.5 we get
Theorem 5.19**.**
Let be a bialgebra in , let be a right -comodule algebra, and let be the corresponding entwining structure. Then the functor
[TABLE]
[TABLE]
is an equivalence of categories iff the extension-of-scalars functor
[TABLE]
[TABLE]
is comonadic and is -Galois (in the sense that the canonical morphism
[TABLE]
is an isomorphism).
Now applying Theorem 5.6 we get
Theorem 5.20**.**
Let be a bialgebra in , let be a right -comodule algebra, and let be the corresponding entwining structure. Suppose that is flat. Then the following are equivalent:
- (i)
The functor
[TABLE]
[TABLE]
is an equivalence of categories.
- (ii)
* is -Galois and is faithfully flat.*
Let be a bialgebra in , and let be a right -comodule algebra. A right -module is a right -module which is a right -comodule such that the -comodule structure morphism is a morphism of right -modules. Morphisms of right -modules are right -module right -comodule morphisms. We write for this category. Note that the category is the category of right -modules in the monoidal category , and it follows from Theorem 2.1 that
Proposition 5.21**.**
.
The following is an immediate consequence of Theorem 5.12.
Theorem 5.22**.**
Let be a bialgebra in , and let be a right -comodule algebra. Then the functor
[TABLE]
is an equivalence of categories iff the extension-of-scalars functor
[TABLE]
is comonadic and is -Galois.
Let be an Hopf algebra in . Then clearly is a right -comodule algebra.
Proposition 5.23**.**
The composite
[TABLE]
is an isomorphism.
Proof 5.24**.**
We will show that the composite
[TABLE]
is the inverse for . Indeed, consider the diagram
[TABLE]
We have:
- •
Square (1) commutes because of coassociativity of ;
- •
Square (2) commutes because of naturality of ;
- •
Square (3) commutes because is a bifunctor;
- •
Square (4) commutes because of associativity of .
Then
[TABLE]
[TABLE]
but since
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Thus . The equality can be shown in a similar way.
Proposition 5.25**.**
**
Proof 5.26**.**
We will first show that the diagram
[TABLE]
is serially commutative. Indeed, we have:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Thus, is isomorphic to the equalizer of the pair . But since is a split monomorphism in , the diagram
[TABLE]
is an equalizer diagram. Hence
Theorem 5.27**.**
Let be a Hopf algebra in . Then the functor
[TABLE]
[TABLE]
is an equivalence of categories.
Proof 5.28**.**
It follows from Propositions 5.16 and 5.17 that is -Galois, and according to Theorem 5.12, the functor is an equivalence iff the functor is comonadic. But since the morphism is a split monomorphism in , the unit of the adjunction is a split monomorphism, and it follows from 3.16 of [10] that is comonadic. This completes the proof.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Barr and C. Wells, Toposes, Triples, and Theories , Grundlehren der Math. Wissenschaften 278 , Springer-Verlag, 1985.
- 2[2] J. Beck, Distributive laws . Lect. Notes Math. 80 , 119-140 (1969).
- 3[3] F. Borceux, Handbook of Categorical Algebra . vol. 2 , Cambridge University Press, 1994.
- 4[4] T. Brzezinski and S, Majid Coalgebra bundles . Comm. Math. Phys. 191 , 467-492 (1998).
- 5[5] T. Brzezinski and R. Wisbauer, Corings and comodules , London Math. Soc. Lect. Note Ser. 309 , Cambridge University Press, Cambridge, 2003.
- 6[6] S. Caenepeel, G. Militaru and S. Zhu, Frobenius and separable functors for generalized Hopf modules and nonlinear equations , Lect. Notes Math. 1787 , (2003).
- 7[7] E. Dubuc, Kan extensions in enriched category theory . Lecture Notes Math. 145 (1970).
- 8[8] J. Gómez-Torrecillas, Comonads and Galois corings . Appl. Categ. Struct. 14 , No. 5-6, 579-598 (2006).
