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 vertex set of a connected simple graph with its path metric is a -quasi-geodesic space
Statement
The vertex set of a connected simple graph with its path metric is a -quasi-geodesic space.
Facts & Assumptions
Given: The hypotheses of the Statement.
A -quasi-geodesic is a -quasi-isometric embedding of a closed real interval, and a space is -quasi-geodesic when every two of its points are joined by one (Quasi-geodesics and quasi-geodesic metric spaces).
The path metric of a connected simple graph assigns to two vertices the least length of a path joining them (The path metric of a connected simple graph).
The path metric of a connected simple graph is a metric on its vertex set (The path metric of a connected simple graph is a metric on its vertex set).
A geodesic of length in a metric space is an isometric embedding of the interval , and the space is geodesic when every two points are the endpoints of one (Geodesics and geodesic metric spaces).
A map is -coarse Lipschitz when , and an -quasi-isometric embedding when in addition (Coarse Lipschitz maps and quasi-isometric embeddings).
It is written and called the integer part, or floor, of . (Integer part: for every real there is exactly one integer with ).
Proof
Given two vertices, parametrise a path realising their distance by sending each integer point of to the corresponding vertex and each intermediate real to the nearer endpoint of its unit subinterval.
The distances so obtained differ from those of the interval by at most one, so the parametrisation is a -quasi-isometric embedding.
Hence every two vertices are joined by a -quasi-geodesic, so the space is -quasi-geodesic and not geodesic unless it is a single point.
Depends on
- The path metric of a connected simple graph
- The path metric of a connected simple graph is a metric on its vertex set
- Geodesics and geodesic metric spaces
- Coarse Lipschitz maps and quasi-isometric embeddings
- Quasi-geodesics and quasi-geodesic metric spaces
- Integer part: for every real $x$ there is exactly one integer $m$ with $m \le x < m + 1$
Used by
Dependency tree · two levels
27 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)