Math 2.0

Category theory; homological algebra Definition

Monad

Builds on FunctorNatural transformation

Definition

Let 𝒞\mathcal{C} be a category. A monad on 𝒞\mathcal{C} is a triple (T,η,μ)(T, \eta, \mu) made of these data.

  1. T ⁣:𝒞→𝒞T \colon \mathcal{C} \to \mathcal{C} is a functor.
  2. η ⁣:Id𝒞⇒T\eta \colon \mathrm{Id}_{\mathcal{C}} \Rightarrow T is a natural transformation, the unit.
  3. μ ⁣:T∘T⇒T\mu \colon T \circ T \Rightarrow T is a natural transformation, the multiplication.

The data must satisfy two laws. The associativity law is μ∘Tμ=μ∘μT\mu \circ T\mu = \mu \circ \mu T as natural transformations TTT⇒TT T T \Rightarrow T. The unit laws are μ∘Tη=id⁡T\mu \circ T\eta = \id_T and μ∘ηT=id⁡T\mu \circ \eta T = \id_T. Here (Tμ)X=T(μX)(T\mu)_X = T(\mu_X) and (μT)X=μT(X)(\mu T)_X = \mu_{T(X)}, and similarly for η\eta.

Remarks

Example: the power set monad on the category of sets. Here T(X)T(X) is the power set of XX, and T(f)T(f) sends a subset AA to its image f(A)f(A). The unit is ηX(x)={x}\eta_X(x) = \set{x} and the multiplication is μX(𝒮)=⋃𝒮\mu_X(\mathcal{S}) = \bigcup \mathcal{S}. Both sides of the associativity law send a set of sets of subsets to the union of all the subsets that occur in it. The unit laws hold because ⋃{A}=A\bigcup \set{A} = A and ⋃{{a}:a∈A}=A\bigcup \set{\set{a} : a \in A} = A.

Non-example: on the category of sets let T(X)=X×XT(X) = X \times X, ηX(x)=(x,x)\eta_X(x) = (x, x) and μX((a,b),(c,d))=(a,c)\mu_X((a, b), (c, d)) = (a, c). Then (μ∘ηT)X(\mu \circ \eta T)_X sends (x,y)(x, y) to μX((x,y),(x,y))=(x,x)\mu_X((x, y), (x, y)) = (x, x). This differs from (x,y)(x, y) when x≠yx \ne y, so a unit law fails. With μX((a,b),(c,d))=(a,d)\mu_X((a, b), (c, d)) = (a, d) instead, one gets a monad.

A monad on 𝒞\mathcal{C} is the same as a monoid object in the monoidal category of endofunctors of 𝒞\mathcal{C}, with composition as the product. The dual notion is a comonad.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Functor concept
  2. Natural transformation concept
  3. Monad definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Monad_(category_theory)
About this page
TagF426Q5R0RY
URIm2://F426Q5R0RY
Kinddefinition
WritingW0 stub
MSC18C15
DefinesMonad
UsesFunctor, Natural transformation
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.