Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 1, p. 6 — f̄_n(x) → Ef(x, ξ̃) uniformly on X, w.p.1

Proved
SolutionQuality.SRP.fbar_tendstoUniformlyOn

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sample-average-approximationstochastic-programminguniform-law-of-large-numbers

Assume (A1)–(A3), and let ξ~1,ξ~2,…\tilde\xi^1,\tilde\xi^2,\dotsξ~​1,ξ~​2,… be i.i.d. as ξ~\tilde\xiξ~​. Then, with probability one, the sample mean functions fˉn(x)=1n∑i=1nf(x,ξ~i)\bar f_n(x)=\frac1n\sum_{i=1}^n f(x,\tilde\xi^i)fˉ​n​(x)=n1​∑i=1n​f(x,ξ~​i) converge to the expected cost Ef(x,ξ~)Ef(x,\tilde\xi)Ef(x,ξ~​) uniformly on XXX:

sup⁡x∈X∣fˉn(x)−Ef(x,ξ~)∣→n→∞0w.p.1.\sup_{x\in X}\big|\bar f_n(x)-Ef(x,\tilde\xi)\big|\xrightarrow[n\to\infty]{}0\qquad\text{w.p.1}.x∈Xsup​​fˉ​n​(x)−Ef(x,ξ~​)​n→∞​0w.p.1.

This uniform strong law of large numbers is the engine behind every consistency statement of the paper: it yields convergence of optimal values (Proposition 1 (i)) and of optimal solutions (Proposition 1 (ii)). The paper quotes it from Rubinstein and Shapiro, Lemma A1.

Formalization Note. The candidate x^\hat xx^ and the minimizers xn∗x_n^*xn∗​ play no role and are not hypotheses. f(x,⋅)f(x,\cdot)f(x,⋅) is assumed measurable for each xxx (the paper's "f(x,ξ~)f(x,\tilde\xi)f(x,ξ~​) is a random variable"). Uniform convergence on XXX is Mathlib's TendstoUniformlyOn.

Preamble
import Mathlib
import Definitions.Def_SolutionQuality_SRP_Setting
Formal statement
namespace SolutionQuality.SRP

open MeasureTheory ProbabilityTheory Filter

theorem fbar_tendstoUniformlyOn {d : ℕ} {Ξ : Type*} [MeasurableSpace Ξ]
    (μ : Measure Ξ) [IsProbabilityMeasure μ]
    (f : E d → Ξ → ℝ) (hfm : ∀ x, Measurable (f x))
    (X : Set (E d)) (hA : Assumptions μ f X)
    {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (ξ : ℕ → Ω → Ξ) (hξ : IsIIDSample P μ ξ) :
    ∀ᵐ ω ∂P, TendstoUniformlyOn (fun n x => sampleMean f (fun i => ξ i ω) n x)
      (expectedCost μ f) atTop X := by sorry

end SolutionQuality.SRP
Source
Bayraksan & Morton, Assessing Solution Quality in Stochastic Programs, preprint (January 26, 2005), p. 6, proof of Proposition 1, second sentence
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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