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 of the finite-word monoid extends to a functor and is left adjoint to the underlying-set functor .
Facts & Assumptions
Given: A set and its finite-word monoid .
The one-letter map is universal: every function extends uniquely to a monoid homomorphism (Finite words satisfy the free-monoid universal property).
Chosen objectwise universal arrows assemble uniquely into a left adjoint (Chosen objectwise universal arrows assemble uniquely into a left adjoint).
Proof
For a function , let be the unique monoid homomorphism extending the one-letter function .
Restriction to letters and the extension in [L1] are inverse, naturally identifying monoid homomorphisms with functions .
Uniqueness in [L1] gives and , since each pair agrees on all one-letter words. Thus is a functor and is natural.
Therefore is a universal arrow from to , and [L2] gives , including the empty-set case.
Depends on
Used by
- FALSE: The Kleisli and Eilenberg–Moore categories are equivalent for every monad False statement
- Integer-valued finite formal sums of words form unital convolution rings Lemma
- Monoids and unital rings are strictly monadic over sets Theorem
- The free unital ring functor is left adjoint to the underlying-set functor Theorem
- The free-monoid monad has monoids as its Eilenberg–Moore algebras Theorem
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
- Emily Riehl, Category Theory in Context, 2nd ed., Example 4.1.10 (standard reference, not scraped)