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 functor is left adjoint to the underlying-set functor
Statement
Choosing a free group on every set defines a functor , and
where is the underlying-set functor. The adjunction bijection sends a group homomorphism to the function .
Facts & Assumptions
Given: A chosen free group for every set .
A free group on has the property that every function extends uniquely to a homomorphism with (Free group on a set of generators).
Two free groups on the same set are uniquely isomorphic by an isomorphism preserving the generator maps (Free groups on the same set are uniquely isomorphic compatibly with their generators).
Groups and group homomorphisms form the locally small category (Groups and group homomorphisms form the large locally small category ).
Chosen objectwise universal arrows assemble uniquely into a left adjoint (Chosen objectwise universal arrows assemble uniquely into a left adjoint).
Proof
For a function , apply [F1] to and define as its unique extending homomorphism.
For each , restriction along and extension by [F1] are inverse maps between and .
Uniqueness in [F1] gives and , since both sides agree with the relevant generator map. Thus is a functor and is natural.
Equivalently, is a universal arrow from to , so [L1] gives and the asserted natural bijection.
For , [F1] says is initial in , so the same construction applies. By [F2], replacing any chosen free-group model changes only by the unique generator-preserving isomorphism.
Depends on
Used by
- GAFT recovers the published free-group adjunction, and the comma-initial criterion the abelianisation adjunction Corollary
- A Kan extension computing the free-group functor Example
- The comparison functor for the free-group adjunction Example
- The unit inserts generators as one-letter words and the counit evaluates words in the free-group adjunction Example
- Every functor with a left adjoint also has a right adjoint False statement
- Left adjoints preserve limits False statement
- Groups are strictly monadic over sets Theorem
- Normal-subgroup quotients of a fixed free group give a canonical solution set for the underlying-set functor on groups Theorem
- The free-group monad has groups as its Eilenberg–Moore algebras Theorem
Dependency tree · two levels
14 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)
- Tom Leinster, Basic Category Theory, Example 2.1.3 (standard reference, not scraped)