Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Vertices and realized edges cover the unit-edge graph realization

Proved
RayBundle.GraphRealization.covered

by jawneeboy · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

geodesicsgraph-theorymetric-geometrymetric-graphs

Let TTT be a connected simple graph on a vertex type VVV, with an explicit edge enumeration e:N≃E(T)e:\mathbb N\simeq E(T)e:N≃E(T); in particular its edge set is countably infinite. Let ∣T∣e|T|_e∣T∣e​ be the unit-edge metric realization formed by successive isometric interval attachments and their metric inductive limit. Write ι:V→∣T∣e\iota:V\to|T|_eι:V→∣T∣e​ for its vertex map and ϵn:[0,1]→∣T∣e\epsilon_n:[0,1]\to|T|_eϵn​:[0,1]→∣T∣e​ for its nnnth edge map.

Every p∈∣T∣ep\in|T|_ep∈∣T∣e​ is either ι(v)\iota(v)ι(v) for some vertex vvv, or ϵn(t)\epsilon_n(t)ϵn​(t) for some n∈Nn\in\mathbb Nn∈N and t∈[0,1]t\in[0,1]t∈[0,1]. 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.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me