Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Every adjunction induces a monad on the domain of its left adjoint

Statement

Let F:C→D be left adjoint to G:D→C, with unit η:1C⇒GF and counit ε:FG⇒1D. Then

T:=GF,η:1C⇒T,μ:=GεF:T2⇒T

define a monad on C (Monad on a category).

Facts & Assumptions

Given: An adjunction F⊣G with unit η and counit ε as in Adjunction by unit, counit, and the triangle identities.

[L1]

The triangle identities are (εF)∘(Fη)=1F and (Gε)∘(ηG)=1G (Adjunction by unit, counit, and the triangle identities).

Proof

technique · direct
1.1given

Put T=GF and μ=GεF. Whiskering preserves naturality, so T is an endofunctor and η:1C⇒T and μ:T2⇒T are natural transformations.

2.1givenstep 1.1L1

At an object A, the two associativity composites are μA∘T(μA)=G(εFA∘FG(εFA)) and μA∘μTA=G(εFA∘εFGFA); naturality of ε at εFA:FGFA→FA identifies the expressions inside G, so μ∘Tμ=μ∘μT.

3.1step 1.1L1∎

Componentwise, μA∘ηTA=G(εFA)∘ηGFA=1GFA by the second triangle identity, while μA∘T(ηA)=G(εFA∘F(ηA))=1GFA by the first; hence both unit laws hold and (T,η,μ) is a monad.

Depends on

Used by

Dependency tree · two levels

6 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