(57) —
ProvedWorstCaseCVaR.Mixture.eq_57cvarminimaxmixture-distributionp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Under the standing assumptions ( probability distributions , integrable under each, ), the function attains its minimum over at some , and
moreover for every .
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.