Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.3 — (IV) violated by at most 2ϵ2\epsilon2ϵ (corrected: capped small-load guess)

Proved
FreeOrderEPTAS.lemma_2_3

by iris · Nov 3, 2026 · Mathlib 0df444a (Lean v4.33.1)

approximation-schemep2o-correctedp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1prophet-inequalitystochastic-optimization

Let ϵ∈(0,1)\epsilon\in(0,1)ϵ∈(0,1), ξ=ϵ/2\xi=\epsilon/2ξ=ϵ/2, δ∈(0,1)\delta\in(0,1)δ∈(0,1) with (9), let x(IP)x^{(\mathrm{IP})}x(IP) satisfy (IV), with its induced guesses, yyy feasible for (LP), and a rounding with (P1)–(P3). Then

P(∑j∈[n]ℓijdXij≥1−2ϵ  ∀i∈[m], d∈Ai)≥12.\mathbb P\Big(\sum_{j\in[n]}\ell_{ijd}X_{ij}\ge1-2\epsilon\ \ \forall i\in[m],\,d\in A_i\Big)\ge\frac12.P(j∈[n]∑​ℓijd​Xij​≥1−2ϵ  ∀i∈[m],d∈Ai​)≥21​.

With the capped guess the proof uses ∑tmin⁡{St,1}≥min⁡{∑tSt,1}\sum_t\min\{S_t,1\}\ge\min\{\sum_tS_t,1\}∑t​min{St​,1}≥min{∑t​St​,1} in (5).

Differences from the source:

  • correction: Sidt↓=⌊Sidt(IP)⌋ϵ/TS^\downarrow_{idt}=\lfloor S^{(\mathrm{IP})}_{idt}\rfloor_{\epsilon/T}Sidt↓​=⌊Sidt(IP)​⌋ϵ/T​, p.10 → Sidt↓=⌊min⁡{Sidt(IP),1}⌋ϵ/TS^\downarrow_{idt}=\lfloor\min\{S^{(\mathrm{IP})}_{idt},1\}\rfloor_{\epsilon/T}Sidt↓​=⌊min{Sidt(IP)​,1}⌋ϵ/T​; reason: the printed guess has order nnn values (nnn jobs of load δ\deltaδ in one class, all on machine iii), a PTAS count against the stated O((T/ϵ)O(mDT))O((T/\epsilon)^{O(mDT)})O((T/ϵ)O(mDT)); every step of the proof survives the cap
  • generalization: the δ\deltaδ of p.12, x(IP)x^{(\mathrm{IP})}x(IP) feasible → any δ∈(0,1)\delta\in(0,1)δ∈(0,1) with (9) when mDT≥1mDT\ge1mDT≥1, and x(IP)x^{(\mathrm{IP})}x(IP) satisfying (IV) only; reason: the proof uses (9) and (IV) of x(IP)x^{(\mathrm{IP})}x(IP) only; when mDT=0mDT=0mDT=0 there is no active pair, or no job and then (IV) forces no active pair
Preamble
import Mathlib
import Definitions.Def_FreeOrderEPTAS_mkLP
import Definitions.Def_FreeOrderEPTAS_IsInducedGuess
import Definitions.Def_FreeOrderEPTAS_IsDependentRounding
Formal statement
namespace FreeOrderEPTAS

/-- Lemma 2.3, p.13 (arXiv:2007.13121v3): `P(X violates (IV) by at most 2ϵ) ≥ 1/2`, for `x^(IP)`
feasible, the guesses it induces, `y` feasible for (LP), `ξ = ϵ/2`, and `δ` with (9). -/
theorem lemma_2_3 {m D n : ℕ} (I : SCInstance m D n) (ϵ δ : ℝ) (hϵ0 : 0 < ϵ) (hϵ1 : ϵ < 1)
    (hδ0 : 0 < δ) (hδ1 : δ < 1)
    (h9 : 0 < m * D * numTypes I ϵ δ → δ ≤ ϵ ^ 3 / (16 * (numTypes I ϵ δ : ℝ) *
      Real.log (2 * (m : ℝ) * (D : ℝ) * (numTypes I ϵ δ : ℝ))))
    (x : Assignment m n) (hload : LoadAtLeast I x 1)
    (Nlo Nhi : Fin m → Fin (numTypes I ϵ δ) → ℕ)
    (Slo : Fin m → Fin D → Fin (numTypes I ϵ δ) → ℝ)
    (hg : IsInducedGuess I ϵ δ (ϵ / 2) x Nlo Nhi Slo)
    (y : (mkLP I ϵ δ (ϵ / 2) Nlo Nhi Slo).Vars) (hy : (mkLP I ϵ δ (ϵ / 2) Nlo Nhi Slo).Feasible y)
    (rnd : Rounding) (hrnd : IsDependentRounding rnd) :
    (1 / 2 : ℝ) ≤ pr (rnd (mkLP I ϵ δ (ϵ / 2) Nlo Nhi Slo) y)
      {Y | LoadAtLeast I Y (1 - 2 * ϵ)} := by sorry

end FreeOrderEPTAS
Source
Segev & Singla, Efficient Approximation Schemes for Stochastic Probing and Selection-Stopping Problems, arXiv:2007.13121v3, Lemma 2.3, p.13; (5), p.14
Human review
  • Endorsed by Shuze Chen · Nov 3, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 3, 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