Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.3 — a step toward the oracle point lowers Φ by at least ασλΦ/30

Proved
FracPackCover.General.lemma_4_3

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

lagrangean-relaxationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1potential-function

Let A,b,d>0,PA, b, d > 0, PA,b,d>0,P be as in the GENERAL problem with PPP convex, and let ρ>0\rho > 0ρ>0 bound the width: ∣aix−bi∣≤ρdi|a_i x - b_i| \le \rho d_i∣ai​x−bi​∣≤ρdi​ for all x∈Px \in Px∈P and all iii. Let x∈Px \in Px∈P, λ=λ(x)\lambda = \lambda(x)λ=λ(x), ε∈(0,1)\varepsilon \in (0,1)ε∈(0,1), α>0\alpha > 0α>0, let yyy be the dual solution of xxx and Φ=ytd=∑ieα(aix−bi)/di\Phi = y^t d = \sum_i e^{\alpha(a_ix-b_i)/d_i}Φ=ytd=∑i​eα(ai​x−bi​)/di​. Let x~∈P\tilde x \in Px~∈P attain CG(y)C_{\mathcal G}(y)CG​(y) and suppose (x,λ)(x,\lambda)(x,λ) and yyy do not satisfy (G2)(\mathcal G2)(G2). If 0≤σ≤λ/(24αρ2)0 \le \sigma \le \lambda/(24\alpha\rho^2)0≤σ≤λ/(24αρ2), x^=(1−σ)x+σx~\hat x = (1-\sigma)x + \sigma \tilde xx^=(1−σ)x+σx~ and Φ^\hat\PhiΦ^ is the potential of x^\hat xx^ (same α\alphaα), then

Φ−Φ^ ≥ ασλ Φ30.\Phi - \hat\Phi \ \ge\ \frac{\alpha\sigma\lambda\,\Phi}{30}.Φ−Φ^ ≥ 30ασλΦ​.

This is the progress lemma: each update of IMPROVE-GENERAL lowers the potential by a fixed fraction, which bounds the number of iterations.

Formalization Note. The paper writes Φ−Φ^=Ω(ασλΦ)\Phi - \hat\Phi = \Omega(\alpha\sigma\lambda\Phi)Φ−Φ^=Ω(ασλΦ); its proof yields Φ−Φ^>ασ(λ/5−4ασρ2)Φ≥ασλΦ/30\Phi - \hat\Phi > \alpha\sigma(\lambda/5 - 4\alpha\sigma\rho^2)\Phi \ge \alpha\sigma\lambda\Phi/30Φ−Φ^>ασ(λ/5−4ασρ2)Φ≥ασλΦ/30, and the explicit constant 1/301/301/30 is stated. The error parameter ε\varepsilonε appears in the printed statement but plays no role; it is kept as a hypothesis. The non-strict inequality covers σ=0\sigma = 0σ=0.

Preamble
import Mathlib
import Definitions.Def_FracPackCover_General_Basic
Formal statement
namespace FracPackCover.General

/-- Lemma 4.3 (pp. 26–27), with the explicit constant of its proof. Let `x ∈ P`, `λ = λ(x)`,
`α > 0`, `y` the dual solution of `x`, `Φ` its potential, and suppose `(x, λ)` and `y` violate (𝒢2)
where `x̃ ∈ P` attains `C_𝒢(y)`. If `0 ≤ σ ≤ λ/(24αρ²)` and `x̂ = (1 − σ)x + σx̃`, then
`Φ − Φ̂ ≥ ασλΦ/30` (the paper writes `Ω(ασλΦ)`). The error parameter `ε ∈ (0,1)` of the printed
statement is kept but unused. -/
theorem lemma_4_3 {m n : ℕ} [NeZero m] (A : Matrix (Fin m) (Fin n) ℝ) (b d : Fin m → ℝ)
    (P : Set (Fin n → ℝ)) (hP : Convex ℝ P) (hd : ∀ i, 0 < d i)
    (ρ : ℝ) (hρ : 0 < ρ) (hW : WidthBound A b d P ρ)
    (x : Fin n → ℝ) (hx : x ∈ P) (ε : ℝ) (hε0 : 0 < ε) (hε1 : ε < 1)
    (α : ℝ) (hα : 0 < α)
    (xt : Fin n → ℝ) (hxt : xt ∈ P)
    (hmin : ∀ x' ∈ P, lagr A b (dualVec A b d α x) xt ≤ lagr A b (dualVec A b d α x) x')
    (hnG2 : ¬ G2 A b d x (lam A b d x) (dualVec A b d α x)
      (lagr A b (dualVec A b d α x) xt))
    (σ : ℝ) (hσ0 : 0 ≤ σ) (hσ : σ ≤ lam A b d x / (24 * α * ρ ^ 2)) :
    α * σ * lam A b d x * potential A b d α x / 30 ≤
      potential A b d α x - potential A b d α ((1 - σ) • x + σ • xt) := by sorry

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