Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, p. 389 — a minimal T-join is the edge-disjoint union of |T|/2 paths pairing the vertices of T

Proved
MetricGenerators.ConnectedJoin.minimal_tjoin_paths

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

graph-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pathst-join

Let GGG be a connected finite graph, let T⊆V(G)T\subseteq V(G)T⊆V(G) have even cardinality, and let FFF be an inclusionwise minimal TTT-join of GGG. Put m=∣T∣/2m=|T|/2m=∣T∣/2. Then the vertices of TTT can be listed as 2m2m2m distinct vertices s1,t1,…,sm,tms_1,t_1,\dots,s_m,t_ms1​,t1​,…,sm​,tm​, and there are paths P1,…,PmP_1,\dots,P_mP1​,…,Pm​ in GGG, PiP_iPi​ joining sis_isi​ and tit_iti​, such that

F=E(P1)∪⋯∪E(Pm),E(Pi)∩E(Pj)=∅ (i≠j).F=E(P_1)\cup\dots\cup E(P_m),\qquad E(P_i)\cap E(P_j)=\emptyset\ (i\neq j).F=E(P1​)∪⋯∪E(Pm​),E(Pi​)∩E(Pj​)=∅ (i=j).

The paper records this fact at the start of §3 and uses it in the sufficiency half of Lemma 2, applied to a minimum TTT-join.

Formalization Note. "Minimal" is inclusionwise minimality and "disjoint" is edge-disjoint, as the paper restates it on p. 392. The pairing is encoded as an injective map from two copies of {1,…,m}\{1,\dots,m\}{1,…,m} to VVV whose image is TTT; the paths are Walks of GGG that are paths.

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

/-- **§3, p. 389 (unnumbered).** "It is useful to know and easy to check that a minimal T-join is
the disjoint union of |T|/2 paths pairing the vertices of T." (Sebő and Tannier, On Metric
Generators of Graphs, Math. Oper. Res. 29(2):383–393 (2004), DOI 10.1287/moor.1030.0070, p. 389.)

Let `G` be a connected graph, `T` a vertex set of even cardinality and `F` an inclusionwise
minimal `T`-join. With `m = |T|/2`, there are vertices `s i, t i` (`i < m`), all `2m` of them
distinct and together forming `T`, and paths `P i` of `G` from `s i` to `t i`, pairwise
edge-disjoint, whose edges together are exactly `F`.

**Formalization Note.** "Minimal" is inclusionwise minimality (`IsMinimalTJoin`); "disjoint" is
edge-disjoint (as p. 392 restates it: "J is the edge-disjoint union of m := |T|/2 paths"). The
pairing is the injective map `Sum.elim s t : Fin m ⊕ Fin m → V` with range `T`. -/
theorem minimal_tjoin_paths {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V)
    (hG : G.Connected) (T : Finset V) (hT : Even T.card) (F : Finset (Sym2 V))
    (hF : IsMinimalTJoin G T F) :
    ∃ (s t : Fin (T.card / 2) → V) (P : ∀ i, G.Walk (s i) (t i)),
      Function.Injective (Sum.elim s t) ∧
      Set.range (Sum.elim s t) = (↑T : Set V) ∧
      (∀ i, (P i).IsPath) ∧
      (∀ i j, i ≠ j → Disjoint (P i).edges.toFinset (P j).edges.toFinset) ∧
      Finset.univ.biUnion (fun i => (P i).edges.toFinset) = F := 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. 389, §3 (unnumbered)
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