Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2.1, p. 6, case "only random costs" (r = 1, r′ = ∞) — v(ξ̃) − v(ξ) ≤ L(‖ξ̃ − ξ‖_1 + Σ‖x̄_τ − E[x̄_τ|F̃_τ]‖_∞) + ε

Proved
MultistageStab.Value.case_costs_random

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) when only the costs are random (hth_tht​ deterministic, r=1r = 1r=1, r′=∞r' = \inftyr′=∞). 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 ε∈(0,α]\varepsilon \in (0,\alpha]ε∈(0,α], every admissible ξ~\tilde\xiξ~​ with ∥ξ~−ξ∥1<δ\|\tilde\xi - \xi\|_1 < \delta∥ξ~​−ξ∥1​<δ and v(ξ~)v(\tilde\xi)v(ξ~​) finite, and every xˉ∈lε(F(ξ,⋅))\bar x \in l_\varepsilon(F(\xi,\cdot))xˉ∈lε​(F(ξ,⋅)),

v(ξ~)−v(ξ)≤L(∥ξ~−ξ∥1+∑τ=2T−1∥xˉτ−E[xˉτ∣F~τ]∥∞)+ε.v(\tilde\xi) - v(\xi) \le L\Big( \|\tilde\xi - \xi\|_1 + \sum_{\tau=2}^{T-1} \big\|\bar x_\tau - \mathbb E[\bar x_\tau \mid \tilde{\mathcal F}_\tau]\big\|_\infty \Big) + \varepsilon .v(ξ~​)−v(ξ)≤L(∥ξ~​−ξ∥1​+τ=2∑T−1​​xˉτ​−E[xˉτ​∣F~τ​]​∞​)+ε.

This is the second case estimate in the proof of Theorem 2.1; here the decisions are essentially bounded.

Formalization Note As in the other case estimates, the inequality is stated in [0,∞][0,\infty][0,∞] with its left-hand side truncated at 000, and ∥⋅∥∞\|\cdot\|_\infty∥⋅∥∞​ is the essential supremum norm (eLpNorm … ⊤).

Preamble
import Mathlib
import Definitions.Def_MultistageStab_Value_Setting

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

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

end MultistageStab.Value
Source
Heitsch, Römisch & Strugarek, Stability of multistage stochastic programs, author manuscript (edoc.hu-berlin.de, c. 2005), pp. 5–7, proof of Theorem 2.1, case "only random costs, i.e., r = 1 and r′ = ∞"
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