Lemma 1 — minimax equality on compact convex sets (with semicontinuity)
ProvedWorstCaseCVaR.Mixture.lemma_1convex-analysisminimaxp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let and be nonempty compact convex sets and let be such that is convex and lower semicontinuous on for every , and is concave and upper semicontinuous on for every . Then there are and with
the outer minimum attained at and the outer maximum at .
This minimax theorem (Fan 1953) is the tool that exchanges the minimization over and the maximization over the weights .
Formalization Note The paper's statement has no continuity hypothesis; without one the minimum and maximum need not exist (on , for and ). The two semicontinuity hypotheses are those of Fan's theorem and are added. The inner and are the real sSup/sInf, attained by semicontinuity on compact sets.
Preamble
import Mathlib import Definitions.Def_WorstCaseCVaR_Mixture_Setting open MeasureTheory
Formal statement
namespace WorstCaseCVaR.Mixture
theorem lemma_1 {m n : ℕ} (X : Set (Fin n → ℝ)) (Y : Set (Fin m → ℝ))
(hXne : X.Nonempty) (hXc : IsCompact X) (hXcv : Convex ℝ X)
(hYne : Y.Nonempty) (hYc : IsCompact Y) (hYcv : Convex ℝ Y)
(φ : (Fin n → ℝ) → (Fin m → ℝ) → ℝ)
(hconv : ∀ y ∈ Y, ConvexOn ℝ X (fun x => φ x y))
(hconc : ∀ x ∈ X, ConcaveOn ℝ Y (fun y => φ x y))
(hlsc : ∀ y ∈ Y, LowerSemicontinuousOn (fun x => φ x y) X)
(husc : ∀ x ∈ X, UpperSemicontinuousOn (fun y => φ x y) Y) :
∃ x₀ ∈ X, ∃ y₀ ∈ Y,
IsLeast ((fun x => sSup ((fun y => φ x y) '' Y)) '' X) (φ x₀ y₀) ∧
IsGreatest ((fun y => sInf ((fun x => φ x y) '' X)) '' Y) (φ x₀ y₀) := 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, Lemma 1 (citing Fan 1953)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.