Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim 5.7 β€” a set S ∈ 𝓛 with S β‰  V has |Ξ΄(S)| β‰₯ 2 in the support

Proved
BoundedDegreeST.LowerUpper.claim_5_7

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

counting-argumentiterative-roundingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1spanning-trees

Throughout, G=(V,E)G=(V,E)G=(V,E) is a finite simple graph, FFF is a forest on VVV with no edge in common with EEE, AvA_vAv​ (v∈Uv\in Uv∈U) and BvB_vBv​ (v∈Wv\in Wv∈W) are integer lower and upper degree bounds on subsets U,WβŠ†VU,W\subseteq VU,WβŠ†V, and xβˆ—x^*xβˆ— is 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:xeβˆ—β‰ 0}E^*=\{e: x^*_e\neq 0\}Eβˆ—={e:xeβˆ—β€‹ξ€ =0}. The forest FFF is not a spanning tree. By Lemma 5.3 there are TUβŠ†UT_U\subseteq UTUβ€‹βŠ†U, TWβŠ†WT_W\subseteq WTWβ€‹βŠ†W and a laminar family L\mathcal LL of tight sets defining xβˆ—x^*xβˆ—; put T=TUβˆͺTWT=T_U\cup T_WT=TU​βˆͺTW​. As in the proof of Lemma 5.1, assume for contradiction that no edge has xeβˆ—=1x^*_e=1xeβˆ—β€‹=1 and no v∈UβˆͺWv\in U\cup Wv∈UβˆͺW has deg⁑Eβˆ—(v)=2\deg_{E^*}(v)=2degEβˆ—β€‹(v)=2.

Claim 5.7. For every S∈LS\in\mathcal LS∈L with Sβ‰ VS\neq VSξ€ =V,

∣δEβˆ—(S)∣ β‰₯Β 2.|\delta_{E^*}(S)|\ \ge\ 2 .∣δEβˆ—β€‹(S)∣ β‰₯Β 2.

The claim is used in Claim 5.9 to rule out a special set's cut having fewer than three edges.

Formalization Note In the paper SSS is the root of a subtree of the forest of L\mathcal LL, so S∈LS\in\mathcal LS∈L; the cut is counted in the support Eβˆ—E^*Eβˆ—.

Preamble
import Definitions.Def_BoundedDegreeST_LowerUpper_Tokens
Formal statement
namespace BoundedDegreeST.LowerUpper

/-- Singh–Lau, Claim 5.7, p. 669, in the setting of Β§5.1 (see Claim 5.4): for a
set `S` of the laminar family `𝓛` with `S β‰  V`, at least two edges of the
support `E*` cross `S`. -/
theorem claim_5_7
    {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)
    (hbasic : Basic E A B U W F x) (hnotree : Β¬ BoundedDegreeST.PlusOne.IsSpanningTree F)
    (hbasis : DefinesBasis E A B U W F x L TU TW)
    (hnoone : βˆ€ e ∈ support E x, x e β‰  1)
    (hnodeg2 : βˆ€ v ∈ U βˆͺ W, degree (support E x) v β‰  2)
    (S : Finset V) (hS : S ∈ L) (hSV : S β‰  Finset.univ) :
    2 ≀ (cut (support E x) S).card := 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.7
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