A monad consists of an endofunctor and natural transformations and , the unit and multiplication of a monad, satisfying
An algebra for a monad is with satisfying and . A morphism of algebras for a monad satisfies . These objects and morphisms form the Eilenberg-Moore category ; its composition works because is a functor.
For the list monad, is the set of finite ordered lists, including the empty list. The map applies to each entry; and concatenates a list of lists. The unit laws say that adding singleton brackets and then flattening changes nothing. Associativity says that flattening a list of lists of lists in either order produces the same ordered sequence. These descriptions also prove naturality.
If is an algebra for a monad, define
The singleton law gives . Apply the algebra associativity law to and to obtain . Applying it to and shows
Thus is a monoid. Applying the same law to shows inductively that is necessarily ordered multiplication of its entries, with the empty product .
Conversely, any monoid defines such a list-fold map . The monoid unit proves , and associativity and the unit prove that multiplying flattened lists equals multiplying their individual products, including empty sublists. Hence . An algebra morphism preserves the empty-list value and two-entry-list values, so it is a monoid homomorphism; conversely a monoid homomorphism preserves every ordered product and is an algebra morphism. Therefore
Thus list-monad algebras are monoids, with the identification also matching every morphism.
If the multiplication in the unit and multiplication of a monad is invertible, the two unit identities of the monad
make both and its inverse. Hence idempotence implies equality of the two unit insertions:
This is the first implication in the characterization of an idempotent monad.
An opmonoidal monad on a monoidal category is a monad whose endofunctor is an opmonoidal functor and whose unit and multiplication of a monad are opmonoidal natural transformations. Suppress only the canonical parentheses. Explicitly,
The composite opmonoidal functor has tensor comparison and unit comparison , explaining the last two equations.
For two algebras for a monad and , define
Let . The unit law for a monad algebra follows at once from the opmonoidality of :
For the multiplication law, naturality of , the algebra laws, and the opmonoidality of give
The two unit-comparison equations above similarly make a algebra for a monad. If are morphisms of algebras for a monad, naturality of shows that is an algebra morphism.
For a third algebra , the base associator is also an algebra morphism: its intertwining equation is precisely the opmonoidal associativity axiom, followed by . The two base unitors are algebra morphisms by the opmonoidal unit axioms. Their pentagon and triangle commute because they commute after the faithful forgetful functor, and the lifted maps have exactly the same underlying morphisms.
The Eilenberg-Moore category is therefore monoidal, with these lifted constraints. Its forgetful functor preserves the tensor product, unit object and constraints exactly, so it is a strict monoidal functor.
On the monoidal category of modules over the commutative ring , consider the monad coming from the unit and multiplication of the bialgebra . Its opmonoidal functor structure has comparison maps
Here and below Sweedler notation abbreviates the comultiplication . The opmonoidal associativity and unit axioms are the coassociativity and counit laws of the coalgebra. The unit and multiplication of a monad are opmonoidal natural transformations because the bialgebra axioms say
The Eilenberg-Moore category of this opmonoidal monad is the category of left -modules: a monad-algebra map is exactly a unital associative action.
Applying the preceding construction gives the diagonal bialgebra action and the unit action
The usual associators and unitors for the tensor product of modules are -linear, and the underlying tensor product is exactly . The forgetful functor into -modules is strict monoidal. The base need not be a field; the modules need be neither flat modules nor finitely generated modules.