Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.6 — token bound for each laminar subtree

Proved
BoundedDegreeST.PlusOne.lemma_4_6

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

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

In the contradiction setting of Lemma 4.1, let (L,T)(\mathcal L,T)(L,T) be the laminar basis of a basic feasible solution with support E∗E^*E∗. No supported edge has value 111, and every w∈Ww\in Ww∈W has deg⁡E∗(w)>Bw+1\deg_{E^*}(w)>B_w+1degE∗​(w)>Bw​+1. For every root S∈LS\in\mathcal LS∈L, the tokens initially attached to vertices in SSS suffice to give two tokens to each vertex of T∩ST\cap ST∩S, two to each strict descendant of SSS in L\mathcal LL, and four to SSS itself. Numerically,

∑v∈Sdeg⁡E∗(v)≥2∣T∩S∣+2∣{R∈L:R⊊S}∣+4.\sum_{v\in S}\deg_{E^*}(v)\ge 2|T\cap S|+2|\{R\in\mathcal L:R\subsetneq S\}|+4.v∈S∑​degE∗​(v)≥2∣T∩S∣+2∣{R∈L:R⊊S}∣+4.

This is the counting statement used to contradict the basis cardinality in Lemma 4.1.

Formalization Note The Lean conclusion is the numerical token inequality that the source's distribution entails. All surrounding contradiction hypotheses are explicit.

Preamble
import Definitions.Def_BoundedDegreeST_PlusOne_Algorithm
Formal statement
namespace BoundedDegreeST.PlusOne

/-- Singh–Lau, Lemma 4.6, p. 667, as the numerical token-distribution bound. -/
theorem lemma_4_6 {V : Type*} [Fintype V] [DecidableEq V]
    (I : Instance V) (x : Sym2 V → ℝ)
    (L : Finset (Finset V)) (T : Finset V) (S : Finset V)
    (hvalid : Valid I) (hbasic : Basic I.E I.B I.W I.F x)
    (hnotree : ¬ IsSpanningTree I.F)
    (hbasis : DefinesBasis I.E I.B I.W I.F x L T)
    (hnoone : ∀ e ∈ support I.E x, x e ≠ 1)
    (hnosmall : ∀ w ∈ I.W, (degree (support I.E x) w : ℤ) > I.B w + 1)
    (hroot : S ∈ L) :
    2 * (T ∩ S).card +
      2 * (L.filter (fun R => R ⊂ S)).card + 4 ≤
      ∑ v ∈ S, degree (support I.E x) v := by sorry
end BoundedDegreeST.PlusOne
Source
Singh, Lau, Approximating minimum bounded degree spanning trees to within one of optimal, STOC 2007, p. 667, Lemma 4.6
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