Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.4 (b), p. 6, (2.12) — w.p.1, sup_x ℋ(∂f̂_N(x), ∂f(x)) → 0

Proved
SAARate.Polyhedral.lemma_2_4_b

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

hausdorff-distancep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sample-average-approximationstochastic-programmingsubdifferential

Let Ω\OmegaΩ be finite with probability measure PPP, let every h(⋅,ω)h(\cdot,\omega)h(⋅,ω) be piecewise linear and convex on Rm\mathbb R^mRm, and let ω1,ω2,…\omega^1,\omega^2,\dotsω1,ω2,… be an i.i.d. sample from PPP. With fff, f^N\hat f_Nf^​N​ and ∂\partial∂ as in the mission's setting and H\mathcal HH the Hausdorff distance between subsets of Rm\mathbb R^mRm, with probability one

lim⁡N→∞ sup⁡x∈Rm H(∂f^N(x), ∂f(x))=0.\lim_{N\to\infty}\ \sup_{x\in\mathbb R^m}\ \mathcal H\big(\partial\hat f_N(x),\,\partial f(x)\big)=0 .N→∞lim​ x∈Rmsup​ H(∂f^​N​(x),∂f(x))=0.

The subdifferentials of the sample average function converge to those of the true expected value function uniformly over the whole space. This is the route to Theorem 2.3 through optimality conditions.

Formalization Note The Hausdorff distance is Mathlib's extended Hausdorff distance (values in [0,∞][0,\infty][0,∞]), and the supremum is taken in [0,∞][0,\infty][0,∞]. The statement concerns one i.i.d. sequence: "w.p.1" means for almost every sample path.

Preamble
import Mathlib
import Definitions.Def_SAARate_Polyhedral_Setting
import Definitions.Def_ShorNonsmooth_Subdiff_Subdifferential

open MeasureTheory ProbabilityTheory Filter Topology ShorNonsmooth.Subdiff
Formal statement
namespace SAARate.Polyhedral

/-- Lemma 2.4 (b), p. 6, (2.12): under (i) and (ii), with probability one the subdifferentials
`∂f̂_N(x)` converge to `∂f(x)` uniformly in `x ∈ ℝ^m`, in the Hausdorff distance. -/
theorem lemma_2_4_b {m : ℕ} {Ω : Type*} [Fintype Ω] [MeasurableSpace Ω]
    [MeasurableSingletonClass Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (h : SAARate.Sharp.E m → Ω → ℝ) (hpl : ∀ ω, IsPLConvex (fun x => h x ω))
    {S : Type*} [MeasurableSpace S] (Q : Measure S) [IsProbabilityMeasure Q]
    (ω : ℕ → S → Ω) (hω : SAARate.SharpLD.IsIIDSample Q P ω) :
    ∀ᵐ s ∂Q, Tendsto (fun N : ℕ => ⨆ x : SAARate.Sharp.E m,
        Metric.hausdorffEDist (subdifferential Set.univ (SAARate.Sharp.saaObj h (fun j => ω j s) N) x)
          (subdifferential Set.univ (SAARate.Sharp.expectedObj P h) x)) atTop (𝓝 0) := by sorry

end SAARate.Polyhedral
Source
Shapiro & Homem-de-Mello, On Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs, preprint (SPEPS copy, edoc.hu-berlin.de), p. 6, Lemma 2.4 (b), (2.12)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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