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.

Every monadic functor is conservative

Statement

Every monadic functor reflects isomorphisms; equivalently, every monadic functor is conservative (Conservative functor).

Facts & Assumptions

Given: A monad T, its algebra homomorphisms (Algebra and algebra homomorphism for a monad), a monadic functor with comparison equivalence as in Monadic and strictly monadic functors, and the fact that fully faithful functors reflect isomorphisms (Every fully faithful functor reflects isomorphisms).

Proof

technique · direct
1.1given

Let f:(A,a)→(B,b) be an algebra homomorphism whose underlying morphism has inverse g. From f∘a=b∘T(f), the inverse equations, and functoriality, one obtains g∘b=a∘T(g) by composing with f and cancelling it; hence g is an algebra homomorphism.

2.1step 1.1

Therefore the Eilenberg–Moore forgetful functor reflects isomorphisms: an underlying inverse is automatically an inverse inside the algebra category by step 1.1.

3.1step 2.1given∎

For a monadic U, its comparison K is an equivalence and hence fully faithful. If U(f)=UTK(f) is an isomorphism, step 2.1 makes K(f) an isomorphism, and full faithfulness reflects that isomorphism back to f; thus U is conservative.

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