Unboxing Algebraic Theories of Generalised Arities
Posted by Emily Riehl
Guest post by José Siqueira
We began our journey in the second Kan Extension Seminar with a discussion of the classical concept of Lawvere theory , facilitated by Evangelia. Together with the concept of a model, this technology allows one to encapsulate the behaviour of algebraic structures defined by collections of -ary operations subject to axioms (such as the ever-popular groups and rings) in a functorial setting, with the added flexibility of easily transferring such structures to arbitrary underlying categories with finite products (rather than sticking with ), naturally leading to important notions such as that of a Lie group.
Throughout the seminar, many features of Lawvere theories and connections to other concepts were unearthed and natural questions were addressed — notably for today’s post, we have established a correspondence between Lawvere theories and finitary monads in and discussed the notion of operad, how things go in the enriched context and what changes if you tweak the definitions to allow for more general kinds of limit. We now conclude this iteration of the seminar by bringing to the table “Monads with arities and their associated theories”, by Clemens Berger, Paul-André Melliès and Mark Weber, which answers the (perhaps last) definitional “what-if”: what goes on if you allow for operations of more general arities.
At this point I would like to thank Alexander Campbell, Brendan Fong and Emily Riehl for the amazing organization and support of this seminar, as well as my fellow colleagues, whose posts, presentations and comments drafted a more user-friendly map to traverse this subject.
Allowing general arities
Recall that a Lawvere theory can be defined as a pair , where is a small category with finite coproducts and is an identity-on-objects finite-coproduct preserving functor. To this data we associate a nerve functor , which takes a set to its -nerve , the presheaf — the -nerve of a set thus takes a finite cardinal to , up to isomorphism. It is easy to check is faithful, but it is also full, with for each natural transformation , seeing as a function . This allows us to regard sets as presheaves over the small category , and as , the -nerves can be used to encode all possible -ary operations on sets. To capture this behaviour of , we are inclined to make the following definition:
Definition. Let be a category and be a full small subcategory of . We say is a dense generator of if its associated nerve functor is fully faithful, where for each .
The idea is that we can replace and in the original definition of Lawvere theory by a category with a dense generator . This allows us to have operations with arities more diverse than simply finite cardinals, while still retaining “good behaviour” — if we think about the dense generator as giving the “allowed arities”, we end up being able to extend all the previous concepts and make the following analogies:
We’ll now discuss each generalised concept and important/useful properties.
If is a Lawvere theory, the restriction functor induces a monad , where is left Kan extension along . This monad preserves the essential image of the nerve functor , and in fact this condition reduces to preservation of coproducts by (refer to 3.5 in the paper for further details). If is a model of on in the usual sense (i.e preserves finite products) we can see that its restriction along is isomorphic to the -nerve of by arguing that
and so we may want to define:
Definition. Let be a category with a dense generator . A theory with arities on is a pair , where is a bijective-on-objects functor such that the induced monad on preserves the essential image of the associated nerve functor . A -model is a presheaf on whose restriction along is isomorphic to some -nerve.
Again, for , this requirement on models says a -model restricts to powers of some object: for some set , the outcome we wanted for models of Lawvere theories.
A morphism of models is still just a natural transformation between them as presheaves and a morphism of theories is a functor that intertwines with the arity functors, i.e . We’ll write for the full subcategory of consisting of the models of and for the category of theories with arities on . We aim to prove a result that establishes an equivalence between and some category of monads, to mirror the situation between Lawvere theories and finitary monads on .
Dense generators and nerves
Having a dense generator is desirable because we can then mimic the following situation:
Recall that if is small and is a functor, then we can form a diagram of shape over by composing the (opposite) of the natural projection functor and the Yoneda embedding. We may then consider the cocone
where is the natural transformation corresponding to via the Yoneda lemma, and find out it is actually a colimit, canonically expressing as a colimit of representable functors — if you are so inclined, you might want to look at this as the coend identity
when is a presheaf on . Likewise for an object of a category with dense generator , there is an associated diagram , which comes equipped with an obvious natural transformation to the constant functor on , whose -component is simply itself — this is called the -cocone over , and it is just the cocone of vertex under the diagram of shape in whose legs consist of all morphisms with . Note that if is small (as is the case), then this diagram is small and, if , the slice category reduces to the category of elements of the presheaf and this construction gives the Yoneda cocone under . One can show that
Proposition. A small full subcategory of is a dense generator precisely when the -cocones are actually colimit-cocones in .
This canonically makes every object of a colimit of objects in , and in view of this result it makes sense to define:
Definition. Let be a category with a dense generator . A monad on is a monad with arities when takes the -cocones of to colimit-cocones in .
That is, the monad has arities whenever scrambling the nerve functor by first applying does not undermine its capacity of turning -cocones into colimits, which in turns preserves the status of as a dense generator, morally speaking — the Nerve Theorem makes this statement more precise:
The Nerve Theorem. Let be a category with a dense generator . For any monad with arities , the full subcategory spanned by the free -algebras on objects of is a dense generator of the Eilenberg-Moore category . The essential image of the associated nerve functor is spanned by those presheaves whose restriction along belongs to the essential image of the , where is obtained by restricting the free -algebra functor.
The proof given relies on an equivalent characterization for monads with arities, namely that a monad on a category with arities is a monad with arities if and only if the “generalised lifting (pseudocommutative) diagram”
is an exact adjoint square, meaning the mate of the invertible -cell implicit in the above square is also invertible, where is the free -algebra functor. Note is monadic, so this diagram indeed gives some sort of lifting of the nerve functor on to the level of monad algebras.
We can build on this result a little bit. Let be a regular cardinal (at this point you might want to check David’s discussion on finite presentability).
Definition. A category is -accessible if it has -filtered colimits and a dense generator comprised only of -presentable objects such that is -filtered for each object of . If in addition the category is cocomplete, we say it is locally -presentable.
If is -accessible, there is a god-given choice of dense generator — we take to be a skeleton of the full subcategory spanned by the -presentable objects of . As all objects in are -presentable, the associated nerve functor preserves -filtered colimits and so any monad preserving -filtered colimits is a monad with arities . The essential image of is spanned by the -flat presheaves on (meaning presheaves whose categories of elements are -filtered). As a consequence, any given object in an -accessible category is canonically an -filtered colimit of -presentable objects and we can prove:
Theorem (Gabriel-Ulmer, Adámek-Rosický). If a monad on an -accessible category preserves -filtered colimits, then its category of algebras is -accessible, with a dense generator spanned by the free -algebras on (a skeleton of) the -presentable objects . Moreover, this category of algebras is equivalent to the full subcategory of spanned by those presheaves whose restriction along is -flat.
Proof. We know is a monad with arities . That is a dense generator as stated follows from its definition and the Nerve Theorem. Now, has -filtered colimits since has and preserves them. As the forgetful functor preserves -filtered colimits (a monadic functor creates all colimits has and preserves), it follows that the free algebra functor preserves -presentability: preserves -filtered colimits whenever is -presentable, and so objects of are -presentable. One can then check each is -filtered.
Note that this theorem says, for , that if a monad on sets is finitary, then its category of algebras (i.e models for the associated classical Lawvere theory) is accessible, with a dense generator given by all the free -algebras on finite sets: this is because a finitely-presentable (i.e -presentable) set is precisely the same as a finite set. As a consequence, the typical “algebraic gadgets” are canonically a colimit of free ones on finitely many generators.
Theories and monads (with arities) are equivalent
If is a monad with arities , then is a theory with arities . The Nerve Theorem then guarantees that induces an equivalence of categories between -models and -algebras, since its essential image is, by definition, the category of -models and the functor is fully faithful. This gives us hope that the situation with Lawvere theories and finitary monads can be extended, and this is indeed the case: the assignment extends to a functor , which forms an equivalence of categories together with the functor that takes a theory to the monad with arities , where is a choice of right adjoint to . When and , we recover the Lawvere theory/finitary monad equivalence.
Relation to operads and examples
Certain kinds of theories with arities are equivalent to operads. Namely, there is a notion of homogeneous globular theory that corresponds to globular (Batanin) operads. Similarly, there is a notion of -homogeneous theory that corresponds to symmetric operads. The remainder of the paper brings other equivalent definitions for monad with arities and builds a couple of examples, such as the free groupoid monad, which is a monad with arities given by (finite, connected) acyclic graphs. A notable example is that dagger categories arise as models of a theory on involutive graphs with non-trivial arities.
Re: Unboxing Algebraic Theories of Generalised Arities
Bravo! I don’t think I’d realized, even in the classical case of a finitary monad on the category of sets, that the (co)Lawvere theory sitting inside the category of algebras (the full subcategory spanned by the free algebras on finite sets) was a dense generator. In retrospect, it’s not surprising, but still I’m grateful to have this clean slogan to recall.