Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2 — Lemma 1 on A×Pπ\mathcal A \times \mathcal P_\piA×Pπ​: max⁡πmin⁡α∈AGβ=min⁡α∈Amax⁡πGβ\max_\pi\min_{\alpha\in\mathcal A} G_\beta = \min_{\alpha\in\mathcal A}\max_\pi G_\betamaxπ​minα∈A​Gβ​=minα∈A​maxπ​Gβ​

Proved
WorstCaseCVaR.Discrete.lemma_1_on_interval

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

cvarminimaxp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let fff, the scenarios y[1],…,y[S]y_{[1]},\dots,y_{[S]}y[1]​,…,y[S]​, the decision xxx and GβG_\betaGβ​ be as in the setting of §2.2, with 0<β<10<\beta<10<β<1. Let Pπ⊆RS\mathcal P_\pi \subseteq \mathbb R^SPπ​⊆RS be a nonempty compact convex set of probability vectors and let A=[a,b]\mathcal A = [a,b]A=[a,b] with a≤ba \le ba≤b be a nonempty closed bounded interval. Then Gβ(x,⋅,⋅)G_\beta(x,\cdot,\cdot)Gβ​(x,⋅,⋅) has a saddle point (α0,π0)∈A×Pπ(\alpha_0,\pi_0) \in \mathcal A \times \mathcal P_\pi(α0​,π0​)∈A×Pπ​:

Gβ(x,α0,π)≤Gβ(x,α0,π0)≤Gβ(x,α,π0)for all α∈A, π∈Pπ,G_\beta(x,\alpha_0,\pi) \le G_\beta(x,\alpha_0,\pi_0) \le G_\beta(x,\alpha,\pi_0)\qquad\text{for all } \alpha\in\mathcal A,\ \pi\in\mathcal P_\pi,Gβ​(x,α0​,π)≤Gβ​(x,α0​,π0​)≤Gβ​(x,α,π0​)for all α∈A, π∈Pπ​,

so that

max⁡π∈Pπmin⁡α∈AGβ(x,α,π)=min⁡α∈Amax⁡π∈PπGβ(x,α,π),\max_{\pi\in\mathcal P_\pi}\min_{\alpha\in\mathcal A} G_\beta(x,\alpha,\pi) = \min_{\alpha\in\mathcal A}\max_{\pi\in\mathcal P_\pi} G_\beta(x,\alpha,\pi),π∈Pπ​max​α∈Amin​Gβ​(x,α,π)=α∈Amin​π∈Pπ​max​Gβ​(x,α,π),

all extrema being attained.

This is the exchange of minimization and maximization on the compact product A×Pπ\mathcal A \times \mathcal P_\piA×Pπ​, the central step of the proof of Theorem 2.

Formalization Note The interval is arbitrary (a≤ba\le ba≤b), not the specific interval produced by the reduction step; the statement is the saddle-point form of the attained min–max equality.

Preamble
import Mathlib
import Definitions.Def_WorstCaseCVaR_Discrete_Setting
Formal statement
namespace WorstCaseCVaR.Discrete

/-- Proof of Theorem 2, Zhu & Fukushima (2009), p. 1167 (Lemma 1 applied on `𝒜 × 𝒫_π`): for every
nonempty closed bounded interval `𝒜 = [a, b]` and every nonempty compact convex set `𝒫_π` of
probability vectors, `G_β(x, ·, ·)` has a saddle point `(α₀, π₀)` on `𝒜 × 𝒫_π`; equivalently,
`max_{π ∈ 𝒫_π} min_{α ∈ 𝒜} G_β(x, α, π) = min_{α ∈ 𝒜} max_{π ∈ 𝒫_π} G_β(x, α, π)` with all extrema
attained. -/
theorem lemma_1_on_interval {n m S : ℕ} (f : (Fin n → ℝ) → (Fin m → ℝ) → ℝ)
    (ys : Fin S → Fin m → ℝ) (x : Fin n → ℝ) (β : ℝ) (hβ0 : 0 < β) (hβ1 : β < 1)
    (P : Set (Fin S → ℝ)) (hP : P ⊆ stdSimplex ℝ (Fin S)) (hne : P.Nonempty)
    (hcpt : IsCompact P) (hcvx : Convex ℝ P) (a b : ℝ) (hab : a ≤ b) :
    ∃ α₀ ∈ Set.Icc a b, ∃ π₀ ∈ P, ∀ α ∈ Set.Icc a b, ∀ π ∈ P,
      G f ys β x α₀ π ≤ G f ys β x α₀ π₀ ∧ G f ys β x α₀ π₀ ≤ G f ys β x α π₀ := by sorry

end WorstCaseCVaR.Discrete
Source
Zhu & Fukushima, Worst-Case Conditional Value-at-Risk with Application to Robust Portfolio Management, Oper. Res. 57(5), 2009, p. 1167, proof of Theorem 2 ("By Lemma 1, we get …")
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