Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17
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 creates every colimit in the base that the monad and its square preserve

Statement

Let D:J→CT be a diagram of algebras whose underlying diagram has a colimit (Q,ij) in C. If both T and T2 preserve this colimit, then there is a unique algebra structure on Q making every ij an algebra homomorphism, and the resulting cocone is a colimit in CT. Thus UT creates every such colimit.

Facts & Assumptions

Given: The diagram, its structure maps aj, the base colimit (Q,ij), and preservation of that colimit by T and T2.

Proof

technique · direct
1.1givenL1

Since T preserves the colimit, the maps ij∘aj:TUTDj→Q induce a unique a:TQ→Q satisfying a∘T(ij)=ij∘aj for every j.

2.1step 1.1given

Precomposition with every ij proves a∘ηQ=1Q. Precomposition with every T2(ij) proves a∘T(a)=a∘μQ; these families are jointly epic because T and T2 preserve the colimit, so (Q,a) is an algebra and every ij is an algebra homomorphism.

3.1step 1.1step 2.1∎

Any algebra cocone has a unique underlying mediating arrow u:Q→X; precomposition with every T(ij) shows u∘a=x∘T(u), so u is automatically an algebra homomorphism. This proves the lifted universal property and the conditional creation claim.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

8 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