Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.4 — for hypercube uncertainty, zRob(A,B,b,d)=zAdapt(A,B,b,d)z_{\mathrm{Rob}}(A,B,b,d)=z_{\mathrm{Adapt}}(A,B,b,d)zRob​(A,B,b,d)=zAdapt​(A,B,b,d)

Proved
RobustPower.Hypercube.theorem_5_4_robust_eq_adapt

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

adaptive-optimizationmixed-integer-optimizationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization

Consider the two-stage mixed integer problems (5.6)–(5.7) in which the constraint matrices, the right-hand side and the second-stage cost are all uncertain: scenario ω∈Ω\omega\in\Omegaω∈Ω has data A(ω)∈Rm×n1A(\omega)\in\mathbb R^{m\times n_1}A(ω)∈Rm×n1​, B(ω)∈Rm×n2B(\omega)\in\mathbb R^{m\times n_2}B(ω)∈Rm×n2​, b(ω)∈Rmb(\omega)\in\mathbb R^mb(ω)∈Rm and d(ω)∈R+n2d(\omega)\in\mathbb R^{n_2}_+d(ω)∈R+n2​​, and the first-stage cost is c∈R+n1c\in\mathbb R^{n_1}_+c∈R+n1​​. The integer coordinates I1I_1I1​, I2I_2I2​ of the two stages are arbitrary.

Suppose the uncertainty set is a hypercube:

U={(A(ω),B(ω),b(ω),d(ω)):ω∈Ω}=[l1,u1]×[l2,u2]×⋯×[lN,uN]\mathcal U=\{(A(\omega),B(\omega),b(\omega),d(\omega)) : \omega\in\Omega\}=[l_1,u_1]\times[l_2,u_2]\times\cdots\times[l_N,u_N]U={(A(ω),B(ω),b(ω),d(ω)):ω∈Ω}=[l1​,u1​]×[l2​,u2​]×⋯×[lN​,uN​]

for some li≤uil_i\le u_ili​≤ui​, i=1,…,Ni=1,\dots,Ni=1,…,N, where N=mn1+mn2+m+n2N=mn_1+mn_2+m+n_2N=mn1​+mn2​+m+n2​. Then

zRob(A,B,b,d)=zAdapt(A,B,b,d).z_{\mathrm{Rob}}(A,B,b,d)=z_{\mathrm{Adapt}}(A,B,b,d).zRob​(A,B,b,d)=zAdapt​(A,B,b,d).

For box uncertainty, even in the constraint matrix, adapting the second-stage decision to the realized scenario gains nothing over a single static decision.

Formalization Note zRobz_{\mathrm{Rob}}zRob​ and zAdaptz_{\mathrm{Adapt}}zAdapt​ are extended-real infima (no optimal solution is assumed; both are +∞+\infty+∞ when infeasible). The hypercube hypothesis is an equality: the realized data are the whole box, not a subset of it.

Preamble
import Definitions.Def_RobustPower_Hypercube_DataBox
import Definitions.Def_RobustPower_Hypercube_Problems
Formal statement
namespace RobustPower.Hypercube

/-- Theorem 5.4 (p. 31): if the uncertainty set
`U = {(A(ω), B(ω), b(ω), d(ω)) | ω ∈ Ω}` is a hypercube in `ℝ^N`,
`N = m n₁ + m n₂ + m + n₂`, then `z_Rob(A,B,b,d) = z_Adapt(A,B,b,d)`. -/
theorem theorem_5_4_robust_eq_adapt
    {m n₁ n₂ : ℕ} {Ω : Type*}
    (A : Ω → Matrix (Fin m) (Fin n₁) ℝ)
    (B : Ω → Matrix (Fin m) (Fin n₂) ℝ)
    (b : Ω → Fin m → ℝ)
    (I₁ : Set (Fin n₁)) (I₂ : Set (Fin n₂))
    (c : Fin n₁ → ℝ) (d : Ω → Fin n₂ → ℝ)
    (hc : 0 ≤ c) (hd : ∀ ω, 0 ≤ d ω)
    (hU : IsHypercube (uncertaintySet A B b d)) :
    zRob A B b I₁ I₂ c d = zAdapt A B b I₁ I₂ c d := by sorry

end RobustPower.Hypercube
Source
Bertsimas & Goyal, On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems, authors' manuscript (MIT DSpace) of Math. Oper. Res. DOI 10.1287/moor.1090.0440, p. 31, Theorem 5.4 (proof pp. 31–32)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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