Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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 Eilenberg–Moore forgetful functor strictly creates coequalizers of UT-split pairs

Statement

For every monad T on C, the Eilenberg–Moore forgetful functor UT:CTC strictly creates coequalizers of UT-split pairs.

Facts & Assumptions

Given: Algebra homomorphisms f,g:(A,a)(B,b) and a supplied split coequalizer q:BC of their underlying pair in C.

[L1]

The functor U strictly creates coequalizers of U-split pairs when every supplied splitting has a unique lift on the same apex and legs, and the lifted fork is a coequalizer (U-split pairs and ordinary or strict creation of their coequalizers).

[L2]

Every split coequalizer is a coequalizer and an absolute colimit (Every split coequalizer is a coequalizer and an absolute colimit).

Proof

technique · direct
1.1

By [L2], q, Tq, and T2q are coequalizers of the corresponding images of f,g. In particular each is an epimorphism, since every coequalizer is epic by its uniqueness clause.

L2given
2.1

Because f and g are algebra homomorphisms, qb:TBC coequalizes Tf and Tg. The universal property of Tq gives a unique c:TCC satisfying cTq=qb.

step 1.1construct
3.1

After precomposition with the epimorphism q, the unit equation cηC=1C is the unit law for b. After precomposition with the epimorphism T2q, the associativity equation cT(c)=cμC is the associativity law for b. Hence (C,c) is a T-algebra.

step 1.1step 2.1algebra
4.1

The defining equation cTq=qb says exactly that q:(B,b)(C,c) is an algebra homomorphism.

step 2.1step 3.1algebra
5.1

If r:(B,b)(D,d) is an algebra homomorphism with rf=rg, [L2] gives a unique underlying u:CD with uq=r. Precomposing uc and dT(u) with the epimorphism Tq gives the same map, so u is an algebra homomorphism and is the unique algebraic factorization.

step 4.1L2
6.1

Any algebra structure c on the supplied apex for which q is an algebra homomorphism satisfies cTq=qb=cTq, so c=c because Tq is epic. Together with step 5.1 this is the unique on-the-nose lift required by [L1].

step 2.1step 5.1L1

Depends on

Used by

Dependency tree · two levels

10 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