Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.1, proof of Proposition 2.1, p. 3 — if δ_N < α(ε)/2 then Ŝ^ε_N ⊂ 𝒮^ε

Proved
KleywegtSAA.ExpRate.subset_of_devMax_lt

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sample-average-approximation

Let S\mathcal SS be a nonempty finite set, ggg the true objective and g^N\hat g_Ng^​N​ the sample average function along a realization ω\omegaω, ε≥0\varepsilon \ge 0ε≥0, and suppose S∖Sε\mathcal S \setminus \mathcal S^\varepsilonS∖Sε is nonempty so that α(ε)\alpha(\varepsilon)α(ε) of (2.3) is defined. For every sample size NNN and every realization ω\omegaω,

δN=max⁡x∈S∣g^N(x)−g(x)∣<α(ε)2⟹S^Nε⊂Sε.\delta_N = \max_{x \in \mathcal S} |\hat g_N(x) - g(x)| < \frac{\alpha(\varepsilon)}{2} \quad\Longrightarrow\quad \hat{\mathcal S}^\varepsilon_N \subset \mathcal S^\varepsilon.δN​=x∈Smax​∣g^​N​(x)−g(x)∣<2α(ε)​⟹S^Nε​⊂Sε.

This is the deterministic core of Propositions 2.1 and 2.2: once the sample average is uniformly within α(ε)/2\alpha(\varepsilon)/2α(ε)/2 of the true objective, every ε\varepsilonε-optimal solution of the SAA problem is ε\varepsilonε-optimal for the true problem.

Formalization Note The implication is pointwise in ω\omegaω and NNN; it needs no independence, integrability or measurability, so those standing hypotheses are omitted (a stronger statement).

Preamble
import Mathlib
import Definitions.Def_KleywegtSAA_ExpRate_Setting

open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace KleywegtSAA.ExpRate

/-- Proof of Proposition 2.1, p. 3 (restated p. 4): if `δ_N < α(ε)/2` then `Ŝ^ε_N ⊂ S^ε`.
Deterministic in the realization `ω` and the sample size `N`. -/
theorem subset_of_devMax_lt {X : Type*} (S : Finset X) (hS : S.Nonempty)
    {𝒲 : Type*} (G : X → 𝒲 → ℝ)
    {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) (W : ℕ → Ω → 𝒲)
    (ε : ℝ) (hε : 0 ≤ ε) (hne : (nonOptSet S hS (trueObj G P W) ε).Nonempty) :
    ∀ (N : ℕ) (ω : Ω), devMax S hS G P W N ω < alpha S hS (trueObj G P W) ε hne / 2 →
      epsSet S hS (sampleObj G W N ω) ε ⊆ epsSet S hS (trueObj G P W) ε := 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, proof of Proposition 2.1 (restated p. 4, §2.2)
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