Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1 — under mixture uncertainty, WCVaRβ(x)=min⁡αmax⁡iFβi(x,α)\mathrm{WCVaR}_\beta(x)=\min_{\alpha}\max_{i}F^i_\beta(x,\alpha)WCVaRβ​(x)=minα​maxi​Fβi​(x,α)

Proved
WorstCaseCVaR.Mixture.theorem_1

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

cvarmixture-distributionp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization

Let P1,…,PlP^1,\dots,P^lP1,…,Pl (l≥1l\ge1l≥1) be probability distributions on Rm\mathbb R^mRm (the likelihood distributions), let 0<β<10<\beta<10<β<1, and let x∈Rnx\in\mathbb R^nx∈Rn be a decision for which the loss f(x,⋅)f(x,\cdot)f(x,⋅) is integrable under every PiP^iPi. Then the worst-case CVaR of xxx over the set PM\mathcal P_MPM​ of all mixtures ∑iλiPi\sum_i\lambda_iP^i∑i​λi​Pi, λ∈Λ\lambda\in\Lambdaλ∈Λ, is

WCVaRβ(x)=min⁡α∈Rmax⁡i∈LFβi(x,α),L={1,…,l},\mathrm{WCVaR}_\beta(x)=\min_{\alpha\in\mathbb R}\max_{i\in\mathcal L}F^i_\beta(x,\alpha),\qquad \mathcal L=\{1,\dots,l\},WCVaRβ​(x)=α∈Rmin​i∈Lmax​Fβi​(x,α),L={1,…,l},

where Fβi(x,α)=α+11−β∫[f(x,y)−α]+ dPi(y)F^i_\beta(x,\alpha)=\alpha+\frac1{1-\beta}\int[f(x,y)-\alpha]^+\,dP^i(y)Fβi​(x,α)=α+1−β1​∫[f(x,y)−α]+dPi(y), and the minimum over α\alphaα is attained.

The theorem replaces a supremum over infinitely many distributions by a pointwise maximum of lll convex functions, so worst-case CVaR minimization over mixtures is a single convex program in (x,α)(x,\alpha)(x,α).

Formalization Note The minimum is stated with an explicit minimizer α0\alpha_0α0​ of FβL(x,⋅)F^{\mathcal L}_\beta(x,\cdot)FβL​(x,⋅). Distributions are probability measures (Remark 1 of the paper); indices are zero-based (Fin l); 0<β<10<\beta<10<β<1 is the standing reading of "confidence level".

Preamble
import Mathlib
import Definitions.Def_WorstCaseCVaR_Mixture_Setting

open MeasureTheory
Formal statement
namespace WorstCaseCVaR.Mixture

theorem theorem_1 {l m n : ℕ} [NeZero l] (P : Fin l → Measure (Fin m → ℝ))
    [∀ i, IsProbabilityMeasure (P i)] (f : (Fin n → ℝ) → (Fin m → ℝ) → ℝ)
    (β : ℝ) (hβ0 : 0 < β) (hβ1 : β < 1) (x : Fin n → ℝ)
    (hf : ∀ i, Integrable (f x) (P i)) :
    ∃ α₀ : ℝ, IsMinOn (FL P f β x) Set.univ α₀ ∧ wcvar P f β x = FL P f β x α₀ := by sorry

end WorstCaseCVaR.Mixture
Source
Zhu & Fukushima, Worst-Case Conditional Value-at-Risk with Application to Robust Portfolio Management, Oper. Res. 57(5), 2009, p. 1157, Theorem 1, Eq. (6)
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