Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 6, proof of (ii), (25a)–(25d), p. 19 — the worst-case ramp is attained at one of four extreme scenarios

Proved
MultistageRUC.WitPolicy.ramp_worst_case_in_four

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

affine-policyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimizationunit-commitment

Let D\mathcal DD be the budget uncertainty set (3), and let dmax⁡,dmin⁡∈D\mathbf d_{\max},\mathbf d_{\min}\in\mathcal Ddmax​,dmin​∈D maximize, respectively minimize, the total load of every period over D\mathcal DD ((19), (20)). Fix a generator iii, coefficients WitW_{it}Wit​, and two consecutive periods t−1t-1t−1, ttt. For a trajectory d\mathbf dd write

f(d)=Wit∑j∈Nddjt−Wi,t−1∑j∈Nddjt−1.f(\mathbf d)=W_{it}\sum_{j\in\mathcal N_d}d^t_j-W_{i,t-1}\sum_{j\in\mathcal N_d}d^{t-1}_j .f(d)=Wit​j∈Nd​∑​djt​−Wi,t−1​j∈Nd​∑​djt−1​.

Let St={dmin⁡,dmax⁡,dminmax(t),dmaxmin(t)}\mathcal S_t=\{\mathbf d_{\min},\mathbf d_{\max},\mathbf d_{minmax}(t),\mathbf d_{maxmin}(t)\}St​={dmin​,dmax​,dminmax​(t),dmaxmin​(t)} with the scenarios (21)–(22). Then for every d∈D\mathbf d\in\mathcal Dd∈D:

  1. there is d′∈St\mathbf d'\in\mathcal S_td′∈St​ with f(d)≤f(d′)f(\mathbf d)\le f(\mathbf d')f(d)≤f(d′);
  2. there is d′′∈St\mathbf d''\in\mathcal S_td′′∈St​ with f(d′′)≤f(d)f(\mathbf d'')\le f(\mathbf d)f(d′′)≤f(d).

So both the maximum and the minimum of fff over D\mathcal DD are attained in the four-element set St\mathcal S_tSt​. Which scenario is extremal depends on the signs of WitW_{it}Wit​ and Wi,t−1W_{i,t-1}Wi,t−1​ (the four cases (25a)–(25d) of the paper). The maximum governs the ramping-up constraints (8e), the minimum the ramping-down constraints (8d).

Formalization Note. Lean periods are 0-based and are indices s, t with t = s + 1. The scenarios dminmax(t)\mathbf d_{minmax}(t)dminmax​(t), dmaxmin(t)\mathbf d_{maxmin}(t)dmaxmin​(t) are defined exactly by (21)–(22): dminmax(t)\mathbf d_{minmax}(t)dminmax​(t) has period ttt from dmax⁡\mathbf d_{\max}dmax​ and period t−1t-1t−1 from dmin⁡\mathbf d_{\min}dmin​. The page's assignment of the labels (25a) and (25d) to these scenarios is swapped; the statement, which quantifies over the whole four-element set, is unaffected.

Preamble
import Mathlib
import Definitions.Def_MultistageRUC_WitPolicy_Setting
Formal statement
namespace MultistageRUC.WitPolicy

theorem ramp_worst_case_in_four {Ng Nd T : ℕ}
    (W : Fin Ng → Fin T → ℝ) (dbar dhat : Fin T → Fin Nd → ℝ) (Γ : ℝ)
    (dmax dmin : Fin T → Fin Nd → ℝ)
    (hmax : IsMaxLoad (MultistageRUC.Equiv.uncSet dbar dhat Γ) dmax)
    (hmin : IsMinLoad (MultistageRUC.Equiv.uncSet dbar dhat Γ) dmin)
    (i : Fin Ng) (s t : Fin T) (hst : t.val = s.val + 1) :
    ∀ d ∈ MultistageRUC.Equiv.uncSet dbar dhat Γ,
      (∃ d' ∈ ({dmin, dmax, dminmax dmin dmax t, dmaxmin dmin dmax t} :
          Set (Fin T → Fin Nd → ℝ)),
        W i t * totalLoad d t - W i s * totalLoad d s ≤
          W i t * totalLoad d' t - W i s * totalLoad d' s) ∧
      (∃ d' ∈ ({dmin, dmax, dminmax dmin dmax t, dmaxmin dmin dmax t} :
          Set (Fin T → Fin Nd → ℝ)),
        W i t * totalLoad d' t - W i s * totalLoad d' s ≤
          W i t * totalLoad d t - W i s * totalLoad d s) := by sorry

end MultistageRUC.WitPolicy
Source
Lorca, Sun, Litvinov, Zheng, Multistage adaptive robust optimization for the unit commitment problem, Oper. Res. (2016), doi:10.1287/opre.2015.1456, manuscript of Sept. 29, 2014, p. 19, Proof of Proposition 6, (25a)–(25d)
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 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