Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.1 — 𝒞1 and 𝒞2 certify infeasibility when λ≤1−3ε\lambda\le1-3\varepsilonλ≤1−3ε, and 3ε3\varepsilon3ε-optimality otherwise

Proved
FracPackCover.Covering.lemma_3_1

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

dualityfractional-coveringp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1relaxed-optimality

Let A≥0A\ge0A≥0, b>0b>0b>0 and a nonempty convex PPP in the nonnegative orthant be covering data, and let 0<ε<130<\varepsilon<\frac130<ε<31​. Let x∈Px\in Px∈P with λ=λ(x)=min⁡iaix/bi\lambda=\lambda(x)=\min_i a_ix/b_iλ=λ(x)=mini​ai​x/bi​, and let y≥0y\ge0y≥0, y≠0y\ne0y=0. Let x~∈P\tilde x\in Px~∈P maximize ytAxy^tAxytAx over PPP and put CC(y)=ytAx~C_{\mathcal C}(y)=y^tA\tilde xCC​(y)=ytAx~. Suppose that (x,λ)(x,\lambda)(x,λ) and yyy satisfy the relaxed optimality conditions

(1+ε)λ ytb≥ytAx,CC(y)−ytAx≤ε (CC(y)+ytb).(1+\varepsilon)\lambda\,y^tb\ge y^tAx,\qquad C_{\mathcal C}(y)-y^tAx\le\varepsilon\,(C_{\mathcal C}(y)+y^tb).(1+ε)λytb≥ytAx,CC​(y)−ytAx≤ε(CC​(y)+ytb).

Then:

  1. if λ≤1−3ε\lambda\le1-3\varepsilonλ≤1−3ε, there is no exact solution, i.e. no x′∈Px'\in Px′∈P with Ax′≥bAx'\ge bAx′≥b;
  2. if λ≥1−3ε\lambda\ge1-3\varepsilonλ≥1−3ε, then xxx is 3ε3\varepsilon3ε-optimal: (1−3ε)λ(x′)≤λ(1-3\varepsilon)\lambda(x')\le\lambda(1−3ε)λ(x′)≤λ for every x′∈Px'\in Px′∈P.

This lemma turns the two relaxed optimality conditions into the two outcomes of the covering algorithm: a certificate that no exact solution exists, or a near-optimal point from which ε\varepsilonε-scaling continues.

Formalization Note "xxx is 3ε3\varepsilon3ε-optimal", i.e. λ≥(1−3ε)λ∗\lambda\ge(1-3\varepsilon)\lambda^*λ≥(1−3ε)λ∗ with λ∗=max⁡{λ(x′):x′∈P}\lambda^*=\max\{\lambda(x'):x'\in P\}λ∗=max{λ(x′):x′∈P} the value of (8), is stated without λ∗\lambda^*λ∗ as the inequality for every x′∈Px'\in Px′∈P. The hypotheses y≠0y\ne0y=0 and ε<13\varepsilon<\frac13ε<31​ are implicit in the paper: for y=0y=0y=0 both conditions hold and both conclusions can fail, and the proof divides by 1−3ε1-3\varepsilon1−3ε. The algorithm uses the lemma with ε≤16\varepsilon\le\frac16ε≤61​.

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

/-- Lemma 3.1 (Plotkin–Shmoys–Tardos, Cornell ORIE TR 999, p. 17). Let `(x, λ)` with `x ∈ P`,
`λ = λ(x)`, and `y ≥ 0`, `y ≠ 0` be feasible primal and dual solutions satisfying 𝒞1 and 𝒞2, where
`C_𝒞(y) = yᵗ A x̃` for a maximizer `x̃ ∈ P` of `yᵗ A x` over `P`. If `λ ≤ 1 − 3ε` there is no exact
solution; if `λ ≥ 1 − 3ε`, `x` is `3ε`-optimal: `(1 − 3ε) λ(x') ≤ λ` for every `x' ∈ P`.
The hypotheses `y ≠ 0` and `0 < ε < 1/3` are implicit in the paper's proof. -/
theorem lemma_3_1 {m n : ℕ} [NeZero m] (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ)
    (P : Set (Fin n → ℝ)) (hdata : IsCoveringData A b P)
    (ε : ℝ) (hε : 0 < ε) (hε3 : ε < 1 / 3)
    (x : Fin n → ℝ) (hx : x ∈ P) (y : Fin m → ℝ) (hy : ∀ i, 0 ≤ y i) (hy0 : y ≠ 0)
    (xt : Fin n → ℝ) (hxt : xt ∈ P) (hmax : ∀ x' ∈ P, yAx A y x' ≤ yAx A y xt)
    (hC1 : C1 A b ε (lam A b x) y x) (hC2 : C2 A b ε y x (yAx A y xt)) :
    (lam A b x ≤ 1 - 3 * ε → ¬ ∃ x' ∈ P, ∀ i, b i ≤ rowVal A x' i) ∧
    (1 - 3 * ε ≤ lam A b x → ∀ x' ∈ P, (1 - 3 * ε) * lam A b x' ≤ lam A b x) := 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. 17–18, Lemma 3.1
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