Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2 — for a compact convex set Pπ\mathcal P_\piPπ​ of discrete distributions, WCVaRβ(x)=min⁡αmax⁡π∈PπGβ(x,α,π)\mathrm{WCVaR}_\beta(x) = \min_{\alpha}\max_{\pi\in\mathcal P_\pi} G_\beta(x,\alpha,\pi)WCVaRβ​(x)=minα​maxπ∈Pπ​​Gβ​(x,α,π)

Proved
WorstCaseCVaR.Discrete.theorem_2

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

cvarminimaxp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization

Let f(x,y)f(x,y)f(x,y) be a loss, let y[1],…,y[S]∈Rmy_{[1]},\dots,y_{[S]} \in \mathbb R^my[1]​,…,y[S]​∈Rm be the scenarios of a discrete random vector, and let 0<β<10<\beta<10<β<1 be a confidence level. For a probability vector π∈RS\pi \in \mathbb R^Sπ∈RS put

Gβ(x,α,π)=α+11−β∑k=1Sπk [f(x,y[k])−α]+,CVaRβ(x,π)=min⁡α∈RGβ(x,α,π),G_\beta(x,\alpha,\pi) = \alpha + \frac{1}{1-\beta}\sum_{k=1}^S \pi_k\,[f(x,y_{[k]})-\alpha]^+,\qquad \mathrm{CVaR}_\beta(x,\pi) = \min_{\alpha\in\mathbb R} G_\beta(x,\alpha,\pi),Gβ​(x,α,π)=α+1−β1​k=1∑S​πk​[f(x,y[k]​)−α]+,CVaRβ​(x,π)=α∈Rmin​Gβ​(x,α,π),

and for a set Pπ\mathcal P_\piPπ​ of probability vectors let WCVaRβ(x)=sup⁡π∈PπCVaRβ(x,π)\mathrm{WCVaR}_\beta(x) = \sup_{\pi\in\mathcal P_\pi}\mathrm{CVaR}_\beta(x,\pi)WCVaRβ​(x)=supπ∈Pπ​​CVaRβ​(x,π).

Theorem. Suppose that Pπ\mathcal P_\piPπ​ is a nonempty compact convex set of probability vectors. Then for each xxx,

WCVaRβ(x)=min⁡α∈Rmax⁡π∈PπGβ(x,α,π).\mathrm{WCVaR}_\beta(x) = \min_{\alpha\in\mathbb R}\max_{\pi\in\mathcal P_\pi} G_\beta(x,\alpha,\pi).WCVaRβ​(x)=α∈Rmin​π∈Pπ​max​Gβ​(x,α,π).

Both extrema on the right-hand side are attained: for every α\alphaα the maximum over Pπ\mathcal P_\piPπ​ exists, and some α0∈R\alpha_0 \in \mathbb Rα0​∈R minimizes α↦max⁡π∈PπGβ(x,α,π)\alpha \mapsto \max_{\pi\in\mathcal P_\pi} G_\beta(x,\alpha,\pi)α↦maxπ∈Pπ​​Gβ​(x,α,π).

The theorem turns the worst-case CVaR — a supremum over distributions of a minimum over thresholds — into a minimum over the threshold of a worst case of a function that is affine in π\piπ. Minimizing WCVaRβ(x)\mathrm{WCVaR}_\beta(x)WCVaRβ​(x) over decisions therefore becomes the single minimization problem (16)–(20) in (x,u,α,θ)(x,u,\alpha,\theta)(x,u,α,θ), which is a linear program under box uncertainty and a second-order cone program under ellipsoidal uncertainty.

Formalization Note The paper's hypothesis "Pπ\mathcal P_\piPπ​ is a compact convex set" is completed by the standing assumptions of §2.2: its elements are probability vectors (πk≥0\pi_k\ge0πk​≥0, ∑kπk=1\sum_k\pi_k=1∑k​πk​=1, i.e. Pπ⊆\mathcal P_\pi \subseteqPπ​⊆ stdSimplex ℝ (Fin S)) and it is nonempty (a supremum over the empty set is meaningless). The confidence level satisfies 0<β<10<\beta<10<β<1. The left-hand side stays a supremum, as printed. The inner maximum is stated as IsMaxOn and its value is used as the real sSup of the image of Pπ\mathcal P_\piPπ​; the outer minimum is an explicit minimizer α₀ with IsMinOn … Set.univ.

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

/-- Theorem 2, Zhu & Fukushima (2009), p. 1159: if `𝒫_π` is a compact convex set (of probability
vectors on the scenarios `y_[1], …, y_[S]`, nonempty), then for each `x`
`WCVaR_β(x) = min_{α ∈ ℝ} max_{π ∈ 𝒫_π} G_β(x, α, π)`.
Both extrema on the right are attained: for every `α` the maximum over `𝒫_π` is attained, and
some `α₀` minimizes `α ↦ max_{π ∈ 𝒫_π} G_β(x, α, π)` over `ℝ`, with value `WCVaR_β(x)`. -/
theorem theorem_2 {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) :
    (∀ α : ℝ, ∃ π₀ ∈ P, IsMaxOn (fun π => G f ys β x α π) P π₀) ∧
    ∃ α₀ : ℝ, IsMinOn (fun α : ℝ => sSup ((fun π => G f ys β x α π) '' P)) Set.univ α₀ ∧
      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. 1159, Theorem 2 (proof p. 1167)
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