Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

CVaR upper-bounds VaR for a finite-support law

Proved
DataDrivenRO.Discrete.var_le_cvar

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

conditional-value-at-riskp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1risk-measuresvalue-at-risk

Let p∈Δnp\in\Delta_np∈Δn​ assign masses to the listed support vectors aj∈Rda_j\in\mathbb R^daj​∈Rd. For every 0<ϵ<10<\epsilon<10<ϵ<1 and direction v∈Rdv\in\mathbb R^dv∈Rd, conditional value at risk at tail level ϵ\epsilonϵ bounds value at risk at the same level:

VaR⁡ϵPp(v)≤CVaR⁡ϵPp(v).\operatorname{VaR}^{P_p}_{\epsilon}(v)\le \operatorname{CVaR}^{P_p}_{\epsilon}(v).VaRϵPp​​(v)≤CVaRϵPp​​(v).

The same conditional-value-at-risk function is convex as a function of the direction vvv. The inequality is used in the first line of the proof of Theorem 4.

Formalization Note PpP_pPp​ is the finitely supported point-mass law. The simplex hypothesis makes it a probability law and prevents the real infima from taking default values.

Preamble
import Mathlib
import Definitions.Def_DataDrivenRO_Discrete_Setting
Formal statement
namespace DataDrivenRO.Discrete

/-- Conditional Value at Risk is an upper bound on Value at Risk for the same finite-support
law and tail level.  Sentence following (11), p. 12. -/
theorem var_le_cvar {d n : ℕ} (a : Fin n → (Fin d → ℝ)) (p : Fin n → ℝ)
    (hp : p ∈ stdSimplex ℝ (Fin n)) (ε : ℝ) (hε0 : 0 < ε) (hε1 : ε < 1)
    (v : Fin d → ℝ) :
    VaR a p ε v ≤ CVaR a p ε v ∧
      ConvexOn ℝ Set.univ (fun w : Fin d → ℝ => CVaR a p ε w) := by sorry

end DataDrivenRO.Discrete
Source
Bertsimas, Gupta & Kallus, Data-Driven Robust Optimization, arXiv:1401.0212v2, sentence following (11), p. 12; proof of Theorem 4, p. ec2
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 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