Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.1, p. 10 — with basic optimal solutions, the number of cutting planes of the form (3.17) is finite

Proved
ShapiroSDDP.Convergence.finite_cuts

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

basic-solutioncutting-planefinitenessp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1sddp

Fix a stage 1≤t≤T−11\le t\le T-11≤t≤T−1 and a finite set DDD of cuts of stage t+1t+1t+1 (the current Qt+2\mathfrak Q_{t+2}Qt+2​). Then there is a finite set FFF of affine functions of xtx_txt​, not depending on the trial point, with the following property: for every trial decision xˉ∈Rnt\bar x\in\mathbb R^{n_t}xˉ∈Rnt​ and every choice, for each outcome j=1,…,Nt+1j=1,\dots,N_{t+1}j=1,…,Nt+1​, of a basic optimal solution (πj,ρj)(\pi_j,\rho_j)(πj​,ρj​) of the dual of the stage-(t+1)(t+1)(t+1) problem

min⁡y,θ c~t+1,j⊤y+θs.t.A~t+1,jy=b~t+1,j−B~t+1,jxˉ, y≥0, θ≥α+β⊤y  ∀(α,β)∈D,\min_{y,\theta}\ \tilde c_{t+1,j}^\top y+\theta\quad\text{s.t.}\quad \tilde A_{t+1,j}y=\tilde b_{t+1,j}-\tilde B_{t+1,j}\bar x,\ y\ge0,\ \theta\ge\alpha+\beta^\top y\ \ \forall(\alpha,\beta)\in D,y,θmin​ c~t+1,j⊤​y+θs.t.A~t+1,j​y=b~t+1,j​−B~t+1,j​xˉ, y≥0, θ≥α+β⊤y  ∀(α,β)∈D,

the cutting plane (3.17) built from these duals at xˉ\bar xxˉ,

ℓ(x)=Q~‾t+1(xˉ)+g~⊤(x−xˉ),g~=−1Nt+1∑jB~t+1,j⊤πj,\ell(x)=\underline{\widetilde{\mathcal Q}}_{t+1}(\bar x)+\tilde g^\top(x-\bar x),\qquad\tilde g=-\frac1{N_{t+1}}\sum_j\tilde B_{t+1,j}^\top\pi_j,ℓ(x)=Q​​t+1​(xˉ)+g~​⊤(x−xˉ),g~​=−Nt+1​1​j∑​B~t+1,j⊤​πj​,

belongs to FFF.

It is the finiteness statement on which the finite convergence of the method rests.

Formalization Note The set FFF is required not to depend on xˉ\bar xxˉ; the dual feasible regions do not depend on xˉ\bar xxˉ, only their objectives do. Finiteness is of cuts for a fixed next-stage cut set DDD, not of dual solutions overall, since the number of dual variables grows with DDD.

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

/-- §3.1, p. 10: when basic optimal dual solutions are used, only finitely many cutting planes
(3.17) can arise. For a stage `1 ≤ t ≤ T − 1` and a fixed cut set `D` of stage `t + 1` there is a
finite set `F` of cuts, not depending on the trial point, containing the cut (3.17) computed at
every trial point `x̄` from every choice of basic optimal dual solutions of the `N_{t+1}`
stage-`(t+1)` problems at `x̄` with the cut set `D`. -/
theorem finite_cuts (I : Instance) (t : ℕ) (ht : 1 ≤ t) (ht' : t + 1 ≤ I.T)
    (D : Finset (Cut I (t + 1))) :
    ∃ F : Finset (Cut I t), ∀ (x : Fin (I.n t) → ℝ)
      (d : Fin (I.N (t + 1)) → CutDual (I.m (t + 1)) D),
      (∀ j, IsBasicOptDual (I.A t j) (rhs I t x j) D (I.c t j) (d j)) →
        cutAt I t x D d ∈ F := by sorry

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