Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(14), proof of Theorem 2.1, p. 7 — v(ξ̃) − v(ξ) ≤ L(‖ξ − ξ̃‖_r + Σ_t sup_{x̄∈l_{α,t}(F(ξ,·))} ‖x̄_t − E[x̄_t|F̃_t]‖_{r′})

Proved
MultistageStab.Value.display_14

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

multistagep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stabilitystochastic-programming

Work in the setting of program (1) for any of the three randomness patterns, with exponents r,r′r, r'r,r′. Assume (A1), X1X_1X1​ bounded, ξ\xiξ admissible, v(ξ)v(\xi)v(ξ) finite, and the level-boundedness of (A2) with constants α>0\alpha > 0α>0, δ>0\delta > 0δ>0. Then there is a constant L>0L > 0L>0 such that for every admissible ξ~\tilde\xiξ~​ with ∥ξ−ξ~∥r<δ\|\xi - \tilde\xi\|_r < \delta∥ξ−ξ~​∥r​<δ and v(ξ~)v(\tilde\xi)v(ξ~​) finite,

v(ξ~)−v(ξ)≤L(∥ξ−ξ~∥r+∑t=2T−1sup⁡xˉ∈lα(F(ξ,⋅))∥xˉt−E[xˉt∣F~t]∥r′),v(\tilde\xi) - v(\xi) \le L\Big( \|\xi - \tilde\xi\|_r + \sum_{t=2}^{T-1} \sup_{\bar x \in l_{\alpha}(F(\xi,\cdot))} \big\|\bar x_t - \mathbb E[\bar x_t \mid \tilde{\mathcal F}_t]\big\|_{r'} \Big),v(ξ~​)−v(ξ)≤L(∥ξ−ξ~​∥r​+t=2∑T−1​xˉ∈lα​(F(ξ,⋅))sup​​xˉt​−E[xˉt​∣F~t​]​r′​),

where lα(F(ξ,⋅))={x∈X(ξ):F(ξ,x)≤v(ξ)+α}l_\alpha(F(\xi,\cdot)) = \{x \in \mathcal X(\xi) : F(\xi,x) \le v(\xi) + \alpha\}lα​(F(ξ,⋅))={x∈X(ξ):F(ξ,x)≤v(ξ)+α}.

This is the one-sided estimate of the optimal values, common to all three patterns; together with the symmetric estimate (15) it gives Theorem 2.1.

Formalization Note The inequality is stated in [0,∞][0,\infty][0,∞] with its left-hand side truncated at 000; the suprema are taken in [0,∞][0,\infty][0,∞].

Preamble
import Mathlib
import Definitions.Def_MultistageStab_Value_Setting

open MeasureTheory ProbabilityTheory
open scoped ENNReal
Formal statement
namespace MultistageStab.Value

theorem display_14 (D : Data) (pat : Pattern) (hpat : pat.Holds D)
    {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (ξ : ℕ → Ω → E D.d) (hA1 : CompleteRecourse D)
    (hv_bot : value P D pat ξ ≠ ⊥) (hv_top : value P D pat ξ ≠ ⊤)
    (α δ : ℝ) (R : NNReal) (hα : 0 < α) (hδ : 0 < δ)
    (hA2 : LevelBoundedWith P D pat ξ α δ R)
    (hA3 : Admissible P D pat ξ) (hX1 : Bornology.IsBounded (X1 D)) :
    ∃ L : ℝ, 0 < L ∧
      ∀ ξ' : ℕ → Ω → E D.d, Admissible P D pat ξ' →
        inputDist P D pat ξ ξ' < ENNReal.ofReal δ →
        value P D pat ξ' ≠ ⊥ → value P D pat ξ' ≠ ⊤ →
        ENNReal.ofReal ((value P D pat ξ').toReal - (value P D pat ξ).toReal) ≤
          ENNReal.ofReal L * (inputDist P D pat ξ ξ' +
            ∑ t ∈ Finset.Icc 2 (D.T - 1),
              ⨆ xbar ∈ levelSet P D pat ξ ((value P D pat ξ).toReal + α),
                eLpNorm (xbar t - P[xbar t | sigmaGen ξ' t]) (r' pat) P) := by sorry

end MultistageStab.Value
Source
Heitsch, Römisch & Strugarek, Stability of multistage stochastic programs, author manuscript (edoc.hu-berlin.de, c. 2005), p. 7, proof of Theorem 2.1, (14)
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