Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 3.1, pp. 10–11 — a policy is optimal for the SAA problem iff it satisfies the DP conditions (3.18)

Proved
ShapiroSDDP.Convergence.optimal_iff_dp

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

dynamic-programmingmultistageoptimality-conditionsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Assume the SAA cost-to-go functions are finite valued on reachable decisions. Let xˉt=xˉt(ξ~[t])\bar x_t=\bar x_t(\tilde\xi_{[t]})xˉt​=xˉt​(ξ~​[t]​), t=1,…,Tt=1,\dots,Tt=1,…,T, be an implementable policy of the SAA problem. Then the policy is optimal, that is feasible with minimal expected cost

1N∑scenarios∑t=1Tc~t⊤xˉt\frac1N\sum_{\text{scenarios}}\sum_{t=1}^T\tilde c_t^\top\bar x_tN1​scenarios∑​t=1∑T​c~t⊤​xˉt​

among all feasible implementable policies, if and only if the dynamic programming optimality conditions

xˉt(ξ~[t])∈arg⁡min⁡xt{c~t⊤xt+Q~t+1(xt): B~txˉt−1(ξ~[t−1])+A~txt=b~t, xt≥0}(3.18)\bar x_t(\tilde\xi_{[t]})\in\arg\min_{x_t}\big\{\tilde c_t^\top x_t+\widetilde{\mathcal Q}_{t+1}(x_t):\ \tilde B_t\bar x_{t-1}(\tilde\xi_{[t-1]})+\tilde A_tx_t=\tilde b_t,\ x_t\ge0\big\}\tag{3.18}xˉt​(ξ~​[t]​)∈argxt​min​{c~t⊤​xt​+Q​t+1​(xt​): B~t​xˉt−1​(ξ~​[t−1]​)+A~t​xt​=b~t​, xt​≥0}(3.18)

hold for t=1,…,Tt=1,\dots,Tt=1,…,T and every scenario of the SAA problem, where at stage 1 the constraint is A1x1=b1A_1x_1=b_1A1​x1​=b1​ (the paper's convention B~0=0\tilde B_0=0B~0​=0) and Q~T+1≡0\widetilde{\mathcal Q}_{T+1}\equiv0Q​T+1​≡0.

The paper recalls this as a classical result (p. 6 and p. 10); in the proof of Proposition 3.1 it reduces optimality of the forward policy to (3.18).

Formalization Note Optimality is defined by expected cost, so this equivalence is not definitional. Since every scenario has positive probability 1/N1/N1/N, (3.18) must hold on every scenario, not only almost surely.

Preamble
import Mathlib
import Definitions.Def_ShapiroSDDP_Convergence_Model
Formal statement
namespace ShapiroSDDP.Convergence

/-- Proof of Proposition 3.1, pp. 10–11 (and §3, p. 6): with finite-valued cost-to-go functions, an
implementable policy of the SAA problem is optimal (minimal expected cost (3.15) among feasible
implementable policies) if and only if it satisfies the dynamic programming optimality conditions
(3.18) at every stage and on every scenario. -/
theorem optimal_iff_dp (I : Instance) (hfin : FiniteValued I) (pol : Policy I)
    (hpol : IsImplementable I pol) :
    IsOptimalPolicy I pol ↔ DPOptimal I pol := by sorry

end ShapiroSDDP.Convergence
Source
Shapiro, Analysis of Stochastic Dual Dynamic Programming Method, Optimization Online 2009/12/2509, pp. 10–11, proof of Proposition 3.1, (3.18); also p. 6, §3
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