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: the same delta works after every finite change of generating set
Statement
False claim: once a finitely generated group is hyperbolic, one numerical slimness constant works for the Cayley graph of every finite generating set.
Facts & Assumptions
Given: The free group and, for each integer , the generating set .
Hyperbolicity is independent of the generating set, but only up to quasi-isometry (Hyperbolicity of a finitely generated group is independent of the finite generating set).
In the Cayley graph of , the vertices , , and form a geodesic triangle with side lengths , , and .
Refutation
The generating set gives a tree Cayley graph, so is -hyperbolic for that choice.
Let , and choose . By [A1], the side from to is geodesic in the Cayley graph of . Write . Any word from to has abelianization ; using the generator once leaves and therefore still needs at least letters, while using it zero times needs at least letters. Hence , so the distance from to the one-edge side is at least . Its distance to the side is . So this geodesic triangle is not -slim.
Since was arbitrary, no single constant works for all finite generating sets of . The theorem [L1] preserves only existence of some constant for each generating set separately. Therefore the claim is false.
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
- Brian H. Bowditch, A course on geometric group theory, Section 2.2 (standard reference, not scraped)