Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.1, p. 23 — in the instance of Theorem 3.1, z_Rob(b, d) ≥ 1

Proved
RobustPower.CostGap.robust_value_ge_one

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization

Consider the instance of Theorem 3.1: no first-stage variables (n1=0n_1=0n1​=0, so c=0c=0c=0 and A=0A=0A=0), n≥1n\ge1n≥1 continuous second-stage variables, a single constraint with B=[1,1,…,1]∈R1×nB=[1,1,\dots,1]\in\mathbb R^{1\times n}B=[1,1,…,1]∈R1×n and right-hand side b(ω)=1b(\omega)=1b(ω)=1 in every scenario, and a cost map d:Ω→Rnd:\Omega\to\mathbb R^nd:Ω→Rn whose range is exactly the cube [0,1]n[0,1]^n[0,1]n. Then the optimal value of the robust problem ΠRob(b,d)\Pi_{\mathrm{Rob}}(b,d)ΠRob​(b,d) satisfies

zRob(b,d) ≥ 1.z_{\mathrm{Rob}}(b,d)\ \ge\ 1 .zRob​(b,d) ≥ 1.

This is the robust half of the gap in Theorem 3.1: the scenario with d(ω)=(1,…,1)d(\omega)=(1,\dots,1)d(ω)=(1,…,1) is among the scenarios, and the single robust decision must cover it.

Formalization Note zRobz_{\mathrm{Rob}}zRob​ is the extended-real infimum of (1.5); the statement does not assume that an optimal robust solution exists. No probability measure is involved.

Preamble
import Mathlib
import Definitions.Def_RobustPower_CostGap_Problems

open MeasureTheory Matrix
Formal statement
namespace RobustPower.CostGap

/-- Proof of Theorem 3.1, p. 23: in the instance of Theorem 3.1, `z_Rob(b, d) ≥ 1`. -/
theorem robust_value_ge_one {n : ℕ} (hn : 0 < n) {Ω : Type*}
    (d : Ω → Fin n → ℝ) (hrange : Set.range d = Set.Icc 0 1) :
    (1 : EReal) ≤
      zRobBD (0 : Matrix (Fin 1) (Fin 0) ℝ) (fun _ _ => 1 : Matrix (Fin 1) (Fin n) ℝ)
          (fun _ _ => 1 : Ω → Fin 1 → ℝ) (0 : Fin 0 → ℝ) d ∅ ∅ := by sorry

end RobustPower.CostGap
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. 23, proof of Theorem 3.1, display z_Rob(b, d) ≥ 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