Monadic vs adjoint decomposition (Q2134643)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Monadic vs adjoint decomposition
scientific article

    Statements

    Monadic vs adjoint decomposition (English)
    0 references
    0 references
    0 references
    3 May 2022
    0 references
    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.
    0 references
    adjunctions
    0 references
    monads
    0 references
    fibrations
    0 references
    separability
    0 references
    combinatorial rank
    0 references

    Identifiers