Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, p. 8 — the optimal value ϑ_k of (3.13) at iteration k is at most the optimal value of the SAA problem

Proved
ShapiroSDDP.Convergence.lower_bound

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

lower-boundp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1sddp

Under the assumptions of the cut-validity statement (finite-valued cost-to-go functions on reachable decisions, valid initial cuts, any run of the SDDP method), let ϑ‾k\underline\vartheta_kϑ​k​ be the optimal value of the first-stage problem (3.13) at iteration kkk,

ϑ‾k=inf⁡{c1⊤x1+Q2(x1): A1x1=b1, x1≥0}.\underline\vartheta_k=\inf\big\{c_1^\top x_1+\mathfrak Q_2(x_1):\ A_1x_1=b_1,\ x_1\ge0\big\}.ϑ​k​=inf{c1⊤​x1​+Q2​(x1​): A1​x1​=b1​, x1​≥0}.

If ϑ‾k\underline\vartheta_kϑ​k​ is finite, then

ϑ‾k≤min⁡{c1⊤x1+Q~2(x1): A1x1=b1, x1≥0},\underline\vartheta_k\le\min\big\{c_1^\top x_1+\widetilde{\mathcal Q}_2(x_1):\ A_1x_1=b_1,\ x_1\ge0\big\},ϑ​k​≤min{c1⊤​x1​+Q​2​(x1​): A1​x1​=b1​, x1​≥0},

the optimal value (3.7) of the SAA problem.

This is the lower bound reported by the algorithm at each iteration.

Formalization Note ϑ‾k\underline\vartheta_kϑ​k​ is the infimum of the LP (3.13) in epigraph form with the iteration-kkk stage-1 cut set; it is genuine because the hypothesis states that this LP is feasible and bounded below. The optimal value (3.7) is then also a genuine infimum.

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

/-- §3, p. 8: along every run, the optimal value `ϑ_k` of problem (3.13) at iteration `k`, whenever
it is finite, is at most the optimal value (3.7) of the SAA problem. -/
theorem lower_bound (I : Instance) (hfin : FiniteValued I) (C₀ : (t : ℕ) → Finset (Cut I t))
    (hC₀ : ValidInit I C₀) (sol : Oracle I) {M : ℕ} (ω : ℕ → Fin M → Scen I)
    (cuts : ℕ → (t : ℕ) → Finset (Cut I t)) (hrun : IsRun I C₀ sol ω cuts) (k : ℕ)
    (hk : CutLPFinite I.A₁ I.b₁ (cuts k 1) I.c₁) :
    cutLPVal I.A₁ I.b₁ (cuts k 1) I.c₁ ≤ optVal I := by sorry

end ShapiroSDDP.Convergence
Source
Shapiro, Analysis of Stochastic Dual Dynamic Programming Method, Optimization Online 2009/12/2509, p. 8, §3, after (3.13)
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