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.
-split pairs and ordinary or strict creation of their coequalizers
Definition
Let be a functor. A parallel pair in is -split when its image under extends to a split coequalizer diagram in (Split coequalizer diagrams).
The functor creates coequalizers of -split pairs when each chosen split coequalizer of and is isomorphic, as a coequalizer diagram, to the image under of a coequalizer of and , and every lifted fork whose image is a coequalizer is itself a coequalizer. This is ordinary isomorphism-invariant creation in the sense of Preservation, reflection, and creation of limits and colimits; continuous and cocontinuous functors.
The functor strictly creates coequalizers of -split pairs when every supplied splitting has a unique lift on the same apex and legs, and the lifted fork is a coequalizer. Strict creation therefore specifies the lifted object and structure on the nose, rather than only up to isomorphism.
Depends on
Used by
- FALSE: every U-split pair is split in the domain False statement
- Supplied created canonical presentations give a quasi-inverse to the comparison functor Lemma
- The underlying-set functor on unital rings strictly creates split coequalizers Lemma
- Beck's monadicity theorem in data-supplied form Theorem
- Strict Beck monadicity theorem Theorem
- The Eilenberg–Moore forgetful functor strictly creates coequalizers of U^T-split pairs Theorem
Dependency tree · two levels
6 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., Definition 5.4.8 (standard reference, not scraped)