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 quotient map by a finite normal subgroup is a quasi-isometry of word metric spaces
Statement
The quotient map by a finite normal subgroup is a quasi-isometry of word metric spaces.
Facts & Assumptions
Given: The hypotheses of the Statement.
A group is finitely generated when some finite subset generates it (Finitely generated groups).
The word length is the least such that is a product of elements of (Word length of a group element with respect to a generating set).
Word length is defined on every element and satisfies , , and exactly when is the identity (Word length is defined on every element and satisfies the subadditivity, inversion and vanishing laws).
The word metric of with respect to is (The word metric of a group with respect to a generating set).
A map is -coarse Lipschitz when , and an -quasi-isometric embedding when in addition (Coarse Lipschitz maps and quasi-isometric embeddings).
A subset is coarsely dense when every point of the space is within a fixed distance of it, and a quasi-isometry is a coarse Lipschitz map admitting a coarse Lipschitz quasi-inverse (Coarsely dense subsets, quasi-inverses and quasi-isometries).
The quotient group, or factor group, has the left cosets (The quotient group and coset product ).
The subgroup is normal in when (Normal subgroup: invariance under conjugation).
A set is finite when for some . (The cardinality of a finite set).
Proof
The image of a finite generating set generates the quotient, so the quotient map does not increase word length and is one-Lipschitz.
Let , which exists because is finite. For each coset , choose a representative of minimal word length in that coset, breaking ties lexicographically in the fixed finite alphabet ; then the quotient map satisfies . If with , then , so Chaining along a shortest quotient expression gives , so is Lipschitz.
For every , the elements and lie in the same coset, so and therefore . Thus and is at bounded distance from . Therefore is a quasi-isometry with quasi-inverse .
Depends on
- Finitely generated groups
- Word length of a group element with respect to a generating set
- Word length is defined on every element and satisfies the subadditivity, inversion and vanishing laws
- The word metric of a group with respect to a generating set
- Coarse Lipschitz maps and quasi-isometric embeddings
- Coarsely dense subsets, quasi-inverses and quasi-isometries
- The quotient group $G/N$ and coset product $(gN)(hN)=ghN$
- Normal subgroup: invariance under conjugation
- The cardinality $\lvert A\rvert$ of a finite set
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
29 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. Loh, Geometric Group Theory: An Introduction (2015 course version), 264 pp. (standard reference, not scraped)
- C. Drutu and M. Kapovich, Geometric Group Theory (with an appendix by B. Nica), 837 pp. (standard reference, not scraped)