Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.3 — a step toward the maximum-cost point lowers Φ\PhiΦ by at least εασΦ\varepsilon\alpha\sigma\PhiεασΦ

Proved
FracPackCover.Covering.lemma_3_3

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 and ρ>0\rho>0ρ>0 a bound on the width (aix≤ρ bia_ix\le\rho\,b_iai​x≤ρbi​ for all x∈Px\in Px∈P and all iii). Let x∈Px\in Px∈P, 0<ε≤10<\varepsilon\le10<ε≤1 and α>0\alpha>0α>0; let yi=1bie−αaix/biy_i=\frac1{b_i}e^{-\alpha a_ix/b_i}yi​=bi​1​e−αai​x/bi​ be the dual solution corresponding to xxx and Φ=ytb\Phi=y^tbΦ=ytb its potential. Suppose xxx and yyy do not satisfy C2\mathcal C2C2. Let x~∈P\tilde x\in Px~∈P attain the maximum CC(y)C_{\mathcal C}(y)CC​(y) of ytAxy^tAxytAx over PPP, and let 0≤σ≤ε/(4αρ)0\le\sigma\le\varepsilon/(4\alpha\rho)0≤σ≤ε/(4αρ). Put x^=(1−σ)x+σx~\hat x=(1-\sigma)x+\sigma\tilde xx^=(1−σ)x+σx~ and let Φ^\hat\PhiΦ^ be the potential of x^\hat xx^ (same α\alphaα). Then

Φ−Φ^ ≥ εασ Φ.\Phi-\hat\Phi\ \ge\ \varepsilon\alpha\sigma\,\Phi .Φ−Φ^ ≥ εασΦ.

This is the progress lemma of the covering algorithm: as long as C2\mathcal C2C2 fails, every update of IMPROVE-COVER decreases the potential by a constant factor.

Formalization Note The step σ\sigmaσ is assumed nonnegative, as it is in Figure 3.

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

/-- Lemma 3.3 (Plotkin–Shmoys–Tardos, Cornell ORIE TR 999, p. 19). Let `x ∈ P`, `0 < ε ≤ 1`,
`α > 0`, and let `y` be the dual solution corresponding to `x` (parameter `α`), with potential
`Φ = yᵗb`, such that `x, y` do not satisfy 𝒞2. Let `x̃ ∈ P` attain the maximum `C_𝒞(y)` of `yᵗ A x`
over `P`, let `ρ` bound the width, and let `0 ≤ σ ≤ ε/(4αρ)`. For `x̂ = (1 − σ) x + σ x̃` with
potential `Φ̂` (same `α`), `Φ − Φ̂ ≥ ε α σ Φ`. -/
theorem lemma_3_3 {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ)
    (P : Set (Fin n → ℝ)) (hdata : IsCoveringData A b P) (ρ : ℝ) (hρ : WidthBound A b P ρ)
    (x xt : Fin n → ℝ) (hx : x ∈ P) (hxt : xt ∈ P)
    (ε α σ : ℝ) (hε : 0 < ε) (hε1 : ε ≤ 1) (hα : 0 < α) (hσ0 : 0 ≤ σ)
    (hσ : σ ≤ ε / (4 * α * ρ))
    (hmax : ∀ x' ∈ P, yAx A (dualY A b α x) x' ≤ yAx A (dualY A b α x) xt)
    (hC2 : ¬ C2 A b ε (dualY A b α x) x (yAx A (dualY A b α x) xt)) :
    ε * α * σ * potential A b α x ≤
      potential A b α x - potential A b α ((1 - σ) • x + σ • xt) := by sorry

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