Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.3, (6), p. 8, case d = 0 — ∅ ≠ S_U(ν) ⊆ S(μ) + Ψ(L̂ d_{F_U}(μ, ν))𝔹 for each ν ∈ P_{F_U}

Proved
ProbMetricStab.General.theorem_2_3_d_zero

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantitative-stabilitysolution-setsstochastic-programming

Consider model (1) without stochastic constraints (d=0d=0d=0) and assume the hypotheses of Theorem 2.2 (the general assumptions, μ∈PFU\mu\in\mathcal P_{\mathcal F_{\mathcal U}}μ∈PFU​​, S(μ)≠∅S(\mu)\neq\emptysetS(μ)=∅, U\mathcal UU an open bounded neighbourhood of S(μ)S(\mu)S(μ)). Let ψ\psiψ be the growth function of problem (1) on cl⁡U\operatorname{cl}\mathcal UclU,

ψ(τ)=inf⁡{∫Ξf0(ξ,x)μ(dξ)−v(μ) : d(x,S(μ))≥τ, x∈MU(μ)}(τ≥0),\psi(\tau)=\inf\Big\{\int_\Xi f_0(\xi,x)\mu(d\xi)-v(\mu)\ :\ d(x,S(\mu))\ge\tau,\ x\in M_{\mathcal U}(\mu)\Big\}\quad(\tau\ge0),ψ(τ)=inf{∫Ξ​f0​(ξ,x)μ(dξ)−v(μ) : d(x,S(μ))≥τ, x∈MU​(μ)}(τ≥0),

ψ−1(t)=sup⁡{τ≥0:ψ(τ)≤t}\psi^{-1}(t)=\sup\{\tau\ge0:\psi(\tau)\le t\}ψ−1(t)=sup{τ≥0:ψ(τ)≤t} and Ψ(η)=η+ψ−1(η)\Psi(\eta)=\eta+\psi^{-1}(\eta)Ψ(η)=η+ψ−1(η). Then there is a constant L^≥1\hat L\ge1L^≥1 such that for each ν∈PFU\nu\in\mathcal P_{\mathcal F_{\mathcal U}}ν∈PFU​​

∅≠SU(ν) ⊆ S(μ)+Ψ(L^ dFU(μ,ν)) B.(6)\emptyset\ne S_{\mathcal U}(\nu)\ \subseteq\ S(\mu)+\Psi\big(\hat L\,d_{\mathcal F_{\mathcal U}}(\mu,\nu)\big)\,\mathbb B.\tag{6}∅=SU​(ν) ⊆ S(μ)+Ψ(L^dFU​​(μ,ν))B.(6)

This is Theorem 2.3 exactly as printed, in the case d=0d=0d=0, where it holds for all perturbations ν\nuν without any smallness condition: the solution sets move by at most Ψ\PsiΨ of the minimal information distance.

Formalization Note Ψ\PsiΨ, ψ−1\psi^{-1}ψ−1 and dFUd_{\mathcal F_{\mathcal U}}dFU​​ take values in [0,∞][0,\infty][0,∞]; when dFU(μ,ν)=∞d_{\mathcal F_{\mathcal U}}(\mu,\nu)=\inftydFU​​(μ,ν)=∞ the inclusion is trivial. The paper's "min" in ψ\psiψ is read as an infimum (+∞+\infty+∞ over the empty set). For d≥1d\ge1d≥1 the printed "for each ν\nuν" fails; see the goal theorem theorem_2_3.

Preamble
import Mathlib
import Definitions.Def_ProbMetricStab_General_Setting
open MeasureTheory Set Metric Filter Topology
open scoped ENNReal
Formal statement
namespace ProbMetricStab.General

theorem theorem_2_3_d_zero {m s : ℕ} {P : Model m s 0}
    {U : Set (EuclideanSpace ℝ (Fin m))} {μ : Measure ↥P.Ξ} (h : P.Thm22Assumptions U μ) :
    ∃ Lhat : ℝ, 1 ≤ Lhat ∧ ∀ ν ∈ P.PFU U,
      (P.SU U ν).Nonempty ∧
      P.SU U ν ⊆ enlarge (P.S μ) (P.Ψ U μ (ENNReal.ofReal Lhat * P.dFU U μ ν)) := by sorry

end ProbMetricStab.General
Source
Rachev & Römisch, Quantitative stability in stochastic programming: The method of probability metrics, preprint (edoc.hu-berlin.de), p. 8, Theorem 2.3, (6), and its proof ("In case that d = 0 ...")
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