Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.1 — with uniform hypercube cost uncertainty, z_Rob(b, d) ≥ (n + 1) · z_Stoch(b, d)

Proved
RobustPower.CostGap.theorem_3_1_cost_uncertainty_gap

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimizationstochastic-programming

Consider the instances of the stochastic problem ΠStoch(b,d)\Pi_{\mathrm{Stoch}}(b,d)ΠStoch​(b,d) and the robust problem ΠRob(b,d)\Pi_{\mathrm{Rob}}(b,d)ΠRob​(b,d) with no first-stage variables (n1=0n_1=0n1​=0, so c=0c=0c=0 and A=0A=0A=0), n2=n≥1n_2=n\ge1n2​=n≥1 continuous second-stage variables (p2=0p_2=0p2​=0), and a single constraint (m=1m=1m=1) with B=[1,1,…,1]∈R1×nB=[1,1,\dots,1]\in\mathbb R^{1\times n}B=[1,1,…,1]∈R1×n. The right-hand side is b(ω)=1b(\omega)=1b(ω)=1 in every scenario, so the constraint reads y1+⋯+yn≥1y_1+\dots+y_n\ge1y1​+⋯+yn​≥1. Let (Ω,μ)(\Omega,\mu)(Ω,μ) be a probability space of scenarios and d:Ω→Rnd:\Omega\to\mathbb R^nd:Ω→Rn a measurable cost map such that

  1. the uncertainty set is I(b,d)(Ω)={(1,d(ω)):ω∈Ω}={1}×[0,1]nI_{(b,d)}(\Omega)=\{(1,d(\omega)):\omega\in\Omega\}=\{1\}\times[0,1]^nI(b,d)​(Ω)={(1,d(ω)):ω∈Ω}={1}×[0,1]n, that is, the range of ddd is exactly the cube [0,1]n[0,1]^n[0,1]n;
  2. the coordinates d1,…,dnd_1,\dots,d_nd1​,…,dn​ are independent and each uniformly distributed on [0,1][0,1][0,1] under μ\muμ.

Then

zRob(b,d) ≥ (n+1)⋅zStoch(b,d).z_{\mathrm{Rob}}(b,d)\ \ge\ (n+1)\cdot z_{\mathrm{Stoch}}(b,d).zRob​(b,d) ≥ (n+1)⋅zStoch​(b,d).

The uncertainty set and the measure are both symmetric and there are no integer variables: these are the hypotheses under which, for right-hand-side uncertainty alone, the robust optimum is at most twice the stochastic one (Theorem 2.1). Theorem 3.1 shows that this bound fails once the costs are uncertain: the stochasticity gap grows linearly in the dimension.

Formalization Note Both optimal values are infima in the extended reals, the stochastic problem ranges over integrable policies whose constraints hold in every scenario, and neither problem is assumed to have an optimal solution. The hypothesis n≥1n\ge1n≥1 is implicit in the paper. Independence and uniformity are stated as: the law of ddd under μ\muμ equals the product of nnn uniform distributions on [0,1][0,1][0,1].

Preamble
import Mathlib
import Definitions.Def_RobustPower_CostGap_Problems

open MeasureTheory Matrix
Formal statement
namespace RobustPower.CostGap

/-- Theorem 3.1 (p. 22). The instance `n₁ = 0`, `n₂ = n`, `p₂ = 0`, `m = 1`, `c = 0`, `A = 0`,
`B = [1, …, 1]`, `b(ω) = 1`, with uncertainty set `{1} × [0, 1]ⁿ` and the coordinates of `d`
independent and uniform on `[0, 1]`, has `z_Rob(b, d) ≥ (n + 1) · z_Stoch(b, d)`. -/
theorem theorem_3_1_cost_uncertainty_gap {n : ℕ} (hn : 0 < n)
    {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω) [IsProbabilityMeasure μ]
    (d : Ω → Fin n → ℝ) (hd : Measurable d) (hrange : Set.range d = Set.Icc 0 1)
    (hlaw : μ.map d = Measure.pi (fun _ : Fin n => volume.restrict (Set.Icc (0 : ℝ) 1))) :
    (((n : ℝ) + 1 : ℝ) : EReal) *
        zStochBD μ (0 : Matrix (Fin 1) (Fin 0) ℝ) (fun _ _ => 1 : Matrix (Fin 1) (Fin n) ℝ)
          (fun _ _ => 1 : Ω → Fin 1 → ℝ) (0 : Fin 0 → ℝ) d ∅ ∅ ≤
      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. 22, Theorem 3.1 (proof pp. 22–23)
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