Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2.1, p. 583 — the Sion exchange inf⁡qmax⁡w∈X(x)=max⁡w∈X(x)inf⁡q\inf_q\max_{w\in X(x)} = \max_{w\in X(x)}\inf_qinfq​maxw∈X(x)​=maxw∈X(x)​infq​

Proved
MinimaxSLP.ObjSDP.sion_exchange

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

convex-analysisminimaxp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let X(x)X(x)X(x) be a nonempty bounded recourse set, let Y⪰0Y\succeq 0Y⪰0, y∈Rdy\in\mathbb R^dy∈Rd and y0,a,b∈Ry_0,a,b\in\mathbb Ry0​,a,b∈R (in the paper a=αka=\alpha_ka=αk​, b=βkb=\beta_kb=βk​), and put

g(q,w)=q′Yq+q′y+y0−a q′w−b.g(q,w)=q'Yq+q'y+y_0-a\,q'w-b .g(q,w)=q′Yq+q′y+y0​−aq′w−b.

Then, with values in the extended reals,

inf⁡q∈Rd max⁡w∈X(x)g(q,w)  =  max⁡w∈X(x) inf⁡q∈Rdg(q,w),\inf_{q\in\mathbb R^d}\ \max_{w\in X(x)} g(q,w)\;=\;\max_{w\in X(x)}\ \inf_{q\in\mathbb R^d} g(q,w),q∈Rdinf​ w∈X(x)max​g(q,w)=w∈X(x)max​ q∈Rdinf​g(q,w),

and the maximum on the right is attained at some w0∈X(x)w_0\in X(x)w0​∈X(x).

This is the application of Sion's minimax theorem in the proof of Theorem 2.1: ggg is convex in qqq because Y⪰0Y\succeq 0Y⪰0 and affine in www, and X(x)X(x)X(x) is compact and convex.

Formalization Note The values are taken in EReal, because inf⁡qg(q,w)=−∞\inf_q g(q,w)=-\inftyinfq​g(q,w)=−∞ when y−awy-a wy−aw is not in the range of YYY. The supremum over w∈X(x)w\in X(x)w∈X(x) is written as an EReal supremum, and its attainment on the right is stated explicitly.

Preamble
import Mathlib
import Definitions.Def_MomentDRO_Conf_Setting
import Definitions.Def_MinimaxSLP_ObjSDP_Model

open MeasureTheory Matrix
Formal statement
namespace MinimaxSLP.ObjSDP

/-- Proof of Theorem 2.1 (p. 583), the Sion step: for `Y ⪰ 0`, `a = α_k ≥ 0` (any real `a`
works) and a nonempty bounded recourse set `X(x)`, with
`g(q, w) = q′Yq + q′y + y₀ − a q′w − b`,
`inf_{q ∈ ℝ^d} max_{w ∈ X(x)} g(q, w) = max_{w ∈ X(x)} inf_{q ∈ ℝ^d} g(q, w)`,
and the outer maximum on the right is attained. Values are taken in `EReal`, because
`inf_q g(q, w)` is `−∞` for some `w`. -/
theorem sion_exchange {n r d : ℕ}
    (W : Matrix (Fin r) (Fin d) ℝ) (T : Matrix (Fin r) (Fin n) ℝ) (h : Fin r → ℝ)
    (x : Fin n → ℝ) (hrec : (recourseSet W T h x).Nonempty)
    (hbdd : Bornology.IsBounded (recourseSet W T h x))
    (Y : Matrix (Fin d) (Fin d) ℝ) (hY : Y.PosSemidef) (y : Fin d → ℝ) (y₀ a b : ℝ) :
    (⨅ q : Fin d → ℝ, ⨆ w ∈ recourseSet W T h x,
        ((q ⬝ᵥ (Y *ᵥ q) + q ⬝ᵥ y + y₀ - a * (q ⬝ᵥ w) - b : ℝ) : EReal)) =
      (⨆ w ∈ recourseSet W T h x, ⨅ q : Fin d → ℝ,
        ((q ⬝ᵥ (Y *ᵥ q) + q ⬝ᵥ y + y₀ - a * (q ⬝ᵥ w) - b : ℝ) : EReal)) ∧
    ∃ w₀ ∈ recourseSet W T h x,
      (⨅ q : Fin d → ℝ, ((q ⬝ᵥ (Y *ᵥ q) + q ⬝ᵥ y + y₀ - a * (q ⬝ᵥ w₀) - b : ℝ) : EReal)) =
        ⨆ w ∈ recourseSet W T h x, ⨅ q : Fin d → ℝ,
          ((q ⬝ᵥ (Y *ᵥ q) + q ⬝ᵥ y + y₀ - a * (q ⬝ᵥ w) - b : ℝ) : EReal) := by sorry

end MinimaxSLP.ObjSDP
Source
Bertsimas, Doan, Natarajan & Teo, Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion, Math. Oper. Res. 35(3), 2010, p. 583, proof of Theorem 2.1 (Sion minimax step, citing Sion [25])
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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