Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (5.14) — the robust cost of (x,y(ωˉ))(x,y(\bar\omega))(x,y(ωˉ)) is at most the adaptive cost

Proved
RobustPower.Hypercube.eq_5_14_corner_cost_le_adapt_cost

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), with d(ω)∈R+n2d(\omega)\in\mathbb R^{n_2}_+d(ω)∈R+n2​​ for every scenario, let ωˉ∈Ω\bar\omega\in\Omegaωˉ∈Ω satisfy d(ω)≤d(ωˉ)d(\omega)\le d(\bar\omega)d(ω)≤d(ωˉ) 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

cTx+sup⁡ω∈Ωd(ω)Ty(ωˉ) ≤ cTx+sup⁡ω∈Ωd(ω)Ty(ω).c^Tx+\sup_{\omega\in\Omega}d(\omega)^Ty(\bar\omega)\ \le\ c^Tx+\sup_{\omega\in\Omega}d(\omega)^Ty(\omega).cTx+ω∈Ωsup​d(ω)Ty(ωˉ) ≤ cTx+ω∈Ωsup​d(ω)Ty(ω).

The left side is the worst-case cost in ΠRob(A,B,b,d)\Pi_{\mathrm{Rob}}(A,B,b,d)ΠRob​(A,B,b,d) of the static pair (x,y(ωˉ))(x,y(\bar\omega))(x,y(ωˉ)); the right side is the worst-case cost in ΠAdapt(A,B,b,d)\Pi_{\mathrm{Adapt}}(A,B,b,d)ΠAdapt​(A,B,b,d) of (x,y(⋅))(x,y(\cdot))(x,y(⋅)).

Formalization Note Both costs are extended reals; the inequality is in [−∞,+∞][-\infty,+\infty][−∞,+∞].

Preamble
import Definitions.Def_RobustPower_Hypercube_Problems
Formal statement
namespace RobustPower.Hypercube

/-- Inequality (5.14) and the chain around it (p. 32): let `ω̄` be a scenario whose
cost vector `d(ω̄)` is entrywise maximal over `Ω`. For every feasible solution
`(x, y(·))` of `Π_Adapt(A,B,b,d)`, the worst-case cost of the static pair `(x, y(ω̄))`,
`cᵀx + max_ω d(ω)ᵀy(ω̄)`, is at most `cᵀx + max_ω d(ω)ᵀy(ω)`. -/
theorem eq_5_14_corner_cost_le_adapt_cost
    {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₂ → ℝ)
    (hd : ∀ ω, 0 ≤ d ω)
    (ωbar : Ω) (hdbar : ∀ ω j, d ω j ≤ d ωbar j)
    (x : Fin n₁ → ℝ) (y : Ω → Fin n₂ → ℝ)
    (hxy : adaptFeasible A B b I₁ I₂ x y) :
    RobustPower.AdaptGap.robCost c d x (y ωbar) ≤ RobustPower.AdaptGap.adaptCost c d x y := 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, Eq. (5.14) and the chain containing it
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