Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4, (4.7) — the equality constraints of 𝓜𝒮𝒫^l become those of (4.6)

Proved
PrimalDualLDR.Multistage.sec_4_eq_4_7

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, with M=E(ξξ⊤)M = \mathbb E(\xi\xi^\top)M=E(ξξ⊤) and Nt:=MPt⊤(PtMPt⊤)−1N_t := MP_t^\top(P_tMP_t^\top)^{-1}Nt​:=MPt⊤​(Pt​MPt⊤​)−1. Fix a stage ttt.

  1. Let xs∈Lks,ns2x_s \in \mathcal L^2_{k^s,n_s}xs​∈Lks,ns​2​ (s∈Ts \in \mathbb Ts∈T) and st∈Lkt,mt2s_t \in \mathcal L^2_{k^t,m_t}st​∈Lkt,mt​2​ be decision rules and Xs∈Rns×ksX_s \in \mathbb R^{n_s\times k^s}Xs​∈Rns​×ks, St∈Rmt×ktS_t \in \mathbb R^{m_t\times k^t}St​∈Rmt​×kt matrices related by (4.3): XsPsM=E(xs(ξs)ξ⊤)X_sP_sM = \mathbb E(x_s(\xi^s)\xi^\top)Xs​Ps​M=E(xs​(ξs)ξ⊤) for every sss, and StPtM=E(st(ξt)ξ⊤)S_tP_tM = \mathbb E(s_t(\xi^t)\xi^\top)St​Pt​M=E(st​(ξt)ξ⊤). Then the ttt-th equality constraint of MSPl\mathcal{MSP}^lMSPl, E([∑sAtsxs(ξs)+st(ξt)−bt(ξt)][Ptξ]⊤)=0\mathbb E\big([\sum_s A_{ts}x_s(\xi^s) + s_t(\xi^t) - b_t(\xi^t)][P_t\xi]^\top\big) = 0E([∑s​Ats​xs​(ξs)+st​(ξt)−bt​(ξt)][Pt​ξ]⊤)=0, holds if and only if
∑s=1TAtsXsPsMPt⊤+StPtMPt⊤=BtPtMPt⊤.(4.7)\sum_{s=1}^T A_{ts}X_sP_sMP_t^\top + S_tP_tMP_t^\top = B_tP_tMP_t^\top. \tag{4.7}s=1∑T​Ats​Xs​Ps​MPt⊤​+St​Pt​MPt⊤​=Bt​Pt​MPt⊤​.(4.7)
  1. For all matrices XsX_sXs​, StS_tSt​, (4.7) holds if and only if
∑s=1TAtsXsPsNtPt+StPt=BtPt,\sum_{s=1}^T A_{ts}X_sP_sN_tP_t + S_tP_t = B_tP_t,s=1∑T​Ats​Xs​Ps​Nt​Pt​+St​Pt​=Bt​Pt​,

the ttt-th equality constraint of (4.6).

This is the step in the derivation of the linear program (4.6) where the multistage case differs from the one-stage case of §2.

Formalization Note The paper derives the forward direction of part 2 by multiplying (4.7) from the right by (PtMPt⊤)−1Pt(P_tMP_t^\top)^{-1}P_t(Pt​MPt⊤​)−1Pt​; the stated equivalence also contains the converse (multiply by MPt⊤MP_t^\topMPt⊤​), which the reformulation of MSPl\mathcal{MSP}^lMSPl as (4.6) needs. Invertibility of PtMPt⊤P_tMP_t^\topPt​MPt⊤​ is not a hypothesis: it follows from the standing assumptions ("PtMPt⊤P_tMP_t^\topPt​MPt⊤​ inherits invertibility from MMM"). MSPl\mathcal{MSP}^lMSPl's equality constraint is in the corrected reading in which ∑s\sum_s∑s​ covers only Atsxs(ξs)A_{ts}x_s(\xi^s)Ats​xs​(ξs).

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

/-- §4, (4.7) (p. 21): the equality constraints of `𝓜𝒮𝒫^l` and of (4.6). Under the standing
assumptions of §4, for every stage `t`:
1. if the rules `x_s ∈ 𝓛²_{k^s,n_s}`, `s_t ∈ 𝓛²_{k^t,m_t}` and the matrices `X_s`, `S_t` are related by
   (4.3), i.e. `X_s P_s M = 𝔼(x_s(ξ^s) ξᵀ)` for all `s` and `S_t P_t M = 𝔼(s_t(ξ^t) ξᵀ)`, then the `t`-th
   equality constraint of `𝓜𝒮𝒫^l` holds iff (4.7):
   `Σ_s A_ts X_s P_s M P_tᵀ + S_t P_t M P_tᵀ = B_t P_t M P_tᵀ`;
2. for all matrices `X_s`, `S_t`, (4.7) holds iff the equality constraint of (4.6):
   `Σ_s A_ts X_s P_s N_t P_t + S_t P_t = B_t P_t`, where `N_t = M P_tᵀ (P_t M P_tᵀ)⁻¹`. -/
theorem sec_4_eq_4_7 (σ : Setting) (hσ : σ.Standing) (t : Fin σ.T) :
    (∀ (x : σ.XRules) (s : (Fin (σ.kb t) → ℝ) → (Fin (σ.m t) → ℝ)) (X : σ.XFam)
        (S : Matrix (Fin (σ.m t)) (Fin (σ.kb t)) ℝ),
        (∀ r, σ.IsL2RuleAt r (x r)) → σ.IsL2RuleAt t s →
        (∀ r, X r * σ.Pt r * σ.M = σ.moment r (x r)) → S * σ.Pt t * σ.M = σ.moment t s →
        (σ.eqMSPl t x s ↔
          ∑ r, σ.A t r * X r * σ.Pt r * σ.M * (σ.Pt t)ᵀ + S * σ.Pt t * σ.M * (σ.Pt t)ᵀ =
            σ.B t * σ.Pt t * σ.M * (σ.Pt t)ᵀ)) ∧
    (∀ (X : σ.XFam) (S : Matrix (Fin (σ.m t)) (Fin (σ.kb t)) ℝ),
        (∑ r, σ.A t r * X r * σ.Pt r * σ.M * (σ.Pt t)ᵀ + S * σ.Pt t * σ.M * (σ.Pt t)ᵀ =
            σ.B t * σ.Pt t * σ.M * (σ.Pt t)ᵀ) ↔
          ∑ r, σ.A t r * X r * σ.Pt r * σ.N t * σ.Pt t + S * σ.Pt t = σ.B t * σ.Pt t) := 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, §4, (4.3), (4.6), (4.7)
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