Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3 — the non-anticipative slack constraint (4.5b) is equivalent to its full-information form (4.5c)

Proved
PrimalDualLDR.Multistage.lemma_3

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

linear-decision-rulesmultistagep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-programming

Consider the multistage setting of §4 under its standing assumptions and the linear-conditional-mean assumption Et(ξ)=MtPtξ\mathbb E_t(\xi) = M_tP_t\xiEt​(ξ)=Mt​Pt​ξ P\mathbb PP-a.s., with M=E(ξξ⊤)M = \mathbb E(\xi\xi^\top)M=E(ξξ⊤). Fix a stage ttt and a matrix St∈Rmt×ktS_t \in \mathbb R^{m_t\times k^t}St​∈Rmt​×kt. Then the constraint

∃ st∈Lkt,mt2: E(st(ξt) ξ⊤)=StPtM,st(ξt)≥0  P-a.s.(4.5b)\exists\, s_t \in \mathcal L^2_{k^t,m_t} : \ \mathbb E\big(s_t(\xi^t)\,\xi^\top\big) = S_tP_tM, \quad s_t(\xi^t) \ge 0 \ \ \mathbb P\text{-a.s.} \tag{4.5b}∃st​∈Lkt,mt​2​: E(st​(ξt)ξ⊤)=St​Pt​M,st​(ξt)≥0  P-a.s.(4.5b)

is equivalent to

∃ s~t∈Lk,mt2: E(s~t(ξ) ξ⊤)=StPtM,s~t(ξ)≥0  P-a.s.(4.5c)\exists\, \tilde s_t \in \mathcal L^2_{k,m_t} : \ \mathbb E\big(\tilde s_t(\xi)\,\xi^\top\big) = S_tP_tM, \quad \tilde s_t(\xi) \ge 0 \ \ \mathbb P\text{-a.s.} \tag{4.5c}∃s~t​∈Lk,mt​2​: E(s~t​(ξ)ξ⊤)=St​Pt​M,s~t​(ξ)≥0  P-a.s.(4.5c)

In (4.5b) the slack is non-anticipative (a function of the history ξt\xi^tξt), while in (4.5c) it may depend on the whole of ξ\xiξ. The equivalence makes the one-stage cone description of Proposition 3 applicable to the slack constraints of MSPl\mathcal{MSP}^lMSPl.

Formalization Note The page prints the sign condition of (4.5c) as "s~t(ξt)≥0\tilde s_t(\xi^t) \ge 0s~t​(ξt)≥0" for a function of the full ξ\xiξ; it is read as s~t(ξ)≥0\tilde s_t(\xi) \ge 0s~t​(ξ)≥0. Moment matrices are entrywise Bochner integrals.

Preamble
import Mathlib
import Definitions.Def_PrimalDualLDR_Multistage_Basic
import Definitions.Def_PrimalDualLDR_Multistage_Setting
import Definitions.Def_PrimalDualLDR_Multistage_Problems

open MeasureTheory Matrix
Formal statement
namespace PrimalDualLDR.Multistage

/-- Lemma 3 (p. 21): under the standing assumptions of §4 and the linear-conditional-mean assumption,
for any given `S_t ∈ ℝ^{m_t × k^t}`, constraint (4.5b) — there is a non-anticipative
`s_t ∈ 𝓛²_{k^t,m_t}` with `𝔼(s_t(ξ^t) ξᵀ) = S_t P_t M` and `s_t(ξ^t) ≥ 0` `P`-a.s. — is equivalent to
(4.5c) — there is `s̃_t ∈ 𝓛²_{k,m_t}`, a function of the whole `ξ`, with `𝔼(s̃_t(ξ) ξᵀ) = S_t P_t M` and
`s̃_t(ξ) ≥ 0` `P`-a.s. -/
theorem lemma_3 (σ : Setting) (hσ : σ.Standing) (hM : σ.LinearCondMean) (t : Fin σ.T)
    (S : Matrix (Fin (σ.m t)) (Fin (σ.kb t)) ℝ) :
    (∃ s : (Fin (σ.kb t) → ℝ) → (Fin (σ.m t) → ℝ), σ.IsL2RuleAt t s ∧
      σ.moment t s = S * σ.Pt t * σ.M ∧ ∀ᵐ ξ ∂σ.P, ∀ i, 0 ≤ s (σ.tr t ξ) i) ↔
    (∃ st : (Fin σ.k → ℝ) → (Fin (σ.m t) → ℝ), PrimalDualLDR.FixedRecourse.IsL2Rule σ.P st ∧
      (fun i j => ∫ ξ, st ξ i * ξ j ∂σ.P) = S * σ.Pt t * σ.M ∧ ∀ᵐ ξ ∂σ.P, ∀ i, 0 ≤ st ξ i) := by sorry

end PrimalDualLDR.Multistage
Source
Kuhn, Wiesemann, Georghiou, Primal and dual linear decision rules in stochastic and robust optimization, Optimization Online 2009/02/2218, p. 21, Lemma 3, (4.5b), (4.5c)
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