Every point of a unit-edge realization lies within one half of a vertex
ProvedRayBundle.GraphRealization.near_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.
For every , there is a vertex with
This is a uniform proximity bound for the vertex image.
Preamble
import Definitions.Def_RayBundle_UnitEdgeGraphGeometry universe u
Formal statement
theorem RayBundle.GraphRealization.near_vertex {V : Type u} (T : SimpleGraph V)
(hT : T.Connected) (e : ℕ ≃ T.edgeSet) (p : RayBundle.GraphRealization T hT e) :
∃ v, dist p (RayBundle.GraphRealization.vertex T hT e v) ≤ (1 / 2 : ℝ) := 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.