Alphabeta Math
TheoremStatement: Literature-sourcedProof: Literature-sourcedprecheck passaudited 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 free–forgetful Eilenberg–Moore adjunction induces the given monad

Statement

For a monad (T,η,μ) on C, the assignment A↦(TA,μA) defines a functor FT:C→CT left adjoint to the forgetful functor UT:CT→C. The monad induced by FT⊣UT is (T,η,μ) on the nose.

Facts & Assumptions

Given: A monad (T,η,μ), its Eilenberg–Moore category and forgetful functor (Eilenberg–Moore category of a monad), and its free algebras (Free algebra for a monad).

Proof

technique · direct
1.1given

Define FT(A)=(TA,μA) and FT(f)=T(f). Naturality of μ gives T(f)∘μA=μB∘T2(f), so T(f) is an algebra homomorphism; the functor laws follow from those of T.

2.1step 1.1given

At an algebra (A,a) define the counit component ϵ(A,a):=a:(TA,μA)→(A,a); the algebra associativity law makes it an algebra homomorphism and the homomorphism equation makes these components natural. The equations a∘ηA=1A and μA∘T(ηA)=1TA are the two triangle identities, so FT⊣UT.

3.1step 1.1step 2.1∎

The composite UTFT equals T, the adjunction unit is η, and UTϵFT has component ϵ(TA,μA)=μA; hence the induced multiplication is μ and the induced monad is the given one on the nose.

Depends on

Used by

Dependency tree · two levels

7 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