A Weighted Limits Proof of Monadicity
Posted by Emily Riehl
Since the 1970s, it has been known that the Eilenberg-Moore object (EM-object) associated with a monad in a 2-category can be characterized as a weighted limit. An element of the limit of a Set-valued diagram can be thought of as a cone over that diagram. Similarly, in the case of a monad in Cat, an object of this weighted limit, more commonly called an algebra for the monad, is exactly a cone over the monad diagram whose shape is described by the weight.
Using the weighted limits formalism, EM-objects in a 2-category are defined representably. It follows that the monadicity theorem characterizing EM-objects and their monadic adjunction can be deduced representably from the monadicity theorem in Cat. Despite this fact, I want to give a direct proof of the 2-categorical monadicity theorem to illustrate that a suitable reinterpretation of Beck’s proof is “all in the weights.” To begin, we’ll use weighted limits to characterize the monadic adjunction. It follows immediately that any adjunction inducing the same monad has a comparison map to the monadic adjunction. Inspecting the weights, we observe that the monadic forgetful functor is conservative. We also show that any object in the EM-object is the colimit of a canonical diagram, itself described by a weighted limit, and the monadic forgetful functor preserves these colimits. If the domain of the comparison map admits certain colimits, this map has a left adjoint. If the forgetful functor is conservative, then the comparison adjunction is an adjoint equivalence.
The point of all this is that the 2-functors defining these weights can be interpreted as simplicial functors. The same discussion, with only minimal modifications, then gives a (formal!) proof of the monadicity theorem for homotopy coherent adjunctions of quasi-categories. I’ll be speaking about this in Sydney this week and Warsaw later this month. This is joint work with Dominic Verity.
The free adjunction
The free monad is a 2-category Mnd built from the algebraist’s , the free monoidal category containing a monoid. Here it will be convenient to observe that Mnd is a full subcategory of the Schanuel-Street free adjunction Adj. The 2-category Adj has two objects, + and -, with hom-categories
Adj(+,+)=, Adj(-,-)=, Adj(-,+)= Adj(+,-)=
The categories and are opposites, defined to be the subcategories of containing maps that preserve the top or bottom elements, respectively, in each ordinal. A 2-functor Adj is an adjunction in the 2-category . We’ll use the familiar notation , , . The functor
Adj(+,+)=
defines the monad resolution associated to the adjunction. The diagram
Adj(-,+)=
is one of the bar resolutions associated to the adjunction. (If this is unfamiliar, see the displayed equations in section 4 here.)
We define Mnd to be the full sub 2-category on the object +. A 2-functor Mnd is a monad in the 2-category .
Weights for the monadic adjunction
Write Adj and Adj for the two representable 2-functors for Adj and and for their restrictions to Mnd. Suppose Mnd is a monad in . By the Yoneda lemma, the weighted limit , the object on which the monad acts. By contrast, the weighted limit is — you guessed it — the EM-object!
You can check this directly in Cat. The weighted limit is defined to be the equalizer
One of the maps in the equalizer diagram is the monad resolution. The other is precomposition with ordinal sum , which defines horizontal composition in Adj. It follows representably that this weighted limit defines the EM-object whenever it exists. (For more on this see Ross Street’s Limits indexed by category-valued 2-functors.)
The advantage of this description of the weight for the EM-object is that we immediately obtain the monadic adjunction: it is an adjunction between the weights and ! This adjunction is simply the restriction of the Yoneda embedding
Adj[Adj,Cat][Mnd,Cat]
Composing with the weighted limit 2-functor
{-,-}:[Mnd,Cat][Mnd,
we get an adjunction between and , the monadic adjunction.
Conservativity of the monadic forgetful functor
The monadic forgetful functor is induced from the map of weights in [Mnd,Cat], defined by pre-composing with . Applied to the unique object of Mnd, the image is the identity-on-objects inclusion . We can factor as a relative cell complex built from two types of cells, which both have the form:
- the product Mnd of the representable with a functor .
Here is either the inclusion of the two endpoints into the walking arrow (used to freely attach the missing map in each hom-set from to ), or it is the surjection from the parallel pair into the walking arrow (used to impose the appropriate composition relations for the attached cells). Importantly both functors are identity-on-objects.
The point is the map of weighted limits factors as a composite of pullbacks of products of maps
- {Mnd, }{Mnd, }
and this, by the Yoneda lemma, is just the induced map between the cotensors . Now this map is (representably) conservative because a natural transformation is invertible if and only if its components are isomorphisms, and the functor is identity-on-objects. Hence, is conservative.
Colimit representation of algebras
Any algebra for a monad on a category is the colimit of a canonical -split coequalizer diagram. More exactly, there is a reflexive coequalizer diagram in built from free algebras (though not free algebra maps) whose colimit is , and this diagram admits a splitting upon application of the forgetful functor .
These canonical colimits diagrams are also “all in the weights”! Before making this precise, allow me to change the diagram shape. The reflexive coequalizer diagram defines a final subcategory of ; instead of reflexive coequalizers, we’ll speak of colimits of simplicial objects; colimit cones have shape . Such a colimit cone is split if it extends along the natural identity-on-objects inclusion .
We’ll describe a weight for a higher dimensional analog of -split augmented simplicial objects. For formal reasons, augmented simplicial objects of this form are colimit diagrams, indeed are absolute colimits. There is a map of weights , hence a map of weighted limits, carrying the EM-object to the object of these canonical colimit cones.
It is easy to define the weight using the principle that the weighted limit functor is cocontinuous in the weights (and contravariant). Namely, is the pushout
The categories and act on the restricted representables using composition in Adj (ordinal sum). This action defines a cone under the pushout diagram with summit and hence the desired map .
The functor defines the weight for augmented simplicial objects in . By cocontinuity, is the pullback i.e., it is the object of augmented simplicial objects in whose images under admit a splitting. Thus is the object of -split augmented simplicial objects in . Using the (locally posetal) 2-category structure on , there is a 2-cell
that defines an absolute left extension diagram. Furthermore, this universal property is equationally witnessed and so preserved by any 2-functor. In particular, taking weighted limits and restricting along we get an absolute left lifting diagram
which we interpret as presenting the elements of the EM-object as colimits of diagrams of shape . Furthermore, the monadic forgetful functor preserves these colimits, essentially by functoriality of our definition of the maps between the weights.
I realize this is all a bit sketchy. The best I can do here is give a reference: this argument is very similar to the discussion in section 5.3 of this paper.
Comparison with the monadic adjunction
Of course, monadicity is about comparing an adjunction with monad with the monadic adjunction . Recall adjunctions are diagrams of shape Adj in . A general result, immediate from the defining universal properties, says that the weighted limit of a restricted diagram is isomorphic to the limit of the original diagram weighted by the left Kan extension of the weight. In particular, writing Adj for our adjunction, its monad is Mnd. Hence, its EM-object is the weighted limit
{, res } = {lan, } = {lan res Adj, }
recalling that was defined to be the restriction along MndAdj of the representable Adj. The weight for the monadic adjunction is now the left Kan extension of the restriction of the Yoneda embedding Adj[Adj,Cat]. The limit returns the adjunction . Hence, the canonical map of weights lan res induces the comparison from the given adjunction to the monadic adjunction . We write for the non-identity component. Functoriality implies that .
Monadicity
As above, the weight for -split simplicial objects in is defined to be a pushout
Here we’re using and not because we’re defining the weight for the (simplicial object shaped) diagrams, not the (augmented simplicial object shaped) cones under these diagrams. We say that admits colimits of -split simplicial objects if there is an absolute left lifting diagram
The weight lan defines a cone under the pushout defining in the expected way. Hence, there is a map
under the hypothesis that admits colimits of -split simplicial objects. It follows from the universal property of the absolute lifting that this is left adjoint to the comparison map .
Let and denote the unit and counit of the comparison adjunction . If preserves colimits of -split simplicial objects, then, as in the classical proof, it follows that is an isomorphism; as is conservative, must be an isomorphism. Now and hence is an isomorphism, so is also an isomorphism. Finally, if is conservative we conclude that is an isomorphism, in which case is an adjoint equivalence, completing the proof.
Re: A weighted limits proof of monadicity
In Richard’s talk at the pre-CT workshop, he mentioned that by right Kan extending along the inclusion of Mnd into Adj, you can obtain the entire monadic adjunction as a diagram. I liked that idea because working with derivators has taught me to sometimes prefer Kan extending along fully faithful functors over constructing (weighted) (co)limits. Can you reformulate your other weighted limits as fully faithful Kan extensions? If so, it might be the easiest way to do something analogous in a “2-derivator” (whatever that is).