Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.2, p. 4 — 1 − P(Ŝ^ε_N ⊂ 𝒮^ε) ≤ Σ_{x∈𝒮} P{|ĝ_N(x) − g(x)| ≥ α(ε)/2}

Proved
KleywegtSAA.ExpRate.union_bound

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sample-average-approximationunion-bound

Let S\mathcal SS be a nonempty finite set, (Ω,P)(\Omega, P)(Ω,P) a probability space carrying the sample W1,W2,…W^1, W^2, \dotsW1,W2,…, ε≥0\varepsilon \ge 0ε≥0, and suppose S∖Sε\mathcal S \setminus \mathcal S^\varepsilonS∖Sε is nonempty. Then for every sample size NNN,

1−P(S^Nε⊂Sε)≤∑x∈SP{∣g^N(x)−g(x)∣≥α(ε)/2}.1 - P\big(\hat{\mathcal S}^\varepsilon_N \subset \mathcal S^\varepsilon\big) \le \sum_{x \in \mathcal S} P\big\{ |\hat g_N(x) - g(x)| \ge \alpha(\varepsilon)/2 \big\}.1−P(S^Nε​⊂Sε)≤x∈S∑​P{∣g^​N​(x)−g(x)∣≥α(ε)/2}.

The bound reduces the failure probability of the SAA method to finitely many one-dimensional deviation probabilities, each controlled by the large-deviations bound (2.4).

Formalization Note The statement holds for any sample sequence, so independence, identical distribution, measurability and integrability are omitted (a stronger statement). Probabilities are values of the measure in [0,∞][0,\infty][0,∞], with truncated subtraction 1−P(⋅)1 - P(\cdot)1−P(⋅); for a probability measure this is the usual complement probability.

Preamble
import Mathlib
import Definitions.Def_KleywegtSAA_ExpRate_Setting

open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace KleywegtSAA.ExpRate

/-- §2.2, p. 4: `1 − P(Ŝ^ε_N ⊂ S^ε) ≤ ∑_{x ∈ S} P{|ĝ_N(x) − g(x)| ≥ α(ε)/2}` for every sample
size `N`. -/
theorem union_bound {X : Type*} (S : Finset X) (hS : S.Nonempty)
    {𝒲 : Type*} (G : X → 𝒲 → ℝ)
    {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P] (W : ℕ → Ω → 𝒲)
    (ε : ℝ) (hε : 0 ≤ ε) (hne : (nonOptSet S hS (trueObj G P W) ε).Nonempty) :
    ∀ N : ℕ,
      1 - P {ω | epsSet S hS (sampleObj G W N ω) ε ⊆ epsSet S hS (trueObj G P W) ε} ≤
        ∑ x ∈ S, P {ω | alpha S hS (trueObj G P W) ε hne / 2 ≤
          |sampleObj G W N ω x - trueObj G P W x|} := by sorry

end KleywegtSAA.ExpRate
Source
Kleywegt & Shapiro, The sample average approximation method for stochastic discrete optimization, preprint (two-author version, sha256 56657748…), p. 4, §2.2, display after "it follows that"
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