Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.1 — the adaptability gap is at most four

Proved
RobustPower.AdaptGap.theorem_5_1_robust_le_four_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

Let A∈Rm×n1A\in\mathbb R^{m\times n_1}A∈Rm×n1​ and B∈Rm×n2B\in\mathbb R^{m\times n_2}B∈Rm×n2​. Let c∈R+n1c\in\mathbb R_+^{n_1}c∈R+n1​​, and let every scenario ω∈Ω\omega\in\Omegaω∈Ω have b(ω)∈R+mb(\omega)\in\mathbb R_+^mb(ω)∈R+m​ and d(ω)∈R+n2d(\omega)\in\mathbb R_+^{n_2}d(ω)∈R+n2​​. Both decision stages may have designated nonnegative integer coordinates. If the paired uncertainty set I(b,d)(Ω)={(b(ω),d(ω)):ω∈Ω}I_{(b,d)}(\Omega)=\{(b(\omega),d(\omega)):\omega\in\Omega\}I(b,d)​(Ω)={(b(ω),d(ω)):ω∈Ω} is symmetric, then the optimal static robust cost is at most four times the optimal fully adaptive worst-case cost:

zRob(b,d)≤4zAdapt(b,d).z_{\mathrm{Rob}}(b,d)\le4z_{\mathrm{Adapt}}(b,d).zRob​(b,d)≤4zAdapt​(b,d).

This is the paper's constant-factor bound when uncertainty affects both right-hand sides and second-stage costs, including mixed-integer second-stage decisions.

Formalization Note Both values are extended-real infima over exactly the feasible decisions in (1.5)–(1.6); no optimal-solution attainment is assumed. Symmetry makes the scenario set nonempty and bounded. Integer coordinates are designated by sets, equivalent to the paper's product domains up to coordinate relabelling.

Preamble
import Mathlib
import Definitions.Def_RobustPower_AdaptGap_Problems
Formal statement
namespace RobustPower.AdaptGap

/-- Theorem 5.1, p. 28: the adaptability gap is at most four. -/
theorem theorem_5_1_robust_le_four_adapt {m n₁ n₂ : ℕ} {Ω : Type*}
    (A : Matrix (Fin m) (Fin n₁) ℝ) (B : Matrix (Fin m) (Fin n₂) ℝ)
    (b : Ω → Fin m → ℝ) (c : Fin n₁ → ℝ) (d : Ω → Fin n₂ → ℝ)
    (I₁ : Set (Fin n₁)) (I₂ : Set (Fin n₂))
    (hc : 0 ≤ c) (hb : ∀ ω, 0 ≤ b ω) (hd : ∀ ω, 0 ≤ d ω)
    (hsym : RobustPower.StochGap.IsSymmetric (scenarioSet b d)) :
    zRob A B b c d I₁ I₂ ≤ (4 : EReal) * zAdapt A B b c d I₁ I₂ := by sorry

end RobustPower.AdaptGap
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. 28, Theorem 5.1
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