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 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.
Depends on
- Monadic and strictly monadic functors
- The Eilenberg–Moore forgetful functor strictly creates every limit that exists in the base
- Set has all small limits, realized as compatible tuples in a set-indexed product
- Equivalences preserve, reflect, and create limits and colimits in the isomorphism-invariant sense
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 40 results over 14 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., Corollary 5.6.7 (standard reference, not scraped)