Alphabeta Math
TheoremStatement: AI-adaptedProof: Literature-sourcedSession-authored (Fable 5 assisted)precheck 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 free-group monad has groups as its Eilenberg–Moore algebras

Statement

The monad on Set induced by the free-group adjunction sends a set to the underlying set of its free group. Its Eilenberg–Moore category is isomorphic over Set to the category of groups.

Facts & Assumptions

Given: The free-group adjunction between sets and groups.

[L1]

The free-group functor is left adjoint to the underlying-set functor (The free-group functor is left adjoint to the underlying-set functor).

[L2]

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

[L3]

A group has associative multiplication, an identity, and inverses (Group and abelian group).

Proof

technique · direct
1.1

By [L1]–[L2], the monad sends X to the underlying set of the free group F(X), its unit inserts generators, and its multiplication evaluates a reduced word whose letters are themselves reduced words. Every group H gives an algebra F(UH)UH by word evaluation.

L1L2
2.1

Conversely, from an algebra a:UF(X)X, define the product, identity, and inverse by evaluating the free-group words xy, 1, and x1. The algebra unit law fixes generators, while the multiplication law identifies evaluation after substitution with direct evaluation; applying it to the standard group-word identities gives all axioms in [L3].

L3step 1.1
3.1

An algebra homomorphism commutes with word evaluation and therefore preserves product, identity, and inverse. Conversely a group homomorphism preserves every group word and hence is an algebra homomorphism. The two constructions are inverse over Set.

L3step 1.1step 2.1

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 33 results over 13 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources