Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.2, p. 5 — √N[min_{x∈𝒮*} ĝ_N(x) − v*] = min_{x∈𝒮*}{√N[ĝ_N(x) − g(x)]}

Proved
KleywegtSAA.ValueCLT.sqrt_mul_minOnOpt_sub

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

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

Let S\mathcal SS be a nonempty finite set, ggg the true objective, v∗=min⁡x∈Sg(x)v^* = \min_{x \in \mathcal S} g(x)v∗=minx∈S​g(x), S∗\mathcal S^*S∗ the set of minimizers of ggg, and g^N\hat g_Ng^​N​ the sample average function. Since v∗=g(x)v^* = g(x)v∗=g(x) for every x∈S∗x \in \mathcal S^*x∈S∗, for every sample size NNN and every realization of the sample

N[min⁡x∈S∗g^N(x)−v∗]=min⁡x∈S∗{N [g^N(x)−g(x)]}.\sqrt N \Big[\min_{x \in \mathcal S^*} \hat g_N(x) - v^*\Big] = \min_{x \in \mathcal S^*} \Big\{\sqrt N\,\big[\hat g_N(x) - g(x)\big]\Big\}.N​[x∈S∗min​g^​N​(x)−v∗]=x∈S∗min​{N​[g^​N​(x)−g(x)]}.

The identity expresses the centred and scaled minimum over S∗\mathcal S^*S∗ as a continuous function (the minimum) of the vector of scaled deviations N[g^N(x)−g(x)]\sqrt N[\hat g_N(x) - g(x)]N​[g^​N​(x)−g(x)], x∈S∗x \in \mathcal S^*x∈S∗, to which the central limit theorem applies.

Formalization Note This is a deterministic identity: no measurability, integrability or independence is assumed. It holds for every NNN, including the junk case N=0N = 0N=0 where both sides are 000.

Preamble
import Mathlib
import Definitions.Def_KleywegtSAA_ValueCLT_Setting
Formal statement
namespace KleywegtSAA.ValueCLT

open MeasureTheory ProbabilityTheory Filter Topology

/-- Kleywegt–Shapiro, §2.2, p. 5: since `v* = g(x)` for every `x ∈ S*`,
`√N [min_{x ∈ S*} ĝ_N(x) − v*] = min_{x ∈ S*} {√N [ĝ_N(x) − g(x)]}`. -/
theorem sqrt_mul_minOnOpt_sub
    {X : Type*} (S : Finset X) (hS : S.Nonempty)
    {𝒲 : Type*} (G : X → 𝒲 → ℝ)
    {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) (W : ℕ → Ω → 𝒲) :
    ∀ (N : ℕ) (ω : Ω),
      Real.sqrt N * (minOnOpt S hS G P W N ω - S.inf' hS (KleywegtSAA.ExpRate.trueObj G P W)) =
        (optSet S hS (KleywegtSAA.ExpRate.trueObj G P W)).inf' (optSet_nonempty S hS (KleywegtSAA.ExpRate.trueObj G P W))
          (fun x => Real.sqrt N * (KleywegtSAA.ExpRate.sampleObj G W N ω x - KleywegtSAA.ExpRate.trueObj G P W x)) := by sorry

end KleywegtSAA.ValueCLT
Source
Kleywegt & Shapiro, The sample average approximation method for stochastic discrete optimization, preprint (two-author version, sha256 56657748…), p. 5, §2.2, proof of Proposition 2.3, the display following "Furthermore, since v* = g(x) for any x ∈ 𝒮*"
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