On Two-Dimensional Monad Theory
Posted by Emily Riehl
Guest post by Sam van Gool
Monads provide a categorical setting for studying sets with additional structure. Similarly, 2-monads provide a 2-categorical setting for studying categories with additional structure. While there is really only one natural notion of algebra morphism in the context of monads, there are several choices of algebra morphism in the context of 2-monads. The interplay between these different kinds of morphisms is the main focus of the paper that I discuss in this post:
- [BKP] Two-dimensional monad theory, R. Blackwell, G. M. Kelly and A. J. Power, J. Pure and Appl. Algebra 59 (1989), pp. 1-41.
I will give an overview of the results and methods used in this paper. Also, especially towards the end of my post, I will also indicate some points that I think could still be clarified further by formulating some questions, which will hopefully lead to fruitful discussions below.
This post forms the 9th instalment of the series of posts written by participants of the Kan Extension Seminar, of which I’m very glad to be a part. In preparing the post I have greatly benefited from discussions with the other participants in the seminar, and of course with the seminar’s organizer, Emily Riehl. I am very grateful for the enthusiasm, encouragement and guidance that you all offered.
2-monads, their algebras, and their morphisms
Two-dimensional universal algebra goes beyond the -enriched setting in that it allows for non-strict morphisms. Consider the following (very) simple example.
Example. For a category , let be the category provided freely with a terminal object. This assignment can be extended to a 2-monad on . Then:
- an algebra for is (entirely determined by giving) a pair where is a category and is a designated terminal object in ;
- a strict morphism is a functor for which ;
- a pseudo morphism is a functor such that is isomorphic to ;
- a colax morphism is just any functor from to , with no additional requirement on the terminal object.
If you didn’t know them already, you will probably have guessed the general definitions of strict, pseudo and lax morphisms by now, as well as the definition of 2-cells between them. Note that, in this post, all 2-monads and algebras for them will be strict, as in [BKP].
For any 2-monad , we thus get the following inclusions of 2-categories:
(In [BKP], the category is denoted by .) Roughly the first half of the paper [BKP] is devoted to the construction of left adjoints (in the 2-categorical sense) to these inclusion functors.
Note that is simply the Eilenberg-Moore -category of the -enriched monad in the case where , in the sense of the second paper that we read in this seminar. The categories and , on the other hand, are special to the -enriched setting.
Limits in -Alg
The category has all 2-limits that the base 2-category has. For , the situation is more subtle.
Example (c’t’d). In the example where is provided freely with a terminal object, let be the terminal category and the category with two objects , and a unique isomorphism between them. There are two pseudo-morphisms , one sending to , the other sending to . However, if is any functor which equalizes these two morphisms, then is empty, and so it does not admit a -algebra structure. Thus, the category does not admit equalizers in general.
Assuming that the -category is complete, it is however possible to construct the following limits in :
- Products,
- Inserters and iso-inserters,
- Equifiers,
and they are created by the forgetful functor . As we saw in last week’s post, these PIE-limits allow for the construction of many other limits. In particular, from the results discussed last week, we see that also has inverters and co-tensors, and hence also lax and pseudo limits.
It is also worth noting that each of the results on existence of limits “restricts to strict” (for lack of a better name), by which I mean that, for each of these limits, there exists a limiting cone such that the algebra 1-cells in the limiting cone:
are strict, and
detect strictness.
For example, for any parallel pair in there is an inserter such that (1) is strict, and (2) if is strict for some algebra morphism , then is strict.
The pseudomorphism classifier
Example (c’t’d). In the example where is provided freely with a terminal object, note that pseudo-morphisms can be mimicked using strict morphisms: for any algebra , consider the algebra , defined by adding one new object and an isomorphism to . It is then clear that, for any algebra , strict morphisms correspond to pseudo-morphisms . In fact, this correspondence is an isomorphism between the categories of morphisms and natural transformations between them.
The following theorem, which is arguably at the heart of the paper [BKP], says that the above phenomenon in fact occurs for any reasonably well-behaved 2-monad.
Theorem. Let be an accessible 2-monad on a 2-category that is complete and cocomplete. Then the inclusion 2-functor has a left adjoint.
Proof (Sketch). The proof of the theorem consists of three steps:
- A general fact: in order to find a left adjoint to a 2-functor , it suffices to find a left adjoint to its underlying ordinary functor , provided that has cotensors with the walking arrow category and preserves them.
- Using (1), one shows that there exists a left adjoint, , to the inclusion functor where is the comma 2-category.
- The hardest part: pseudo-morphisms out of a -algebra can be mimicked by -morphisms out of a certain object of .
Now, composing (2) and (3), one associates to any -algebra the -algebra and observes that this gives an ordinary (1-categorical) left adjoint to . Then, by (1) and the fact that cotensors exist in , it is also a 2-categorical left adjoint.
The image under the left adjoint of an algebra , seen as an object of , is denoted by and called the pseudo-morphism classifier of . Under the conditions of the Theorem, there is also a lax morphism classifier.
There are more conceptual proofs of these facts, using the concept of codescent objects; see, for example, this paper (which will be discussed in these series in a month or so) and Section 4 of the 2-categories companion by Stephen Lack. The latter paper, by the way, has been an indispensable source for me in preparing this post, and those who are familiar with it will probably recognize its influence throughout the post.
Flexibility
We denote by the letters and the unit and co-unit of the adjunction
from the above theorem. For any algebra in , the morphism is in fact always a surjective equivalence in the 2-category , but in general does not even need to be an equivalence in , as we will see shortly. If is an equivalence in , then is called semi-flexible, and is called flexible if is a surjective equivalence in . The flexible objects are the cofibrant objects in a model structure on lifted from the model structure on , and the pseudomorphism classifier is then a special cofibrant replacement of (see Section 7.3 of the 2-categories companion for more details about this).
Several equivalent characterizations of flexibility and semi-flexibility are given in Theorems 4.4 and 4.7, respectively, of [BKP]. One useful equivalent way to say that a -algebra is semi-flexible is that every pseudo-morphism out of is isomorphic to a strict morphism out of . With this definition, we can see that not every -algebra is semi-flexible:
Example. Let be the 2-monad on whose algebras are small categories with assigned finite limits. Let be the terminal category, with finite limits assigned in the only possible way. Let be any category with assigned finite limits in which is the assigned terminal object and the assigned product is not equal to (the two objects will of course be isomorphic). Then the functor which sends the unique object of to is a pseudo-morphism, but it is clearly not isomorphic to any strict morphism.
The following example shows that flexibility and semi-flexibility are really different concepts.
Example. Categories whose objects are functors can also often be represented as the -algebras for an appropriate monad on an appropriate base 2-category . For instance, there is a 2-monad on , given on objects by , such that -algebras are functors, a pseudomorphism from to is a diagram of the form and such a pseudomorphism is strict exactly when is the identity. Now, letting denote the terminal category, it is easy to describe the pseudomorphism classifier of the -algebra : this is the inclusion functor , where is the indiscrete category on objects (As a simple but nice exercise, you may check that, indeed, any pseudomorphism out of the algebra corresponds uniquely to a strict morphism out of the algebra .) Now, letting again denote the category with two objects , and a unique isomorphism between them, one may check that the algebra is equivalent in to the algebra , which is flexible, and therefore is semi-flexible. However, is not flexible. (See example 4.11 in [BKP]).
Biadjunctions and bicolimits in
So far, we have only considered limits, which one would expect to exist in a category of algebras. On the other hand, we wouldn’t generally expect colimits to exist in a category of algebras, but as it turns out, in the last section of [BKP], the authors prove that:
- the category admits bicolimits, and
- any strict map of 2-monads induces a map that has a left biadjoint.
Both of these results are consequences of the following more technical fact:
Theorem. If is a 2-functor so that the composite 2-functor
has a left adjoint , then maps into flexible algebras, and is left biadjoint to .
From the above theorem and the relation between biadjoints and bicolimits that we discussed last week, bicolimits can now be constructed in , as claimed in (1) above. To prove (2), one first notices that 2-functor extends to a 2-functor making the diagram
commute. One may then apply the Theorem in the case .
More examples of 2-monads
Above I motivated the concepts and theorems in [BKP] with some simple examples of 2-monads. The last section of [BKP] contains many more examples. About the general method for constructing such examples, the authors make the following interesting comment.
“In practice one is seldom presented with a 2-monad and invited to consider its algebras; more commonly one contemplates some structure borne by a category (…) and one concludes in certain cases that the structure is given by an action of a 2-monad (…)”
With this comment in mind, one may now construct 2-monads whose algebras are monoidal categories, symmetric monoidal closed categories (here the 2-monad is over the 2-category , where the 2-cells are only taken to be natural isomorphisms), and even finitary 2-monads themselves (they are the algebras for a certain 2-monad on the functor 2-category , where is the full subcategory of consisting of the finitely presentable objects. This perspective was exploited in a later paper by Kelly and Power on presentations of 2-monads.
A final point of interest is that one may distinguish a special kind of 2-monad , namely those for which the -algebra structure on an object is unique if it exists. Such 2-monads define a property of rather than a structure on the objects of the base 2-category , and may thus be called property-like (as they are in this later paper by Kelly and Lack). As the authors of [BKP] remark, it “may well be a hard problem” how to distinguish the property-like 2-monads from, say, a presentation for them. A particular class of 2-monads which are ‘property-defining’ are the lax-idempotent 2-monads (which also go by the names “quasi-idempotent” and “Kock-Zöberlein” 2-monads).
Questions
Let me finish with a (non-exhaustive) list of questions that may be interesting to discuss below.
Can the fact that limits in can be chosen with a fair amount of “strictness” be understood using this account of lax / pseudo limits for morphisms between -algebras using -enrichment?
The flexible algebras are exactly the strict retracts of pseudomorphism classifiers. The latter are “free algebras”, in some sense (at least in the sense that they are the images of a left adjoint). This suggests that one could think of the concept ‘flexible algebra’ as a 2-categorical version of the familiar concept ‘projective algebra’ in the 1-categorical setting. Is this a good intuition, and if so, can it be (or has it already been) made more precise?
In order to better understand the concept of flexible algebra and the biadjunctions in the later part of [BKP], it would probably be useful to study different examples of 2-monads, and in particular, answer the following questions in such examples:
(a) is there a concrete construction of the pseudomorphism classifier?
(b) which algebras are (semi-)flexible?
(c) (for a strict map between 2-monads) what does the biadjunction do?
Re: On Two-Dimensional Monad Theory
Very nice! A couple of slight corrections: (1) In your example of categories with a terminal object, the arbitrary functors are actually the colax morphisms, whereas every lax morphism is automatically pseudo (this is because that 2-monad is colax-idempotent).
(2) You say “we wouldn’t generally expect colimits to exist in a category of algebras”, but actually in the case when the monad is accessible, we would. At least, they do exist for 1-categories of algebras and in , by a transfinite construction. The point here is to show that, still assuming the monad to be accessible, colimits (of the bicategorical sort) also exist in .
Also, the answer to your first question is “yes”. (-: