Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim 5.8 β€” if S ∈ 𝓛 has r members then x*(D(S)) = r βˆ’ 1

Proved
BoundedDegreeST.LowerUpper.claim_5_8

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

counting-argumentiterative-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, xβˆ—x^*xβˆ— a 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βˆ—, and (L,TU,TW)(\mathcal L,T_U,T_W)(L,TU​,TW​) as in the conclusion of Lemma 5.3. For S∈LS\in\mathcal LS∈L, the members of SSS are its children in the forest of L\mathcal LL and the supernodes contained in SSS but in no child, and D(S)D(S)D(S) is the set of support edges joining two different members. If SSS has rrr members, then

xβˆ—(D(S))=rβˆ’1.x^*(D(S)) = r-1 .xβˆ—(D(S))=rβˆ’1.

The identity is what forces at least three fractional edges between the members when r=3r=3r=3 (case 2 of Lemma 5.6) and integrality of a single edge when r=2r=2r=2 (case 3).

Formalization Note Only feasibility, the forest property of FFF and the conclusion of Lemma 5.3 are assumed, which is all the paper's proof uses. The paper's proof writes ∣S∩F∣|S\cap F|∣S∩F∣ for ∣F(S)∣|F(S)|∣F(S)∣. rrr is the cardinality of the set of members, and the identity is stated in R\mathbb RR.

Preamble
import Definitions.Def_BoundedDegreeST_LowerUpper_Tokens
Formal statement
namespace BoundedDegreeST.LowerUpper

/-- Singh–Lau, Claim 5.8, p. 669: if `x` is feasible, `(𝓛, T_U, T_W)` is as in
Lemma 5.3 and `S ∈ 𝓛` has `r` members (its children in the forest of `𝓛`
and the supernodes inside `S` but in no child), then `x(D(S)) = r βˆ’ 1`, where
`D(S)` is the set of support edges joining two different members of `S`. -/
theorem claim_5_8 {V : Type*} [Fintype V] [DecidableEq V]
    (E F : Finset (Sym2 V)) (A B : V β†’ β„€) (U W : Finset V)
    (x : Sym2 V β†’ ℝ) (L : Finset (Finset V)) (TU TW : Finset V)
    (hE : BoundedDegreeST.PlusOne.SimpleEdges E) (hF : BoundedDegreeST.PlusOne.IsForest F) (hEF : Disjoint E F)
    (hfeas : Feasible E A B U W F x)
    (hbasis : DefinesBasis E A B U W F x L TU TW)
    (S : Finset V) (hS : S ∈ L) :
    BoundedDegreeST.PlusOne.edgeSum x (crossing E F x L S) = ((members F L S).card : ℝ) - 1 := by sorry

end BoundedDegreeST.LowerUpper
Source
Singh, Lau, Approximating minimum bounded degree spanning trees to within one of optimal, STOC 2007, p. 669, Claim 5.8
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