Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.2, last sentence, p. 6 — for d = 0, |v(μ) − v_U(ν)| ≤ d_{F_U}(μ, ν) for all ν ∈ P_{F_U}

Proved
ProbMetricStab.General.theorem_2_2_d_zero

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

optimal-valuep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantitative-stabilitystochastic-programming

Consider model (1) without stochastic constraints (d=0d=0d=0). Assume the hypotheses of Theorem 2.2: the general assumptions, μ∈PFU\mu\in\mathcal P_{\mathcal F_{\mathcal U}}μ∈PFU​​, S(μ)≠∅S(\mu)\ne\emptysetS(μ)=∅, U\mathcal UU an open bounded neighbourhood of S(μ)S(\mu)S(μ) (the Lipschitz and metric-regularity conditions are automatic or void when d=0d=0d=0). Then for every ν∈PFU\nu\in\mathcal P_{\mathcal F_{\mathcal U}}ν∈PFU​​ the values v(μ)v(\mu)v(μ) and vU(ν)v_{\mathcal U}(\nu)vU​(ν) are finite and

∣v(μ)−vU(ν)∣ ≤ dFU(μ,ν).|v(\mu)-v_{\mathcal U}(\nu)|\ \le\ d_{\mathcal F_{\mathcal U}}(\mu,\nu).∣v(μ)−vU​(ν)∣ ≤ dFU​​(μ,ν).

This is the last sentence of Theorem 2.2: in the absence of constraints the estimate (4) holds with L=1L=1L=1 and globally on PFU\mathcal P_{\mathcal F_{\mathcal U}}PFU​​, with no restriction on the distance between μ\muμ and ν\nuν.

Formalization Note The finiteness of v(μ)v(\mu)v(μ) and vU(ν)v_{\mathcal U}(\nu)vU​(ν), implicit on the page (which writes a real inequality), is part of the conclusion, so the extended-real difference never takes the form ∞−∞\infty-\infty∞−∞. The hypotheses are the bundle of Theorem 2.2's assumptions instantiated at d=0d=0d=0; condition (ii) is void and (iii) is part of the bundle as on the page.

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_2_d_zero {m s : ℕ} {P : Model m s 0}
    {U : Set (EuclideanSpace ℝ (Fin m))} {μ : Measure ↥P.Ξ} (h : P.Thm22Assumptions U μ) :
    ∀ ν ∈ P.PFU U,
      P.v μ ≠ ⊤ ∧ P.v μ ≠ ⊥ ∧ P.vU U ν ≠ ⊤ ∧ P.vU U ν ≠ ⊥ ∧
      EReal.abs (P.v μ - P.vU U ν) ≤ 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. 6, Theorem 2.2 ("In case d = 0, the estimate (4) is valid with L = 1 and for all ν ∈ P_{F_U}")
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