Vertices and realized edges cover the unit-edge graph realization
ProvedRayBundle.GraphRealization.coveredgeodesicsgraph-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.
Every is either for some vertex , or for some and . The inductive limit here is taken without a metric completion.
Preamble
import Definitions.Def_RayBundle_UnitEdgeGraphGeometry universe u
Formal statement
theorem RayBundle.GraphRealization.covered {V : Type u} (T : SimpleGraph V)
(hT : T.Connected) (e : ℕ ≃ T.edgeSet) (p : RayBundle.GraphRealization T hT e) :
(∃ v, p = RayBundle.GraphRealization.vertex T hT e v) ∨ ∃ n t, p = RayBundle.GraphRealization.edge T hT e n t := 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.