Lemma 4.6 — token bound for each laminar subtree
ProvedBoundedDegreeST.PlusOne.lemma_4_6iterative-roundinglinear-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1spanning-trees
In the contradiction setting of Lemma 4.1, let be the laminar basis of a basic feasible solution with support . No supported edge has value , and every has . For every root , the tokens initially attached to vertices in suffice to give two tokens to each vertex of , two to each strict descendant of in , and four to itself. Numerically,
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.