Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (5.2) — doubling center-scenario decisions gives a robust solution

Proved
RobustPower.AdaptGap.eq_5_2_doubled_feasible

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

adaptive-optimizationmixed-integer-optimizationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization

In the same nonnegative symmetric scenario model, let (x,y(⋅))(x,y(\cdot))(x,y(⋅)) be any feasible adaptive decision and let ω0\omega^0ω0 realize the point of symmetry. Then the doubled decisions are feasible in the static robust problem:

2x∈DI1,2y(ω0)∈DI2,A(2x)+B(2y(ω0))≥b(ω)for all ω∈Ω.2x\in D_{I_1},\qquad 2y(\omega^0)\in D_{I_2},\qquad A(2x)+B(2y(\omega^0))\ge b(\omega)\quad\text{for all }\omega\in\Omega.2x∈DI1​​,2y(ω0)∈DI2​​,A(2x)+B(2y(ω0))≥b(ω)for all ω∈Ω.

The claim includes preservation of the integer coordinates and is the feasibility step used in Theorem 5.1.

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

/-- (5.2) and the p. 29 claim: doubling the center-scenario decisions is robust feasible. -/
theorem eq_5_2_doubled_feasible {m n₁ n₂ : ℕ} {Ω : Type*}
    (A : Matrix (Fin m) (Fin n₁) ℝ) (B : Matrix (Fin m) (Fin n₂) ℝ)
    (b : Ω → Fin m → ℝ) (d : Ω → Fin n₂ → ℝ)
    (I₁ : Set (Fin n₁)) (I₂ : Set (Fin n₂))
    (x : Fin n₁ → ℝ) (y : Ω → Fin n₂ → ℝ) (ω₀ : Ω)
    (hb : ∀ ω, 0 ≤ b ω) (hd : ∀ ω, 0 ≤ d ω)
    (hfeas : AdaptFeasible A B b I₁ I₂ x y)
    (hcenter : RobustPower.StochGap.IsSymmetricAbout (scenarioSet b d) (b ω₀, d ω₀)) :
    RobustPower.StochGap.RobFeasible A B b I₁ I₂ ((2 : ℝ) • x) ((2 : ℝ) • 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, pp. 28–29, (5.2) and the following claim
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