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.
FALSE: any two infinite finitely generated groups are quasi-isometric
Statement refuted
any two infinite finitely generated groups are quasi-isometric.
Facts & Assumptions
Given: The proposed claim together with the witness named in the Statement refuted.
A finitely generated group is quasi-isometric to a metric space when its word metric for some, equivalently every, finite generating set is (The quasi-isometry type of a finitely generated group).
The word metric of with respect to is (The word metric of a group with respect to a generating set).
Balls of a word metric are finite if and only if the generating set is finite (Balls of a word metric are finite if and only if the generating set is finite).
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).
is the open ball, the closed ball and the sphere of centre and radius . The radius is always a strictly positive real; a ball of radius or of negative radius is never written in this library. (Open ball, closed ball and sphere in a metric space).
A free group on a set is a group together with a map such that, for every group and every function , there is a unique group homomorphism satisfying (Free group on a set of generators).
A set is finite when for some . (The cardinality of a finite set).
A map is -coarse Lipschitz when , and an -quasi-isometric embedding satisfies in addition (Coarse Lipschitz maps and quasi-isometric embeddings).
In a free group with respect to a free basis, word length is reduced-word length (With respect to a free basis, the word length of an element is the length of its reduced word).
For every real number there is a larger natural number (Every complete ordered field is Archimedean).
Refutation
The claim asserts a single quasi-isometry class for all infinite finitely generated groups.
For each integer , the open ball of radius in the integers has elements. In the free group , the positive words of length in the letters are distinct reduced words, so the corresponding ball has at least elements.
Suppose there were a quasi-isometry . By [L3] choose a coarse Lipschitz quasi-inverse , coarse-Lipschitz constants for , and a bound with for every . If , then , so every fibre lies in the open ball . By [L1], left multiplication by bijects that ball with , so every fibre has at most elements by [L2]. Moreover, if then , so has at most elements. Hence . But for by induction, while . By [L9] choose a natural so large that and ; then , contradicting the displayed bound. Thus and are not quasi-isometric.
Depends on
- The word metric of a group with respect to a generating set
- Balls of a word metric are finite if and only if the generating set is finite
- Coarse Lipschitz maps and quasi-isometric embeddings
- Coarsely dense subsets, quasi-inverses and quasi-isometries
- The quasi-isometry type of a finitely generated group
- Free group on a set of generators
- With respect to a free basis, the word length of an element is the length of its reduced word
- Open ball, closed ball and sphere in a metric space
- The cardinality $\lvert A\rvert$ of a finite set
- Every complete ordered field is Archimedean
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
43 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)