Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1 (iii), p. 6 — σ²_x̂(x*_min) ≤ liminf s²_n(x*_n) ≤ limsup s²_n(x*_n) ≤ σ²_x̂(x*_max), w.p.1

Proved
SolutionQuality.SRP.prop1_iii

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

consistencyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sample-variancestochastic-programming

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ξ~​; let xn∗x_n^*xn∗​ be optimal solutions of (SPn_nn​). Let xmin⁡∗∈arg⁡min⁡x∈X∗σx^2(x)x^*_{\min}\in\arg\min_{x\in X^*}\sigma^2_{\hat x}(x)xmin∗​∈argminx∈X∗​σx^2​(x) and xmax⁡∗∈arg⁡max⁡x∈X∗σx^2(x)x^*_{\max}\in\arg\max_{x\in X^*}\sigma^2_{\hat x}(x)xmax∗​∈argmaxx∈X∗​σx^2​(x) be optimal solutions of (SP) with the smallest and the largest variance σ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,

σx^2(xmin⁡∗)≤lim inf⁡n→∞sn2(xn∗)≤lim sup⁡n→∞sn2(xn∗)≤σx^2(xmax⁡∗).\sigma^2_{\hat x}(x^*_{\min})\le\liminf_{n\to\infty}s_n^2(x_n^*)\le\limsup_{n\to\infty}s_n^2(x_n^*)\le\sigma^2_{\hat x}(x^*_{\max}).σx^2​(xmin∗​)≤n→∞liminf​sn2​(xn∗​)≤n→∞limsup​sn2​(xn∗​)≤σx^2​(xmax∗​).

The sample variance computed at the SAA minimizer is asymptotically bracketed by the smallest and largest variances over the optimal set; when X∗X^*X∗ is a singleton it is a consistent estimator of σx^2(x∗)\sigma^2_{\hat x}(x^*)σx^2​(x∗). This is the variance ingredient of the validity proofs of Theorems 2–4.

Formalization Note. The chain of liminf and limsup is stated in its equivalent ε\varepsilonε-form, which avoids the junk value of real liminf on unbounded sequences: almost surely, for every ε>0\varepsilon>0ε>0, eventually σx^2(xmin⁡∗)−ε≤sn2(xn∗)≤σx^2(xmax⁡∗)+ε\sigma^2_{\hat x}(x^*_{\min})-\varepsilon\le s_n^2(x_n^*)\le\sigma^2_{\hat x}(x^*_{\max})+\varepsilonσx^2​(xmin∗​)−ε≤sn2​(xn∗​)≤σx^2​(xmax∗​)+ε. xmin⁡∗x^*_{\min}xmin∗​ and xmax⁡∗x^*_{\max}xmax∗​ are given points with their defining argmin/argmax properties over X∗X^*X∗.

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

open MeasureTheory ProbabilityTheory Filter

theorem prop1_iii {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)
    (xn : ℕ → Ω → E d) (hxn : IsSAAMinimizerSeq P f X ξ xn)
    (xmin xmax : E d)
    (hxmin : xmin ∈ optSet μ f X ∧ ∀ x ∈ optSet μ f X, gapVar μ f xhat xmin ≤ gapVar μ f xhat x)
    (hxmax : xmax ∈ optSet μ f X ∧ ∀ x ∈ optSet μ f X, gapVar μ f xhat x ≤ gapVar μ f xhat xmax) :
    ∀ᵐ ω ∂P, ∀ ε > 0, ∀ᶠ n in atTop,
      gapVar μ f xhat xmin - ε ≤ sampleVar f xhat (fun i => ξ i ω) n (xn n ω) ∧
        sampleVar f xhat (fun i => ξ i ω) n (xn n ω) ≤ gapVar μ f xhat xmax + ε := by sorry

end SolutionQuality.SRP
Source
Bayraksan & Morton, Assessing Solution Quality in Stochastic Programs, preprint (January 26, 2005), p. 6, Proposition 1 (iii); x*_min, x*_max defined on p. 6
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