nLab monadic functor



Category theory

Higher algebra

2-Category theory



A functor U:DCU \,\colon\, D\to C is monadic iff it has a left adjoint F:CDF \,\colon\, C\to D and the adjunction FUF\dashv U “comes from: the induced monad on CC” – that is, UU monadic iff FUF\dashv U is a monadic adjunction.

In this situation UU “looks like” the forgetful functor from the Eilenberg-Moore category of the monad (UF,η,Uϵ F)(U\circ F, \eta, U\epsilon_F) on CC, and has ‘nice properties’ similar to these forgetful functors.

The monadicity theorem characterizes monadic functors and makes these ‘nice properties’ precise.

Monadic functors are sometimes called functors of effective descent type. See the page on monadic descent for more on this aspect.


Given a pair of adjoint functors F:CD:UF \colon C \to D :U, FUF \dashv U, with unit η:Id CUF\eta: Id_C \to U \circ F and counit ϵ:FUId D\epsilon: F \circ U \to Id_D, one constructs a monad T=(T,μ,η)\mathbf{T}=(T,\mu,\eta) setting T=UF:CCT = U \circ F: C \to C, μ=UϵF:TT=UFUFUF=T\mu = U \epsilon F: T T = U F U F \to U F = T.

Consider the Eilenberg-Moore category C TC^{\mathbf{T}} of TT-algebras (TT-modules) in CC. Clearly U(ϵ M):TUM=UFUMUMU (\epsilon_M): T U M = U F U M \to U M is a TT-action. In fact there is a canonical comparison functor K T:DC TK^{\mathbf{T}} \colon D \to C^{\mathbf{T}} given on objects by K(M)(UM,U(ϵ M))K(M) \coloneqq \big(U M, U (\epsilon_M) \big). We then say that we have a (resp. strictly) monadic adjunction iff KK is an equivalence (resp. isomorphism) of categories.


(monadic functor)
A functor U:DCU \colon D \to C is monadic (resp. strictly monadic) if it has a left adjoint F:CDF \colon C\to D and the comparison functor K T:DC TK^{\mathbf{T}} \colon D \to C^{\mathbf{T}} is an equivalence of categories (resp. an isomorphism of strict categories).

In other words, up to equivalence, monadic functors are precisely the forgetful functors defined on Eilenberg-Moore categories for monads, and strictly monadic functors are the same as these forgetful functors up to isomorphism.


A category DD is called monadic over a category CC if there is any functor U:DCU \colon D \to C which is monadic (Def. ).


Basic properties


A monadic functor is strictly monadic if and only if it is also an amnestic isofibration.


Clearly, a strictly monadic functor is an amnestic isofibration; and if a monadic functor UU is amnestic, then the comparison functor KK is also amnestic, and if UU is a monadic isofibration, so is KK; therefore in this case KK must be an isomorphism of categories.


Beware that the class of monadic functors is not closed under composition.

For a specific counter-example: the category of reflexive quivers is monadic over SetSet via the functor RefGphSetRefGph \to Set sending a graph to its set of edges, and the category of categories is monadic over reflexive graphs via the forgetful functor CatRefGphCat \to RefGph, but CatCat is not monadic over SetSet (via any functor whatsoever, since such categories are regular categories but CatCat is not).

This is an instance of a general phenomenon: Let 𝒞\mathcal{C} be a reflective subcategory of a presheaf category A^\widehat{A} (e.g. every locally presentable category is of this form). Then the adjunction between 𝒞\mathcal{C} and A^\widehat{A} is monadic, and the adjunction between A^\widehat{A} and Set ObA\mathrm{Set}^{\mathrm{Ob} A} is also monadic. But the composite adjunction between 𝒞\mathcal{C} and Set ObA\mathrm{Set}^{\mathrm{Ob} A} is often not monadic. For instance, if it is monadic, then 𝒞\mathcal{C} must be a Barr-exact category.

Monadicity theorem

Various versions of Beck’s monadicity theorem (also: “tripleability theorem” in older literature) give sufficient, and sometimes necessary, conditions for a given functor to be monadic. There are also dual, comonadic versions.


Last revised on November 6, 2022 at 10:50:32. See the history of this page for a list of all contributions to it.