Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 1, pp. 6–7 — s²_n(x) → σ²_x̂(x) uniformly on X, w.p.1

Proved
SolutionQuality.SRP.sampleVar_tendstoUniformlyOn

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

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

Assume (A1)–(A3), let x^∈X\hat x\in Xx^∈X, and let ξ~1,ξ~2,…\tilde\xi^1,\tilde\xi^2,\dotsξ~​1,ξ~​2,… be i.i.d. as ξ~\tilde\xiξ~​. For x∈Xx\in Xx∈X let

sn2(x)=1n−1∑i=1n[(f(x^,ξ~i)−f(x,ξ~i))−(fˉn(x^)−fˉn(x))]2s_n^2(x)=\frac{1}{n-1}\sum_{i=1}^n\Big[\big(f(\hat x,\tilde\xi^i)-f(x,\tilde\xi^i)\big)-\big(\bar f_n(\hat x)-\bar f_n(x)\big)\Big]^2sn2​(x)=n−11​i=1∑n​[(f(x^,ξ~​i)−f(x,ξ~​i))−(fˉ​n​(x^)−fˉ​n​(x))]2

be the sample variance of the differences f(x^,ξ~i)−f(x,ξ~i)f(\hat x,\tilde\xi^i)-f(x,\tilde\xi^i)f(x^,ξ~​i)−f(x,ξ~​i), and σx^2(x)=var⁡[f(x^,ξ~)−f(x,ξ~)]\sigma^2_{\hat x}(x)=\operatorname{var}[f(\hat x,\tilde\xi)-f(x,\tilde\xi)]σx^2​(x)=var[f(x^,ξ~​)−f(x,ξ~​)]. Then, with probability one,

sup⁡x∈X∣sn2(x)−σx^2(x)∣→n→∞0.\sup_{x\in X}\big|s_n^2(x)-\sigma^2_{\hat x}(x)\big|\xrightarrow[n\to\infty]{}0 .x∈Xsup​​sn2​(x)−σx^2​(x)​n→∞​0.

This is the first step of the proof of Proposition 1 (iii): combined with part (ii) it controls the sample variance evaluated at the random minimizer xn∗x_n^*xn∗​.

Formalization Note. The minimizers xn∗x_n^*xn∗​ do not appear. f(x,⋅)f(x,\cdot)f(x,⋅) is assumed measurable for each xxx. σx^2\sigma^2_{\hat x}σx^2​ is Mathlib's variance, finite under (A2).

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

open MeasureTheory ProbabilityTheory Filter

theorem sampleVar_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 μ ξ)
    (xhat : E d) (hxhat : xhat ∈ X) :
    ∀ᵐ ω ∂P, TendstoUniformlyOn (fun n x => sampleVar f xhat (fun i => ξ i ω) n x)
      (gapVar μ f xhat) atTop X := by sorry

end SolutionQuality.SRP
Source
Bayraksan & Morton, Assessing Solution Quality in Stochastic Programs, preprint (January 26, 2005), pp. 6–7, proof of Proposition 1 (iii), first claim
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