Math 2.0

Category theory; homological algebra Theorem

Varieties as categories of algebras over a monad

Builds on Variety of algebrasForgetful functorFree functorMonadMonad from an adjunctionAlgebra over a monadEilenberg–Moore category

Statement

Let 𝒱\mathcal{V} be a variety of algebras of a finitary signature, regarded as a category with homomorphisms. Let U ⁣:𝒱→𝐒𝐞𝐭U \colon \mathcal{V} \to \mathbf{Set} be the forgetful functor and let F ⁣:𝐒𝐞𝐭→𝒱F \colon \mathbf{Set} \to \mathcal{V} be the free functor, its left adjoint. Let 𝕋=(UF,η,μ)\mathbb{T} = (U F, \eta, \mu) be the monad on 𝐒𝐞𝐭\mathbf{Set} induced by this adjunction, and let 𝐒𝐞𝐭𝕋\mathbf{Set}^{\mathbb{T}} be its Eilenberg–Moore category of 𝕋\mathbb{T}-algebras. Then the comparison functor K ⁣:𝒱→𝐒𝐞𝐭𝕋K \colon \mathcal{V} \to \mathbf{Set}^{\mathbb{T}}, which sends an algebra AA to the 𝕋\mathbb{T}-algebra (UA,UεA)(U A, U \varepsilon_A) where εA ⁣:FUA→A\varepsilon_A \colon F U A \to A is the counit, is an isomorphism of categories.

Remarks

The underlying set of UF(X)U F(X) is the set of terms in the variables XX modulo the identities of 𝒱\mathcal{V}. The map UεA ⁣:UFUA→UAU \varepsilon_A \colon U F U A \to U A evaluates such a term at elements of AA. Conversely, a 𝕋\mathbb{T}-algebra h ⁣:UF(X)→Xh \colon U F(X) \to X defines each basic operation ff of arity nn by f(x1,…,xn)=h(f(x1,…,xn))f(x_1, \ldots, x_n) = h(f(x_1, \ldots, x_n)). On the right, hh is applied to the term f(x1,…,xn)f(x_1, \ldots, x_n). The unit and associativity laws of hh force the identities of 𝒱\mathcal{V} to hold. Another proof applies Beck's monadicity theorem: UU creates coequalizers of UU-split pairs.

Example: for the variety of monoids, UF(X)U F(X) is the set X∗X^* of words. A 𝕋\mathbb{T}-algebra structure X∗→XX^* \to X is the same as a monoid structure on XX: it sends a word to the product of its letters.

The monads that arise in this way are finitary, and every finitary monad on 𝐒𝐞𝐭\mathbf{Set} arises from a variety, possibly with infinitely many operations of each finite arity. Monads that are not finitary describe infinitary structures; for instance, the algebras of the ultrafilter monad on 𝐒𝐞𝐭\mathbf{Set} are the compact Hausdorff spaces.

Going deeper

For a student

The result says that the forgetful functor of a variety is monadic, in the strict sense that the comparison functor is an isomorphism, not only an equivalence. It explains why constructions on varieties, such as limits computed on underlying sets and the existence of colimits, follow from general monad theory. Together with Lawvere theories, it gives three equivalent views of a variety: by a presentation, by a Lawvere theory, and by a finitary monad on 𝐒𝐞𝐭\mathbf{Set}. The Kleisli category of the same monad is equivalent to the full subcategory of free algebras.

Reading path

To understand this page from the ground up, read these 11 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. Adjoint functors concept
  2. Algebra over a monad concept
  3. Comonad concept
  4. Eilenberg–Moore category concept
  5. Forgetful functor concept
  6. Free functor concept
  7. Monad concept
  8. Unit and counit concept
  9. Variety of algebras concept
  10. Monad from an adjunction statement
  11. Varieties as categories of algebras over a monad statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Monad_(category_theory)
About this page
TagEZ21NHHAKG
URIm2://EZ21NHHAKG
Kindstatement, theorem
WritingW0 stub
MSC18C05, 18C15, 08C05
StatusThis copy of the site has no build data. Run m2 status EZ21NHHAKG.
AboutVariety of algebras, Eilenberg–Moore category
UsesVariety of algebras, Forgetful functor, Free functor, Monad, Monad from an adjunction, Algebra over a monad, Eilenberg–Moore category
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • 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.