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 . The axioms satisfied by these maps turn out to have a striking formal relation to the axioms for a monoid.
A monad on a category consists of
an endofunctor , and
a pair of natural transformations (the unit of ) and (the multiplication), such that
is a unit for , i.e. , and
is associative, i.e. .
This generalises evidently from categories to the objects of any bicategory. If is a bicategory, a monad on an object of consists of a 1-cell together with 2-cells satisfying axioms as before.
These data and axioms can be expressed graphically in string diagrams. The data , , appear as:

Thanks to the distinctive shapes, one can usually omit the labels:

The axioms and then appear as:

The name “monad” and the terms “unit”, “multiplication” and “associativity” come from a clear analogy with monoids. Indeed, one can define a monad on an object of a bicategory as just a monoid in its endomorphism category .
Alternatively, monads can be taken as more fundamental, and a monoid in a monoidal category can be defined as a monad in , viewing as a one-object bicategory.
Yet another definition, slick and mysterious:
A monad in is a lax functor from the terminal bicategory to .
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.
Peter LeFanu Lumsdaine?: I did the diagrams with the monad called and have only just noticed that that disagrees with what’s used in the preceding description. Was there a particular principled reason for calling it above? I can change the diagrams to agree if so, but if not, might it be easier on newcomers to use throughout? Pretty much all the references I know use that as the generic name for a monad. —Peter
Mike Shulman: I like as the name for a monad. (I also think that as a matter of exposition, this page should start out with monads in and introduce the more general version later, but I don’t have time to implement that right now.)
Peter LeFanu Lumsdaine?: I’d been thinking the same; so I’ve re-organised things as you suggest, and added an “idea” section. I think that probably goes into too much detail now, especially since “generalised algebraic theory” is only one of many ideas of what a monad is, but someone else can probably cut it down more dispassionately than I can :-)
Mike Shulman: I don’t think it needs any cutting down. If anything, one could add more description of all the other things that a monad is.
Monads in are sometimes, mostly in older literature, also called triples (alluding to the triple of data ). In even older literature, they are also referred to as standard constructions, from Beck’s discovery of them as a unifying description of the constructions of various homology theories.
We can picture a monad in as an image of the third oriental in . See the remarks at monoidal category.
Monads on posets are particularly simple. 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.
Every algebraic theory with a notion of free algebra defines a monad on Set. For example, the operation taking a set to the underlying set of the free monoid on may be extended to a monad, the list monad.
An internal monad on the subobject classifier of a topos is a Lawvere-Tierney topology on .
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 -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.
Some monads arise from operads, in which case algebras for the monad are the same as algebras for the operad. A Lawvere theory is another special sort of monad in .
There is a vertical categorification of monads to (∞,1)-categories. See (∞,1)-monad.
in section 3 of
Five short videotaped lectures:
Introductory slides:
Book (recall that monads are also called ‘triples’):