Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(57) — WCVaRβ(x)=min⁡αmax⁡λ∈Λ∑iλiFβi(x,α)\mathrm{WCVaR}_\beta(x)=\min_{\alpha}\max_{\lambda\in\Lambda}\sum_i\lambda_iF^i_\beta(x,\alpha)WCVaRβ​(x)=minα​maxλ∈Λ​∑i​λi​Fβi​(x,α)

Proved
WorstCaseCVaR.Mixture.eq_57

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

cvarminimaxmixture-distributionp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Under the standing assumptions (l≥1l\ge1l≥1 probability distributions PiP^iPi, f(x,⋅)f(x,\cdot)f(x,⋅) integrable under each, 0<β<10<\beta<10<β<1), the function α↦max⁡λ∈ΛHβ(x,α,λ)\alpha\mapsto\max_{\lambda\in\Lambda}H_\beta(x,\alpha,\lambda)α↦maxλ∈Λ​Hβ​(x,α,λ) attains its minimum over R\mathbb RR at some α0\alpha_0α0​, and

WCVaRβ(x)=min⁡α∈Rmax⁡λ∈ΛHβ(x,α,λ)=min⁡α∈Rmax⁡λ∈Λ∑i=1lλiFβi(x,α);\mathrm{WCVaR}_\beta(x)=\min_{\alpha\in\mathbb R}\max_{\lambda\in\Lambda}H_\beta(x,\alpha,\lambda)=\min_{\alpha\in\mathbb R}\max_{\lambda\in\Lambda}\sum_{i=1}^l\lambda_iF^i_\beta(x,\alpha);WCVaRβ​(x)=α∈Rmin​λ∈Λmax​Hβ​(x,α,λ)=α∈Rmin​λ∈Λmax​i=1∑l​λi​Fβi​(x,α);

moreover max⁡λ∈ΛHβ(x,α,λ)=max⁡λ∈Λ∑iλiFβi(x,α)\max_{\lambda\in\Lambda}H_\beta(x,\alpha,\lambda)=\max_{\lambda\in\Lambda}\sum_i\lambda_iF^i_\beta(x,\alpha)maxλ∈Λ​Hβ​(x,α,λ)=maxλ∈Λ​∑i​λi​Fβi​(x,α) for every α\alphaα.

This is the min–max form of the worst-case CVaR; the paper obtains it from (55), the inequality (56) and the elementary min–max inequality.

Preamble
import Mathlib
import Definitions.Def_WorstCaseCVaR_Mixture_Setting

open MeasureTheory
Formal statement
namespace WorstCaseCVaR.Mixture

theorem eq_57 {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 (fun α => sSup ((fun lam => Hfun P f β x α lam) '' stdSimplex ℝ (Fin l)))
          Set.univ α₀ ∧
        wcvar P f β x = sSup ((fun lam => Hfun P f β x α₀ lam) '' stdSimplex ℝ (Fin l)) ∧
        ∀ α : ℝ, sSup ((fun lam => Hfun P f β x α lam) '' stdSimplex ℝ (Fin l)) =
          sSup ((fun lam => ∑ i, lam i * Fi P f β x i α) '' stdSimplex ℝ (Fin l)) := 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. 1167, proof of Theorem 1, Eq. (56)–(57)
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