Monad (category theory)

Introduction

A monad is a certain type of endofunctor. For example, if F and G are a pair of adjoint functors, with F left adjoint to G , then the composition G ∘ F is a monad. If F and G are inverse functors, the corresponding monad is the identity functor. In general, adjunctions are not equivalences — they relate categories of different natures. The monad theory matters as part of the effort to capture what it is that adjunctions 'preserve'. The other half of the theory, of what can be learned likewise from consideration of F ∘ G , is discussed under the dual theory of comonads.

The monad axioms can be seen at work in a simple example: let G be the forgetful functor from the category Grp of groups to the category Set of sets. Then let F be the free group functor.

This means that the monad

takes a set X and returns the underlying set of the free group F r e e ( X ) . In this situation, we are given two natural morphisms:

by including any set X into the set F r e e ( X ) in the natural way, as strings of length 1. Further,

can be made out of a natural concatenation or 'flattening' of 'strings of strings'. This amounts to two natural transformations

and

They will satisfy some axioms about identity and associativity that result from the adjunction properties.

Another example is when T is the endofunctor on the category of vector spaces which maps a vector space V to its tensor algebra T ( V ) , and which maps linear maps to their tensor product. We then have a natural transformations corresponding to the embedding of V into its tensor algebra, and a natural transformation corresponding to the map from T ( T ( V ) ) to T ( V ) obtained by simply expanding all tensor products. These satisfy the monad axioms.

Those axioms are formally similar to the monoid axioms. They are taken as the definition of a general monad (not assumed a priori to be connected to an adjunction) on a category.

If we specialize to categories arising from partially ordered sets ( P , ≤ ) (with a single morphism from x to y iff x ≤ y ), then the formalism becomes much simpler: adjoint pairs are Galois connections and monads are closure operators.

Every monad arises from some adjunction, in fact typically from many adjunctions. Two constructions introduced below, the Kleisli category and the category of Eilenberg–Moore algebras, are extremal solutions of the problem of constructing an adjunction that gives rise to a given monad.

The example about free groups given above can be generalized to any type of algebra in the sense of a variety of algebras in universal algebra. Thus, every such type of algebra gives rise to a monad on the category of sets. Importantly, the algebra type can be recovered from the monad (as the category of Eilenberg–Moore algebras), so monads can also be seen as generalizing universal algebras. Even more generally, any adjunction is said to be monadic (or tripleable) if it shares this property of being (equivalent to) the Eilenberg–Moore category of its associated monad. Consequently, Beck's monadicity theorem, which gives a criterion for monadicity, can be used to show that an arbitrary adjunction can be treated as a category of algebras in this way.

The notion of monad was invented by Roger Godement in 1958 under the name "standard construction." In the 1960s and 1970s, many people used the name "triple." The now standard term "monad" is due to Saunders Mac Lane.

Formal definition

If C is a category, a monad on C consists of an endofunctor T : C → C together with two natural transformations: η : 1 C → T (where 1 C denotes the identity functor on C ) and μ : T 2 → T (where T 2 is the functor T ∘ T from C to C ). These are required to fulfill the following conditions (sometimes called coherence conditions):

We can rewrite these conditions using following commutative diagrams:

See the article on natural transformations for the explanation of the notations T μ and μ T , or see below the commutative diagrams not using these notions:

The first axiom is akin to the associativity in monoids, the second axiom to the existence of an identity element. Indeed, a monad on C can alternatively be defined as a monoid in the category E n d C whose objects are the endofunctors of C and whose morphisms are the natural transformations between them, with the monoidal structure induced by the composition of endofunctors.

Comonads and their importance

The categorical dual definition is a formal definition of a comonad (or cotriple); this can be said quickly in the terms that a comonad for a category C is a monad for the opposite category C o p . It is therefore a functor U from C to itself, with a set of axioms for counit and comultiplication that come from reversing the arrows everywhere in the definition just given.

Since a comonoid is not a basic structure in abstract algebra, this is less familiar at an immediate level.

The importance of the definition comes in a class of theorems from the categorical (and algebraic geometry) theory of descent. What was realised in the period 1960 to 1970 is that recognising the categories of coalgebras for a comonad was an important tool of category theory (particularly topos theory). The results involved are based on Beck's theorem. Roughly what goes on is this: while it is simple set theory that a surjective mapping of sets is as good as the equivalence relation "x is in the same fiber as y" on the domain of the mapping, for geometric morphisms what you should do is pass to such a coalgebra subcategory.

Examples

The rich set of examples is given by adjunctions (see Monads and adjunctions), and the free group example mentioned above belongs to that set.

Here is another example, on the category S e t : For a set A let T ( A ) be the power set of A and for a function f : A → B let T ( f ) be the function between the power sets induced by taking direct images under f . For every set A , we have a map η A : A → T ( A ) , which assigns to every a ∈ A the singleton { a } . The function

takes a set of sets to its union. These data describe a monad.

Closure operators are monads on preorder categories.

Algebras for a monad

Suppose that ( T , η , μ ) is a given monad on a category C .

A T -algebra ( x , h ) is an object x of C together with an arrow h : T x → x of C called the structure map of the algebra such that the diagrams

commute.

A morphism f : ( x , h ) → ( x ′ , h ′ ) of T -algebras is an arrow f : x → x ′ of C such that the diagram

commutes.

The category C T of T -algebras and their morphisms is called the Eilenberg–Moore category or category of (Eilenberg–Moore) algebras of the monad T . The forgetful functor C T → C has a left adjoint C → C T taking x to the free algebra ( T x , μ x ) .

Given the monad T , there exists another "canonical" category C T called the Kleisli category of the monad T . This category is equivalent to the category of free algebras for the monad T , i. e. the full subcategory of C T whose objects are of the form ( T x , μ x ) , for x an object of C .

Monads and adjunctions

An adjunction ( F , G , η , ε ) between two categories C and D (where F : C → D is left adjoint to G : D → C and η and ε are respectively the unit and the counit) always defines a monad ( G F , η , G ε F ) .

Conversely, it is interesting to consider the adjunctions which define a given monad ( T , η , μ ) this way. Let A d j ( C , T ) be the category whose objects are the adjunctions ( F , G , e , ε ) such that ( G F , e , G ε F ) = ( T , η , μ ) and whose arrows are the morphisms of adjunctions which are the identity on C . Then this category has

An adjunction ( F , G , η , ε ) between two categories C and D is a monadic adjunction when the category D is equivalent to the Eilenberg–Moore category C T for the monad T = G F . (Mac Lane uses a stronger definition, where the two categories are isomorphic rather than equivalent.) By extension, a functor G : D → C is said to be monadic if it has a left adjoint F forming a monadic adjunction. Beck's monadicity theorem gives a characterization of monadic functors.

Uses

Monads are used in functional programming to express types of sequential computation (sometimes with side-effects). See monads in functional programming, and the more mathematically oriented Wikibook module b:Haskell/Category theory.

In categorical logic, an analogy has been drawn between the monad-comonad theory, and modal logic via closure operators, interior algebras, and their relation to models of S4 and Intuitionistic logics.

Generalization

It is possible to define monads in a 2-category C . Monads described above are monads for C = C a t .