Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.1, proof, claim (i) — in each round Y(j)≥X(j)/BY(j)\ge X(j)/BY(j)≥X(j)/B

Proved
BNCovPack.Packing.claim_i

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 j=1,…,mj=1,\dots,mj=1,…,m each of which has at least one positive entry. Let X(r)=∑ic(i)x(i)X(r)=\sum_i c(i)x(i)X(r)=∑i​c(i)x(i) and Y(r)=∑k≤ry(k)Y(r)=\sum_{k\le r}y(k)Y(r)=∑k≤r​y(k) be the values of the primal and dual solutions after round rrr. Then for every round r≤mr\le mr≤m,

X(r)≤B⋅Y(r),i.e.Y(r)≥X(r)/B.X(r)\le B\cdot Y(r),\qquad\text{i.e.}\qquad Y(r)\ge X(r)/B.X(r)≤B⋅Y(r),i.e.Y(r)≥X(r)/B.

Together with primal feasibility (claim (ii)) and weak duality, this is what makes the scheme BBB-competitive.

Formalization Note The scheme, XXX and YYY are stateAfter, primalValue and dualValue of BNCovPack.Packing.Scheme; r=0r=0r=0 is the initial state. The positivity of every column is the paper's standing assumption (p. 4), without which a round never terminates.

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 (i) (p. 5; proved pp. 5–6): in each round
`r`, the value `X` of the primal solution maintained by the online fractional packing scheme is
at most `B` times the value `Y` of its dual solution, `Y(r) ≥ X(r)/B`. -/
theorem claim_i {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 → primalValue inst B r ≤ B * dualValue inst B r := 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 (i) (proved pp. 5–6, displays (1)–(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