Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.1, proof, claim (ii) — the primal solution produced by the scheme is feasible

Proved
BNCovPack.Packing.claim_ii

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

linear-programmingonline-algorithmsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1primal-dual

Consider the online fractional packing scheme of Section 3 with parameter B>0B>0B>0, run on an instance with n≥1n\ge 1n≥1 primal variables, costs c(i)>0c(i)>0c(i)>0, non-negative coefficients a(i,j)a(i,j)a(i,j), and columns each of which has at least one positive entry. Let xxx denote the primal solution held by the scheme. Then:

  1. after every round r≤mr\le mr≤m, xxx is feasible for the covering constraints revealed so far:
x(i)≥0  for all i,∑i=1na(i,k) x(i)≥1  for every column k≤r;x(i)\ge 0\ \text{ for all } i,\qquad \sum_{i=1}^n a(i,k)\,x(i)\ge 1\ \text{ for every column } k\le r;x(i)≥0  for all i,i=1∑n​a(i,k)x(i)≥1  for every column k≤r;
  1. no primal variable ever decreases: the value of x(i)x(i)x(i) after round r+1r+1r+1 is at least its value after round rrr.

Feasibility of the primal solution is half of the weak-duality argument that turns claim (i) into BBB-competitiveness. Part 2 is the paper's remark that "the values of the primal variables never decrease" (p. 5), which its proof of claim (ii) uses.

Formalization Note Columns are Fin m, 0-based, so "column k≤rk\le rk≤r" (1-based) is (k : ℕ) < r. The scheme is stateAfter of BNCovPack.Packing.Scheme.

Preamble
import Mathlib
import Definitions.Def_OnlinePrimalDual_GeneralPacking_GeneralInstance
import Definitions.Def_BNCovPack_Packing_Scheme
Formal statement
namespace BNCovPack.Packing

open OnlinePrimalDual.GeneralPacking

/-- Buchbinder–Naor 2009, proof of Theorem 3.1, claim (ii) (p. 5; proved p. 6): after every round
`r`, the primal solution `x` maintained by the scheme is feasible for the covering constraints
given so far (`x ≥ 0` and `∑ᵢ a(i,k) x(i) ≥ 1` for every column `k < r`), and no primal variable
ever decreases from one round to the next. -/
theorem claim_ii {I : Type*} [Fintype I] [Nonempty I] {m : ℕ}
    (inst : GeneralInstance I (Fin m)) (B : ℝ) (hB : 0 < B)
    (hcol : ∀ j : Fin m, ∃ i, 0 < inst.a i j) :
    (∀ r : ℕ, r ≤ m →
      (∀ i, 0 ≤ (stateAfter inst B r).x i) ∧
      (∀ k : Fin m, (k : ℕ) < r → 1 ≤ ∑ i, inst.a i k * (stateAfter inst B r).x i)) ∧
    (∀ r : ℕ, ∀ i, (stateAfter inst B r).x i ≤ (stateAfter inst B (r + 1)).x i) := by sorry

end BNCovPack.Packing
Source
Buchbinder, Naor, Online Primal-Dual Algorithms for Covering and Packing, Math. Oper. Res. (2009), DOI 10.1287/moor.1080.0363, p. 5, Theorem 3.1, proof, claim (ii) (proved p. 6); monotonicity: p. 5, line 2
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