Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.1 — a basic solution has an edge with x*_e = 1 or a vertex v ∈ U ∪ W with deg_{E*}(v) = 2

Proved
BoundedDegreeST.LowerUpper.lemma_5_1

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

basic-solutionsiterative-roundingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1spanning-trees

Let G=(V,E)G=(V,E)G=(V,E) be a finite simple graph, FFF a forest on VVV edge-disjoint from EEE that is not a spanning tree, and x∗x^*x∗ a basic feasible solution of LP-MBDCT(G,A,B,U,W,F)(G,\mathcal A,\mathcal B,U,W,F)(G,A,B,U,W,F) with support E∗E^*E∗. Then at least one of the following holds:

  1. there is an edge eee with xe∗=1x^*_e=1xe∗​=1;
  2. there is a vertex v∈U∪Wv\in U\cup Wv∈U∪W with deg⁡E∗(v)=2\deg_{E^*}(v)=2degE∗​(v)=2.
(∃e∈E: xe∗=1)  ∨  (∃v∈U∪W: deg⁡E∗(v)=2).(\exists e\in E:\ x^*_e=1)\ \ \lor\ \ (\exists v\in U\cup W:\ \deg_{E^*}(v)=2).(∃e∈E: xe∗​=1)  ∨  (∃v∈U∪W: degE∗​(v)=2).

This is the key lemma that makes every iteration of MBDCT Algorithm 2 progress: it either fixes an edge or removes a degree constraint.

Formalization Note The hypothesis that FFF is not a spanning tree is implicit in the paper (Step 1 has not returned). Degree bounds are integers.

Preamble
import Definitions.Def_BoundedDegreeST_LowerUpper_LP
Formal statement
namespace BoundedDegreeST.LowerUpper

/-- Singh–Lau, Lemma 5.1, p. 668: a basic feasible solution `x*` of
LP-MBDCT(G, 𝓐, 𝓑, U, W, F) with support `E*` has an edge `e` with `x*_e = 1`,
or a vertex `v ∈ U ∪ W` with `deg_{E*}(v) = 2`. The hypothesis that `F` is not
a spanning tree is implicit in the paper (Step 1 has not returned). -/
theorem lemma_5_1 {V : Type*} [Fintype V] [DecidableEq V]
    (E F : Finset (Sym2 V)) (A B : V → ℤ) (U W : Finset V) (x : Sym2 V → ℝ)
    (hE : BoundedDegreeST.PlusOne.SimpleEdges E) (hF : BoundedDegreeST.PlusOne.IsForest F) (hEF : Disjoint E F)
    (hbasic : Basic E A B U W F x) (hnotree : ¬ BoundedDegreeST.PlusOne.IsSpanningTree F) :
    (∃ e ∈ E, x e = 1) ∨ (∃ v ∈ U ∪ W, degree (support E x) v = 2) := by sorry

end BoundedDegreeST.LowerUpper
Source
Singh, Lau, Approximating minimum bounded degree spanning trees to within one of optimal, STOC 2007, p. 668, Lemma 5.1
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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