You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.
The nlab states (paraphrasing)
The cocompletion under a class of certain diagrams gives a lax-idempotent 2-monad , since then an algebra is a category with all such colimits, which implies is lax-idempotent.
I am having trouble seeing the intermediate step, i.e. that algebras must have all such colimits. Am I missing something obvious? Can this be shown using only the universal property of the cocompletion, without reference to a particular presentation?
Writing for the unit of , if (as any algebra for a lax-idempotent 2-monads has), then for a diagram we have
So if we can show that is indeed lax-idempotent, then the missing step holds; so I'd also be happy with such a proof. However, the nlab used the missing step to prove that is lax-idempotent, so they probably had in mind some direct proof.
There are a few ways to prove this, but perhaps the most intuitive is to show that a category admits -colimits (for some class of shapes ) if and only if the inclusion into the free -cocompletion admits a left adjoint (which then tells you that the algebras for , which are by definition the -cocomplete categories, are characterised by the adjointness condition that defines a lax-idempotent pseudomonad).
I think it's a good exercise to try to show this yourself, but if you get stuck, there's a proof in Proposition 3.17 of Notes on enriched categories with colimits of some class.
Nathanael Arkor said:
...the algebras for , which are by definition the -cocomplete categories...
I'm probably missing something extremely obvious. Why is this the case? An algebra for should be a category equipped with a (not necessarily -colimits-preserving) functor such that some diagrams commute, right?
Intiutively, preserving colimits of some sort is what says has them.
It may help to think about a decategorified analogue like the monad for commutative monoids, though here "having finite sums" is a structure, not a property, so this monad is not idempotent. In this case the map preserves finite sums when is a commutative monoid and thus has them.
Fernando Chu said:
I'm probably missing something extremely obvious. Why is this the case? An algebra for should be a category equipped with a (not necessarily -colimits-preserving) functor such that some diagrams commute, right?
By definition, a "free -cocompletion" provides a left pseudoadjoint to the forgetful 2-functor from the 2-category of -cocomplete categories and -cocontinuous functors to the 2-category of categories.
This forgetful 2-functor is furthermore pseudomonadic. This is perhaps the point that's not obvious to you? It can be verified by checking a 2-dimensional version of the monadicity theorem, for instance.
However, if you'd like a really concrete proof that the algebras are precisely the -cocomplete categories (i.e. directly using the definition of (pseudo)algebra), without using any abstract machinery, @Philip Saville, Andrew Slattery and I give such a proof in §7 of Bicategories of algebras for relative pseudomonads.
Yes! The forgetful 2-functor being pseudomonadic was the step I was missing. Thanks a lot!
Fernando Chu has marked this topic as resolved.
Another paper you might find helpful is Kelly–Lack's On the monadicity of categories with chosen colimits. The focus is a little different, because they assume pseudomonadicity from the outset, and then deduce 2-monadicity, but the introduction of the paper may provide useful context.