Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.3, (6), p. 8, for d_{F_U}(μ, ν) < δ — ∅ ≠ S_U(ν) ⊆ S(μ) + Ψ(L̂ d_{F_U}(μ, ν))𝔹

Proved
ProbMetricStab.General.theorem_2_3

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

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

Let the assumptions of Theorem 2.2 hold: the general assumptions of model (1), μ∈PFU\mu\in\mathcal P_{\mathcal F_{\mathcal U}}μ∈PFU​​, and

  1. S(μ)S(\mu)S(μ) is nonempty and U⊆Rm\mathcal U\subseteq\mathbb R^mU⊆Rm is an open bounded neighbourhood of S(μ)S(\mu)S(μ);
  2. if d≥1d\ge1d≥1, x↦∫Ξf0(ξ,x)μ(dξ)x\mapsto\int_\Xi f_0(\xi,x)\mu(d\xi)x↦∫Ξ​f0​(ξ,x)μ(dξ) is Lipschitz continuous on X∩cl⁡UX\cap\operatorname{cl}\mathcal UX∩clU;
  3. x↦Mx−1(μ)x\mapsto M^{-1}_x(\mu)x↦Mx−1​(μ) is metrically regular at each pair (xˉ,0)(\bar x,0)(xˉ,0) with xˉ∈S(μ)\bar x\in S(\mu)xˉ∈S(μ).

Let ψ(τ)=inf⁡{∫Ξf0(ξ,x)μ(dξ)−v(μ):d(x,S(μ))≥τ, x∈MU(μ)}\psi(\tau)=\inf\{\int_\Xi f_0(\xi,x)\mu(d\xi)-v(\mu):d(x,S(\mu))\ge\tau,\ x\in M_{\mathcal U}(\mu)\}ψ(τ)=inf{∫Ξ​f0​(ξ,x)μ(dξ)−v(μ):d(x,S(μ))≥τ, x∈MU​(μ)} (τ≥0\tau\ge0τ≥0) be the growth function of problem (1) on cl⁡U\operatorname{cl}\mathcal UclU, ψ−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 are constants L^≥1\hat L\ge1L^≥1 and δ>0\delta>0δ>0 such that for each ν∈PFU\nu\in\mathcal P_{\mathcal F_{\mathcal U}}ν∈PFU​​ with dFU(μ,ν)<δd_{\mathcal F_{\mathcal U}}(\mu,\nu)<\deltadFU​​(μ,ν)<δ,

∅≠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 the paper's quantitative stability theorem for solution sets: the localized solution sets of the perturbed problem stay within Ψ\PsiΨ of the minimal information distance from the original solution set, and the modulus Ψ\PsiΨ is governed by the growth of the objective near S(μ)S(\mu)S(μ). For kkk-th order growth ψ(τ)=γτk\psi(\tau)=\gamma\tau^kψ(τ)=γτk it gives Hölder continuity of SUS_{\mathcal U}SU​ at μ\muμ with rate 1/k1/k1/k (Remark 2.4).

Formalization Note The page states (6) "for each ν∈PF,U\nu\in\mathcal P_{\mathcal F,\mathcal U}ν∈PF,U​". For d≥1d\ge1d≥1 this is false: with X=[0,1]X=[0,1]X=[0,1], d=1d=1d=1, f0(ξ,x)=xf_0(\xi,x)=xf0​(ξ,x)=x, f1(ξ,x)=ξ−xf_1(\xi,x)=\xi-xf1​(ξ,x)=ξ−x, μ=δ0\mu=\delta_0μ=δ0​, U=(−12,12)\mathcal U=(-\tfrac12,\tfrac12)U=(−21​,21​), all hypotheses hold, but ν=δ1\nu=\delta_1ν=δ1​ gives MU(ν)=∅M_{\mathcal U}(\nu)=\emptysetMU​(ν)=∅ and so SU(ν)=∅S_{\mathcal U}(\nu)=\emptysetSU​(ν)=∅. The proof argues "as in the proof of Theorem 2.2", which needs dFU(μ,ν)<δd_{\mathcal F_{\mathcal U}}(\mu,\nu)<\deltadFU​​(μ,ν)<δ. The statement here is therefore the δ-local form the proof establishes; the printed all-ν\nuν form is the separate item theorem_2_3_d_zero for d=0d=0d=0, where it is true. Ψ\PsiΨ, ψ−1\psi^{-1}ψ−1 and dFUd_{\mathcal F_{\mathcal U}}dFU​​ take values in [0,∞][0,\infty][0,∞], ψ\psiψ is an infimum in R‾\overline{\mathbb R}R (+∞+\infty+∞ when no feasible point is τ\tauτ-far from S(μ)S(\mu)S(μ)), and d(x,A)d(x,A)d(x,A) is the extended distance (+∞+\infty+∞ for A=∅A=\emptysetA=∅).

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 {m s d : ℕ} {P : Model m s d}
    {U : Set (EuclideanSpace ℝ (Fin m))} {μ : Measure ↥P.Ξ} (h : P.Thm22Assumptions U μ) :
    ∃ Lhat δ : ℝ, 1 ≤ Lhat ∧ 0 < δ ∧ ∀ ν ∈ P.PFU U, P.dFU U μ ν < ENNReal.ofReal δ →
      (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) (δ-local form established by the proof; the printed "for each ν" fails for d ≥ 1)
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