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 and free-module functor
Example
Free groups and free left -modules vary functorially with their sets of generators.
Facts & Assumptions
Given: A unital ring and sets with functions between them.
Functors preserve identities and composition (Covariant functor, identity functor, composite functor, and contravariant functor), and the relevant source and target categories exist (Sets and functions form the large locally small category , Groups and group homomorphisms form the large locally small category , Left modules over a fixed ring and module homomorphisms form the large locally small category ).
The reduced-word group on has the free-group universal property (Free group on a set of generators, Reduced words form the free group on an alphabet).
A free module has a basis, and finite sums in its additive commutative monoid are defined and invariant under reindexing (Generated submodule, cyclic and finitely generated modules, module basis and free module, A finite sum in a commutative monoid indexed by an arbitrary finite set).
A finite sum over a finite index set in a commutative monoid is well defined and independent of the enumeration, and reindexes along a bijection (A finite sum in a commutative monoid indexed by an arbitrary finite set, Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule).
Verification
For a function , the composite extends uniquely by [L2] to a homomorphism .
Construct explicitly, since [L3] says only what it means for a module to be free and does not build one: let be the set of functions whose support is finite, with pointwise addition and scalar multiplication. Both operations preserve finite support because and , so is a left -module, and the family with and elsewhere is a basis: every is the finite sum , and a vanishing finite combination has every coefficient zero by evaluating at each index. So is free in the sense of [L3]. Now sends to the family ; the index set is finite because it lies in , which is what [L4] requires, whereas itself may be infinite. The result again has finite support, contained in , and is additive and -linear because each coefficient is a finite sum of the corresponding coefficients of . On basis elements it sends to .
Both maps assigned to fix every generator. The uniqueness of the free extensions therefore gives and .
For , the maps and agree on every generator. The module maps and likewise send to ; finite-sum reindexing gives the same equality in coefficient form.
Hence and , with the maps above, define functors and .
Depends on
- A finite sum in a commutative monoid indexed by an arbitrary finite set
- Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule
- Covariant functor, identity functor, composite functor, and contravariant functor
- Sets and functions form the large locally small category $\mathbf{Set}$
- Groups and group homomorphisms form the large locally small category $\mathbf{Grp}$
- Left modules over a fixed ring and module homomorphisms form the large locally small category $R\text{-}\mathbf{Mod}$
- Free group on a set of generators
- Reduced words form the free group on an alphabet
- Generated submodule, cyclic and finitely generated modules, module basis and free module
- A finite sum in a commutative monoid indexed by an arbitrary finite set
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 81 results over 17 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
- Emily Riehl, Category Theory in Context, Examples 2.1.3 and 4.5.2 (standard reference, not scraped)