Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.4 — IMPROVE-GENERAL stops after at most 2 + 8640ρ²λ₀⁻²ln(12mρλ₀⁻¹) oracle calls

Proved
FracPackCover.General.theorem_4_4

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

complexitylagrangean-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, let ρ>0\rho > 0ρ>0 bound the width (∣aix−bi∣≤ρdi|a_i x - b_i| \le \rho d_i∣ai​x−bi​∣≤ρdi​ on PPP), and let orc\mathrm{orc}orc be any exact minimizing oracle (subroutine (10)). Let x0∈Px_0 \in Px0​∈P with λ0=λ(x0)>0\lambda_0 = \lambda(x_0) > 0λ0​=λ(x0​)>0. Then procedure IMPROVE-GENERAL started at x0x_0x0​, with parameters α=4λ0−1ln⁡(12mρλ0−1)\alpha = 4\lambda_0^{-1}\ln(12m\rho\lambda_0^{-1})α=4λ0−1​ln(12mρλ0−1​) and σ=λ0/(48αρ2)\sigma = \lambda_0/(48\alpha\rho^2)σ=λ0​/(48αρ2), stops, and the number of oracle calls it makes is at most

B=2+8640 ρ2λ02 ln⁡ ⁣(12mρλ0).B = 2 + 8640\,\frac{\rho^2}{\lambda_0^2}\,\ln\!\Big(\frac{12 m\rho}{\lambda_0}\Big).B=2+8640λ02​ρ2​ln(λ0​12mρ​).

More precisely, run with any fuel F≥BF \ge BF≥B, the loop test fails before the fuel is exhausted.

This is the per-call complexity bound that the driver's analysis sums over the calls.

Formalization Note. The paper writes O(ρ2λ0−2log⁡(mρλ0−1))O(\rho^2\lambda_0^{-2}\log(m\rho\lambda_0^{-1}))O(ρ2λ0−2​log(mρλ0−1​)) iterations; its proof (Lemma 4.3 with λ≥λ0/2\lambda \ge \lambda_0/2λ≥λ0​/2, eαλ0/2≤Φ≤meαλ0e^{\alpha\lambda_0/2} \le \Phi \le m e^{\alpha\lambda_0}eαλ0​/2≤Φ≤meαλ0​) yields at most 1+8640ρ2λ0−2ln⁡(12mρλ0−1)1 + 8640\rho^2\lambda_0^{-2}\ln(12m\rho\lambda_0^{-1})1+8640ρ2λ0−2​ln(12mρλ0−1​) updates and one more oracle call. The statement is for the corrected parameters (λ0/2\lambda_0/2λ0​/2 in place of λ0\lambda_0λ0​ in Figure 4's α\alphaα and σ\sigmaσ); with Figure 4's printed parameters the hypothesis σ≤λ/(24αρ2)\sigma \le \lambda/(24\alpha\rho^2)σ≤λ/(24αρ2) of Lemma 4.3 fails whenever λ<λ0\lambda < \lambda_0λ<λ0​, and the decrease its proof gives is negative for λ<5λ0/6\lambda < 5\lambda_0/6λ<5λ0​/6.

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

/-- Theorem 4.4 (p. 27), for IMPROVE-GENERAL with the corrected parameters
`α = 4λ₀⁻¹ ln(12mρλ₀⁻¹)`, `σ = λ₀/(48αρ²)`. Started at `x₀ ∈ P` with `λ₀ = λ(x₀) > 0`, every
exact minimizing oracle, the procedure stops (its loop test fails) within
`B = 2 + 8640 ρ² λ₀⁻² ln(12mρλ₀⁻¹)` loop tests and makes at most `B` oracle calls (the paper writes
`O(ρ²λ₀⁻² log(mρλ₀⁻¹))` iterations). -/
theorem theorem_4_4 {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 ρ)
    (orc : (Fin m → ℝ) → (Fin n → ℝ)) (horc : IsMinOracle P A orc)
    (x0 : Fin n → ℝ) (hx0 : x0 ∈ P) (hlam : 0 < lam A b d x0) (fuel : ℕ)
    (hfuel : 2 + 8640 * ρ ^ 2 / lam A b d x0 ^ 2 * Real.log (12 * m * ρ / lam A b d x0)
      ≤ (fuel : ℝ)) :
    (improveGeneral A b d ρ orc fuel x0).exit ≠ ImproveExit.outOfFuel ∧
      ((improveGeneral A b d ρ orc fuel x0).calls : ℝ) ≤
        2 + 8640 * ρ ^ 2 / lam A b d x0 ^ 2 * Real.log (12 * m * ρ / lam A b d x0) := 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. 27, Theorem 4.4 (for Figure 4 with λ₀/2-corrected parameters)
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