Alphabeta Math
TheoremStatement: AI-adaptedProof: Literature-sourcedprecheck 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 strictly creates every limit that exists in the base

Statement

For every monad T on C, the forgetful functor UT:CT→C strictly creates every limit that exists in C. No preservation hypothesis on T is required.

Facts & Assumptions

Given: A diagram D:J→CT with algebra structures aj:TUTDj→UTDj, and a limiting cone pj:L→UTDj in C.

[L1]

Strict creation requires a unique lifted limiting cone with exactly the supplied apex and legs (Preservation, reflection, and creation of limits and colimits; continuous and cocontinuous functors).

Proof

technique · direct
1.1L1L2

The maps aj∘T(pj):TL→UTDj form a cone because every arrow of D is an algebra homomorphism. By [L2] there is a unique ℓ:TL→L with pj∘ℓ=aj∘T(pj) for every j.

2.1step 1.1L2

After composition with every pj, the equations ℓ∘ηL=1L and ℓ∘T(ℓ)=ℓ∘μL become the corresponding algebra laws for aj by naturality; the limit legs are jointly monic by uniqueness in [L2], so both equations hold and (L,ℓ) is a T-algebra.

3.1step 1.1step 2.1L1∎

If a cone from an algebra (X,x) has underlying mediating arrow u:X→L, then composing u∘x and ℓ∘T(u) with every pj gives the same map because each cone leg is an algebra homomorphism; joint monicity makes u an algebra homomorphism. Its uniqueness and the uniqueness of ℓ follow from the base limit, giving exactly the strict lift required by [L1], including when J is empty.

Depends on

Used by

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