How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Monads Comonads and Their Algebras
1 · Prerequisites
- Adjunctions Units and Counits
- Binary Operations, Monoids, Groups and Subgroups
- Cardinal Arithmetic, Cofinality and the Alephs
- Categories, Functors and Natural Transformations
- Construction of the Natural Numbers
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Free Modules, Exact Sequences, Projective and Injective Modules
- Group Homomorphisms and the Isomorphism Theorems
- Limits and Colimits
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinal Arithmetic and the First Uncountable Ordinal
- Ordinals, Cardinals, and Transfinite Recursion
- Reflective Subcategories and the Adjoint Functor Theorems
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Set Theory Beyond Choice: Recorded, Not Proved Here
- Suprema and Infima
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Universal Properties, Representables and the Yoneda Lemma
2 · Summary
An adjunction is controlled by its unit, counit, and triangle identities (Adjunction by unit, counit, and the triangle identities), and composing adjunctions gives the formulas used to compare their induced endofunctors (Adjunctions compose with the composite unit and counit formulas). A reflective full subcategory has an inclusion with a left adjoint (Reflective full subcategory and reflector), whose counit is invertible (The counit of a reflection is an isomorphism). These facts supply the adjunction and reflection data used to construct monads, comparison functors, and the idempotent case.
A monad and its formal dual, a comonad, lead to algebra and coalgebra categories together with Kleisli and Eilenberg–Moore resolutions. The comparison constructions give monadicity, limit creation, and the reflective description of idempotent algebras. Monad morphisms restrict algebra structures, while distributive laws build composite monads. On a preorder monads and comonads become monotone maps that are extensive or contractive, and on a poset those are exactly closure and interior operators; free algebra, power-set, and ultrafilter constructions then provide concrete instances before the dual co-Kleisli and co-Eilenberg–Moore theory.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Monad on a category
Definition
Let be a category. A monad on is a triple consisting of an endofunctor (Covariant functor, identity functor, composite functor, and contravariant functor) and natural transformations (Natural transformation and its components)
called the unit and multiplication, such that
Here , , , and are whiskerings in the sense of Whiskering and horizontal composition of natural transformations. Componentwise, for every object ,
The monoid description of a monad requires an endofunctor category
When the endofunctors of and their natural transformations form the functor category (Functor category ), composition makes that category monoidal, and the data and equations of Monad on a category say exactly that is a monoid object in it. In particular this description is available for a small ; If is small and is locally small then is locally small; if both are small it is small supplies the corresponding smallness and local-smallness conclusions.
For an arbitrary large , the library's convention treats endofunctors and natural transformations only as metatheoretic shorthand and does not form them into a category. The monad definition itself remains meaningful there, but the phrase “monoid object in the endofunctor category” is used only when that category exists.
Comonad on a category
Definition
Let be a category. A comonad on is a triple consisting of an endofunctor , a counit , and a comultiplication such that
Equivalently, a comonad on is a monad (Monad on a category) on the opposite category (Opposite category ), with every arrow reversed.
Every adjunction induces a monad on the domain of its left adjoint
Statement
Facts & Assumptions
Given: An adjunction with unit and counit as in Adjunction by unit, counit, and the triangle identities.
The triangle identities are and (Adjunction by unit, counit, and the triangle identities).
Proof
Put and . Whiskering preserves naturality, so is an endofunctor and and are natural transformations.
At an object , the two associativity composites are and ; naturality of at identifies the expressions inside , so .
Componentwise, by the second triangle identity, while by the first; hence both unit laws hold and is a monad.
Every adjunction induces a comonad on the codomain of its left adjoint
Statement
Facts & Assumptions
Given: An adjunction with unit and counit .
The adjunction induces the monad on (Every adjunction induces a monad on the domain of its left adjoint).
Proof
Apply [L1] to the opposite adjunction . Reversing arrows translates its endofunctor , unit, and multiplication into , , and on .
The translated associativity equation is , and the translated unit equations are ; these are precisely coassociativity and the two counit laws, so the displayed data form a comonad.
Algebra and algebra homomorphism for a monad
Definition
Let be a monad on (Monad on a category). A -algebra is an object together with a morphism , called its structure map, satisfying
For -algebras and , a -algebra homomorphism is a morphism in such that
Algebra homomorphisms are closed under identities and composition
Statement
For a monad , identity morphisms are -algebra homomorphisms, and the composite of two -algebra homomorphisms is a -algebra homomorphism. These operations inherit associativity and identity laws from the base category.
Facts & Assumptions
Given: -algebras and their homomorphisms as in Algebra and algebra homomorphism for a monad.
Proof
For an algebra , functoriality gives , so and is an algebra homomorphism.
If and are algebra homomorphisms, then , so their composite is one too.
Composition of these morphisms is the composition in ; step 1.1 supplies its identities and step 2.1 its closure, while associativity and the identity laws are inherited from .
Eilenberg–Moore category of a monad
Definition
For a monad on , the Eilenberg–Moore category has the -algebras as objects and the -algebra homomorphisms as morphisms. Its identities and composition are those of ; Algebra homomorphisms are closed under identities and composition proves that these operations are closed and satisfy the category laws.
The Eilenberg–Moore forgetful functor sends to and acts as the identity on each underlying morphism.
Free algebra for a monad
Definition
For a monad and an object , the free -algebra on is
It is a -algebra: its associativity axiom is the componentwise monad associativity equation, and its unit axiom is . For a morphism , naturality of makes an algebra homomorphism.
The free–forgetful Eilenberg–Moore adjunction induces the given monad
Statement
For a monad on , the assignment defines a functor left adjoint to the forgetful functor . The monad induced by is on the nose.
Facts & Assumptions
Given: A monad , its Eilenberg–Moore category and forgetful functor (Eilenberg–Moore category of a monad), and its free algebras (Free algebra for a monad).
Proof
Define and . Naturality of gives , so is an algebra homomorphism; the functor laws follow from those of .
At an algebra define the counit component ; the algebra associativity law makes it an algebra homomorphism and the homomorphism equation makes these components natural. The equations and are the two triangle identities, so .
The composite equals , the adjunction unit is , and has component ; hence the induced multiplication is and the induced monad is the given one on the nose.
Kleisli composition is associative and unital
Statement
Let be a monad on . For morphisms and , define
Then is associative, and is a two-sided identity at .
Facts & Assumptions
Given: A monad as in Monad on a category and composable arrows , , and .
Proof
Expanding the definitions gives , while .
Naturality of at rewrites as , and the monad associativity equation identifies the two expansions in step 1.1.
Naturality of and the two distinct unit laws give and , so the asserted identities hold.
Kleisli category of a monad
Definition
For a monad on , the Kleisli category has the same objects as and hom-collections
The identity at is , and composition is . The category laws are established before this definition in Kleisli composition is associative and unital.
The Kleisli adjunction induces the given monad
Statement
For a monad on , there is an adjunction
whose induced monad is on the nose.
Facts & Assumptions
Given: The Kleisli category of Kleisli category of a monad and the monad used to define it.
Proof
Define and . Define , and for a Kleisli arrow put .
The Kleisli identity and associativity laws show that both assignments preserve identities and composition. Moreover naturally in and , so they form an adjunction.
The unit is . The counit at a Kleisli object is represented by , and applying gives ; the Kleisli unit laws are the triangle identities. Thus and the induced unit and multiplication are and .
The Kleisli and Eilenberg–Moore universal properties are schematic
The universal properties of the Kleisli and Eilenberg–Moore adjunctions quantify over each supplied adjunction inducing a fixed monad and assert the existence and uniqueness of particular comparison functors. They do not require a category whose objects are all such adjunctions.
This distinction matters under the library's size convention. The functor category is formed only when is small, and for a large source the notation is metatheoretic shorthand rather than a category (Functor category ); smallness and local smallness of then need the further hypotheses of If is small and is locally small then is locally small; if both are small it is small. No large category of every monad resolution is presumed here. The following factorisation results state the universal properties in the objectwise form that remains meaningful without such a category.
The Kleisli factorisation functor for an adjunction inducing a monad exists and is unique
Statement
Let be an adjunction with counit whose induced monad is a fixed monad on on the nose, and write for the Kleisli adjunction with counit . There is exactly one functor satisfying
namely
These three equalities are what it means for to be a morphism of adjunctions from the Kleisli adjunction to .
Facts & Assumptions
Given: An adjunction as in Adjunction by unit, counit, and the triangle identities, inducing with as in Every adjunction induces a monad on the domain of its left adjoint, and the Kleisli adjunction of The Kleisli adjunction induces the given monad.
Proof
A Kleisli arrow has adjoint transpose ; define by this formula and by .
For an identity , the first triangle identity gives . For and , substitution of , naturality of , and the triangle identities gives , so is a functor.
The formulas give and on objects and arrows, and sends the Kleisli counit to . Conversely, those equalities force the image of to be its adjoint transpose, so they force the formula of step 1.1 on every arrow and prove uniqueness.
The comparison functor to the Eilenberg–Moore category exists and is unique
Statement
Let be an adjunction with counit inducing a fixed monad on on the nose, and write for the Eilenberg–Moore adjunction with counit . There is exactly one functor satisfying
namely the comparison functor
These three equalities are what it means for to be a morphism of adjunctions from to the Eilenberg–Moore adjunction.
Facts & Assumptions
Given: An adjunction with unit and counit as in Adjunction by unit, counit, and the triangle identities, inducing and as in Every adjunction induces a monad on the domain of its left adjoint, together with the Eilenberg–Moore adjunction of The free–forgetful Eilenberg–Moore adjunction induces the given monad.
Proof
For set , and for set .
The triangle identity gives . Naturality of at gives the algebra associativity equation for , and naturality at gives ; hence the objects and arrows in step 1.1 are algebras and algebra homomorphisms.
Directly , and ; the Eilenberg–Moore counit at is , so the counit data also agree. These strict equalities force the underlying arrow action and every structure map, proving uniqueness.
Kleisli and Eilenberg–Moore adjunctions have the extremal universal properties
Statement
Fix a monad on . Among supplied adjunctions inducing on the nose, the Kleisli adjunction has the schematic initial universal property and the Eilenberg–Moore adjunction has the schematic terminal universal property: every such adjunction admits a unique morphism of adjunctions from the Kleisli resolution and a unique morphism of adjunctions to the Eilenberg–Moore resolution.
Facts & Assumptions
Given: A fixed monad and an arbitrary supplied adjunction inducing it.
For an adjunction with counit inducing on the nose there is exactly one functor with , and for every (The Kleisli factorisation functor for an adjunction inducing a monad exists and is unique).
For the same adjunction there is exactly one functor with , and for every (The comparison functor to the Eilenberg–Moore category exists and is unique).
Proof
Apply [L1] to the supplied adjunction; its unique factorisation is the required morphism from the Kleisli resolution.
Apply [L2] to the same adjunction; its unique comparison is the required morphism to the Eilenberg–Moore resolution.
Steps 1.1 and 1.2 give the two asserted existence-and-uniqueness properties for each supplied adjunction. This objectwise assertion does not form a category of all resolutions.
Composing with an adjunction that induces the identity monad on the nose does not change the induced monad
Statement
Let and be adjunctions. Suppose the monad induced by is the identity monad on on the nose: , , and . Then the monad induced on by the composite adjunction is the monad induced by on the nose.
Facts & Assumptions
Given: The two adjunctions and the displayed strict identity-monad hypotheses.
The composite adjunction has unit and counit (Adjunctions compose with the composite unit and counit formulas).
Proof
The composite induced endofunctor is , and [L1] with gives .
Its multiplication is . Expanding by [L1], then using and , reduces this transformation to .
The endofunctor, unit, and multiplication obtained in steps 1.1 and 2.1 are exactly , , and , so the two induced monads agree on the nose.
The comparison from the Kleisli category is fully faithful with image the free algebras
Statement
For a monad on , the canonical comparison functor
sends to the free algebra and is fully faithful. Its strict image is exactly the full subcategory of free -algebras.
Facts & Assumptions
Given: The Kleisli and Eilenberg–Moore resolutions, their comparison functors (The Kleisli factorisation functor for an adjunction inducing a monad exists and is unique, The comparison functor to the Eilenberg–Moore category exists and is unique), and the definition of a free algebra (Free algebra for a monad).
Proof
The comparison sends to and a Kleisli arrow to the algebra homomorphism .
For every , the map is a bijection from to the algebra homomorphisms ; its inverse sends to . The monad unit laws show the two composites are identities, using the algebra-homomorphism equation for in one direction.
Thus every induced hom-set map is bijective, so is fully faithful (Faithful, full, fully faithful, essentially surjective, and split essentially surjective functors); step 1.1 also shows that its objects are precisely the free algebras, giving the claimed strict image.
Monadic and strictly monadic functors
Definition
Let have a left adjoint , let be the induced monad, and let be the comparison functor of The comparison functor to the Eilenberg–Moore category exists and is unique. The functor is monadic when is an equivalence of categories (Equivalence, quasi-inverse, and adjoint equivalence of categories).
It is strictly monadic when is an isomorphism of categories, so its object and morphism correspondences, inverse, and equations hold on the nose. Strict monadicity implies monadicity; the converse is not part of the definition.
Conservative functor
Definition
A functor is conservative if it reflects isomorphisms: whenever is a morphism of and is an isomorphism in (Isomorphism, groupoid, and connected category), the morphism is an isomorphism in .
The Eilenberg–Moore forgetful functor strictly creates every limit that exists in the base
Statement
For every monad on , the forgetful functor strictly creates every limit that exists in . No preservation hypothesis on is required.
Facts & Assumptions
Given: A diagram with algebra structures , and a limiting cone in .
Strict creation requires a unique lifted limiting cone with exactly the supplied apex and legs (Preservation, reflection, and creation of limits and colimits; continuous and cocontinuous functors).
A limit admits a unique mediating arrow from every cone (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).
Proof
The maps form a cone because every arrow of is an algebra homomorphism. By [L2] there is a unique with for every .
After composition with every , the equations and become the corresponding algebra laws for by naturality; the limit legs are jointly monic by uniqueness in [L2], so both equations hold and is a -algebra.
If a cone from an algebra has underlying mediating arrow , then composing and with every gives the same map because each cone leg is an algebra homomorphism; joint monicity makes an algebra homomorphism. Its uniqueness and the uniqueness of follow from the base limit, giving exactly the strict lift required by [L1], including when is empty.
Every category monadic over Set is complete
Statement
If is monadic, then has every small limit.
Facts & Assumptions
Given: A monadic functor in the sense of Monadic and strictly monadic functors.
Every small diagram in has a limit (Set has all small limits, realized as compatible tuples in a set-indexed product).
An Eilenberg–Moore forgetful functor strictly creates every base limit (The Eilenberg–Moore forgetful functor strictly creates every limit that exists in the base).
Equivalences preserve, reflect, and create all existing limits in the ordinary isomorphism-invariant sense (Equivalences preserve, reflect, and create limits and colimits in the isomorphism-invariant sense).
Proof
For any small diagram in the Eilenberg–Moore category of the induced monad on , [L1] supplies its underlying limit and [L2] lifts that limit; hence this Eilenberg–Moore category is complete.
Monadicity says that the comparison is an equivalence. By [L3], each small limit from step 1.1 transports across , so is complete.
The Eilenberg–Moore forgetful functor creates every colimit in the base that the monad and its square preserve
Statement
Let be a diagram of algebras whose underlying diagram has a colimit in . If both and preserve this colimit, then there is a unique algebra structure on making every an algebra homomorphism, and the resulting cocone is a colimit in . Thus creates every such colimit.
Facts & Assumptions
Given: The diagram, its structure maps , the base colimit , and preservation of that colimit by and .
Creation of colimits is the cocone dual of creation of limits (Preservation, reflection, and creation of limits and colimits; continuous and cocontinuous functors), with colimits as in Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties.
Proof
Since preserves the colimit, the maps induce a unique satisfying for every .
Precomposition with every proves . Precomposition with every proves ; these families are jointly epic because and preserve the colimit, so is an algebra and every is an algebra homomorphism.
Any algebra cocone has a unique underlying mediating arrow ; precomposition with every shows , so is automatically an algebra homomorphism. This proves the lifted universal property and the conditional creation claim.
Every monadic functor is conservative
Statement
Every monadic functor reflects isomorphisms; equivalently, every monadic functor is conservative (Conservative functor).
Facts & Assumptions
Given: A monad , its algebra homomorphisms (Algebra and algebra homomorphism for a monad), a monadic functor with comparison equivalence as in Monadic and strictly monadic functors, and the fact that fully faithful functors reflect isomorphisms (Every fully faithful functor reflects isomorphisms).
Proof
Let be an algebra homomorphism whose underlying morphism has inverse . From , the inverse equations, and functoriality, one obtains by composing with and cancelling it; hence is an algebra homomorphism.
Therefore the Eilenberg–Moore forgetful functor reflects isomorphisms: an underlying inverse is automatically an inverse inside the algebra category by step 1.1.
For a monadic , its comparison is an equivalence and hence fully faithful. If is an isomorphism, step 2.1 makes an isomorphism, and full faithfulness reflects that isomorphism back to ; thus is conservative.
Idempotent monad
Definition
A monad is idempotent when its multiplication is a natural isomorphism.
For a monad, invertibility of multiplication, monicity of every multiplication component, and equality of the two whiskered units are equivalent
Statement
For a monad , the following are equivalent:
- is a natural isomorphism, so the monad is idempotent (Idempotent monad);
- every component is monic;
- .
Facts & Assumptions
Given: A monad .
A monomorphism is left-cancellable: implies (Monomorphism and epimorphism by left and right cancellation).
Proof
If is a natural isomorphism, each is an isomorphism and therefore monic, proving .
If every is monic, the monad unit laws give ; cancellation by [L1] yields for every , proving .
Assume . The unit law makes a right inverse to . Naturality of at , followed by , gives ; thus is also a left inverse, every is invertible, and .
Algebras for an idempotent monad form a reflective subcategory
Statement
Let be an idempotent monad on . An object admits a -algebra structure if and only if is an isomorphism, and then the structure is uniquely . The forgetful functor identifies with the full reflective subcategory of such objects, with reflector .
Facts & Assumptions
Given: An idempotent monad (Idempotent monad), its algebras (Algebra and algebra homomorphism for a monad), and its Eilenberg–Moore category (Eilenberg–Moore category of a monad).
Proof
If is an algebra structure, then . Naturality of at and idempotence, which gives , imply ; hence .
Conversely, if is invertible, put . The unit axiom is immediate, and naturality of together with the monad unit laws gives ; step 1.1 shows this structure is unique.
Naturality of shows every base morphism between two such fixed objects commutes with their inverse-unit algebra structures, so the subcategory is full. The unit is universal from to this subcategory, since is fixed and every map to a fixed object extends uniquely through ; hence is its reflector in the sense of Reflective full subcategory and reflector.
The Kleisli and Eilenberg–Moore categories of an idempotent monad are equivalent
Statement
For an idempotent monad , the canonical comparison is an equivalence of categories.
Facts & Assumptions
Given: The comparison theorem and the characterisation of algebras for an idempotent monad (The comparison from the Kleisli category is fully faithful with image the free algebras, Algebras for an idempotent monad form a reflective subcategory).
A functor is an equivalence exactly when it is fully faithful and split essentially surjective (A functor is an equivalence exactly when it is fully faithful and split essentially surjective, without Choice).
Proof
The canonical comparison is fully faithful, and its strict image consists of the free algebras.
For each algebra , the idempotent-algebra theorem gives . The map is therefore a specified algebra isomorphism from to the free algebra on , with inverse .
The specified isomorphisms of step 1.2 make the fully faithful comparison of step 1.1 split essentially surjective; [L1] therefore makes it an equivalence.
The inclusion of a reflective full subcategory is monadic
Statement
If is a reflective full subcategory of , then its inclusion is monadic.
Facts & Assumptions
Given: A reflection as in Reflective full subcategory and reflector.
A reflection is an adjunction with the full inclusion (Reflective full subcategory and reflector).
Algebras for an idempotent monad are exactly the objects whose unit is invertible, with the unique inverse-unit structure (Algebras for an idempotent monad form a reflective subcategory).
An adjunction induces the monad formed from its right adjoint after its left adjoint (Every adjunction induces a monad on the domain of its left adjoint).
Every component of the counit of a reflection is an isomorphism (The counit of a reflection is an isomorphism).
Proof
By [L1] and [L3], the reflection induces the monad on with multiplication . By [L4] this multiplication is a natural isomorphism, so is idempotent (Idempotent monad).
By [L2], the Eilenberg–Moore category of is the full subcategory of objects for which the reflection unit is invertible. The comparison sends to , and its essential image is exactly this fixed-object subcategory.
Fullness of makes the comparison fully faithful, and every algebra has the specified isomorphism to the comparison image of . Thus the comparison is an equivalence, so is monadic by Monadic and strictly monadic functors.
Morphisms between monads on one category
Definition
Let and be monads on the same category . A monad morphism is a natural transformation satisfying
and
At an object , the multiplication equation is
Whenever the endofunctor category exists, monads on a fixed category and their morphisms form a category
Statement
Let be a category for which the functor category exists. Monads on as objects and monad morphisms as arrows form a category.
Facts & Assumptions
Given: Monads , , and on .
A monad morphism is a natural transformation preserving the unit and multiplication (Morphisms between monads on one category).
When exists, natural transformations between endofunctors are arrows of a category and compose vertically (Functor category ).
Proof
The identity satisfies and , so it is a monad morphism.
If and are monad morphisms, then , so their vertical composite preserves the unit.
Naturality of gives ; substituting the multiplication equations for and yields , so the composite preserves multiplication.
By [L2], vertical composition is associative and the transformations in step 1.1 are identities. Steps 2.1 and 3.1 give closure under composition under the stated endofunctor-category size condition. Hence these objects and arrows form a category.
A monad morphism induces restriction of algebras and a natural comparison of free algebras
Statement
A monad morphism on induces a functor over , defined by restriction of algebra structure. Its components also define a natural transformation from the free -algebra functor to the free -algebra functor followed by .
Facts & Assumptions
Given: A monad morphism on .
The equations for are and (Morphisms between monads on one category).
An -algebra satisfies and , and its homomorphisms satisfy (Algebra and algebra homomorphism for a monad).
The free -algebra on is (Free algebra for a monad).
Proof
For an -algebra , put . By [L1]–[L2], , while naturality of and the two multiplication equations give . Thus is a -algebra.
If is an -algebra homomorphism, then by naturality of . Hence the unchanged underlying arrow is a -algebra homomorphism, and unchanged identities and composites define a functor over .
For every , the multiplication equation in [L1] says precisely that is a -algebra homomorphism. Naturality of makes these maps natural in , giving the claimed comparison of free algebras.
Distributive law between two monads
Definition
Let and be monads on a category . A distributive law of over is a natural transformation satisfying
and
A distributive law makes the composite endofunctor a monad
Statement
If is a distributive law of the monad over the monad , then is a monad. Its unit is and its multiplication is
Facts & Assumptions
Given: Monads on and a distributive law .
A distributive law of over is a natural transformation satisfying and , together with and (Distributive law between two monads).
A monad consists of an endofunctor with a unit and multiplication satisfying the unit and associativity equations (Monad on a category).
An -algebra map satisfies and , and an algebra homomorphism satisfies (Algebra and algebra homomorphism for a monad).
The Eilenberg--Moore forgetful functor is the identity on underlying morphisms, hence is faithful (Eilenberg–Moore category of a monad).
The Eilenberg--Moore adjunction of any monad induces that monad on the nose (The free–forgetful Eilenberg–Moore adjunction induces the given monad).
If has unit and counit and has unit and counit , then with unit and counit (Adjunctions compose with the composite unit and counit formulas).
For an adjunction with unit and counit , the data , and define a monad on the domain of (Every adjunction induces a monad on the domain of its left adjoint).
Proof
For an -algebra define the following lifted object and arrow assignment.
Put on an -algebra homomorphism .
The first distributive unit law gives the first identity below, and the first distributive multiplication law, naturality of , and the -algebra laws give the second.
and
Thus is an -algebra. If is an -algebra homomorphism, then naturality of gives
so the assignment in step 1.1 is an endofunctor .
The second distributive unit law and naturality of give the following identity.
Thus each is an -algebra homomorphism.
The second distributive multiplication law and naturality of give the following identity.
Hence each is also an -algebra homomorphism.
The underlying components of these two natural transformations are and . Their monad equations hold in by [L2], and [L4] reflects those equalities. Therefore is a monad on .
Take the Eilenberg--Moore adjunction and the Eilenberg--Moore adjunction . By [L5] they induce and , respectively, and by [L6] they compose to the following adjunction.
The induced endofunctor is . The composite-unit formula in [L6] gives . Expanding the two Eilenberg--Moore counits in the composite-counit formula gives the following multiplication.
Naturality of at identifies its last two arrows with
This is the multiplication in the Statement.
By [L7], the endofunctor, unit, and multiplication computed in step 6.1 satisfy both unit laws and associativity, so they define the asserted monad on .
On a preorder the monads are exactly the monotone extensive maps with T(Tp) below Tp; on a poset they are exactly the closure operators
Statement
Let be a preorder, regarded as a category. A monad on is equivalently a monotone map such that and for every . These inequalities force and to be mutually comparable. If is a poset, this is equivalently a closure operator: a monotone, extensive, idempotent map.
Facts & Assumptions
Given: A preorder , regarded as a category.
A preorder determines a category with at most one morphism between any two objects, and functors between such categories are exactly monotone maps (A preorder is a category with at most one morphism between any two objects, and its functors are exactly monotone maps).
A monad has natural transformations and satisfying the monad equations (Monad on a category).
A partial order is a preorder satisfying antisymmetry (Partial order and partially ordered set).
Proof
By [L1] the endofunctor is a monotone map, and a morphism in a preorder-category exists exactly when and is then the only one, so a natural transformation is precisely the family of inequalities . Hence by [L2] is exactly the family , and is exactly . Applying monotonicity to also gives .
Conversely, a monotone with and supplies the unique transformations and by [L1]. Every monad diagram commutes because a preorder has at most one arrow between any fixed source and target.
If is a poset, step 1.1 and antisymmetry give ; conversely an ordinary closure operator is monotone and extensive and its idempotence supplies , so step 1.2 makes it a monad.
Algebras for a preorder monad are exactly its fixed objects up to preorder equivalence; on a poset they are its fixed points
Statement
For a monad on a preorder , a -algebra structure exists on exactly when and are mutually comparable. On a poset this says exactly that .
Facts & Assumptions
Given: A monad on a preorder .
A -algebra on includes an arrow (Algebra and algebra homomorphism for a monad).
The monad unit supplies , and every required diagram between fixed objects of a preorder commutes automatically (On a preorder the monads are exactly the monotone extensive maps with T(Tp) below Tp; on a poset they are exactly the closure operators).
Antisymmetry turns mutual comparability into equality (Partial order and partially ordered set).
Proof
If carries a -algebra, [L1] gives , while [L2] gives ; hence the two objects are mutually comparable.
Conversely, if , the corresponding unique arrow is an algebra structure: its unit and associativity diagrams commute because parallel arrows in a preorder are equal.
When is a poset, [L3] changes mutual comparability into , and equality plainly gives the comparison required in step 2.1.
On a preorder the comonads are exactly the monotone contractive maps with Gp below G(Gp); on a poset they are exactly the interior operators
Statement
Let be a preorder. A comonad on is equivalently a monotone map such that and for every . These inequalities force and to be mutually comparable. If is a poset, this is equivalently an interior operator: a monotone, contractive, idempotent map.
Facts & Assumptions
Given: A preorder .
A comonad on is a monad on (Comonad on a category).
Monads on a preorder are exactly its monotone extensive maps equipped with the reverse comparison from their square (On a preorder the monads are exactly the monotone extensive maps with T(Tp) below Tp; on a poset they are exactly the closure operators).
Reversing a preorder reverses each inequality (Opposite category ).
In a poset, mutual comparability implies equality (Partial order and partially ordered set).
Proof
By [L1], regard as a monad on , with its counit and comultiplication serving as the unit and multiplication there.
Applying [L2] in the opposite order gives monotonicity, , and . Monotonicity applied to gives , so the two values are mutually comparable.
Conversely, the stated inequalities reverse to the data in [L2] on , hence give a comonad by [L1]. If is a poset, [L4] makes the two comparisons equivalent to , precisely the idempotence condition for an interior operator.
The free-monoid monad has monoids as its Eilenberg–Moore algebras
Statement
The monad on induced by the free-monoid adjunction sends a set to the set of finite words, inserts letters as one-letter words, and flattens words of words by concatenation. Its Eilenberg–Moore category is isomorphic over to the category of monoids.
Facts & Assumptions
Given: The free-monoid adjunction between sets and monoids.
The free-monoid functor sends to the monoid of finite words and is left adjoint to the underlying-set functor (The free-monoid functor is left adjoint to the underlying-set functor).
Every adjunction induces a monad, whose unit is the adjunction unit and whose multiplication uses the counit (Every adjunction induces a monad on the domain of its left adjoint).
A monoid has an associative binary operation and a two-sided identity (Semigroup and monoid).
Proof
By [L1]–[L2], the induced endofunctor is , its unit sends a letter to its one-letter word, and its multiplication concatenates a finite word of finite words. A monoid therefore gives an algebra by evaluating each word.
Conversely, for an algebra , define and . The algebra unit law evaluates one-letter words to their letters, and the multiplication law says evaluation is unchanged by first evaluating subwords; applied to empty, two-letter, and three-letter decompositions, it gives the two unit laws and associativity.
An algebra homomorphism commutes with evaluation, hence preserves the empty word and two-letter words and is a monoid homomorphism. Conversely a monoid homomorphism preserves every finite word evaluation, so it is an algebra homomorphism. These identifications are inverse and unchanged on underlying sets.
The free-group monad has groups as its Eilenberg–Moore algebras
Statement
The monad on induced by the free-group adjunction sends a set to the underlying set of its free group. Its Eilenberg–Moore category is isomorphic over to the category of groups.
Facts & Assumptions
Given: The free-group adjunction between sets and groups.
The free-group functor is left adjoint to the underlying-set functor (The free-group functor is left adjoint to the underlying-set functor).
Every adjunction induces a monad on the domain of its left adjoint (Every adjunction induces a monad on the domain of its left adjoint).
A group has associative multiplication, an identity, and inverses (Group and abelian group).
Proof
By [L1]–[L2], the monad sends to the underlying set of the free group , its unit inserts generators, and its multiplication evaluates a reduced word whose letters are themselves reduced words. Every group gives an algebra by word evaluation.
Conversely, from an algebra , define the product, identity, and inverse by evaluating the free-group words , , and . The algebra unit law fixes generators, while the multiplication law identifies evaluation after substitution with direct evaluation; applying it to the standard group-word identities gives all axioms in [L3].
An algebra homomorphism commutes with word evaluation and therefore preserves product, identity, and inverse. Conversely a group homomorphism preserves every group word and hence is an algebra homomorphism. The two constructions are inverse over .
For a unital ring R, the free-R-module monad on sets has left R-modules as its Eilenberg–Moore algebras
Statement
Fix a unital ring . The monad on induced by the free-left--module adjunction sends a set to the underlying set of its free module . Its Eilenberg–Moore category is isomorphic over to the category of left -modules.
Facts & Assumptions
Given: A unital ring and the free-left--module adjunction.
The free-module functor is left adjoint to the underlying-set functor (The free-module functor is left adjoint to the underlying-set functor).
Every adjunction induces a monad on the domain of its left adjoint (Every adjunction induces a monad on the domain of its left adjoint).
A left -module is an abelian group with a compatible unital left -action (Unital left and right modules over a ring; unqualified module means left module).
Proof
By [L1]–[L2], the monad sends to finite formal sums , its unit sends to , and multiplication evaluates a finite formal sum of finite formal sums. Every left -module gives an algebra by evaluating such sums.
Conversely, for an algebra , define , , and . The algebra unit and multiplication laws say that substituting finite formal sums before evaluation has the same result as flattening them first; the module axioms in [L3] follow by applying this equality to the corresponding formal sums.
An algebra homomorphism commutes with evaluation, hence preserves , addition, and scalar multiplication. Conversely an -linear map preserves every finite formal sum and is therefore an algebra homomorphism. These identifications are inverse over .
Singleton and union define the covariant power-set monad
Statement
The covariant power-set functor carries a monad whose unit is and whose multiplication is union.
Facts & Assumptions
Given: A set and functions between sets.
The power set is the set of all subsets of (The power set ).
Direct image sends a subset along to (The image and the preimage of a set under a relation).
A monad requires natural unit and multiplication satisfying two unit laws and associativity (Monad on a category).
Proof
Define . Direct images preserve identities and composition, so this is an endofunctor; define and .
For , one has , so union is natural. Also , which proves naturality of the singleton unit directly.
The two unit laws are and . Associativity is the equality obtained by removing either pair of parentheses from a union of families of families. These identities also hold when , so [L3] gives the claimed monad.
Algebras for the covariant power-set monad are posets with all small suprema and their morphisms preserve every small supremum
Statement
The Eilenberg–Moore category of the covariant power-set monad is isomorphic to the category of posets admitting every small supremum and maps preserving every small supremum.
Facts & Assumptions
Given: The covariant power-set monad with singleton unit and union multiplication.
The covariant power-set monad has singleton unit and union multiplication (Singleton and union define the covariant power-set monad), while an algebra map satisfies and , and a homomorphism satisfies (Algebra and algebra homomorphism for a monad).
A poset has all small suprema exactly when every set of its elements has a least upper bound (A poset category is complete exactly when every small family has an infimum, and cocomplete exactly when every small family has a supremum).
Antisymmetry is the condition that and imply (Partial order and partially ordered set).
Proof
Given an algebra , define when . The singleton law gives reflexivity; symmetry of the set gives antisymmetry; and the flattening law makes the induced binary join associative, from which transitivity follows. Thus this is a partial order.
For every , put . Applying the flattening law to families formed from , its singleton subsets, and an arbitrary common upper bound proves respectively that every member of lies below and that lies below every upper bound; this includes . The algebra-homomorphism equation says exactly that .
Conversely, on a poset with all small suprema define . Singleton suprema give the unit law, and gives the multiplication law. A map satisfies the algebra-homomorphism equation exactly when it preserves these suprema.
Pushforward sends ultrafilters to ultrafilters and is functorial
Statement
For a function and an ultrafilter on , define
Then is an ultrafilter on . Moreover, and , where denotes the set of ultrafilters on .
Facts & Assumptions
Given: A function and an ultrafilter on .
An ultrafilter is a proper filter maximal among proper filters (Ultrafilter).
A proper filter is an ultrafilter exactly when, for every subset , it contains either or its complement (Characterisation of ultrafilters: every set or its complement).
Proof
Inverse image preserves the whole set, inclusions, and finite intersections and sends the empty set to the empty set. Consequently the displayed family contains , excludes , is upward closed, and is closed under finite intersections, so it is a proper filter.
For , [L2] applied to says that either or . Thus decides every subset of and is an ultrafilter by [L2].
The equalities and show membership-by-membership that and .
The principal-ultrafilter and ultrafilter-flattening formulas are well-defined and natural
Statement
Write for the set of ultrafilters on and for . The formulas
define natural transformations and .
Facts & Assumptions
Given: A set , a point , and an ultrafilter on .
Pushforward makes functorial (Pushforward sends ultrafilters to ultrafilters and is functorial).
The complement-decision property characterises ultrafilters (Characterisation of ultrafilters: every set or its complement).
In an ultrafilter, a finite union belongs exactly when one of its members belongs (Ultrafilters are prime: a union in has a member in ).
Proof
The subsets containing form a proper filter and decide every according as or , so is an ultrafilter by [L2]. For , the equivalence proves naturality of .
The identities , , , and give the filter axioms for . Inner complement decision gives ; their union belongs to the outer ultrafilter, so [L3] puts one of them in it. By [L2] the resulting filter is an ultrafilter.
For and , expanding definitions gives exactly when . This is equivalent to , because by [L1]. Hence .
The ultrafilter endofunctor with principal unit and flattening multiplication
Definition
The ultrafilter endofunctor sends to the set of ultrafilters on and sends to ultrafilter pushforward . Its principal unit and flattening multiplication are
The preceding pushforward and flattening lemmas establish that these assignments are well-defined and natural.
The ultrafilter endofunctor with principal unit and flattening multiplication is a monad
Statement
The ultrafilter endofunctor together with the principal unit and flattening multiplication is a monad on .
Facts & Assumptions
Given: The functor and the natural transformations and from The ultrafilter endofunctor with principal unit and flattening multiplication.
For , write ; then exactly when (The ultrafilter endofunctor with principal unit and flattening multiplication).
The data in [L1] are already well-defined and natural (The ultrafilter endofunctor with principal unit and flattening multiplication).
Proof
For , one has iff iff iff . Thus .
Likewise iff . This inverse image is , so .
For , expanding membership in along either or gives the same condition . Hence multiplication is associative, and steps 1.1–1.2 give the unit laws.
Coalgebra and coalgebra homomorphism for a comonad
Definition
Let be a comonad on . A -coalgebra is an object with a morphism satisfying
A coalgebra homomorphism is a morphism in satisfying
Coalgebra homomorphisms are closed under identities and composition
Statement
For a comonad , every identity on a -coalgebra is a coalgebra homomorphism, and the composite of coalgebra homomorphisms is a coalgebra homomorphism.
Facts & Assumptions
Given: -coalgebras , , and .
A coalgebra homomorphism satisfies (Coalgebra and coalgebra homomorphism for a comonad).
Proof
Functoriality gives , so is a coalgebra homomorphism by [L1].
If and are coalgebra homomorphisms, then . Thus is a coalgebra homomorphism.
Co-Eilenberg–Moore category of a comonad
Definition
For a comonad on , the co-Eilenberg–Moore category has -coalgebras as objects and coalgebra homomorphisms as morphisms. Its identities and composition are those of , whose closure is supplied by Coalgebra homomorphisms are closed under identities and composition. The forgetful functor sends a coalgebra and a coalgebra homomorphism to their underlying object and arrow.
The cofree–forgetful co-Eilenberg–Moore adjunction induces the given comonad
Statement
For a comonad on , the forgetful functor has a right adjoint , where . The comonad induced by is on the nose.
Facts & Assumptions
Given: A comonad on .
A comonad on is a monad on (Comonad on a category).
The Eilenberg–Moore free–forgetful adjunction of a monad induces that monad on the nose (The free–forgetful Eilenberg–Moore adjunction induces the given monad).
Proof
Regard as a monad on and apply [L2] there.
Taking opposites translates algebras into coalgebras, the free algebra into the cofree coalgebra , and the free–forgetful adjunction into . Its unit at is and its counit at is .
The triangle equations translate to and . Therefore the induced endofunctor is , its counit is , and its comultiplication is .
Co-Kleisli composition is associative and unital
Statement
For a comonad , regard a co-Kleisli arrow as a morphism . Define
for , and define the identity at to be . Then is associative and unital.
Facts & Assumptions
Given: A comonad and co-Kleisli arrows , , and .
The comonad equations are coassociativity of and the two counit laws for (Comonad on a category).
For a monad and morphisms , , the composite is associative, and is a two-sided identity at (Kleisli composition is associative and unital).
Proof
The formula has source and target , so it defines composition on the proposed arrows.
Expanding and , naturality and coassociativity of move the two duplications into the same order, after which functoriality of makes the composites equal.
Naturality of at rewrites as , so the equation gives ; and , so the equation gives . Hence is a two-sided identity.
Co-Kleisli category of a comonad
Definition
For a comonad on , the co-Kleisli category has the objects of and hom-collections
Composition is , and the identity of is . These operations form a category by Co-Kleisli composition is associative and unital.
The co-Kleisli adjunction induces the given comonad
Statement
For a comonad on , there is an adjunction
with and . Its induced comonad is on the nose.
Facts & Assumptions
Given: A comonad and its co-Kleisli category.
A co-Kleisli arrow is a base arrow , with composition determined by (Co-Kleisli category of a comonad).
The Kleisli adjunction construction induces its original monad (The Kleisli adjunction induces the given monad).
Proof
Define and for . Define and let be the co-Kleisli arrow represented by . These are the formal duals of the Kleisli functors.
Co-Kleisli associativity and unit laws make both assignments functorial. The equality is a natural identity of hom-sets, so .
The counit of this adjunction is , while its unit at is the co-Kleisli arrow represented by . The triangle identities are the co-Kleisli unit laws, and the induced comultiplication is of that unit, namely . Thus the induced comonad is .
Co-Kleisli and co-Eilenberg–Moore adjunctions have the dual extremal universal properties
Statement
Fix a comonad on . Among supplied adjunctions inducing on the nose, the co-Kleisli adjunction has the schematic initial universal property and the co-Eilenberg–Moore adjunction has the schematic terminal universal property: every such adjunction admits a unique morphism of adjunctions from the co-Kleisli resolution and a unique morphism of adjunctions to the co-Eilenberg–Moore resolution, with the corresponding equalities over the base categories.
Facts & Assumptions
Given: A comonad and an adjunction inducing .
The co-Eilenberg–Moore adjunction induces (The cofree–forgetful co-Eilenberg–Moore adjunction induces the given comonad).
The co-Kleisli adjunction induces (The co-Kleisli adjunction induces the given comonad).
For a fixed monad, every supplied adjunction inducing it admits a unique morphism of adjunctions from the Kleisli adjunction and a unique morphism of adjunctions to the Eilenberg–Moore adjunction; Kleisli has the schematic initial universal property and Eilenberg–Moore the schematic terminal one (Kleisli and Eilenberg–Moore adjunctions have the extremal universal properties).
Proof
Regard as a monad on the opposite category and apply [L3] there.
An adjunction inducing on becomes inducing that monad on , and under this translation the Kleisli and Eilenberg–Moore resolutions of the latter are the co-Kleisli and co-Eilenberg–Moore adjunctions of [L1]–[L2]. A morphism of adjunctions is a functor between their intermediate categories, and passing to opposite categories carries such a functor to , which runs between the same two adjunctions in the same order. The two comparison directions are therefore preserved rather than reversed, so the initial property stays with co-Kleisli and the terminal one with co-Eilenberg–Moore.
Transporting the two universal properties of [L3] back along this translation gives, for every supplied adjunction inducing , a unique morphism of adjunctions from the co-Kleisli resolution and a unique morphism of adjunctions to the co-Eilenberg–Moore resolution, with the required equalities over the base categories. This assertion quantifies over supplied data and does not require a category of all such adjunctions.
5 · Examples, counterexamples and false statements
FALSE: The Kleisli and Eilenberg–Moore categories are equivalent for every monad
Statement
False claim: for every monad, its Kleisli and Eilenberg–Moore categories are equivalent.
The free-monoid monad on is a counterexample.
Facts & Assumptions
Given: The free-monoid monad on .
Its Kleisli hom-set from to is (Kleisli category of a monad; The free-monoid monad has monoids as its Eilenberg–Moore algebras).
Its Eilenberg–Moore category is the category of monoids (The free-monoid monad has monoids as its Eilenberg–Moore algebras).
A functor is an equivalence exactly when it is fully faithful and split essentially surjective (A functor is an equivalence exactly when it is fully faithful and split essentially surjective, without Choice); an equivalence consists of quasi-inverse functors and natural isomorphisms and (Equivalence, quasi-inverse, and adjoint equivalence of categories), and is fully faithful when every is bijective (Faithful, full, fully faithful, essentially surjective, and split essentially surjective functors).
The canonical Kleisli comparison is fully faithful with image the free algebras (The comparison from the Kleisli category is fully faithful with image the free algebras).
For an idempotent monad , the canonical comparison is an equivalence of categories (The Kleisli and Eilenberg–Moore categories of an idempotent monad are equivalent).
Refutation
By [L1], the endomorphism set of in the Kleisli category is .
The monoid with has exactly two endomorphisms: an endomorphism fixes , and it may send to either idempotent or .
If , this function set is a singleton. If is nonempty, choose ; the words are distinct, and the corresponding constant functions show that is infinite.
If the two categories were equivalent, essential surjectivity would place in the image up to isomorphism, and full faithfulness would give a bijection between its two-element endomorphism set and the endomorphism set of some Kleisli object. Step 2.1 rules this out.
The claim is therefore false. The positive boundary is [L4], that the canonical comparison is fully faithful with image the free algebras, together with [L5], that it is an equivalence when the monad is idempotent.
FALSE: Every functor with a left adjoint is monadic
Statement
False claim: every functor that has a left adjoint is monadic.
The underlying-set functor is a counterexample.
Facts & Assumptions
Given: The underlying-set functor .
The discrete-topology functor is left adjoint to (Discrete topology, underlying set, and indiscrete topology form an adjoint triple).
Every monadic functor is conservative (Every monadic functor is conservative).
A continuous bijection is an isomorphism in exactly when its inverse is continuous (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological).
Refutation
By [L1], has a left adjoint.
On a two-element set , let have the discrete topology and the indiscrete topology. The identity function is continuous and is a bijection, but is not continuous because a singleton is open in and not in .
Thus is an isomorphism while is not, so is not conservative. By [L2] it is not monadic, even though step 1.1 gives it a left adjoint.
FALSE: A monad is a monoid object in the endofunctor category for every category
Statement
False claim under the library's size convention: for every category , a monad on is a monoid object in the endofunctor category .
The slogan is valid when that endofunctor category is formed, as recorded in The monoid description of a monad requires an endofunctor category.
Facts & Assumptions
Given: The library convention for functor categories.
The functor category is formed when the source is small; for an arbitrary large source the same notation may be used only as metatheoretic shorthand, and the definition does not form those proper-class-sized data into a category (Functor category ).
If is small and is locally small, then is locally small; if both are small, then is small (If is small and is locally small then is locally small; if both are small it is small).
Sets as objects and functions as morphisms form a large locally small category (Sets and functions form the large locally small category ).
A monad on is an endofunctor with a unit and a multiplication satisfying the two unit equations and associativity (Monad on a category).
Refutation
A monoid object is defined only inside an actual monoidal category, so the claimed description presupposes that is a category.
Take , which is large by [L3], carrying the identity monad , whose unit and associativity equations hold trivially by [L4]. The source is not small, so by [L1] the adopted convention does not form into a category, and the presupposition of step 1.1 fails for this monad.
A claim asserted for every category therefore fails at , where it presupposes a category the convention does not form. When is small the functor category is formed by [L1] and is locally small by [L2], and the usual monoid description is valid there.
FALSE: Every algebra for a monad is free
Statement
False claim: every algebra for every monad is a free algebra.
The free-monoid monad has a two-element algebra that is not free.
Facts & Assumptions
Given: The free-monoid monad on .
Its algebras are monoids, while its free algebras are free word monoids (The free-monoid monad has monoids as its Eilenberg–Moore algebras; Free algebra for a monad).
A monoid has associative multiplication and a two-sided identity (Semigroup and monoid).
Refutation
By [L1], it suffices to exhibit a monoid that is not isomorphic to a free word monoid.
Let with an identity and . Its multiplication is associative by inspection, so it is a monoid and hence an algebra for the free-monoid monad.
A free word monoid on the empty set has one element. A free word monoid on a nonempty set contains the distinct words for any chosen generator , so it is infinite. Therefore no free word monoid has two elements, and is not free.
Sources
Standard references
Recommended treatments; not extraction sources.
- E. Riehl, Category Theory in Context, 2nd ed., Definition 5.1.1
- B. Richter, From Categories to Homotopy Theory, Definition 6.1.1
- S. Mac Lane, Categories for the Working Mathematician, 2nd ed., Chapter VI.1
- E. Riehl, Category Theory in Context, 2nd ed., Remark 5.1.2
- E. Riehl, Category Theory in Context, 2nd ed., Definition 5.1.6
- E. Riehl, Category Theory in Context, 2nd ed., Lemma 5.1.3
- B. Richter, From Categories to Homotopy Theory, Theorem 6.1.3
- E. Riehl, Category Theory in Context, 2nd ed., Lemma 5.1.3 and Definition 5.1.6
- E. Riehl, Category Theory in Context, 2nd ed., Definition 5.2.4
- B. Richter, From Categories to Homotopy Theory, Definition 6.2.1
- B. Richter, From Categories to Homotopy Theory, Section 6.2
- E. Riehl, Category Theory in Context, 2nd ed., Definition 5.2.8
- B. Richter, From Categories to Homotopy Theory, Example 6.2.3
- E. Riehl, Category Theory in Context, 2nd ed., Lemma 5.2.9
- B. Richter, From Categories to Homotopy Theory, Theorem 6.2.5
- E. Riehl, Category Theory in Context, 2nd ed., Example 5.2.iv
- B. Richter, From Categories to Homotopy Theory, Example 6.3.2
- E. Riehl, Category Theory in Context, 2nd ed., Definition 5.2.10
- B. Richter, From Categories to Homotopy Theory, Definition 6.3.1
- E. Riehl, Category Theory in Context, 2nd ed., Lemma 5.2.12
- B. Richter, From Categories to Homotopy Theory, Corollary 6.3.6 and Remark 6.3.7
- E. Riehl, Category Theory in Context, 2nd ed., Proposition 5.2.13
- B. Richter, From Categories to Homotopy Theory, Definition 6.3.8 and Theorem 6.3.10
- B. Richter, From Categories to Homotopy Theory, Theorem 6.3.10
- S. Mac Lane, Categories for the Working Mathematician, 2nd ed., Chapter VI.3
- S. Mac Lane, Categories for the Working Mathematician, 2nd ed., Exercise VI.5.5
- E. Riehl, Category Theory in Context, 2nd ed., Lemma 5.2.14
- B. Richter, From Categories to Homotopy Theory, Proposition 6.3.5
- E. Riehl, Category Theory in Context, 2nd ed., Definition 5.3.1
- S. Mac Lane, Categories for the Working Mathematician, 2nd ed., Chapter VI
- E. Riehl, Category Theory in Context, 2nd ed., discussion following Lemma 5.6.1
- E. Riehl, Category Theory in Context, 2nd ed., Theorem 5.6.5(i)
- B. Richter, From Categories to Homotopy Theory, Theorem 6.5.1
- E. Riehl, Category Theory in Context, 2nd ed., Corollary 5.6.7
- E. Riehl, Category Theory in Context, 2nd ed., Theorem 5.6.5(ii)
- B. Richter, From Categories to Homotopy Theory, Lemma 6.5.2
- E. Riehl, Category Theory in Context, 2nd ed., Lemma 5.6.1
- E. Riehl, Category Theory in Context, 2nd ed., Example 5.1.iii
- E. Riehl, Category Theory in Context, 2nd ed., Proposition 5.3.3(i)
- E. Riehl, Category Theory in Context, 2nd ed., Example 5.3.i
- E. Riehl, Category Theory in Context, 2nd ed., Proposition 5.3.3(ii)
- M. Richter, From Categories to Homotopy Theory, Definition 6.1.15
- S. Mac Lane, Categories for the Working Mathematician, 2nd ed., Chapter VI, Section 1
- S. Mac Lane, Categories for the Working Mathematician, 2nd ed., Exercise VI.2.3
- E. Cheng, Distributive laws for Lawvere theories, Definition 2.1
- E. Cheng, Distributive laws for Lawvere theories, Theorem 2.2
- E. Riehl, Category Theory in Context, 2nd ed., Example 5.1.7
- E. Riehl, Category Theory in Context, 2nd ed., Examples 5.1.7 and 5.2.6(iv)
- E. Riehl, Category Theory in Context, 2nd ed., Example 5.2.6(i)
- E. Riehl, Category Theory in Context, 2nd ed., Examples 5.1.4(iv) and Exercise 5.2.i
- E. Riehl, Category Theory in Context, 2nd ed., Examples 5.1.4(iii) and Exercise 5.2.i
- E. Riehl, Category Theory in Context, 2nd ed., Example 5.1.5(i)
- S. Mac Lane, Categories for the Working Mathematician, 2nd ed., Exercise VI.2.2
- E. Riehl, Category Theory in Context, 2nd ed., Exercise 5.1.ii
- E. Riehl, Category Theory in Context, 2nd ed., Example 5.1.4(v) and Exercise 5.1.ii
- E. Riehl, Category Theory in Context, 2nd ed., Exercise 5.2.iii
- E. Riehl, Category Theory in Context, 2nd ed., Definition 5.2.10 by formal duality
- E. Riehl, Category Theory in Context, 2nd ed., Lemma 5.2.12 by formal duality
- E. Riehl, Category Theory in Context, 2nd ed., Proposition 5.2.13 by formal duality
- E. Riehl, Category Theory in Context, 2nd ed., Definition 5.3.1 and Theorem 5.5.1
- E. Riehl, Category Theory in Context, 2nd ed., Definitions 5.2.4 and 5.2.8