Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.1, proof, claim (iii) — each packing constraint is violated by at most 2log⁡(1+n ai(max⁡)/ai(min⁡))/B2\log(1+n\,a_i(\max)/a_i(\min))/B2log(1+nai​(max)/ai​(min))/B

Proved
BNCovPack.Packing.claim_iii

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, m≥1m\ge 1m≥1 columns, costs c(i)>0c(i)>0c(i)>0, non-negative coefficients a(i,k)a(i,k)a(i,k), and every column having at least one positive entry. For a packing constraint iii let

ai(max⁡)=max⁡1≤k≤ma(i,k),ai(min⁡)=min⁡1≤k≤m{a(i,k)∣a(i,k)≠0}.a_i(\max)=\max_{1\le k\le m}a(i,k),\qquad a_i(\min)=\min_{1\le k\le m}\{a(i,k)\mid a(i,k)\neq 0\}.ai​(max)=1≤k≤mmax​a(i,k),ai​(min)=1≤k≤mmin​{a(i,k)∣a(i,k)=0}.

Then the final dual solution yyy satisfies, for every iii,

∑k=1ma(i,k) y(k) ≤ c(i)⋅2log⁡(1+n ai(max⁡)/ai(min⁡))B.\sum_{k=1}^{m}a(i,k)\,y(k)\ \le\ c(i)\cdot\frac{2\log\big(1+n\,a_i(\max)/a_i(\min)\big)}{B}.k=1∑m​a(i,k)y(k) ≤ c(i)⋅B2log(1+nai​(max)/ai​(min))​.

The paper writes the conclusion of Theorem 3.1 as c(i)⋅O((log⁡n+log⁡(ai(max⁡)/ai(min⁡)))/B)c(i)\cdot O\big((\log n+\log(a_i(\max)/a_i(\min)))/B\big)c(i)⋅O((logn+log(ai​(max)/ai​(min)))/B); this is the explicit bound its proof establishes. It says the scheme's dual solution violates each packing constraint by at most a logarithmic factor divided by BBB.

Formalization Note ai(max⁡)a_i(\max)ai​(max) and ai(min⁡)a_i(\min)ai​(min) are the published aMax and aMin, taken over all mmm columns (unlike the prefix maximum used inside the scheme). When row iii has no non-zero coefficient, aMin is 000, the Lean expression n⋅0/0n\cdot 0/0n⋅0/0 is 000, and both sides are 000. The logarithm is natural (Real.log).

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

open OnlinePrimalDual.GeneralPacking

/-- Buchbinder–Naor 2009, proof of Theorem 3.1, claim (iii) (p. 5; proved p. 6): when the scheme
has processed all `m` columns, every packing constraint `i` is violated by at most a factor
`2 log(1 + n aᵢ(max)/aᵢ(min))/B`:
`∑_{k=1}^{m} a(i,k) y(k) ≤ c(i) · 2 log(1 + n aᵢ(max)/aᵢ(min)) / B`,
with `n = |I|`, `aᵢ(max)` the largest and `aᵢ(min)` the smallest non-zero coefficient of `x(i)`
over all `m` columns, and the natural logarithm. -/
theorem claim_iii {I : Type*} [Fintype I] [Nonempty I] {m : ℕ} [NeZero m]
    (inst : GeneralInstance I (Fin m)) (B : ℝ) (hB : 0 < B)
    (hcol : ∀ j : Fin m, ∃ i, 0 < inst.a i j) :
    ∀ i : I, ∑ k : Fin m, inst.a i k * (stateAfter inst B m).y k ≤
      inst.c i * (2 * Real.log (1 + (Fintype.card I : ℝ) * aMax inst i / aMin inst i)) / B := 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 (iii) (proved p. 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