Biwreaths: a self-contained system in a 2-category that encodes different known algebraic constructions and gives rise to new ones

DOI10.1016/J.JPAA.2018.06.015MaRDI QIDQ1634845zbMATH OpenOpenAlexWikidataFDO

Authors Bojana Femić

Publication date 18 December 2018

Published in Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1707.05447

zbMATH Keywords

bicategory bimonad biwreath

Mathematics Subject Classification ID

Abstract: We introduce bimonads in a 2-category

K

and define biwreaths as bimonads in the 2-category

of bimonads, in the analogous fashion as Lack and Street defined wreaths. A biwreath is then a system containing a wreath, a cowreath and their mixed versions, but also a 2-cell

l a m b d a

in

governing the compatibility of the monad and the comonad structure of the biwreath. We deduce that the monad laws encode 2-(co)cycles and the comonad laws so called 3-(co)cycles, while the 2-cell conditions of the (co)monad structure 2-cells of the biwreath encode (co)actions twisted by these 2- and 3-(co)cycles. The compatibilities of

l a m b d a

deliver concrete expressions of the latter structure 2-cells. We concentrate on the examples of biwreaths in the 2-category induced by a braided monoidal category

C

and take for the distributive laws in a biwreath the braidings of the different categories of Yetter-Drinfel'd modules in

C

. We prove that the before-mentioned properties of a biwreath specified to the latter setting recover on the level of

C

different algebraic constructions known in the category

_{R} M

of modules over a commutative ring

R

, such as Radford biproduct, Sweedler's crossed product algebra, comodule algebras over a quasi-bialgebra and the Drinfel'd twist. In this way we obtain that the known examples of (mixed) wreaths coming from

_{R} M

are not merely examples, rather they are consequences of the structure of a biwreath, and that the form of their structure morphisms originates in the laws inside of a biwreath. Choosing different distributive laws and different 2-cells

l a m b d a

in a biwreath, leads to different and possibly new algebraic constructions.

Review text

There are introduced bimonads and biwreaths in a \(2\)-category, analogously to monads and wreaths (see [\textit{S. Lack} and \textit{R. Street}, J. Pure Appl. Algebra 175, No. 1--3, 243--265 (2002; Zbl 1019.18002)]). Like bialgebras, a bimonad consists of a monad and a comonad satisfying certain compatibility conditions. Biwreaths are bimonads in a suitable \(2\)-category of bimonads. Examples of these concepts are given in the \(2\)-category induced by a braided monoidal category.

Recommendations

Cites work

Cited in

(7)

This page was built for publication: Biwreaths: a self-contained system in a 2-category that encodes different known algebraic constructions and gives rise to new ones

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1634845)