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.
A free group of rank at least two has subgroups of every finite rank
Statement
If is a free group of rank at least , then for every integer there is a subgroup of of rank .
Facts & Assumptions
Given: A free group of rank at least .
A free basis is the generating subset appearing in the universal property of a free group (A free basis of a group).
Finite rank means cardinality of a finite free basis (The rank of a free group admitting a finite basis).
A subgroup of index in a rank-two free group has rank (The Schreier index-rank formula).
Proof
Choose a free basis of with at least two elements, and fix distinct . Let . For any group and any function , extend to a function on by sending every basis element outside to . The universal property in [L1] then gives a unique homomorphism , whose restriction to extends . Hence is a free basis of , so [L2] gives .
For , the cyclic subgroup has free basis . Now assume . Because is free on , there is a surjective homomorphism with and . Let . Then , so [L3] gives .
The subgroup handles , and the subgroups handle every . Therefore has subgroups of every finite rank.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
7 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
- C. Löh, Geometric Group Theory: An Introduction (2015 course version) (standard reference, not scraped)
- J. S. Milne, Group Theory, Version 4.01 (standard reference, not scraped)