Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2 (via the proof of Theorem 1) — min-max inequality WCVaRβ(x)≤sup⁡πGβ(x,α,π)\mathrm{WCVaR}_\beta(x) \le \sup_{\pi} G_\beta(x,\alpha,\pi)WCVaRβ​(x)≤supπ​Gβ​(x,α,π) for every α\alphaα

Proved
WorstCaseCVaR.Discrete.minmax_inequality

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β​, CVaRβ\mathrm{CVaR}_\betaCVaRβ​, WCVaRβ\mathrm{WCVaR}_\betaWCVaRβ​ be as in the setting of §2.2, with 0<β<10<\beta<10<β<1, and let Pπ\mathcal P_\piPπ​ be a nonempty set of probability vectors in RS\mathbb R^SRS. Then for every α∈R\alpha \in \mathbb Rα∈R

WCVaRβ(x)=sup⁡π∈Pπmin⁡α′∈RGβ(x,α′,π)  ≤  sup⁡π∈PπGβ(x,α,π).\mathrm{WCVaR}_\beta(x) = \sup_{\pi\in\mathcal P_\pi}\min_{\alpha'\in\mathbb R} G_\beta(x,\alpha',\pi) \;\le\; \sup_{\pi\in\mathcal P_\pi} G_\beta(x,\alpha,\pi).WCVaRβ​(x)=π∈Pπ​sup​α′∈Rmin​Gβ​(x,α′,π)≤π∈Pπ​sup​Gβ​(x,α,π).

Equivalently,

inf⁡α∈Rsup⁡π∈PπGβ(x,α,π)  ≥  sup⁡π∈Pπmin⁡α∈RGβ(x,α,π).\inf_{\alpha\in\mathbb R}\sup_{\pi\in\mathcal P_\pi} G_\beta(x,\alpha,\pi) \;\ge\; \sup_{\pi\in\mathcal P_\pi}\min_{\alpha\in\mathbb R} G_\beta(x,\alpha,\pi).α∈Rinf​π∈Pπ​sup​Gβ​(x,α,π)≥π∈Pπ​sup​α∈Rmin​Gβ​(x,α,π).

This is the elementary min-max inequality (weak duality) on the unrestricted threshold line R\mathbb RR; together with the saddle point on A×Pπ\mathcal A \times \mathcal P_\piA×Pπ​ it closes the gap between inf⁡α∈R\inf_{\alpha\in\mathbb R}infα∈R​ and min⁡α∈A\min_{\alpha\in\mathcal A}minα∈A​ in the proof of Theorem 2. The paper prints it in the proof of Theorem 1 for the mixture function HβH_\betaHβ​ and invokes it for GβG_\betaGβ​ through "a further discussion similar to the proof of Theorem 1".

Formalization Note The inequality is stated pointwise in α\alphaα, which is equivalent to the inf form. The suprema are real sSups of images; for a nonempty set of probability vectors and 0<β<10<\beta<10<β<1 both images are nonempty and bounded above, so they are true suprema. Compactness of Pπ\mathcal P_\piPπ​ is not needed for this inequality and is not assumed.

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

/-- The min-max inequality used in the proof of Theorem 2, Zhu & Fukushima (2009), p. 1167 (stated
there for Theorem 1's `H_β`): `inf_{α ∈ ℝ} max_{π ∈ 𝒫_π} G_β(x, α, π) ≥ sup_{π ∈ 𝒫_π} min_{α ∈ ℝ}
G_β(x, α, π) = WCVaR_β(x)`, in the equivalent form: for every `α`,
`WCVaR_β(x) ≤ max_{π ∈ 𝒫_π} G_β(x, α, π)`. -/
theorem minmax_inequality {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) :
    ∀ α : ℝ, wcvar f ys β x P ≤ sSup ((fun π => G f ys β x α π) '' P) := 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 1 (min-max inequality), as used in the proof of Theorem 2
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