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.
Free groups are residually finite
Statement
Free groups are residually finite.
Facts & Assumptions
Given: A free group and a nonidentity element .
The finite residual is trivial exactly when every nonidentity element is omitted by some finite-index normal subgroup (The finite residual is the intersection of the finite-index normal subgroups, and a group is residually finite when that intersection is trivial).
Every nontrivial element of a free group is conjugate to a cyclically reduced word, and cyclic reduction preserves triviality (Every nonempty reduced word has the form with nonempty and cyclically reduced, Cyclically reduced words, Reduced words form the free group on an alphabet, Free groups on the same set are uniquely isomorphic compatibly with their generators).
Proof
By [L1], replace by a conjugate and assume it is represented by a nontrivial cyclically reduced word in finitely many letters. Build a finite pointed labelled graph with distinct vertices and a distinguished path from to labelled . Because is reduced, these prescribed edges define partial injective transitions. Complete each partial transition to a permutation of the finite vertex set, so every vertex has exactly one incoming and one outgoing edge of each used label.
Reading words from gives an action of the free group on the finite vertex set. The word sends to the distinct vertex . Therefore the induced homomorphism does not kill .
The kernel of that finite permutation action has finite index and omits . Since was arbitrary, [F1] shows that the finite residual is trivial. Hence free groups are residually finite.
Depends on
- The finite residual is the intersection of the finite-index normal subgroups, and a group is residually finite when that intersection is trivial
- Reduced words form the free group on an alphabet
- Free groups on the same set are uniquely isomorphic compatibly with their generators
- Cyclically reduced words
- Every nonempty reduced word has the form $tct^{-1}$ with $c$ nonempty and cyclically reduced
Used by
Dependency tree · two levels
13 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
- Brian Osserman, Math 6112 notes on inverse limits and profinite groups (standard reference, not scraped)
- H. W. Lenstra, Profinite groups and Galois groups (standard reference, not scraped)