Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24
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.

Modules over a fixed unital ring are strictly monadic over sets

Statement

For every fixed unital ring R, the underlying-set functor U:R-ModSet is strictly monadic, and hence monadic.

Facts & Assumptions

Given: A fixed unital ring R and the free-left-R-module adjunction.

[L1]

The Eilenberg–Moore category of the free-left-R-module monad is isomorphic over Set to the category of left R-modules (For a unital ring R, the free-R-module monad on sets has left R-modules as its Eilenberg–Moore algebras).

[L2]

A functor is strictly monadic when its comparison functor is an isomorphism of categories (Monadic and strictly monadic functors).

[L3]

The comparison functor is K(d)=(Ud,Uεd) and acts on morphisms by K(h)=U(h) (The comparison functor to the Eilenberg–Moore category exists and is unique).

Proof

technique · direct
1.1

The isomorphism in [L1] sends a module to its underlying set with its finite-linear-combination algebra structure and acts identically on underlying functions. By the comparison formula in [L3], it is the comparison for the free-module adjunction, including for the zero ring and zero module.

L1L3construct
2.1

The comparison is therefore an isomorphism over Set, so the underlying-set functor is strictly monadic by [L2].

step 1.1L2

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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