There is a close relation between adjunctions (adjoint functors) and monads:
Every adjunction induces a monad and a comonad .
(Huber 1961, §4; see eg. MacLane 1971, §VI.1 (p 134); Borceux 1994, vol. 2, prop. 4.2.1).
In detail:
Let be a pair of adjoint functors ie are adjoint functors where , , is the unit and is the counit. Then:
We verify that we obtain a monad, the argument for the comonad is formally dual.
(1) We know that this diagram commutes:
By applying , we obtain the first part of the unitaly of the monad:
(2) We know that this diagram commutes: By putting , we obtain the second part of the unitality of the monad:
(3) The naturality of is written, for every :
We apply it to and it gives:
Finally apply to this diagram to obtain:
which is exactly the associativity of the multiplication of the monad.
(4) The naturality of the multiplication is obtained by two whiskerings of the counit .
An adjunction inducing a monad (as above) is also called a resolution of .
There is in general more than one such resolution, in fact there is a category of adjunctions for a given monad whose morphisms are “comparison functors” (eg. MacLane 1971, §VI.3).
In this category:
the initial object is the adjunction over the Kleisli category of the monad;
the terminal object is that over the Eilenberg-Moore category of algebras, also called the monadic adjunction (recognized by monadicity theorems).
(e.g. Borceux 1994, vol. 2, prop. 4.2.2)
The above passage from adjunctions to monads and back to their monadic adjunctions constitutes itself an adjunction, sometimes called the semantics-structure adjunction.
Created on August 10, 2023 at 15:00:11. See the history of this page for a list of all contributions to it.