Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.1 (i) — initially Φ≤1\Phi\le 1Φ≤1, and Φ>0\Phi>0Φ>0 at all times

Proved
BNCovPack.SetCover.lemma_5_1_i

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

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

Let XXX be a ground set of nnn elements, S\mathcal SS a finite family of sets, and OPT≥1OPT\ge 1OPT≥1 a natural number. Let Φ=Φ1+Φ2\Phi=\Phi_1+\Phi_2Φ=Φ1​+Φ2​ be the potential of Section 5.1, with r=eln⁡(e/(e−1))r=e\ln(e/(e-1))r=eln(e/(e−1)) and α=max⁡{1,ln⁡(rn/OPT)}\alpha=\max\{1,\ln(rn/OPT)\}α=max{1,ln(rn/OPT)}. Then:

  1. at start, when every weight is 000 and no set is chosen,
Φ(0,∅)=1−(1−e−α)n+e−OPT≤1;\Phi(0,\emptyset)=1-(1-e^{-\alpha})^n+e^{-OPT}\le 1;Φ(0,∅)=1−(1−e−α)n+e−OPT≤1;
  1. for every real α\alphaα, every weight vector www and every family C\mathcal CC of sets, Φ(w,C)>0\Phi(w,\mathcal C)>0Φ(w,C)>0.

Together with Lemma 5.1 (ii), part 1 gives Φ≤1\Phi\le 1Φ≤1 throughout the run of the algorithm, which is what Lemma 5.2 uses; part 2 is the positivity used to conclude that each term of Φ\PhiΦ is at most 111.

Formalization Note The page's proof writes "1−exp⁡(−dne−α)1-\exp(-dne^{-\alpha})1−exp(−dne−α)" and "α≥ln⁡(dn/OPT)\alpha\ge\ln(dn/OPT)α≥ln(dn/OPT)"; the letter ddd there is a misprint for rrr, since the chosen α\alphaα only gives rne−α≤OPTrne^{-\alpha}\le OPTrne−α≤OPT, and 1−x≥e−rx1-x\ge e^{-rx}1−x≥e−rx holds for 0≤x≤1/e0\le x\le 1/e0≤x≤1/e with this rrr. The statement uses rrr. Positivity is stated for all states, not only those reached by the algorithm. n=0n=0n=0 is allowed (then Φ(0,∅)=e−OPT\Phi(0,\emptyset)=e^{-OPT}Φ(0,∅)=e−OPT).

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 (i)** (Buchbinder–Naor 2009, p. 12; proof p. 13): at start (all weights `0`,
empty cover) `Φ ≤ 1` when `α = max {1, ln(r n / OPT)}`, `r = e ln(e/(e−1))`, `n = |E|`, and
`OPT ≥ 1`; and `Φ > 0` in every state (every weight vector `w`, every family `C`, every `α`). -/
theorem lemma_5_1_i {E T : Type*} [Fintype E] [Fintype T] [DecidableEq T]
    (inst : SetCoverInstance E T) (OPT : ℕ) (hOPT : 1 ≤ OPT) :
    potential inst (alphaParam (Fintype.card E) OPT) OPT (fun _ => 0) ∅ ≤ 1 ∧
    ∀ (α : ℝ) (w : T → ℝ) (C : Finset T), 0 < 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 (i); proof p. 13 (α, r, initial value of Φ)
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