Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.2 — cost at most optimum, degrees at most B + 1

Proved
BoundedDegreeST.PlusOne.theorem_1_2

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

iterative-roundinglinear-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1spanning-trees

For a finite simple undirected graph G=(V,E)G=(V,E)G=(V,E), arbitrary real edge costs cec_ece​, and integer upper bounds BvB_vBv​, suppose the bounded-degree spanning-tree LP is feasible. The Figure 4 algorithm started with no selected edges and degree constraints at every vertex has a terminating run, every run takes at most 2∣V∣−12|V|-12∣V∣−1 iterations, and every returned spanning tree TTT satisfies

deg⁡T(v)≤Bv+1(v∈V),c(T)≤∑e∈Ecexefor every LP-feasible x.\deg_T(v)\le B_v+1\quad(v\in V),\qquad c(T)\le\sum_{e\in E}c_e x_e\quad\text{for every LP-feasible }x.degT​(v)≤Bv​+1(v∈V),c(T)≤e∈E∑​ce​xe​for every LP-feasible x.

In particular, c(T)≤c(T0)c(T)\le c(T_0)c(T)≤c(T0​) for every spanning tree T0T_0T0​ satisfying all the original degree bounds, hence c(T)c(T)c(T) is at most the original optimum. This is the paper's (1,Bv+1)(1,B_v+1)(1,Bv​+1) approximation guarantee.

Formalization Note The goal uses LP-MBDCT with F=∅F=\varnothingF=∅ and W=VW=VW=V, which gives LP (1)–(5). The iteration bound represents the combinatorial part of polynomial time; LP solver complexity is outside the formal statement. Run existence prevents an empty return relation from making the guarantee vacuous.

Preamble
import Definitions.Def_BoundedDegreeST_PlusOne_Algorithm
Formal statement
namespace BoundedDegreeST.PlusOne

/-- Singh–Lau, Theorem 1.2, p. 661, via Figure 4 at `F = ∅`, `W = V`. -/
theorem theorem_1_2 {V : Type*} [Fintype V] [DecidableEq V]
    (E : Finset (Sym2 V)) (c : Sym2 V → ℝ) (B : V → ℤ)
    (hsimple : SimpleEdges E)
    (hfeasible : ∃ x, Feasible E B Finset.univ ∅ x) :
    (∃ T, Returns c (initial E B) T) ∧
    (∀ k, Chain c (initial E B) k →
      (k : ℤ) ≤ 2 * (Fintype.card V : ℤ) - 1) ∧
    (∀ T, Returns c (initial E B) T →
      T ⊆ E ∧ IsSpanningTree T ∧
      (∀ v : V, (degree T v : ℤ) ≤ B v + 1) ∧
      (∀ x, Feasible E B Finset.univ ∅ x →
        cost c T ≤ ∑ e ∈ E, c e * x e) ∧
      (∀ T₀ : Finset (Sym2 V), T₀ ⊆ E → IsSpanningTree T₀ →
        (∀ v : V, (degree T₀ v : ℤ) ≤ B v) →
        cost c T ≤ cost c T₀)) := by sorry
end BoundedDegreeST.PlusOne
Source
Singh, Lau, Approximating minimum bounded degree spanning trees to within one of optimal, STOC 2007, p. 661, Theorem 1.2; p. 662, Eqs. (1)–(5); p. 666, Figure 4
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