Integer-distance spheres about graph vertices contain only vertices
ProvedRayBundle.GraphRealization.integer_distance_vertexgeodesicsgraph-theorymetric-geometrymetric-graphs
Let be a connected simple graph on a vertex type , with an explicit edge enumeration ; in particular its edge set is countably infinite. Let be the unit-edge metric realization formed by successive isometric interval attachments and their metric inductive limit. Write for its vertex map and for its th edge map.
If , , and satisfies , then for some vertex . This is the vertex-detection fact used when sampling a continuous geodesic ray at integer times.
Preamble
import Definitions.Def_RayBundle_UnitEdgeGraphGeometry universe u
Formal statement
theorem RayBundle.GraphRealization.integer_distance_vertex {V : Type*} (T : SimpleGraph V)
(hT : T.Connected) (e : ℕ ≃ T.edgeSet) (p : RayBundle.GraphRealization T hT e)
(v : V) (n : ℕ) (hn : dist p (RayBundle.GraphRealization.vertex T hT e v) = (n : ℝ)) :
∃ w, p = RayBundle.GraphRealization.vertex T hT e w := by sorry
Source
Standard unit-edge metric-graph convention: Nicholas Touikan, On geodesic ray bundles in hyperbolic groups, Proceedings of the American Mathematical Society 146 (2018), 4165–4173, Section 2. https://arxiv.org/abs/1706.01979 The present construction and supporting lemmas are proved in the supplied Lean development; these targets are not assigned numbered theorem attributions in that paper.