Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, pp. 7–8 — the constructed planes are cutting planes: 𝔔_{t+1} ≤ 𝒬̃_{t+1} and Q̲̃_{t+1,j} ≤ Q̃_{t+1,j} along every run

Proved
ShapiroSDDP.Convergence.cut_valid

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

cutting-planelower-boundp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1sddp

Consider the SAA problem with finite-valued cost-to-go functions on reachable decisions, valid initial cut sets C0C_0C0​, any oracle, and any run of the SDDP method (any forward samples and any choice of basic optimal dual solutions). Then for every iteration kkk and every stage 1≤t≤T−11\le t\le T-11≤t≤T−1:

  1. every cut (α,β)(\alpha,\beta)(α,β) of the stage-ttt set at iteration kkk is a cutting plane of Q~t+1\widetilde{\mathcal Q}_{t+1}Q​t+1​ on reachable decisions:
α+β⊤x≤Q~t+1(x)for every reachable x∈Rnt,\alpha+\beta^\top x\le\widetilde{\mathcal Q}_{t+1}(x)\qquad\text{for every reachable }x\in\mathbb R^{n_t},α+β⊤x≤Q​t+1​(x)for every reachable x∈Rnt​,

so that Qt+1≤Q~t+1\mathfrak Q_{t+1}\le\widetilde{\mathcal Q}_{t+1}Qt+1​≤Q​t+1​ there; 2. for every reachable xtx_txt​, every outcome jjj of stage t+1t+1t+1 and every feasible yyy of the stage-(t+1)(t+1)(t+1) problem, the point (y,Q~t+2(y))(y,\widetilde{\mathcal Q}_{t+2}(y))(y,Q​t+2​(y)) is feasible for the stage-(t+1)(t+1)(t+1) problem with the iteration-kkk cuts. Hence the optimal value Q~‾t+1,j(xt)\underline{\widetilde Q}_{t+1,j}(x_t)Q​​t+1,j​(xt​) of the problem with cuts is at most Q~t+1,j(xt)\widetilde Q_{t+1,j}(x_t)Q​t+1,j​(xt​), and Q~‾t+1≤Q~t+1\underline{\widetilde{\mathcal Q}}_{t+1}\le\widetilde{\mathcal Q}_{t+1}Q​​t+1​≤Q​t+1​.

The paper notes that from t=T−1t=T-1t=T−1 on the constructed planes are supporting planes of Q~‾t\underline{\widetilde{\mathcal Q}}_tQ​​t​ but may be only cutting planes of Q~t\widetilde{\mathcal Q}_tQ​t​. This statement is the "cutting plane" half of that remark, and it is the basis of the lower bound and of the convergence argument.

Formalization Note The cost-to-go values are evaluated only at reachable decisions, where they are genuine infima. Conclusion 2 avoids the infimum of the problem with cuts by exhibiting a feasible point of objective c~t+1,j⊤y+Q~t+2(y)\tilde c_{t+1,j}^\top y+\widetilde{\mathcal Q}_{t+2}(y)c~t+1,j⊤​y+Q​t+2​(y). No sampling hypothesis, (A1) or oracle property is needed.

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

/-- §3, pp. 7–8: along every run of the SDDP method, every cut of every iteration is a cutting
plane of the SAA cost-to-go on reachable decisions, `α + βᵀ x ≤ 𝒬̃_{t+1}(x)`, so `𝔔_{t+1} ≤ 𝒬̃_{t+1}`;
and for every reachable `x_t`, outcome `j` and feasible `y` of the stage-`(t+1)` problem, the point
`(y, 𝒬̃_{t+2}(y))` is feasible for the stage-`(t+1)` problem with cuts, so that
`Q̲̃_{t+1,j}(x_t) ≤ Q̃_{t+1,j}(x_t)`. -/
theorem cut_valid (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 t, 1 ≤ t → t + 1 ≤ I.T → ∀ a ∈ cuts k t, ∀ x ∈ Reach I t, cutEval a x ≤ V I t x) ∧
      ∀ k t, 1 ≤ t → t + 1 ≤ I.T → ∀ x ∈ Reach I t, ∀ j : Fin (I.N (t + 1)),
        ∀ y ∈ Feas I t x j,
          (y, V I (t + 1) y) ∈ CutLPFeas (I.A t j) (rhs I t x j) (cuts k (t + 1)) := by sorry

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