Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.6 — with mmm oracle calls, an initial x∈Px\in Px∈P with Ax≥1mbAx\ge\frac1m bAx≥m1​b or a proof that no exact solution exists

Proved
FracPackCover.Covering.lemma_3_6

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

fractional-coveringinitializationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let A≥0A\ge0A≥0, b>0b>0b>0, PPP be covering data and let subroutine (7) be an exact maximization oracle. The initial-solution procedure calls the oracle once for each row iii, with costs aia_iai​, obtaining xi∈Px_i\in Pxi​∈P that maximizes aixa_ixai​x over PPP (mmm calls in all), and then:

  1. if aixi<bia_ix_i<b_iai​xi​<bi​ for some iii, it reports that there is no exact solution, and indeed no x′∈Px'\in Px′∈P has Ax′≥bAx'\ge bAx′≥b;
  2. otherwise it returns x=1m∑ixix=\frac1m\sum_i x_ix=m1​∑i​xi​, which lies in PPP and satisfies
Ax ≥ 1m b.Ax\ \ge\ \tfrac1m\, b .Ax ≥ m1​b.

This provides the starting point of the covering algorithm, with λ(x)≥1/m\lambda(x)\ge 1/mλ(x)≥1/m.

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

/-- Lemma 3.6 (Plotkin–Shmoys–Tardos, Cornell ORIE TR 999, p. 20). The initial-solution procedure
`initCover`, which makes `m` calls to subroutine (7) (one with costs `a_i` for each row `i`), either
finds `x ∈ P` with `A x ≥ (1/m) b`, or correctly concludes that there is no exact solution. -/
theorem lemma_3_6 {m n : ℕ} [NeZero m] (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ)
    (P : Set (Fin n → ℝ)) (hdata : IsCoveringData A b P)
    (orc : (Fin m → ℝ) → (Fin n → ℝ)) (horc : IsMaxOracle A P orc) :
    (initCover A b orc = none → ¬ ∃ x' ∈ P, ∀ i, b i ≤ rowVal A x' i) ∧
    (∀ x, initCover A b orc = some x → x ∈ P ∧ ∀ i, (1 / (m : ℝ)) * b i ≤ rowVal A x i) := 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. 20, Lemma 3.6
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