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.
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.
Depends on
Used by
- Composing with an adjunction that induces the identity monad on the nose does not change the induced monad Corollary
- Every adjunction induces a comonad on the codomain of its left adjoint Corollary
- The self-adjunction of the contravariant power-set functor induces the double-power-set monad Example
- The state monad threads a fixed state set through a computation Example
- A distributive law makes the composite endofunctor a monad Theorem
- For a unital ring R, the free-R-module monad on sets has left R-modules as its Eilenberg–Moore algebras Theorem
- The comparison functor to the Eilenberg–Moore category exists and is unique Theorem
- The free-group monad has groups as its Eilenberg–Moore algebras Theorem
- The free-monoid monad has monoids as its Eilenberg–Moore algebras Theorem
- The inclusion of a reflective full subcategory is monadic Theorem
- The Kleisli factorisation functor for an adjunction inducing a monad exists and is unique Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 9 results over 7 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- E. Riehl, Category Theory in Context, 2nd ed., Lemma 5.1.3 (standard reference, not scraped)
- B. Richter, From Categories to Homotopy Theory, Theorem 6.1.3 (standard reference, not scraped)