Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(10)–(11), p. 9 — VaR^R_β(Y) ≤ 0 iff P(Y > ε) < β ∀ε > 0, and VaR^L_β(Y) ≤ 0 iff P(Y > 0) ≤ β

Proved
TailRiskSharing.VaRConv.display10_11_var_nonpos

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantilevalue-at-risk

Let P\mathbb PP be a probability measure, YYY a random variable and β∈(0,1)\beta\in(0,1)β∈(0,1). Then

VaRβR(Y)≤0  ⟺  P(Y>ε)<β  for all ε>0,\mathrm{VaR}^R_\beta(Y)\le 0\iff \mathbb P(Y>\varepsilon)<\beta\ \text{ for all }\varepsilon>0,VaRβR​(Y)≤0⟺P(Y>ε)<β  for all ε>0,

and

VaRβL(Y)≤0  ⟺  P(Y>0)≤β.\mathrm{VaR}^L_\beta(Y)\le 0\iff \mathbb P(Y>0)\le\beta.VaRβL​(Y)≤0⟺P(Y>0)≤β.

These two characterizations of a non-positive quantile are the basic tool of the proof of Theorem 1: they turn bounds on VaRs of shares of a risk into bounds on tail probabilities.

Formalization Note YYY is measurable (Y∈L0Y\in L^0Y∈L0). Atomlessness is not assumed: the equivalences hold under any probability measure.

Preamble
import Mathlib
import Definitions.Def_TailRiskSharing_VaRConv_Setting

open MeasureTheory ProbabilityTheory
Formal statement
namespace TailRiskSharing.VaRConv

theorem display10_11_var_nonpos {Ω : Type*} [MeasurableSpace Ω]
    (P : Measure Ω) [IsProbabilityMeasure P]
    (Y : Ω → ℝ) (hY : Y ∈ (L0 : Set (Ω → ℝ))) (β : ℝ) (hβ0 : 0 < β) (hβ1 : β < 1) :
    (VaRR P β Y ≤ 0 ↔ ∀ ε : ℝ, 0 < ε → P.real {ω | ε < Y ω} < β) ∧
    (VaRL P β Y ≤ 0 ↔ P.real {ω | 0 < Y ω} ≤ β) := 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, displays (10) and (11)
Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

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