(12), p. 9 — VaR^L_{α₁−δ} ≥ VaR^R_{α₁} ≥ VaR^L_{α₁} for δ ∈ (0, α₁)
ProvedTailRiskSharing.VaRConv.display12_var_sandwichp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantilevalue-at-risk
Let be a probability measure, and . For every random variable ,
The right VaR at level is squeezed between left VaRs; letting is how the proof of Theorem 1 passes from statements about left VaRs to right VaRs.
Formalization Note is measurable. Atomlessness is not assumed.
Preamble
import Mathlib import Definitions.Def_TailRiskSharing_VaRConv_Setting open MeasureTheory ProbabilityTheory
Formal statement
namespace TailRiskSharing.VaRConv
theorem display12_var_sandwich {Ω : Type*} [MeasurableSpace Ω]
(P : Measure Ω) [IsProbabilityMeasure P]
(α₁ : ℝ) (hα0 : 0 < α₁) (hα1 : α₁ < 1) (δ : ℝ) (hδ0 : 0 < δ) (hδ1 : δ < α₁)
(X : Ω → ℝ) (hX : X ∈ (L0 : Set (Ω → ℝ))) :
VaRR P α₁ X ≤ VaRL P (α₁ - δ) X ∧ VaRL P α₁ X ≤ VaRR P α₁ X := by sorry
end TailRiskSharing.VaRConv
Source
Liu, Mao, Wang & Wei, Inf-convolution, Optimal Allocations, and Model Uncertainty for Tail Risk Measures, SSRN 3490348 (version of January 16, 2022), p. 9, proof of Theorem 1, display (12)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.