Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.4 — during IMPROVE-COVER, λ≥3λ0/4\lambda\ge3\lambda_0/4λ≥3λ0​/4

Proved
FracPackCover.Covering.lemma_3_4

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

fractional-coveringp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1potential-function

Let A≥0A\ge0A≥0, b>0b>0b>0, PPP be covering data, ρ>0\rho>0ρ>0 a width bound, and let subroutine (7) be an exact maximization oracle. Let 0<ε<10<\varepsilon<10<ε<1 and run IMPROVE-COVER(x,ε)(x,\varepsilon)(x,ε) (Figure 3) from x∈Px\in Px∈P with λ0=λ(x)>0\lambda_0=\lambda(x)>0λ0​=λ(x)>0. Then throughout the execution the current solution (x,λ)(x,\lambda)(x,λ) satisfies

λ ≥ 34 λ0.\lambda\ \ge\ \tfrac34\,\lambda_0 .λ ≥ 43​λ0​.

Precisely: if xtx_txt​ is the point after ttt updates and the while-test of Figure 3 held at x0,…,xt−1x_0,\dots,x_{t-1}x0​,…,xt−1​, then λ(xt)≥34λ0\lambda(x_t)\ge\frac34\lambda_0λ(xt​)≥43​λ0​.

Combined with Lemma 3.2 and the choice α=4λ0−1ε−1ln⁡(4mε−1)\alpha=4\lambda_0^{-1}\varepsilon^{-1}\ln(4m\varepsilon^{-1})α=4λ0−1​ε−1ln(4mε−1), this shows that C1\mathcal C1C1 holds at every point of the run.

Formalization Note The statement is about the states of the run of Figure 3, not about an arbitrary point: "reached" means the while-test held at every earlier state.

Preamble
import Mathlib
import Definitions.Def_FracPackCover_Covering_Basic
import Definitions.Def_FracPackCover_Covering_ImproveCover
Formal statement
namespace FracPackCover.Covering

/-- Lemma 3.4 (Plotkin–Shmoys–Tardos, Cornell ORIE TR 999, p. 19). Let `0 < ε < 1` and let
IMPROVE-COVER(x, ε) (Figure 3) start from `x ∈ P` with `λ0 = λ(x) > 0`, width bound `ρ` and an
exact maximization oracle. Then every point `(x_t, λ_t)` reached during its execution has
`λ_t ≥ 3λ0/4`. -/
theorem lemma_3_4 {m n : ℕ} [NeZero m] (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ)
    (P : Set (Fin n → ℝ)) (hdata : IsCoveringData A b P) (ρ : ℝ) (hρ : WidthBound A b P ρ)
    (orc : (Fin m → ℝ) → (Fin n → ℝ)) (horc : IsMaxOracle A P orc)
    (x : Fin n → ℝ) (hx : x ∈ P) (hlam : 0 < lam A b x) (ε : ℝ) (hε : 0 < ε) (hε1 : ε < 1)
    (t : ℕ) (ht : IsReachedCover A b orc ρ ε x t) :
    3 * lam A b x / 4 ≤ lam A b (coverIterate A b orc ρ ε x t) := by sorry

end FracPackCover.Covering
Source
Plotkin, Shmoys, Tardos, Fast Approximation Algorithms for Fractional Packing and Covering Problems, Cornell ORIE Tech. Rep. 999 (1992), pp. 19–20, Lemma 3.4
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