Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.2 — α ≥ 2λ⁻¹ln(6mρλ⁻¹) implies 𝒢1

Proved
FracPackCover.General.lemma_4_2

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 satisfy ∣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 with λ=λ(x)>0\lambda = \lambda(x) > 0λ=λ(x)>0, and let α\alphaα satisfy

α≥2λln⁡ ⁣(6mρλ).\alpha \ge \frac{2}{\lambda}\ln\!\Big(\frac{6m\rho}{\lambda}\Big).α≥λ2​ln(λ6mρ​).

Then xxx and its corresponding dual solution yi=1dieα(aix−bi)/diy_i = \frac{1}{d_i}e^{\alpha(a_ix-b_i)/d_i}yi​=di​1​eα(ai​x−bi​)/di​ satisfy (G1)(\mathcal G1)(G1): λ ytd≤4 yt(Ax−b)\lambda\, y^t d \le 4\, y^t(Ax - b)λytd≤4yt(Ax−b).

This says that the exponential dual solution makes the first relaxed optimality condition automatic once α\alphaα is large enough, so the algorithm only needs to test (G2)(\mathcal G2)(G2).

Formalization Note. λ>0\lambda > 0λ>0 is implicit in the paper (λ−1\lambda^{-1}λ−1 and the logarithm appear); m≥1m \ge 1m≥1 and the width bound ρ\rhoρ are the section's standing assumptions.

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

/-- Lemma 4.2 (p. 26). If `α ≥ 2λ⁻¹ ln(6mρλ⁻¹)`, where `λ = λ(x) > 0` for a point `x ∈ P` and
`ρ > 0` bounds the width of `P`, then `x` and its dual solution `y_i = d_i⁻¹ e^{α(a_ix − b_i)/d_i}`
satisfy (𝒢1). -/
theorem lemma_4_2 {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) (hlam : 0 < lam A b d x) (α : ℝ)
    (hα : 2 / lam A b d x * Real.log (6 * m * ρ / lam A b d x) ≤ α) :
    G1 A b d x (lam A b d x) (dualVec A b d α x) := by sorry

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