Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.3 — a basic solution is the unique solution of a laminar family of tight sets and tight lower/upper degree rows

Proved
BoundedDegreeST.LowerUpper.lemma_5_3

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 there are TU⊆UT_U\subseteq UTU​⊆U, TW⊆WT_W\subseteq WTW​⊆W and a nonempty laminar family L⊆I(F)\mathcal L\subseteq\mathcal I(F)L⊆I(F) of nonempty sets such that x∗x^*x∗ restricted to E∗E^*E∗ is the unique solution in RE∗\mathbb R^{E^*}RE∗ of

x(δ(v))=Av (v∈TU),x(δ(v))=Bv (v∈TW),x(E(S))=∣S∣−∣F(S)∣−1 (S∈L),x(\delta(v))=A_v\ (v\in T_U),\qquad x(\delta(v))=B_v\ (v\in T_W),\qquad x(E(S))=|S|-|F(S)|-1\ (S\in\mathcal L),x(δ(v))=Av​ (v∈TU​),x(δ(v))=Bv​ (v∈TW​),x(E(S))=∣S∣−∣F(S)∣−1 (S∈L),

the vectors {χE(S):S∈L}∪{χδ(v):v∈TU}∪{χδ(v):v∈TW}\{\chi_{E(S)}:S\in\mathcal L\}\cup\{\chi_{\delta(v)}:v\in T_U\}\cup\{\chi_{\delta(v)}:v\in T_W\}{χE(S)​:S∈L}∪{χδ(v)​:v∈TU​}∪{χδ(v)​:v∈TW​} are linearly independent, and ∣E∗∣=∣L∣+∣TU∣+∣TW∣|E^*|=|\mathcal L|+|T_U|+|T_W|∣E∗∣=∣L∣+∣TU​∣+∣TW​∣.

This is the structural description of extreme points on which the counting argument of §5.1 rests.

Formalization Note The hypothesis that FFF is not a spanning tree is implicit in the paper (the lemma is applied after Step 1 has not returned); without it E∗=∅E^*=\varnothingE∗=∅ and no nonempty L\mathcal LL need exist. The vectors live in RE∗\mathbb R^{E^*}RE∗ and are indexed by L⊔TU⊔TW\mathcal L\sqcup T_U\sqcup T_WL⊔TU​⊔TW​.

Preamble
import Definitions.Def_BoundedDegreeST_LowerUpper_LP
Formal statement
namespace BoundedDegreeST.LowerUpper

/-- Singh–Lau, Lemma 5.3, p. 668: a basic feasible solution of
LP-MBDCT(G, 𝓐, 𝓑, U, W, F) is the unique solution of a linearly independent
system of tight rows given by `T_U ⊆ U`, `T_W ⊆ W` and a nonempty laminar
family `𝓛 ⊆ 𝓘(F)`, with `|E*| = |𝓛| + |T_U| + |T_W|`. The hypothesis that `F`
is not a spanning tree is implicit in the paper (Step 1 has not returned). -/
theorem lemma_5_3 {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) :
    ∃ (TU TW : Finset V) (L : Finset (Finset V)),
      DefinesBasis E A B U W F x L TU TW := 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.3
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