Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(11), proof of Theorem 2.1, pp. 5–6 — an adapted feasible x̃ with ‖E[x̄_t|F̃_t] − x̃_t‖ ≤ L_t(…)

Proved
MultistageStab.Value.display_11

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

conditional-expectationmeasurable-selectionmultistagep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-programming

Work in the setting of program (1) with a randomness pattern and its exponents r,r′r, r'r,r′. Let ξ\xiξ be an admissible input and assume complete fixed recourse (A1). Then there are constants Lt>0L_t > 0Lt​>0 with the following property. For every admissible input ξ~\tilde\xiξ~​, with generated filtration F~t=σ(ξ~1,…,ξ~t)\tilde{\mathcal F}_t = \sigma(\tilde\xi_1,\dots,\tilde\xi_t)F~t​=σ(ξ~​1​,…,ξ~​t​), and every feasible policy xˉ∈X(ξ)\bar x \in \mathcal X(\xi)xˉ∈X(ξ), there is a feasible policy x~∈X(ξ~)\tilde x \in \mathcal X(\tilde\xi)x~∈X(ξ~​) (so x~t\tilde x_tx~t​ is F~t\tilde{\mathcal F}_tF~t​-measurable, in Lr′L_{r'}Lr′​, x~t∈Xt\tilde x_t \in X_tx~t​∈Xt​, and At,0x~t+At,1x~t−1=ht(ξ~t)A_{t,0}\tilde x_t + A_{t,1}\tilde x_{t-1} = h_t(\tilde\xi_t)At,0​x~t​+At,1​x~t−1​=ht​(ξ~​t​)) with x~1=xˉ1\tilde x_1 = \bar x_1x~1​=xˉ1​ and, almost surely for every t=2,…,Tt = 2,\dots,Tt=2,…,T,

∥E[xˉt∣F~t]−x~t∥≤Lt(∑τ=2tE[∥ξτ−ξ~τ∥ ∣ F~τ]+∑τ=2t−1E[∥xˉτ−E[xˉτ∣F~τ]∥ ∣ F~τ+1]).\big\|\mathbb E[\bar x_t \mid \tilde{\mathcal F}_t] - \tilde x_t\big\| \le L_t\Big( \sum_{\tau=2}^{t} \mathbb E\big[\|\xi_\tau - \tilde\xi_\tau\| \,\big|\, \tilde{\mathcal F}_\tau\big] + \sum_{\tau=2}^{t-1} \mathbb E\big[\|\bar x_\tau - \mathbb E[\bar x_\tau \mid \tilde{\mathcal F}_\tau]\| \,\big|\, \tilde{\mathcal F}_{\tau+1}\big]\Big).​E[xˉt​∣F~t​]−x~t​​≤Lt​(τ=2∑t​E[∥ξτ​−ξ~​τ​∥​F~τ​]+τ=2∑t−1​E[∥xˉτ​−E[xˉτ​∣F~τ​]∥​F~τ+1​]).

If only the costs are random, the first sum is absent.

The constants LtL_tLt​ do not depend on ξ~\tilde\xiξ~​ or xˉ\bar xxˉ. This estimate transfers a policy that is adapted to the filtration of ξ\xiξ to one adapted to the filtration of ξ~\tilde\xiξ~​, and is the core of the stability proof.

Formalization Note The paper constructs x~\tilde xx~ for xˉ\bar xxˉ in an ε\varepsilonε-level set; the statement here takes any feasible xˉ\bar xxˉ, which the construction allows and which is stronger. The case "only costs random" is the pattern costs, in which the first sum is replaced by 000.

Preamble
import Mathlib
import Definitions.Def_MultistageStab_Value_Setting

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

theorem display_11 (D : Data) (pat : Pattern) (hpat : pat.Holds D)
    {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (ξ : ℕ → Ω → E D.d) (hA1 : CompleteRecourse D) (hA3 : Admissible P D pat ξ) :
    ∃ L : ℕ → ℝ, (∀ t, 0 < L t) ∧
      ∀ ξ' : ℕ → Ω → E D.d, Admissible P D pat ξ' →
        ∀ xbar ∈ feasible P D pat ξ, ∃ xtil ∈ feasible P D pat ξ', xtil 1 = xbar 1 ∧
          ∀ t ∈ Finset.Icc 2 D.T, ∀ᵐ ω ∂P,
            ‖P[xbar t | sigmaGen ξ' t] ω - xtil t ω‖ ≤
              L t * ((if pat = Pattern.costs then 0 else
                  ∑ τ ∈ Finset.Icc 2 t,
                    P[fun ω => ‖ξ τ ω - ξ' τ ω‖ | sigmaGen ξ' τ] ω) +
                ∑ τ ∈ Finset.Icc 2 (t - 1),
                  P[fun ω => ‖xbar τ ω - P[xbar τ | sigmaGen ξ' τ] ω‖ | sigmaGen ξ' (τ + 1)] ω) := 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–6, proof of Theorem 2.1, construction of x̃ and (11)
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