Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2 — a connected T-join F is minimum iff it is a tree and μ_F = μ_G on V(F)

Proved
MetricGenerators.ConnectedJoin.lemma_2

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

graph-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1t-jointree-metric

Let GGG be a connected finite graph, T⊆V(G)T\subseteq V(G)T⊆V(G), and let FFF be a connected TTT-join of GGG. Then FFF is a minimum TTT-join if and only if

F is a treeandμF(x,y)=μG(x,y)for all x,y∈V(F),F\ \text{is a tree}\qquad\text{and}\qquad \mu_F(x,y)=\mu_G(x,y)\quad\text{for all }x,y\in V(F),F is a treeandμF​(x,y)=μG​(x,y)for all x,y∈V(F),

where μG\mu_GμG​ and μF\mu_FμF​ are the shortest-path distances in GGG and in the graph (V(F),F)(V(F),F)(V(F),F).

This is the link between TTT-joins and tree metrics: a connected minimum TTT-join is a tree embedded isometrically in GGG, and conversely. Theorem 6 is deduced from it.

Formalization Note. GGG connected is the paper's standing assumption. Connectivity and the tree property are those of (V(F),F)(V(F),F)(V(F),F). The evenness of ∣T∣|T|∣T∣ is not a separate hypothesis, since it follows from the existence of a TTT-join.

Preamble
import Mathlib
import Definitions.Def_MetricGenerators_ConnectedJoin_TJoin
Formal statement
namespace MetricGenerators.ConnectedJoin

/-- **Lemma 2** (p. 392). "A connected T-join F in a graph G is minimum if and only if it is a
tree, and for all x, y ∈ V(F): μ_F(x, y) = μ_G(x, y)." (Sebő and Tannier, On Metric Generators of
Graphs, Math. Oper. Res. 29(2):383–393 (2004), DOI 10.1287/moor.1030.0070, p. 392, Lemma 2.)

Let `G` be a connected graph and `F` a connected `T`-join of `G`. Then `F` is a minimum `T`-join
if and only if the graph `(V(F), F)` is a tree and the distance in `(V(F), F)` between any two
vertices of `V(F)` equals their distance in `G`.

**Formalization Note.** `G.Connected` is the paper's standing assumption (p. 383). Connectivity
and the tree property refer to the graph `(V(F), F)` (`IsConnectedEdgeSet`, `IsTreeEdgeSet`), and
μ_F is `edgeDist F` (the distance in `(V(F), F)` for vertices of `V(F)`). The evenness of `|T|` is
not a separate hypothesis: it follows from the existence of the `T`-join `F`. -/
theorem lemma_2 {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) (hG : G.Connected)
    (T : Finset V) (F : Finset (Sym2 V)) (hF : MetricGenerators.FewComponents.IsTJoin G T F) (hconn : IsConnectedEdgeSet F) :
    MetricGenerators.FewComponents.IsMinTJoin G T F ↔
      IsTreeEdgeSet F ∧
        ∀ x ∈ MetricGenerators.FewComponents.edgeSupport F, ∀ y ∈ MetricGenerators.FewComponents.edgeSupport F, edgeDist F x y = G.dist x y := by sorry

end MetricGenerators.ConnectedJoin
Source
Sebő and Tannier, On Metric Generators of Graphs, Math. Oper. Res. 29(2):383–393 (2004), DOI 10.1287/moor.1030.0070, p. 392, Lemma 2
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 2026

    Confirmed by the mission captain (proposal self-audit).

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