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.
Hyperbolicity is a quasi-isometry invariant of geodesic spaces
Statement
Assume the Axiom of Choice. If two geodesic metric spaces are quasi-isometric and one of them is hyperbolic, then so is the other.
Facts & Assumptions
Given: AC and a quasi-isometry between geodesic metric spaces and .
Under AC, a quasi-isometric embedding of geodesic spaces transports slimness from its target to its source, with an explicit bound. A quasi-isometry also has a controlled coarse inverse, so the implication works in both directions (Hyperbolicity is transported by a quasi isometry).
AC is used by [F1] for the Morse bound and construction of the controlled inverse (The Axiom of Choice).
Proof
Let be the given quasi-isometry. If is -slim, [F1] first extracts uniform quasi-isometric embedding constants for and then gives an explicit slimness constant for . The extraction uses the supplied coarse inverse and both bounded composite errors; the transport uses the two Hausdorff inclusions of Morse stability.
If instead is hyperbolic, [F1] gives a controlled quasi-isometric inverse . Applying the same transport assertion to makes hyperbolic. In the empty-space case the quasi-isometry convention forces both spaces empty and the claim is vacuous. Thus hyperbolicity is invariant in both directions.
Depends on
Used by
Dependency tree · two levels
10 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
- Clara Löh, Geometric Group Theory, Section 6.2.3 (standard reference, not scraped)
- Brian H. Bowditch, A course on geometric group theory, Section 2.2 (standard reference, not scraped)