Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eqs. (5.11)–(5.13) — the adaptive decision at ωˉ\bar\omegaωˉ is robust feasible

Proved
RobustPower.Hypercube.eq_5_11_5_13_corner_rob_feasible

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

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

In the setting of (5.6)–(5.7), let ωˉ∈Ω\bar\omega\in\Omegaωˉ∈Ω be a scenario with A(ωˉ)≤A(ω)A(\bar\omega)\le A(\omega)A(ωˉ)≤A(ω), B(ωˉ)≤B(ω)B(\bar\omega)\le B(\omega)B(ωˉ)≤B(ω) and b(ω)≤b(ωˉ)b(\omega)\le b(\bar\omega)b(ω)≤b(ωˉ) entrywise for every ω∈Ω\omega\in\Omegaω∈Ω. If (x,y(⋅))(x,y(\cdot))(x,y(⋅)) is feasible for ΠAdapt(A,B,b,d)\Pi_{\mathrm{Adapt}}(A,B,b,d)ΠAdapt​(A,B,b,d), then the static pair (x,y(ωˉ))(x,y(\bar\omega))(x,y(ωˉ)) is feasible for ΠRob(A,B,b,d)\Pi_{\mathrm{Rob}}(A,B,b,d)ΠRob​(A,B,b,d): for every ω∈Ω\omega\in\Omegaω∈Ω,

A(ω)x+B(ω)y(ωˉ) ≥ A(ωˉ)x+B(ωˉ)y(ωˉ) ≥ b(ωˉ) ≥ b(ω).A(\omega)x+B(\omega)y(\bar\omega)\ \ge\ A(\bar\omega)x+B(\bar\omega)y(\bar\omega)\ \ge\ b(\bar\omega)\ \ge\ b(\omega).A(ω)x+B(ω)y(ωˉ) ≥ A(ωˉ)x+B(ωˉ)y(ωˉ) ≥ b(ωˉ) ≥ b(ω).

No sign is assumed on AAA, BBB or bbb; the nonnegativity of xxx and y(ωˉ)y(\bar\omega)y(ωˉ) comes from the decision domains.

Preamble
import Definitions.Def_RobustPower_Hypercube_Problems
Formal statement
namespace RobustPower.Hypercube

/-- Inequalities (5.11)–(5.13) (p. 32): let `ω̄` be a scenario whose `A(ω̄)`, `B(ω̄)`
are entrywise minimal and whose `b(ω̄)` is entrywise maximal over `Ω`. For every
feasible solution `(x, y(·))` of `Π_Adapt(A,B,b,d)`, the static pair `(x, y(ω̄))` is
feasible for `Π_Rob(A,B,b,d)`. -/
theorem eq_5_11_5_13_corner_rob_feasible
    {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₂))
    (ωbar : Ω)
    (hA : ∀ ω i j, A ωbar i j ≤ A ω i j)
    (hB : ∀ ω i j, B ωbar i j ≤ B ω i j)
    (hb : ∀ ω i, b ω i ≤ b ωbar i)
    (x : Fin n₁ → ℝ) (y : Ω → Fin n₂ → ℝ)
    (hxy : adaptFeasible A B b I₁ I₂ x y) :
    robFeasible A B b I₁ I₂ x (y ωbar) := 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. 32, Eqs. (5.11)–(5.13)
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