Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1 (ii), p. 6 — all limit points of {x*_n} lie in X*, w.p.1

Proved
SolutionQuality.SRP.prop1_ii

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

consistencyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sample-average-approximationstochastic-programming

Assume (A1)–(A3), 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 an optimal solution of (SPn_nn​) built on ξ~1,…,ξ~n\tilde\xi^1,\dots,\tilde\xi^nξ~​1,…,ξ~​n, for each nnn, and let X∗X^*X∗ be the set of optimal solutions of (SP). Then, with probability one, every limit point (cluster point) of the sequence {xn∗}\{x_n^*\}{xn∗​} belongs to X∗X^*X∗:

P(every cluster point of (xn∗)n≥1 lies in X∗)=1.P\Big(\text{every cluster point of } (x_n^*)_{n\ge1} \text{ lies in } X^*\Big)=1.P(every cluster point of (xn∗​)n≥1​ lies in X∗)=1.

When (SP) has several optimal solutions the sequence xn∗x_n^*xn∗​ need not converge, but it accumulates only at optimal solutions. This is part (ii) of Proposition 1 and is used in part (iii).

Formalization Note. x^\hat xx^ is not used and is dropped. Each xn∗x_n^*xn∗​ is a measurable map that, almost surely, lies in XXX and minimizes the sample mean fˉn\bar f_nfˉ​n​ over XXX on the same first nnn observations. A limit point is a MapClusterPt of the sequence along atTop.

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

open MeasureTheory ProbabilityTheory Filter

theorem prop1_ii {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 μ ξ)
    (xn : ℕ → Ω → E d) (hxn : IsSAAMinimizerSeq P f X ξ xn) :
    ∀ᵐ ω ∂P, ∀ x, MapClusterPt x atTop (fun n => xn n ω) → x ∈ optSet μ f X := by sorry

end SolutionQuality.SRP
Source
Bayraksan & Morton, Assessing Solution Quality in Stochastic Programs, preprint (January 26, 2005), p. 6, Proposition 1 (ii)
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