symmetric monoidal (∞,1)-category of spectra
The entry is about monads in the sense of category theory, for another concept see also monad in nonstandard analysis.
A monad is a structure that is a lot like a monoid, but that lives in a bicategory rather than a monoidal category. In other words, the concept of a monad is the horizontal categorification of that of a monoid.
Monads are among the most pervasive structures in category theory and its applications: for example, they are central to the category-theoretic account of universal algebra, as well as underlying the theory of simplicial objects and thus, via the Dold–Kan correspondence, much of homological algebra.
A monad in a bicategory is given by
such that the diagrams
The name “monad” and the terms “unit”, “multiplication” and “associativity” bear a clear analogy with monoids (but see also at monad (disambiguation)). Indeed, one can define a monad on an object of a bicategory as just a monoid in the endomorphism category . Alternatively, monads can be taken as more fundamental, and a monoid in a monoidal category can be defined as a monad in , the one-object bicategory corresponding to .
A third and somewhat less obvious definition says that a monad in is a lax 2-functor from the terminal bicategory to : the unique object of is sent to the object , the morphism becomes , and and arise from the coherent 2-cells expressing lax functoriality. This in turn is equivalent to saying that a monad is a category enriched in a bicategory with a single object and single morphism. Among higher-category theorists, it’s tempting to suggest that this is the most fundamental definition, and the most basic reason for the ubiquity and importance of monads. Regardless of this, however, the earlier more elementary definitions are both practically and pedagogically essential.
The data of and axioms for a monad can be expressed graphically as string diagrams. Writing for the monad in question (this notation being the standard one when ), these data can be represented as
Thanks to the distinctive shapes, one can usually omit the labels:
The axioms then appear as:
Monads in are sometimes, mostly in older literature, also called triples (alluding to the triple of data ), following Eilenberg and Moore. In even older literature, they are also referred to as standard constructions, the original term used by Godement when he introduced the idea. For terminological remarks by Ross Street see category-list here.
Given the equivalence between monads in and lax functors it is straightforward to define the bicategory of monads in to be the lax functor category , which consists of lax functors, lax transformations and modifications.
Spelling this out, we see that an object of is a monad in . A morphism of monads is given by 1-cell together with a 2-cell satisfying
Finally, a 2-cell is given by a 2-cell satisfying
Given that a monad in a bicategory is nothing but a monoid in a hom-category , it is natural to consider a module over this monoid: a module for a monad. This notion of module is more general than a module in a monoidal category, however, since it need not live in but can be in (for left modules) or (for right modules).
In a Cat-like bicategory, left modules over a monad are usually called algebras over the monad. This terminology is confusing from the point of view of monads as monoids, but is justified because in Cat itself, such algebras with domain 1 are just algebras for a monad in the classical sense. Such algebras are a powerful tool to encode general algebraic structures; this is the topic of universal algebra. The algebras over a monad form its Eilenberg-Moore category, which is characterized by a universal property.
Every adjunction induces a monad and a comonad . There is in general more than one adjunction which gives rise to a given monad this way, in fact there is a category of adjunctions for a given monad. The initial object in that category is the adjunction over the Kleisli category of the monad and the terminal object is that over the Eilenberg-Moore category of algebras. (e.g. Borceux, vol. 2, prop. 4.2.2) The latter is called the monadic adjunction.
General types of monads that have standard usages also as monads in computer science? include
Monads are often considered in the 2-category Cat where they are given by endofunctors with a monoid structure on them. In particular, monads in Cat on Set are equivalent to the equational theories studied in universal algebra. In this context, a monad abstracts the concept of an algebraic theory (such as “group” or “ring”), giving a general notion of extra structure on an object of a category.
Classically, if is an algebraic theory (e.g. the theory of groups), a -structure on a set tells us how to interpret various terms (e.g. ) formed from elements of the set, subject to certain axioms (e.g. ). A monad collects this up into a functor . For a set , is the set of all terms of the theory formed from elements of , with terms identified if axioms force them to be equal. For groups, is thus the (underlying set of the) free group of formal words from ; the fact that gives free structures turns out to be typical.
To capture the theory fully, we need to include a little more data: a natural map recording how each gives a trivial term , and a map recording how further terms built from terms are already present as terms in .
Monads on posets are particularly simple (in particular, they are always idempotent). In fact, monads on power sets are extremely common throughout mathematics; they are known in less categorially-inclined circles as Moore closures, and there are many examples there.
in section 3 of
H. Appelgate, M. Barr, J. Beck, F. W. Lawvere, F. E. J. Linton, E. Manes, M. Tierney, F. Ulmer, Seminar on triples and categorical homology theory, ETH 1966/67, edited by B.~Eckmann, LNM 80, Springer 1969.
Relation to universal algebra:
Anthony Voutas, The basic theory of monads and their connection to universal algebra (pdf)