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.
Taking itself as a generating set gives a word metric of diameter one, not bilipschitz equivalent to the standard one
Statement refuted
The comparison theorem for word metrics remains true for arbitrary generating sets.
Facts & Assumptions
Given: The proposed claim together with the witness named in the Statement refuted.
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).
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).
The identity map between the word metrics of two finite generating sets of a group is a bilipschitz equivalence (The identity map between the word metrics of two finite generating sets is a bilipschitz equivalence).
Bounded subset. is bounded if or there are and a real with . (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space).
Counterexample
Taking the whole group of integers as generating set gives every nonzero integer word length one.
So that word metric has diameter one, while the metric for the generating set is unbounded: the distance from to is . Its individual balls are finite, as [L2] requires, but their radii are not bounded uniformly.
The two are therefore not bilipschitz equivalent; the failing hypothesis of the comparison theorem is the finiteness used to take a maximum over the symmetrised set.
Depends on
- Word length of a group element with respect to a generating set
- 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
- The identity map between the word metrics of two finite generating sets is a bilipschitz equivalence
- Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space
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)