Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.1, p. 5 — at a sharp minimum x̄, w.p.1 for N large enough the SAA problem has the unique optimal solution x̂_N = x̄

Proved
SAARate.Sharp.theorem_2_1

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

monte-carlop2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sample-average-approximationsharp-minimumstochastic-programming

Let PPP be a probability measure on (Ω,F)(\Omega,\mathcal F)(Ω,F), Θ⊆Rm\Theta\subseteq\mathbb R^mΘ⊆Rm and h:Rm×Ω→Rh:\mathbb R^m\times\Omega\to\mathbb Rh:Rm×Ω→R, and consider the true problem and its sample average approximation

min⁡x∈Θ{f(x):=EPh(x,ω)},min⁡x∈Θ{f^N(x):=N−1∑j=1Nh(x,ωj)},\min_{x\in\Theta}\bigl\{f(x):=\mathbb E_P h(x,\omega)\bigr\}, \qquad \min_{x\in\Theta}\Bigl\{\hat f_N(x):=N^{-1}\sum_{j=1}^N h(x,\omega^j)\Bigr\},x∈Θmin​{f(x):=EP​h(x,ω)},x∈Θmin​{f^​N​(x):=N−1j=1∑N​h(x,ωj)},

where ω1,ω2,…\omega^1,\omega^2,\dotsω1,ω2,… is an i.i.d. sample from PPP. Suppose that

  1. for every ω∈Ω\omega\in\Omegaω∈Ω the function h(⋅,ω)h(\cdot,\omega)h(⋅,ω) is convex;
  2. the expected value function fff is well defined and finite valued;
  3. the set Θ\ThetaΘ is closed and convex;
  4. Assumption (A) holds: xˉ∈Θ\bar x\in\Thetaxˉ∈Θ is the unique optimal solution of the true problem, and for some c>0c>0c>0, f(x)≥f(xˉ)+c∥x−xˉ∥f(x)\ge f(\bar x)+c\|x-\bar x\|f(x)≥f(xˉ)+c∥x−xˉ∥ for all x∈Θx\in\Thetax∈Θ.

Then w.p.1 for NNN large enough the approximating problem has a unique optimal solution x^N\hat x_Nx^N​ and x^N=xˉ\hat x_N=\bar xx^N​=xˉ:

argmin⁡x∈Θf^N(x)={xˉ}.\operatorname*{argmin}_{x\in\Theta}\hat f_N(x)=\{\bar x\}.x∈Θargmin​f^​N​(x)={xˉ}.

"W.p.1 for NNN large enough" means: for almost every sample path there is N∗N^*N∗, depending on the path, such that the statement holds for every N≥N∗N\ge N^*N≥N∗. At a sharp minimum, therefore, the Monte Carlo approximation does not merely converge to the true solution: it returns it exactly once the sample is large enough.

Formalization Note. Assumption 2 is encoded as integrability of h(x,⋅)h(x,\cdot)h(x,⋅) for every xxx. The sample is one i.i.d. sequence on an auxiliary probability space (S,Q)(S,Q)(S,Q), and f^N\hat f_Nf^​N​ uses its first NNN terms; the conclusion is "for QQQ-almost every path, eventually in NNN". "Unique optimal solution equal to xˉ\bar xxˉ" is the set equality argmin⁡Θf^N={xˉ}\operatorname{argmin}_\Theta\hat f_N=\{\bar x\}argminΘ​f^​N​={xˉ}, which includes existence.

Preamble
import Mathlib
import Definitions.Def_SAARate_Sharp_Setting
Formal statement
namespace SAARate.Sharp

open MeasureTheory ProbabilityTheory Filter Topology

theorem theorem_2_1 {m : ℕ} {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω)
    [IsProbabilityMeasure P] (h : E m → Ω → ℝ)
    (hconv : ∀ ω, ConvexOn ℝ Set.univ (fun x => h x ω))
    (hint : ∀ x, Integrable (h x) P)
    (Θ : Set (E m)) (hΘc : IsClosed Θ) (hΘv : Convex ℝ Θ)
    (xbar : E m) (hA : AssumptionA P h Θ xbar)
    {S : Type*} [MeasurableSpace S] (Q : Measure S) [IsProbabilityMeasure Q]
    (ω : ℕ → S → Ω) (hω : IsIIDSample Q P ω) :
    ∀ᵐ s ∂Q, ∀ᶠ N in atTop, argminOn (saaObj h (fun j => ω j s) N) Θ = {xbar} := by sorry

end SAARate.Sharp
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. 5, Theorem 2.1 (with (1.1), (1.2) p. 1 and Assumption (A) p. 4)
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