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.
Over a cocomplete base, a monadic category is cocomplete exactly when it has coequalizers
Statement
Let be monadic and suppose is cocomplete. Then is cocomplete if and only if has coequalizers.
Facts & Assumptions
Given: A monadic functor with cocomplete base and induced monad .
A category is cocomplete when every small diagram in it has a colimit (Finite, small, and large limits and colimits; complete and cocomplete categories).
Once the required coproducts and a coequalizer between them exist, every small colimit is constructed by the standard coproduct-coequalizer formula (Every small colimit can be constructed as a coequalizer between coproducts over the arrows and objects of the index category).
An equivalence of categories preserves and reflects every existing colimit (Equivalences preserve, reflect, and create limits and colimits in the isomorphism-invariant sense).
Every -algebra is the coequalizer in of the canonical pair (Every algebra is the coequalizer of its canonical pair of free algebras).
The free -algebra functor is left adjoint to the Eilenberg–Moore forgetful functor (The free–forgetful Eilenberg–Moore adjunction induces the given monad).
Left adjoints preserve every colimit that exists (Left adjoints preserve every colimit that exists).
Proof
For the forward direction, if is cocomplete then it has the colimit of every parallel pair, hence every coequalizer.
For the reverse direction, replace across its monadic comparison equivalence by . Given a small family , [L5] and [L6] identify the coproducts of free algebras with free algebras on the corresponding base coproducts. If and are their coproduct injections, define by By hypothesis this pair has a coequalizer in . The construction also applies to the empty family.
For every , the map coequalizes the canonical pair for . Its universal property [L4] gives a unique algebra map satisfying .
Given algebra maps , the maps assemble to a map . Each coequalizes its canonical pair by [L4], so and there is a unique with . Then because the two maps agree after the epimorphism , and uniqueness follows because the are jointly epimorphic. Thus is the coproduct of the family.
For the reverse direction, now has all small coproducts by step 3.1 and all coequalizers by hypothesis, so [L2] constructs every small colimit.
For the reverse direction, transport these colimits back across the comparison equivalence by [L3]. Thus is cocomplete.
Step 1.1 proves the forward implication, while steps 1.2 to 5.1 prove the reverse implication, establishing the biconditional.
Depends on
- Monadic and strictly monadic functors
- Finite, small, and large limits and colimits; complete and cocomplete categories
- Equalizers and coequalizers as limits and colimits of a parallel pair
- Free algebra for a monad
- Every algebra is the coequalizer of its canonical pair of free algebras
- The free–forgetful Eilenberg–Moore adjunction induces the given monad
- Left adjoints preserve every colimit that exists
- Every small colimit can be constructed as a coequalizer between coproducts over the arrows and objects of the index category
- Equivalences preserve, reflect, and create limits and colimits in the isomorphism-invariant sense
Used by
Dependency tree · two levels
26 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- E. Riehl, Category Theory in Context, 2nd ed., Proposition 5.6.11 (standard reference, not scraped)