A monad on consists of an endofunctor and natural transformations , satisfying, at every object ,
These are the associativity and unit laws. An algebra for a monad is with
A monad algebra morphism is a morphism satisfying . Identity morphisms satisfy this equation, and if satisfy it, then . Hence these objects and morphisms form the Eilenberg-Moore category , with the forgetful functor and .
Define the free algebra functor by and . The monad laws make an algebra action, and naturality of makes a monad algebra morphism. For an algebra for a monad , define
with proposed inverse . This inverse is a monad algebra morphism, since
One composite is . For a monad algebra morphism , the other is . Both formulas commute with composition in a category in and with monad algebra morphisms in , so the bijection is natural. Thus
For , consider the reflexive free-algebra presentation of a monad algebra
Both parallel morphisms are monad algebra morphisms: satisfies the monad associativity law, while is the image under of . The map is a monad algebra morphism because , and the same equation says it equalizes the pair.
Suppose is a monad algebra morphism with . Put . Naturality of and the unit law give
Moreover, since is a monad algebra morphism,
Thus is a monad algebra morphism and factors through . If , then , proving uniqueness. Therefore every monad algebra is the stated coequalizer of free algebras.
The underlying fork is a split coequalizer: take , and . Then , , and . Its splitting maps need not be monad algebra morphisms; the preceding argument separately proves the coequalizer in .

Articles by others on the same topic (0)

There are currently no matching articles.