Codescent Objects and Coherence
Posted by Emily Riehl
Guest post by Alex Corner
This is the 11th post in the Kan Extension Seminar series, in which we will be looking at Steve Lack’s paper
- [Lack] Codescent objects and coherence, Stephen Lack, J. Pure and Appl. Algebra 175 (2002), pp. 223-241.
A previous post in this series introduced us to two-dimensional monad theory, where we were told about -monads, their strict algebras, and the interplay of the various morphisms that can be considered between them. The paper of Lack has a slightly different focus in that not only are we interested in morphisms of varying levels of strictness but also in the weaker notions of algebra for a -monad, namely the pseudoalgebras and lax algebras.
An example that we will consider is that of the free monoid -monad on the -category of small categories, functors, and natural transformations. The strict algebras for this -monad are strict monoidal categories, whilst the lax algebras are (unbiased) lax monoidal categories. Similarly, the pseudoalgebras are (unbiased) monoidal categories. The classic coherence theorem of Mac Lane is then almost an instance of saying that the pseudoalgebras for the free monoid -monad are equivalent to the strict algebras. We will see conditions for when this can be true for an arbitrary -monad.
Thanks go to Emily, my supervisor Nick Gurski, the other participants of the Kan extension seminar, as well as all of the participants of the Sheffield category theory seminar.
Algebras for -monads
When doing -category theory, we often look at weakening familiar notions. We generally do this by replacing axioms that required commutativity of certain diagrams with (possibly invertible) -cells, which themselves are required to satisfy coherence axioms. For instance, given a -monad (with multiplication and unit ) on a -category , a lax algebra for consists of an object of , a -cell of and -cells in which satisfy suitable axioms. A pseudoalgebra is defined as above but with invertible -cells.
Example We’ll see what’s going on by looking at the free monoid -monad again, call it . A lax algebra for is a category and a functor with natural transformations , as above. Now is the coproduct meaning that objects in are finite lists of objects in , and similarly for morphisms. The functor is a functor out of a coproduct so in fact corresponds to a family of functors which we can view as being the -ary tensors of an unbiased lax monoidal category. The natural transformation then has components which are morphisms in . These are what correspond to the associators in a biased monoidal category. The associativity and unit axioms can then be found to be expressed by the lax algebra axioms.
These differing levels of strictness offer us a whole host of -categories to look at. For our purposes we will be looking at the following -categories:
- , of strict algebras, strict morphisms, and transformations;
- , of pseudoalgebras, pseudomorphisms, and transformations;
- , of lax algebras, lax morphisms, and transformations.
Lax codescent objects
The second section of the paper begins by considering lax morphisms of the form between a lax algebra and a strict algebra . The idea is that lax morphisms of this form in can be recast as strict morphisms in . There is an inclusion 2-functor and the aim is to construct a left adjoint. To this end, Lack describes a universal property related to -cells in of the form so that there is an isomorphism which is natural in Y. This tells us that if such an object exists for every lax algebra , then the left adjoint also exists.
The universal property in question turns out to be that of a lax codescent object in a -category. First we define lax coherence data to be diagrams accompanied by -cells A lax codescent object is then an object , a -cell , and a -cell , all interacting with the -cells and -cells of the lax coherence data. These then also satisfy universal properties of a -categorical nature, much like those we saw in a previous post.
Consider for a moment, an algebra for a -monad on a -category . We know that this can be expressed as the reflective coequaliser of the diagram in the category of -algebras. However in the case of a lax algebra for a -monad , this won’t be the case. Instead we can form lax coherence data in when we accompany it with -cells and , where the rest of the -cells are just identities arising from the -monad axioms. The universal property alluded to above is then that the lax codescent object of this lax coherence data is the same as that of the replacement (strict) algebra which would give the adjunction previously described.
If all of the mentions of -cells in the above description of a lax codescent object were replaced with invertible -cells, then we would have the notion of a codescent object. This is the analogous situation in the case of pseudoalgebras, where the aim is to find a left adjoint to the inclusion to the inclusion -functor
A useful observation is that lax codescent objects may be defined using weighted colimits and can be built from coinserters and coequifiers. Also worthy of note is that codescent objects can be built from co-iso-inserters and coequifiers. Now co-iso-inserters exist whenever coinserters and coequifiers do, so that anything we want to prove about lax algebras by utilising such colimits, will also be true for pseudoalgebras.
This section of the paper also includes a number of results concerning adjunctions between the various -categories of algebras, with the following theorem then being the basis for the first characterisation of a coherence theorem.
Theorem: (Lack, 2.4) For a -monad on a -category , the inclusion has a left adjoint if any of the following conditions holds:
- admits lax codescent objects and preserves them;
- admits coinserters and coequifiers and preserves them;
- is cocomplete and preserves -filtered colimits for some regular cardinal .
Conditions and also give us a left adjoint to the inclusion . Furthermore, we also find that a left adjoint to the inclusion , which we saw in the paper of Blackwell, Kelly, and Power, also exists under these conditions. Something else that we saw in that paper is the reason for needing to preserve these colimits - the colimits exist in just when preserves them.
Coherence
The simplest possible characterisation of coherence for -monads would be:
Theorem-Schema: The inclusion has a left adjoint, and the components of the unit are equivalences in .
Now this is certainly not true in general. A counter-example (3.1) is given in the paper, whilst Mike Shulman also shows that not every pseudoalgebra is equivalent to a strict one.
Something that is rather nice, though, is that we already have some conditions under which the theorem-schema is satisfied.
Theorem: (Lack, 3.2) If is a -monad on a -category admitting codescent objects, and preserves them, then the inclusion has a left adjoint, and the components of the unit are equivalences in . In particular this is the case if has coinserters and coequifiers, and preserves them.
The proof of this is rather simple and falls out of the two-dimensional universal property of the codescent objects.
I’m going to roll the latter two sections of the paper together now and talk about the other characterisation of coherence, which concerns a general coherence result of Power. That paper looks at -monads on and , where is a small set and the latter -category is attained from the first by only considering invertible -cells. Power then shows that if is a -monad on one of these -categories which preserves bijective-on-objects functors, then every pseudoalgebra for is equivalent to a strict one.
Some -monads which satisfy these conditions include -based clubs, whose strict algebras give such structures as monoidal categories (see the scope of the results below for more monoidal examples) or categories with strictly associative finite products or coproducts. Also described in Power’s paper is a -monad on for which the pseudoalgebras are unbiased bicategories with object set . The coherence result then tells us that every bicategory is biequivalent to a -category with the same set of objects.
Comparing Power’s statement to the theorem-schema, we see that they are not quite the same. The schema asks for there to be an adjunction for which the components of the unit give the equivalences we are concerned with. As it turns out, the conditions which Power proposes are indeed enough to give what we desire, and this is what the latter characterisation of Lack looks at.
Recall that every functor can be factored as a bijective-on-objects functor followed by a full and faithful functor. This gives an orthogonal factorisation system on . However, the factorisation system has an extra two-dimensional property concerning -cells. If we are given a natural isomorphism where is bijective-on-objects and is full and faithful, then there is a unique pair consisting of a functor and a natural isomorphism such that and the whiskering of with gives back . For an arbitrary -category , an orthogonal factorisation system with such a property is deemed an enhanced factorisation system.
Theorem: (Lack, 4.10) If is a -category with an enhanced factorisation system having the property that if and then , and if is a -monad on for which preserves -maps, then the inclusion has a left adjoint, and the components of the unit of the adjunction are equivalences in .
The proof starts by noting that if we have a pseudoalgebra then we can factorise as where and . Thus we have an invertible -cell and, since preserves -maps, we can use the enhanced factorisation system to get a strict algebra which is equivalent to . (See Power’s coherence result for the details on this.)
It is interesting to see the scope of these results and the places in which people have considered this type of coherence problem before.
- Dunn proved the theorem-schema when is the -category of based topological categories and for which is a -monad induced by a braided -operad.
- The theorem-schema was also proved by Hermida, though required much more of both the -category and the -monad , such as requiring existence and preservation of various limits and colimits, exactness properties relating these, as well as further conditions on the unit and multiplication of the -monad. Something that does fall out of this alternative setup is that can be replaced by a new -monad, on a different -category, which is lax-idempotent.
- Rather more recently Nick Gurski and I wrote about operads with general groups of equivariance. Therein we showed that the -monads which arise from -operads in this way satisfy the coherence conditions following the enhanced factorisation system route. These -monads capture many different structures, including monoidal categories, braided monoidal categories, symmetric monoidal categories, and ribbon braided monoidal categories. Thus we can say, for example, that every unbiased braided monoidal category is equivalent to a braided strict monoidal category, and similarly for the other variations.
- The first theorem we mentioned above has three conditions, the third being the requirement that is cocomplete and preserves -filtered colimits for some regular cardinal . We mentioned aboe that it was proved by Blackwell, Kelly, and Power that this is also sufficient to give a left adjoint to the inclusion . They also proved further that if is locally -presentable then there is a -monad which preserves -filtered colimits and where . The result of the theorem we discussed then follows when is locally presentable and preserves -filtered colimits. Lack comments that it is a major unsolved problem as to whether the entire theorem-schema can be shown to be true under these asumptions - and further whether it is true when is only cocomplete.
Re: Codescent Objects and Coherence
Another interesting appearance of codescent objects, as touched on in this paper, is in the bo-ff factorisation of a functor. Just as how in Set (or more generally a regular category) we may form the image factorisation of a function by taking the coequaliser of its kernel pair (the equivalence relation it induces on its domain), in Cat (or more generally) we get the bo-ff factorisation of a functor by taking the codescent object of its “higher kernel”. See for instance John Bourke’s thesis, where this 2-dimensional exactness play continues, featuring cateads in the role of equivalence relations.