Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.1, (2.3), p. 3 — α(ε) = min_{x∈𝒮∖𝒮^ε} g(x) − v* − ε > 0

Proved
KleywegtSAA.ExpRate.alpha_pos

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sample-average-approximationwell-conditioning

Let S\mathcal SS be a nonempty finite set, g:S→Rg : \mathcal S \to \mathbb Rg:S→R any function, v∗=min⁡Sgv^* = \min_{\mathcal S} gv∗=minS​g, and ε≥0\varepsilon \ge 0ε≥0. Let Sε={x∈S:g(x)≤v∗+ε}\mathcal S^\varepsilon = \{x \in \mathcal S : g(x) \le v^* + \varepsilon\}Sε={x∈S:g(x)≤v∗+ε} and suppose S∖Sε\mathcal S \setminus \mathcal S^\varepsilonS∖Sε is nonempty. Then

α(ε)=min⁡x∈S∖Sεg(x)−v∗−ε>0.\alpha(\varepsilon) = \min_{x \in \mathcal S \setminus \mathcal S^\varepsilon} g(x) - v^* - \varepsilon > 0.α(ε)=x∈S∖Sεmin​g(x)−v∗−ε>0.

The number α(ε)\alpha(\varepsilon)α(ε) measures how well the ε\varepsilonε-optimal solutions are separated from the rest; it is the margin that the sample average must resolve.

Formalization Note The statement holds for any real function on S\mathcal SS, so it is stated without probability. When Sε=S\mathcal S^\varepsilon = \mathcal SSε=S the paper's α(ε)\alpha(\varepsilon)α(ε) is a minimum over the empty set and is undefined; the nonemptiness of S∖Sε\mathcal S \setminus \mathcal S^\varepsilonS∖Sε is therefore a hypothesis.

Preamble
import Mathlib
import Definitions.Def_KleywegtSAA_ExpRate_Setting

open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace KleywegtSAA.ExpRate

/-- (2.3), p. 3: for `ε ≥ 0`, if `S \ S^ε` is nonempty then
`α(ε) = min_{x ∈ S \ S^ε} g(x) − v* − ε > 0`. Stated for an arbitrary real function `g` on `S`. -/
theorem alpha_pos {X : Type*} (S : Finset X) (hS : S.Nonempty) (g : X → ℝ)
    (ε : ℝ) (hε : 0 ≤ ε) (hne : (nonOptSet S hS g ε).Nonempty) :
    0 < alpha S hS g ε hne := by sorry

end KleywegtSAA.ExpRate
Source
Kleywegt & Shapiro, The sample average approximation method for stochastic discrete optimization, preprint (two-author version, sha256 56657748…), p. 3, (2.3) and the sentence after it
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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