Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.9 (i), p. 21 — a.s. every cluster point of estimated optimal solutions minimizes Ef

Proved
DupacovaWets.Consistency.clusterPt_mem_argmin

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

consistencyp2o-batch-pfp1bp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-programming

The standing data are those of §3: Ξ\XiΞ is a Polish space with its Borel σ\sigmaσ-field, PPP a probability measure on it, (Z,F,μ)(Z,\mathcal F,\mu)(Z,F,μ) a probability space with an increasing sequence of sub-σ\sigmaσ-fields F1⊆F2⊆⋯⊆F\mathcal F^1\subseteq\mathcal F^2\subseteq\dots\subseteq\mathcal FF1⊆F2⊆⋯⊆F, Pν(⋅,ζ)P^\nu(\cdot,\zeta)Pν(⋅,ζ) random probability measures on Ξ\XiΞ, and f:Rn×Ξ→(−∞,∞]f:\mathbb R^n\times\Xi\to(-\infty,\infty]f:Rn×Ξ→(−∞,∞] an integrand with domain S×ΞS\times\XiS×Ξ; fff, SSS and the measures satisfy Assumptions 3.4 and 3.5. Write Ef(x)=∫Ξf(x,ξ) P(dξ)Ef(x)=\int_\Xi f(x,\xi)\,P(d\xi)Ef(x)=∫Ξ​f(x,ξ)P(dξ) and Eνf(x,ζ)=∫Ξf(x,ξ) Pν(dξ,ζ)E^\nu f(x,\zeta)=\int_\Xi f(x,\xi)\,P^\nu(d\xi,\zeta)Eνf(x,ζ)=∫Ξ​f(x,ξ)Pν(dξ,ζ), with the +∞+\infty+∞ convention of p. 10.

Under Assumptions 3.4 and 3.5 there is Z0∈FZ_0\in\mathcal FZ0​∈F with μ(Z∖Z0)=0\mu(Z\setminus Z_0)=0μ(Z∖Z0​)=0 such that for every ζ∈Z0\zeta\in Z_0ζ∈Z0​: if xν∈argmin⁡Eνf(⋅,ζ)x^\nu\in\operatorname{argmin}E^\nu f(\cdot,\zeta)xν∈argminEνf(⋅,ζ) for ν=1,2,…\nu=1,2,\dotsν=1,2,…, then every cluster point x^\hat xx^ of (xν)(x^\nu)(xν) satisfies

x^∈argmin⁡Ef,\hat x\in\operatorname{argmin} Ef ,x^∈argminEf,

i.e. it is an optimal solution of the true problem.

This is the solution part of the consistency theorem, valid without assuming that EfEfEf has a unique minimizer.

Formalization Note Lean writes Rn\mathbb R^nRn as EuclideanSpace ℝ (Fin n), and the sample index is shifted: Lean's Pν k ζ and 𝔽 k are the paper's Pk+1(⋅,ζ)P^{k+1}(\cdot,\zeta)Pk+1(⋅,ζ) and Fk+1\mathcal F^{k+1}Fk+1, while P=P0P = P^0P=P0 is kept as the separate argument P. A cluster point is a point x^\hat xx^ such that every neighbourhood of x^\hat xx^ contains xνx^\nuxν for infinitely many ν\nuν (MapClusterPt). On the page (i) and (ii) share one set Z0Z_0Z0​; as separate items each has its own, and intersecting the two recovers a common one. The printed "argmin⁡Eνfν\operatorname{argmin}E^\nu f^\nuargminEνfν" is read as argmin⁡Eνf\operatorname{argmin}E^\nu fargminEνf. The paper also says that Ξ\XiΞ is the support of PPP; this hypothesis is not used in the proofs of §3 and is omitted, which makes the statement stronger.

Preamble
import Mathlib
import Definitions.Def_DupacovaWets_Consistency_expect
import Definitions.Def_DupacovaWets_Consistency_ExtendedFunctions
import Definitions.Def_DupacovaWets_Consistency_Assumptions
open MeasureTheory Filter Topology
Formal statement
namespace DupacovaWets.Consistency

/-- Dupačová–Wets (WP-86-41), p. 21, Theorem 3.9 (i): there is `Z₀ ∈ F` with `μ(Z \ Z₀) = 0`
such that for every `ζ ∈ Z₀`, every cluster point of every sequence `x^ν ∈ argmin E^ν f(·, ζ)`
belongs to `argmin Ef`. (`Pν k` is the paper's `P^{k+1}`.) -/
theorem clusterPt_mem_argmin {n : ℕ} {Ξ : Type*} [TopologicalSpace Ξ] [PolishSpace Ξ] [MeasurableSpace Ξ] [BorelSpace Ξ]
    (P : Measure Ξ) [IsProbabilityMeasure P]
    {Z : Type*} [mZ : MeasurableSpace Z] (μ : Measure Z) [IsProbabilityMeasure μ]
    (𝔽 : Filtration ℕ mZ) (Pν : ℕ → Z → Measure Ξ)
    (f : EuclideanSpace ℝ (Fin n) → Ξ → EReal) (S : Set (EuclideanSpace ℝ (Fin n)))
    (h34 : Assumption3_4 f S) (h35 : Assumption3_5 f S P μ 𝔽 Pν) :
    ∃ Z₀ : Set Z, MeasurableSet Z₀ ∧ μ Z₀ᶜ = 0 ∧ ∀ ζ ∈ Z₀,
      ∀ xs : ℕ → EuclideanSpace ℝ (Fin n), (∀ k, xs k ∈ argminSet (expectFn (Pν k ζ) f)) →
        ∀ xhat : EuclideanSpace ℝ (Fin n), MapClusterPt xhat atTop xs →
          xhat ∈ argminSet (expectFn P f) := by sorry

end DupacovaWets.Consistency
Source
Dupačová & Wets, IIASA Working Paper WP-86-41 (Aug. 1986), p. 21, Theorem 3.9 (i)
Human review
  • Endorsed by Shuze Chen · Oct 4, 2026

    Confirmed by the moderator at approval.

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