Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.1 (ii) — after augmenting a set, taking it or excluding it does not increase Φ\PhiΦ

Proved
BNCovPack.SetCover.lemma_5_1_ii

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

derandomizationonline-algorithmsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1potential-functionset-cover

Let Φ=Φ1+Φ2\Phi=\Phi_1+\Phi_2Φ=Φ1​+Φ2​ be the potential of Section 5.1 for a set-cover instance, with parameter α≥0\alpha\ge 0α≥0 and any natural number OPTOPTOPT. Let (w,C)(w,\mathcal C)(w,C) be any state (weights and chosen family), sss a set, and δ≥0\delta\ge 0δ≥0. Write w+δ1sw+\delta\mathbf 1_sw+δ1s​ for the weights with w(s)w(s)w(s) increased by δ\deltaδ. Then at least one of

Φ(w+δ1s, C∪{s})≤Φ(w,C)orΦ(w+δ1s, C)≤Φ(w,C)\Phi\big(w+\delta\mathbf 1_s,\ \mathcal C\cup\{s\}\big)\le\Phi(w,\mathcal C) \qquad\text{or}\qquad \Phi\big(w+\delta\mathbf 1_s,\ \mathcal C\big)\le\Phi(w,\mathcal C)Φ(w+δ1s​, C∪{s})≤Φ(w,C)orΦ(w+δ1s​, C)≤Φ(w,C)

holds.

This is the property that keeps the potential from increasing during the run of the online algorithm: whenever the weight of a set is augmented, one of the two decisions (take the set or leave it out) is available without increasing Φ\PhiΦ. It is the online form of the pessimistic-estimator step in derandomized rounding.

Formalization Note The page considers an augmentation 0≤δs≤10\le\delta_s\le10≤δs​≤1; the bound δs≤1\delta_s\le 1δs​≤1 is not used by its argument and is dropped here, which makes the statement stronger. The statement is for every state (w,C)(w,\mathcal C)(w,C), not only reachable ones.

Preamble
import Mathlib
import Definitions.Def_OnlinePrimalDual_OnlineSetCover_SetCoverInstance
import Definitions.Def_BNCovPack_SetCover_Potential
Formal statement
namespace BNCovPack.SetCover

open OnlinePrimalDual.OnlineSetCover

/-- **Lemma 5.1 (ii)** (Buchbinder–Naor 2009, p. 12; proof p. 13): when the weight of a set `s`
is augmented by `δ ≥ 0`, either taking `s` to the cover or excluding it does not increase `Φ`
(compared with its value before the augmentation). Stated for every state `(w, C)` and every
`α ≥ 0`; the paper's proof assumes `δ ≤ 1` but does not use it. -/
theorem lemma_5_1_ii {E T : Type*} [Fintype E] [Fintype T] [DecidableEq T]
    (inst : SetCoverInstance E T) (α : ℝ) (hα : 0 ≤ α) (OPT : ℕ)
    (w : T → ℝ) (C : Finset T) (s : T) (δ : ℝ) (hδ : 0 ≤ δ) :
    potential inst α OPT (Function.update w s (w s + δ)) (insert s C) ≤ potential inst α OPT w C ∨
    potential inst α OPT (Function.update w s (w s + δ)) C ≤ potential inst α OPT w C := by sorry

end BNCovPack.SetCover
Source
Buchbinder, Naor, Online Primal-Dual Algorithms for Covering and Packing, Math. Oper. Res. (2009), DOI 10.1287/moor.1080.0363, p. 12, Lemma 5.1 (ii); proof pp. 13-14
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