Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (5.1) — center-scenario adaptive cost bound

Proved
RobustPower.AdaptGap.eq_5_1_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 two-stage adaptive problem, suppose the nonnegative scenario set is symmetric about the scenario (b(ω0),d(ω0))(b(\omega^0),d(\omega^0))(b(ω0),d(ω0)). Let dhd^hdh be the coordinatewise upper endpoint of the cost vectors. For every feasible adaptive decision (x,y(⋅))(x,y(\cdot))(x,y(⋅)),

cTx+(dh2)Ty(ω0)≤cTx+sup⁡ω∈Ωd(ω)Ty(ω).c^Tx+\left(\frac{d^h}{2}\right)^Ty(\omega^0)\le c^Tx+\sup_{\omega\in\Omega}d(\omega)^Ty(\omega).cTx+(2dh​)Ty(ω0)≤cTx+ω∈Ωsup​d(ω)Ty(ω).

The inequality measures how the center scenario controls the second-stage cost of any feasible adaptive policy; it does not require an optimal policy to exist.

Preamble
import Mathlib
import Definitions.Def_RobustPower_AdaptGap_Problems

open Matrix
Formal statement
namespace RobustPower.AdaptGap

/-- Inequality (5.1), p. 28, for an arbitrary feasible adaptive solution. -/
theorem eq_5_1_adapt_cost {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₂))
    (x : Fin n₁ → ℝ) (y : Ω → Fin n₂ → ℝ) (ω₀ : Ω)
    (hc : 0 ≤ c) (hb : ∀ ω, 0 ≤ b ω) (hd : ∀ ω, 0 ≤ d ω)
    (hfeas : AdaptFeasible A B b I₁ I₂ x y)
    (hcenter : RobustPower.StochGap.IsSymmetricAbout (scenarioSet b d) (b ω₀, d ω₀)) :
    (((c ⬝ᵥ x + (costUpper d / 2) ⬝ᵥ y ω₀ : ℝ) : EReal) ≤
      adaptCost c d x y) := 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, (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