Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eqs. (5.8)–(5.10) — on a hypercube the worst corner ωˉ\bar\omegaωˉ is a scenario

Proved
RobustPower.Hypercube.eq_5_8_5_10_worst_scenario

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimizationuncertainty-sets

Let Ω\OmegaΩ be a scenario set with data A(ω),B(ω),b(ω),d(ω)A(\omega),B(\omega),b(\omega),d(\omega)A(ω),B(ω),b(ω),d(ω), and suppose the uncertainty set U={(A(ω),B(ω),b(ω),d(ω)):ω∈Ω}\mathcal U=\{(A(\omega),B(\omega),b(\omega),d(\omega)):\omega\in\Omega\}U={(A(ω),B(ω),b(ω),d(ω)):ω∈Ω} is a hypercube. Then there is a scenario ωˉ∈Ω\bar\omega\in\Omegaωˉ∈Ω whose data are entrywise the worst possible:

Aij(ωˉ)=min⁡ω∈ΩAij(ω),Bij(ωˉ)=min⁡ω∈ΩBij(ω),bi(ωˉ)=max⁡ω∈Ωbi(ω),dj(ωˉ)=max⁡ω∈Ωdj(ω)A_{ij}(\bar\omega)=\min_{\omega\in\Omega}A_{ij}(\omega),\quad B_{ij}(\bar\omega)=\min_{\omega\in\Omega}B_{ij}(\omega),\quad b_i(\bar\omega)=\max_{\omega\in\Omega}b_i(\omega),\quad d_j(\bar\omega)=\max_{\omega\in\Omega}d_j(\omega)Aij​(ωˉ)=ω∈Ωmin​Aij​(ω),Bij​(ωˉ)=ω∈Ωmin​Bij​(ω),bi​(ωˉ)=ω∈Ωmax​bi​(ω),dj​(ωˉ)=ω∈Ωmax​dj​(ω)

for all i,ji,ji,j; that is, A(ωˉ)≤A(ω)A(\bar\omega)\le A(\omega)A(ωˉ)≤A(ω), B(ωˉ)≤B(ω)B(\bar\omega)\le B(\omega)B(ωˉ)≤B(ω), b(ω)≤b(ωˉ)b(\omega)\le b(\bar\omega)b(ω)≤b(ωˉ) and d(ω)≤d(ωˉ)d(\omega)\le d(\bar\omega)d(ω)≤d(ωˉ) entrywise for every ω∈Ω\omega\in\Omegaω∈Ω.

This is where the hypercube assumption enters the proof of Theorem 5.4: for a general uncertainty set the entrywise extremes need not be realized by a single scenario.

Preamble
import Definitions.Def_RobustPower_Hypercube_DataBox
Formal statement
namespace RobustPower.Hypercube

/-- Equations (5.8)–(5.10) (pp. 31–32): if the uncertainty set is a hypercube, the
data `vec(Ā, B̄, b̄, d̄)` made of the entrywise minima of `A(ω)`, `B(ω)` and the
entrywise maxima of `b(ω)`, `d(ω)` over `ω ∈ Ω` is realized by a scenario `ω̄`. -/
theorem eq_5_8_5_10_worst_scenario
    {m n₁ n₂ : ℕ} {Ω : Type*}
    (A : Ω → Matrix (Fin m) (Fin n₁) ℝ)
    (B : Ω → Matrix (Fin m) (Fin n₂) ℝ)
    (b : Ω → Fin m → ℝ) (d : Ω → Fin n₂ → ℝ)
    (hU : IsHypercube (uncertaintySet A B b d)) :
    ∃ ωbar : Ω,
      (∀ ω i j, A ωbar i j ≤ A ω i j) ∧
      (∀ ω i j, B ωbar i j ≤ B ω i j) ∧
      (∀ ω i, b ω i ≤ b ωbar i) ∧
      (∀ ω j, d ω j ≤ d ωbar j) := 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, pp. 31–32, Eqs. (5.8)–(5.10) and the sentence following them
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