Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16
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-monoid functor is left adjoint to the underlying-set functor

Statement

The assignment X↦X∗ of the finite-word monoid extends to a functor (−)∗:Set→Mon and is left adjoint to the underlying-set functor U:Mon→Set.

Facts & Assumptions

Given: A set X and its finite-word monoid X∗.

[L1]

The one-letter map iX:X→X∗ is universal: every function X→U(M) extends uniquely to a monoid homomorphism X∗→M (Finite words satisfy the free-monoid universal property).

[L2]

Chosen objectwise universal arrows assemble uniquely into a left adjoint (Chosen objectwise universal arrows assemble uniquely into a left adjoint).

Proof

technique · direct
1.1L1construct

For a function a:X→Y, let a∗:X∗→Y∗ be the unique monoid homomorphism extending the one-letter function iYa.

1.2L1

Restriction to letters and the extension in [L1] are inverse, naturally identifying monoid homomorphisms X∗→M with functions X→U(M).

2.1step 1.1L1

Uniqueness in [L1] gives (1X)∗=1X∗ and (ba)∗=b∗a∗, since each pair agrees on all one-letter words. Thus (−)∗ is a functor and iX is natural.

3.1step 1.1step 2.1step 1.2L2∎

Therefore (X∗,iX) is a universal arrow from X to U, and [L2] gives (−)∗⊣U, including the empty-set case.

Depends on

Used by

Dependency tree · two levels

12 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