Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24
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 canonical algebra presentation is split in the base, but its canonical splittings need not be algebra homomorphisms

Statement

For every T-algebra (A,a), the underlying canonical presentation

T2AT(a)μATAaA

is a split coequalizer in C, with t=ηTA:TAT2A and s=ηA:ATA. These canonical splitting maps need not be algebra homomorphisms, so the presentation need not be split in CT.

Facts & Assumptions

Given: A monad (T,η,μ) and a T-algebra (A,a).

[L1]

Every T-algebra (A,a) is the coequalizer in CT of the canonical pair of free algebras T(a),μA:T2ATA (Every algebra is the coequalizer of its canonical pair of free algebras).

[L2]

A split coequalizer diagram has maps f,g:xy, h:yz, t:yx, and s:zy satisfying hf=hg, hs=1z, gt=1y, and ft=sh (Split coequalizer diagrams).

[L3]

The free-monoid monad inserts letters as one-letter words and flattens words of words by concatenation; its Eilenberg–Moore category is isomorphic over Set to the category of monoids (The free-monoid monad has monoids as its Eilenberg–Moore algebras).

Proof

technique · direct
1.1

The algebra law gives aT(a)=aμA and aηA=1A. The monad unit law gives μAηTA=1TA, while naturality of η gives T(a)ηTA=ηAa. These are exactly the four equations of [L2] for t=ηTA and s=ηA.

L1L2algebra
1.2

For the free-monoid monad, take the monoid M={1,e} with e2=e. On the two-letter word [e,e], the composite ηMa first multiplies and gives the one-letter word [e], whereas μMT(ηM) gives the two-letter word [e,e].

L3construct
2.1

Therefore the underlying canonical presentation is split in C.

step 1.1L2
2.2

The equality ηMa=μMT(ηM) is precisely the algebra-homomorphism equation for ηM:(M,a)(TM,μM), and step 1.2 shows it fails.

step 1.2L3algebra
2.3

For that same algebra no algebra section exists at all. Under the isomorphism over Set of [L3], an algebra map s:(M,a)(TM,μM) with as=1M is a monoid homomorphism σ from M to the free monoid on the set M whose composite with word evaluation is the identity. Concatenation adds word lengths, so w2=w forces w=0 and the empty word is the only idempotent of that free monoid; since e2=e in M, σ(e) is the empty word and evaluates to 1e. Hence the presentation of (M,a) is not split in CT.

step 1.2L3algebra
3.1

Thus the canonical splittings always exist in the base by step 2.1, the canonical ones need not lift to algebra homomorphisms by step 2.2, and by step 2.3 the presentation itself need not be split in CT. No failure is asserted for every monad or every algebra.

step 2.1step 2.2step 2.3

Depends on

Used by

Dependency tree · two levels

11 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