Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.2, p. 12, (3.17) — ∃ β > 0, limsup_N N⁻¹ log P(ℳ_N^c) ≤ −β

Proved
SAARate.Polyhedral.theorem_3_2

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

large-deviationsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polyhedralsample-average-approximationstochastic-programming

Assume the conditions of Theorem 2.3:

  1. the scenario set Ω\OmegaΩ is finite;
  2. every h(⋅,ω)h(\cdot,\omega)h(⋅,ω) is piecewise linear and convex on Rm\mathbb R^mRm;
  3. Θ\ThetaΘ is closed, convex and polyhedral;
  4. the optimal set AAA of the true problem min⁡x∈ΘEPh(x,ω)\min_{x\in\Theta}\mathbb E_Ph(x,\omega)minx∈Θ​EP​h(x,ω) is nonempty and bounded.

Let ω1,ω2,…\omega^1,\omega^2,\dotsω1,ω2,… be an i.i.d. sample from PPP on a probability space (S,Q)(S,Q)(S,Q), let ANA_NAN​ be the optimal set of the SAA problem min⁡x∈ΘN−1∑j=1Nh(x,ωj)\min_{x\in\Theta}N^{-1}\sum_{j=1}^Nh(x,\omega^j)minx∈Θ​N−1∑j=1N​h(x,ωj), and let

MN:={ AN is nonempty and forms a face of A }.(3.16)\mathcal M_N:=\{\,A_N\text{ is nonempty and forms a face of }A\,\}.\tag{3.16}MN​:={AN​ is nonempty and forms a face of A}.(3.16)

Then there is a constant β>0\beta>0β>0 such that

lim sup⁡N→∞1Nlog⁡Q(MNc)≤−β.(3.17)\limsup_{N\to\infty}\frac1N\log Q(\mathcal M_N^c)\le-\beta.\tag{3.17}N→∞limsup​N1​logQ(MNc​)≤−β.(3.17)

The probability that the SAA problem fails to return a face of the true optimal set decays exponentially in the sample size. This is the quantitative form of Theorem 2.3, and it explains why small samples already solve finite piecewise linear stochastic programs exactly.

Formalization Note (3.17) is stated in the equivalent form: for every δ>0\delta>0δ>0, eventually Q(MNc)≤e−(β−δ)NQ(\mathcal M_N^c)\le e^{-(\beta-\delta)N}Q(MNc​)≤e−(β−δ)N. This avoids the logarithm of a probability that may be 000. MNc\mathcal M_N^cMNc​ is not shown to be measurable, so Q(MNc)Q(\mathcal M_N^c)Q(MNc​) is its outer measure; an upper bound on it is the stronger statement. The complement is of the whole event: ANA_NAN​ empty, or ANA_NAN​ not a face of AAA. The empty set is a face of every set, so nonemptiness is stated explicitly.

Preamble
import Mathlib
import Definitions.Def_SAARate_Polyhedral_Setting

open MeasureTheory ProbabilityTheory Filter
Formal statement
namespace SAARate.Polyhedral

/-- Theorem 3.2, p. 12, (3.17): under the assumptions (i)–(iv) of Theorem 2.3 there is `β > 0`
with `limsup_N N⁻¹ log P(ℳ_N^c) ≤ −β`, where `ℳ_N` (3.16) is the event that the SAA optimal set
`A_N` is nonempty and a face of the true optimal set `A`. Stated in ε-form: for every `δ > 0`,
eventually `P(ℳ_N^c) ≤ exp(−(β − δ) N)`, with `P(ℳ_N^c)` the outer measure. -/
theorem theorem_3_2 {m : ℕ} {Ω : Type*} [Fintype Ω] [MeasurableSpace Ω]
    [MeasurableSingletonClass Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (h : SAARate.Sharp.E m → Ω → ℝ) (hpl : ∀ ω, IsPLConvex (fun x => h x ω))
    (Θ : Set (SAARate.Sharp.E m)) (hΘc : IsClosed Θ) (hΘv : Convex ℝ Θ) (hΘp : IsPolyhedral Θ)
    (hA : (SAARate.Sharp.argminOn (SAARate.Sharp.expectedObj P h) Θ).Nonempty ∧
      Bornology.IsBounded (SAARate.Sharp.argminOn (SAARate.Sharp.expectedObj P h) Θ))
    {S : Type*} [MeasurableSpace S] (Q : Measure S) [IsProbabilityMeasure Q]
    (ω : ℕ → S → Ω) (hω : SAARate.SharpLD.IsIIDSample Q P ω) :
    ∃ β > 0, ∀ δ > 0, ∀ᶠ N : ℕ in atTop,
      Q {s | ¬ ((SAARate.Sharp.argminOn (SAARate.Sharp.saaObj h (fun j => ω j s) N) Θ).Nonempty ∧
          IsFace (SAARate.Sharp.argminOn (SAARate.Sharp.expectedObj P h) Θ) (SAARate.Sharp.argminOn (SAARate.Sharp.saaObj h (fun j => ω j s) N) Θ))} ≤
        ENNReal.ofReal (Real.exp (-(β - δ) * (N : ℝ))) := by sorry

end SAARate.Polyhedral
Source
Shapiro & Homem-de-Mello, On Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs, preprint (SPEPS copy, edoc.hu-berlin.de), p. 12, Theorem 3.2, (3.16), (3.17)
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