Lemma 5.3 — a basic solution is the unique solution of a laminar family of tight sets and tight lower/upper degree rows
ProvedBoundedDegreeST.LowerUpper.lemma_5_3basic-solutionsiterative-roundingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1spanning-trees
Let be a finite simple graph, a forest on edge-disjoint from that is not a spanning tree, and a basic feasible solution of LP-MBDCT with support . Then there are , and a nonempty laminar family of nonempty sets such that restricted to is the unique solution in of
the vectors are linearly independent, and .
This is the structural description of extreme points on which the counting argument of §5.1 rests.
Formalization Note The hypothesis that is not a spanning tree is implicit in the paper (the lemma is applied after Step 1 has not returned); without it and no nonempty need exist. The vectors live in and are indexed by .
Preamble
import Definitions.Def_BoundedDegreeST_LowerUpper_LP
Formal statement
namespace BoundedDegreeST.LowerUpper
/-- Singh–Lau, Lemma 5.3, p. 668: a basic feasible solution of
LP-MBDCT(G, 𝓐, 𝓑, U, W, F) is the unique solution of a linearly independent
system of tight rows given by `T_U ⊆ U`, `T_W ⊆ W` and a nonempty laminar
family `𝓛 ⊆ 𝓘(F)`, with `|E*| = |𝓛| + |T_U| + |T_W|`. The hypothesis that `F`
is not a spanning tree is implicit in the paper (Step 1 has not returned). -/
theorem lemma_5_3 {V : Type*} [Fintype V] [DecidableEq V]
(E F : Finset (Sym2 V)) (A B : V → ℤ) (U W : Finset V) (x : Sym2 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) :
∃ (TU TW : Finset V) (L : Finset (Finset V)),
DefinesBasis E A B U W F x L TU TW := by sorry
end BoundedDegreeST.LowerUpper
Source
Singh, Lau, Approximating minimum bounded degree spanning trees to within one of optimal, STOC 2007, p. 668, Lemma 5.3
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.