Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 10, p. 14 — φ_β(x) = min_α F_β(x, α), argmin = [α_β(x), α⁺_β(x)], F_β(x, ·) finite convex

Proved
RUCVaR.MinFormula.theorem_10

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

convexitycvarminimization-formulap2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1value-at-risk

Theorem 10 (fundamental minimization formula). Let PPP be a Borel probability measure on Rm\mathbb R^mRm, the law of the random vector yyy, and let f(x,y)f(x,y)f(x,y) be the loss of a decision x∈X⊆Rnx\in X\subseteq\mathbb R^nx∈X⊆Rn, continuous in xxx on XXX, measurable in yyy, with E{∣f(x,y)∣}<∞E\{|f(x,y)|\}<\inftyE{∣f(x,y)∣}<∞ for each x∈Xx\in Xx∈X. Let 0<β<10<\beta<10<β<1 and x∈Xx\in Xx∈X. Write

Fβ(x,α)=α+11−βE{[f(x,y)−α]+},F_\beta(x,\alpha)=\alpha+\frac{1}{1-\beta}E\big\{[f(x,y)-\alpha]^+\big\},Fβ​(x,α)=α+1−β1​E{[f(x,y)−α]+},

αβ(x)\alpha_\beta(x)αβ​(x) for the β-VaR, αβ+(x)\alpha_\beta^+(x)αβ+​(x) for the upper β-VaR, and ϕβ(x)\phi_\beta(x)ϕβ​(x) for the β-CVaR, the mean of the β-tail distribution. Then:

  1. Fβ(x,α)F_\beta(x,\alpha)Fβ​(x,α) is finite for every α\alphaα, and Fβ(x,⋅)F_\beta(x,\cdot)Fβ​(x,⋅) is convex, hence continuous;
  2. the minimum of Fβ(x,⋅)F_\beta(x,\cdot)Fβ​(x,⋅) is attained and equals the β-CVaR:
ϕβ(x)=min⁡αFβ(x,α);(28)\phi_\beta(x)=\min_\alpha F_\beta(x,\alpha); \tag{28}ϕβ​(x)=αmin​Fβ​(x,α);(28)
  1. αβ(x)≤αβ+(x)\alpha_\beta(x)\le\alpha^+_\beta(x)αβ​(x)≤αβ+​(x), and the argmin is the nonempty closed bounded interval
argmin⁡αFβ(x,α)=[αβ(x),αβ+(x)];(29)\operatorname{argmin}_\alpha F_\beta(x,\alpha)=[\alpha_\beta(x),\alpha^+_\beta(x)]; \tag{29}argminα​Fβ​(x,α)=[αβ​(x),αβ+​(x)];(29)
  1. in particular αβ(x)∈argmin⁡αFβ(x,α)\alpha_\beta(x)\in\operatorname{argmin}_\alpha F_\beta(x,\alpha)αβ​(x)∈argminα​Fβ​(x,α) and ϕβ(x)=Fβ(x,αβ(x))\phi_\beta(x)=F_\beta(x,\alpha_\beta(x))ϕβ​(x)=Fβ​(x,αβ​(x)). (30)

VaR and CVaR of the loss are thus computed together by minimizing a convex function of one real variable, for any loss distribution, discrete or continuous.

Formalization Note "Finite" is integrability of [f(x,⋅)−α]+[f(x,\cdot)-\alpha]^+[f(x,⋅)−α]+ for every α\alphaα. "min with attainment" is stated as: ϕβ(x)\phi_\beta(x)ϕβ​(x) is the least element of the range of Fβ(x,⋅)F_\beta(x,\cdot)Fβ​(x,⋅). The argmin is the set of global minimizers. ϕβ(x)\phi_\beta(x)ϕβ​(x) is defined as the mean of the β-tail distribution of Definition 3, not through FβF_\betaFβ​, so (28) is not true by definition. All standing assumptions of §2 are carried even though only integrability of the loss at the given xxx is used.

Preamble
import Mathlib
import Definitions.Def_MultistageStochastic_RiskFunctional
import Definitions.Def_RUCVaR_MinFormula_Setting
open MeasureTheory Filter Topology
Formal statement
namespace RUCVaR.MinFormula

/-- Theorem 10 (fundamental minimization formula), p. 14, (28)–(30). -/
theorem theorem_10 {m n : ℕ} (P : Measure (Fin m → ℝ)) [IsProbabilityMeasure P]
    (X : Set (Fin n → ℝ)) (f : (Fin n → ℝ) → (Fin m → ℝ) → ℝ)
    (hf_cont : ∀ y, ContinuousOn (fun x => f x y) X) (hf_meas : ∀ x, Measurable (f x))
    (hf_int : ∀ x ∈ X, Integrable (f x) P) (β : ℝ) (hβ0 : 0 < β) (hβ1 : β < 1)
    (x : Fin n → ℝ) (hx : x ∈ X) :
    (∀ α : ℝ, Integrable (fun y => max (f x y - α) 0) P) ∧
    ConvexOn ℝ Set.univ (Fbeta P f β x) ∧ Continuous (Fbeta P f β x) ∧
    IsLeast (Set.range (Fbeta P f β x)) (CVaR P f β x) ∧
    (VaR P f β x ≤ VaRPlus P f β x ∧
      {α : ℝ | IsMinOn (Fbeta P f β x) Set.univ α} = Set.Icc (VaR P f β x) (VaRPlus P f β x)) ∧
    (IsMinOn (Fbeta P f β x) Set.univ (VaR P f β x) ∧
      CVaR P f β x = Fbeta P f β x (VaR P f β x)) := by sorry

end RUCVaR.MinFormula
Source
Rockafellar & Uryasev, Conditional value-at-risk for general loss distributions, Research Report #2001-5, Univ. of Florida, April 4, 2001, p. 14, Theorem 10, (27)–(30)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 2026

    Confirmed by the mission captain (proposal self-audit).

  • Endorsed by iris · Oct 31, 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