Relative monadicity (Q7035949)

The concept of \textit{monadicity} is fundamental in category theory. A functor \(r:D\rightarrow E\) is said to be \textit{monadic} if it exhibits \(D\) as the category of algebras for a monad on \(E\). A \textit{relative monad} is a refinement of the notion of monad that relaxes the requirement that the monad's underlying functor be an endofunctor [\textit{T. Altenkirch} et al., Lect. Notes Comput. Sci. 6014, 297--311 (2010; Zbl 1284.18010); Log. Methods Comput. Sci. 11, No. 1, Paper No. 3, 40 p. (2015; Zbl 1448.18007)]. A monad relative to a functor \(j:A\rightarrow E\) may be viewed as a generalization of the notion of monad in which the possible arities of operations for algebras are valued in \(A\), while the possible carriers for algebras are valued in \(E\).\N\NThis paper establishes two \textit{relative monadicity theorems}. The first (Theorem 4.7) is a characterization in the mode of \textit{J. Beck} [\url{https://ncatlab.org/nlab/files/Untitled+manuscript.pdf}] and \textit{R. Pare} [J. Algebra 19, 80--95 (1971; Zbl 0242.18008)], establishing that, for \(r\) to be \(j\)-monadic, it is necessary and sufficient that \(r\) admits a left \(j\)-relative adjoint and create certain colimits. The second (Theorem 6.5) is a pasting law for relatively monadic functors, which may be seen as analogues to the pasting law for pullbacks, characterizing the relative monadicity of one functor in terms of the relative monadicity of another.