Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (3.1), p. 23 — z_Stoch(b, d) ≤ E_µ[min(d₁(ω), …, dₙ(ω))] in the instance of Theorem 3.1

Proved
RobustPower.CostGap.eq_3_1_stoch_le_expected_min

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

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

Consider the instance of Theorem 3.1 (n1=0n_1=0n1​=0, c=0c=0c=0, A=0A=0A=0, n≥1n\ge1n≥1 continuous second-stage variables, B=[1,…,1]∈R1×nB=[1,\dots,1]\in\mathbb R^{1\times n}B=[1,…,1]∈R1×n, b(ω)=1b(\omega)=1b(ω)=1), with a probability measure μ\muμ on the scenario set Ω\OmegaΩ and a measurable cost map d:Ω→Rnd:\Omega\to\mathbb R^nd:Ω→Rn whose range is exactly [0,1]n[0,1]^n[0,1]n. Then the optimal value of the stochastic problem ΠStoch(b,d)\Pi_{\mathrm{Stoch}}(b,d)ΠStoch​(b,d) satisfies

zStoch(b,d) ≤ Eμ[min⁡(d1(ω),…,dn(ω))].z_{\mathrm{Stoch}}(b,d)\ \le\ \mathbb E_\mu\bigl[\min\bigl(d_1(\omega),\dots,d_n(\omega)\bigr)\bigr].zStoch​(b,d) ≤ Eμ​[min(d1​(ω),…,dn​(ω))].

The paper obtains this bound from a policy that, in each scenario, buys one unit of a cheapest coordinate. No distributional assumption on ddd is used beyond measurability and boundedness; combined with Eq. (3.2) it gives zStoch(b,d)≤1/(n+1)z_{\mathrm{Stoch}}(b,d)\le 1/(n+1)zStoch​(b,d)≤1/(n+1).

Formalization Note zStochz_{\mathrm{Stoch}}zStoch​ is the extended-real infimum of (1.4) over integrable policies. The paper's policy y~\tilde yy~​ puts a 1 on every minimizing coordinate, which at ties costs a multiple of the minimum; the statement here is the resulting bound on zStochz_{\mathrm{Stoch}}zStoch​, not a claim about that particular policy. The minimum is written as an infimum over the finite nonempty index set {1,…,n}\{1,\dots,n\}{1,…,n}.

Preamble
import Mathlib
import Definitions.Def_RobustPower_CostGap_Problems

open MeasureTheory Matrix
Formal statement
namespace RobustPower.CostGap

/-- Eq. (3.1), p. 23: in the instance of Theorem 3.1, the policy that buys one unit of a cheapest
coordinate shows `z_Stoch(b, d) ≤ E_μ[min(d₁(ω), …, dₙ(ω))]`. -/
theorem eq_3_1_stoch_le_expected_min {n : ℕ} (hn : 0 < n)
    {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω) [IsProbabilityMeasure μ]
    (d : Ω → Fin n → ℝ) (hd : Measurable d) (hrange : Set.range d = Set.Icc 0 1) :
    zStochBD μ (0 : Matrix (Fin 1) (Fin 0) ℝ) (fun _ _ => 1 : Matrix (Fin 1) (Fin n) ℝ)
        (fun _ _ => 1 : Ω → Fin 1 → ℝ) (0 : Fin 0 → ℝ) d ∅ ∅ ≤
      ((∫ ω, (⨅ j, d ω j) ∂μ : ℝ) : EReal) := 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, Eq. (3.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