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.
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.
Depends on
Used by
- Over a cocomplete base, a monadic category is cocomplete exactly when it has coequalizers Proposition
- The Kleisli and Eilenberg–Moore universal properties are schematic Remark
- A distributive law makes the composite endofunctor a monad Theorem
- The cofree–forgetful co-Eilenberg–Moore adjunction induces the given comonad Theorem
- The comparison functor to the Eilenberg–Moore category exists and is unique Theorem
- Under dependent choice, a finitary monad on a complete cocomplete locally small category has complete and cocomplete algebras Theorem
- Under the ultrafilter lemma, compact Hausdorff spaces are monadic over sets Theorem
Dependency tree · two levels
7 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., Lemma 5.2.9 (standard reference, not scraped)
- B. Richter, From Categories to Homotopy Theory, Theorem 6.2.5 (standard reference, not scraped)