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.
Under dependent choice, algebras for a finitary monad on a complete cocomplete locally small category have coequalizers
Statement
Assume dependent choice. If is a finitary monad on a complete, cocomplete, locally small category , then the Eilenberg–Moore category has coequalizers.
Facts & Assumptions
Given: Dependent choice, a complete cocomplete locally small category , a finitary monad , and algebra homomorphisms .
A functor is finitary when it preserves every small filtered colimit (Finitary functors and finitary monads).
Dependent choice produces a sequence from a nonempty set with an entire successor relation and a specified starting point (The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain).
Let have complete locally small domain and be continuous. If satisfies the solution-set condition at , then has an initial object, equivalently a universal arrow from to (General adjoint functor theorem, objectwise initial-object form).
The Eilenberg–Moore forgetful functor strictly creates every limit existing in the base (The Eilenberg–Moore forgetful functor strictly creates every limit that exists in the base).
If and the indexing category are small and chosen limits of the pointwise diagrams exist, those choices form a limit in (For small source and index categories, chosen target limits and colimits compute the corresponding functor-category limits and colimits pointwise).
Proof
In , form , the coequalizer of , and , the coequalizer of . Their universal properties induce maps and characterized by and . Both and are epimorphisms.
The category is complete by [L4] and locally small because its hom-sets are subsets of those of . The walking parallel-pair category is finite and hence small. For any small limit diagram, the finitely many pointwise limits can be chosen without a choice axiom, so [L5] makes the parallel-pair functor category complete. The constant-diagram functor is continuous because these limits are pointwise.
Suppose has been constructed with and . Put , and choose as a coequalizer of . Define , , , and . Naturality of and the monad unit law give . Consequently and .
Let be any algebra homomorphism with . Factor it uniquely as . Precomposing with the epimorphism and using step 1.1 gives .
To justify the countable sequence of choices in step 2.1, encode each finite stage by a set. For a state , let be all valid successor codes of least possible von Neumann rank; it is a nonempty subset of some , hence a set. Starting with the code from step 1.1, recursively close under for finitely many steps and take the union over . Replacement and union make this closure a set on which the successor relation is entire. Applying [L2] to that set gives one compatible sequence of stages.
Suppose satisfies . The algebra law for shows that coequalizes and , so it factors uniquely through as a map with . The definitions in step 2.1 then give and , closing the induction.
Form the sequential colimits and , with injections and . The identities make the a map of the two sequential diagrams, hence induce . The compatible induce . The shifted identities and identify with .
The natural-number indexing category is filtered, so finitarity [L1] identifies the colimit in step 4.1 with . Make this identification, so and the induced comparison is the identity. Thus .
For every , naturality of and the definition of give . The colimit injections are jointly epimorphic, so .
The compatible induce . Passing the equations to the colimit gives , and compatibility at stage zero gives .
The successor coequalizer equations are . Passing these compatible equations to the filtered colimit gives because in step 5.1. Together with step 6.1, this makes a -algebra.
Passing and to the colimit gives , so is an algebra homomorphism; it coequalizes because does.
By steps 6.2 and 7.1, is an algebra homomorphism, and step 6.2 gives . Therefore the single algebra fork is a solution set for the constant-diagram functor at the given parallel pair: every algebra fork factors through it, without a uniqueness assertion.
Apply [L3] to using the singleton solution set from step 9.1 and the complete, locally small, and continuity properties proved in step 1.2. The resulting universal arrow is a left adjoint value for , hence a coequalizer of in . Since the pair was arbitrary, all coequalizers exist.
Depends on
- Finitary functors and finitary monads
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- Eilenberg–Moore category of a monad
- The Eilenberg–Moore forgetful functor strictly creates every limit that exists in the base
- For small source and index categories, chosen target limits and colimits compute the corresponding functor-category limits and colimits pointwise
- General adjoint functor theorem, objectwise initial-object form
- The solution-set condition for a functor, stated object by object
- Equalizers and coequalizers as limits and colimits of a parallel pair
- Small, locally small, and large categories
Used by
Dependency tree · two levels
31 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., proof of Theorem 5.6.12 (standard reference, not scraped)