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.
FALSE: every -split pair is split in the domain
Statement
False claim: if a parallel pair in is -split for a functor , then that pair is split in .
Facts & Assumptions
Given: The Eilenberg–Moore forgetful functor for the free-monoid monad.
A parallel pair is -split when its image under extends to a split coequalizer diagram (-split pairs and ordinary or strict creation of their coequalizers).
The underlying canonical presentation is split in the base, but its canonical splittings need not be algebra homomorphisms (The canonical algebra presentation is split in the base, but its canonical splittings need not be algebra homomorphisms).
Refutation
Take the canonical presentation of the two-element monoid with as an algebra for the free-monoid monad. By [L1] and [L2], its underlying pair is -split.
If the coequalizer evaluation had a monoid-homomorphic section , then because . The only idempotent word in a free monoid is the empty word, since a nonempty word has positive length and its square has twice that length. But evaluation of the empty word is , not , so no such section exists.
Hence this pair becomes split after applying but is not split in the algebra category. The -split condition therefore does not imply a splitting in the domain.
Depends on
Used by
Nothing in the library uses this result yet.
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., Example 5.4.7 (standard reference, not scraped)