Monadic vs adjoint decomposition

Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15)

Abstract: It is known that the so-called monadic decomposition, applied to the adjunction connecting the category of bialgebras to the category of vector spaces via the tensor and the primitive functors, returns the usual adjunction between bialgebras and (restricted) Lie algebras. Moreover, in this framework, the notions of augmented monad and combinatorial rank play a central role. In order to set these results into a wider context, we are led to substitute the monadic decomposition by what we call the adjoint decomposition. This construction has the advantage of reducing the computational complexity when compared to the first one. We connect the two decompositions by means of an embedding and we investigate its properties by using a relative version of Grothendieck fibration. As an application, in this wider setting, by using the notion of augmented monad, we introduce a notion of combinatorial rank that, among other things, is expected to give some hints on the length of the monadic decomposition.

Review text

In Section 1, the authors study functors with monadic decomposition of monadic length \(N\), i.e. the functors having a sequence of functors \((R_n)_{n<N}\) such that \(R_0=R\), each \(R_n\), \(0\leq n\leq N\), has a left adjoint functor \(L_n\), the functor \(R_{n+1}\), \(0\leq n<N\), is the comparison functor induced by the adjunction \((L_n,R_n)\) with respect to the associated monad and \(L_N\) is fully faithful while \(L_n\) is not fully faithful for \(0\leq n <N\). Inserted categories are considered as well. Next section is devoted to the construction of new adjoint triangle to an adjoint triangle as introduced by [\textit{S. MacLane} (ed.), Reports of the Midwest Category Seminar. II. Springer, Cham (1968; Zbl 0165.00201)]. Thus an adjoint decomposition is constructed for any adjunction with very general condition and this adjoint decompositions are related with monadic decompositions, using functors \(\Lambda_n\) in Section 3. Using a relative notion of Grothendieck fibration the objects in the image of the functor \(\Lambda_n\) are characterized. In Section 5, augmented monads are studied, and applications to the category of bialgebras and augmented algebras in a preadditive monoidal category are given. In the last section, a notion of combinatorial rank of an object with respect to an adjunction is introduced. It is shown that functor \(R\) has a monadic decomposition of length \(N\), then ever object in the domain of \(R\) has combinatorial rank at most \(N\). Applications to the category of (left-left) Yetter-Drinfeld modules over a finite dimensional Hopf algebra \(H\) are given.

Recommendations

Cites work

Cited in

(4)

This page was built for publication: Monadic vs adjoint decomposition

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