For algebras for a monad and underlying binary coproducts in a category, put . If the algebra pair has a coequalizer, that coequalizer is their algebra coproduct. An algebra map from transposes to ; equalizing the pair is exactly the two algebra-morphism equations for . The pair is reflexive through .
If has finite colimits and a monad preserves reflexive coequalizers, its Eilenberg-Moore category has finite colimits. The forgetful functor creates reflexive coequalizers preserved by . The coproduct presentation for monad algebras yields binary coproducts, and is initial. Any pair can then be replaced by the reflexive pair , with identical coequalizers. Finite coproducts and coequalizers give all finite colimits.
Articles by others on the same topic
There are currently no matching articles.