One can consider various compatibilities between a (co)monad on a monoidal category and the underlying monoidal product; they are variants of the idea of a distributive law. Similarly, one can look at a compatibility between an action of a monoidal category and a (co)monad on the same category. A Hopf monad satisfies conditions analogous to that of a Hopf monoid (Bruguières 06).
Warning: more than one notion comes up with the names of bimonad and Hopf monad; there are also related notions of monoidal monad and opmonoidal monad as well of a strong monad.
A monoidal monad on a monoidal category is a monad whose underlying endofunctor is a lax monoidal functor and such that the unit and multiplication are monoidal natural transformations. Consequently, the Kleisli category of a monoidal monad has a canonical monoidal structure such that the forgetful functor is strict monoidal.
(…)
An opmonoidal monad on a monoidal category is a monad whose underlying endofunctor is a colax monoidal functor, and such that the unit and multiplication are monoidal natural transformations. An opmonoidal monad is also called a bimonad.
For an opmonoidal monad , one can define the left fusion operator to be the natural transformation
of the opmonoidal constraint of and its monad multiplication. Similarly, we have the right fusion operator
The fusion operators satisfy certain axioms. In fact, an opmonoidal monad structure on is uniquely determined by a fusion operator (of either sort) along with the monad unit and the opmonoidal unit constraint , satisfying appropriate axioms.
An opmonoidal monad is called a Hopf monad if both of its fusion operators are invertible. More generally we have left and right Hopf monads where only one fusion operator is invertible. This definition is in Bruguières-Lack-Virelizier.
Alternatively, one might be tempted to define a Hopf monad to be a Hopf monoid in the monoidal category of endofunctors, but that monoidal category is not symmetric or even braided or duoidal, so this doesn’t make sense. However, we can instead ask for a “local” braiding in the form of a mixed distributive law.
Thus, we might define a bimonad to be an endofunctor equipped with the structure of both a monad and a comonad, along with a distributive law satisfying suitable axioms analogous to those of a bimonoid. A bimonad in this sense is a Hopf monad if it has an antipode making the same diagrams commute as for a Hopf monoid. This definition is in Mesablishvili-Wisbauer.
If is a bimonoid in a braided monoidal category, then the monad (whose algebras are -modules) is opmonoidal, with constraints induced by the comultiplication and counit of . If is moreover a Hopf monoid, then is a (Bruguières-Lack-Virelizier) Hopf monad.
In fact, if is a bimonoid as before, then is also a bimonad in the sense of Mesablishvili-Wisbauer, with monad and comonad structures induced by the monoid and comonoid structures of . Moreover, if is a Hopf monoid, then is a Hopf monad in their sense as well.
If is a (Bruguières-Lack-Virelizier) Hopf monad on a closed monoidal category, then its category of algebras is also closed and the monadic forgetful functor preserves internal-homs.
wikipedia opmonoidal monad
Kornél Szlachányi, The monoidal Eilenberg–Moore construction and bialgebroids, J. Pure Appl. Algebra 182, no. 2–3 (2003) 287–315
R. Wisbauer, Bimonads and Hopf monads on categories, pdf
Bachuki Mesablishvili, Robert Wisbauer, Notes on bimonads and Hopf monads, Theory Appl. Cat. 26:10, 2012, 281-303, abs pdf arxiv/1010.3628
D. Chikhladze, S. Lack, R. Street, Hopf monoidal comonads, Theory and Appl. of Cat. 24 (2010) No. 19, 554-563.tac
A. Bruguières, Hopf monads, math.QA/0604180; Hopf monads: an introduction, an exposè, pdf; Hopf monads, tensor categories and quantum invariants, an exposè, pdf; Galois-Grothendieck duality, Tannaka duality and Hopf (co)monads. talk at workshop “Hopf algebras and tensor categories”, University of Almería, July 4-8, 2011, pdf
G. Böhm, Weak bimonads and weak Hopf monads, conference slides, 2010, pdf
Last revised on October 2, 2017 at 18:45:58. See the history of this page for a list of all contributions to it.