Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1, p. 17 — X′_ε =d X_ε for X′ = max{X, m}, m ∈ [VaR^L_ε(X), VaR^R_ε(X)]

Proved
TailRiskSharing.TailConv.lemma1_tail_max

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantiletail-risk-measurevalue-at-risk

Let (Ω,F,P)(\Omega,\mathcal F,P)(Ω,F,P) be an atomless probability space, X∈L∞X\in L^\inftyX∈L∞, and ε∈(0,1)\varepsilon\in(0,1)ε∈(0,1). Let mmm be any number with

VaRεL(X)≤m≤VaRεR(X),\mathrm{VaR}^L_\varepsilon(X)\le m\le \mathrm{VaR}^R_\varepsilon(X),VaRεL​(X)≤m≤VaRεR​(X),

and put X′=max⁡{X,m}X'=\max\{X,m\}X′=max{X,m}. Then the tails of X′X'X′ and XXX beyond their (1−ε)(1-\varepsilon)(1−ε)-quantiles have the same law:

Xε′=dXε.X'_\varepsilon\overset{d}{=}X_\varepsilon .Xε′​=dXε​.

Raising XXX to a level inside its (1−ε)(1-\varepsilon)(1−ε)-quantile interval changes only the body of the distribution, so an ε\varepsilonε-tail risk measure cannot tell XXX and X′X'X′ apart. This is the technical lemma behind Theorem 3.

Formalization Note Xε′=dXεX'_\varepsilon\overset{d}{=}X_\varepsilonXε′​=dXε​ is stated through display (6) as (FX′(x)−(1−ε))+=(FX(x)−(1−ε))+(F_{X'}(x)-(1-\varepsilon))^+=(F_X(x)-(1-\varepsilon))^+(FX′​(x)−(1−ε))+=(FX​(x)−(1−ε))+ for all xxx.

Preamble
import Mathlib
import Definitions.Def_TailRiskSharing_TailConv_Setting

open MeasureTheory
Formal statement
namespace TailRiskSharing.TailConv

/-- Lemma 1, p. 17 (proof p. 38): for `X ∈ L^∞`, `ε ∈ (0,1)` and
`m ∈ [VaR^L_ε(X), VaR^R_ε(X)]`, the tails of `X' = max{X, m}` and `X` at level `ε` have the
same law: `X'_ε =d X_ε` (encoded through (6)). -/
theorem lemma1_tail_max {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (hP : TailRiskSharing.VaRConv.IsAtomless P) (ε : ℝ) (hε0 : 0 < ε) (hε1 : ε < 1) (X : Ω → ℝ) (hX : X ∈ Linf P)
    (m : ℝ) (hmL : TailRiskSharing.VaRConv.VaRL P ε X ≤ m) (hmR : m ≤ TailRiskSharing.VaRConv.VaRR P ε X) :
    TailRiskSharing.VaRTail.TailEquiv P ε (fun ω => max (X ω) m) X := by sorry

end TailRiskSharing.TailConv
Source
Liu, Mao, Wang & Wei, Inf-convolution, Optimal Allocations, and Model Uncertainty for Tail Risk Measures, SSRN 3490348 (version of January 16, 2022), p. 17, Lemma 1; proof in Appendix B, p. 38
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