Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 18 (Lemma 1 of Liu et al. 2020, as used) — □ρᵢ is monotone if one ρⱼ is monotone

Proved
TailRiskSharing.TailConv.infConv_monotone

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

inf-convolutionmonotonicityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1risk-measure

Let (Ω,F,P)(\Omega,\mathcal F,P)(Ω,F,P) be an atomless probability space, n≥1n\ge1n≥1, and ρ1,…,ρn:L∞→R\rho_1,\dots,\rho_n:L^\infty\to\mathbb Rρ1​,…,ρn​:L∞→R. If one of them, ρj\rho_jρj​, is monotone, then the inf-convolution

□i=1nρi:L∞→[−∞,∞)\mathop{\square}_{i=1}^n\rho_i:L^\infty\to[-\infty,\infty)□i=1n​ρi​:L∞→[−∞,∞)

is monotone: □i=1nρi(X)≤□i=1nρi(Y)\mathop{\square}_{i=1}^n\rho_i(X)\le\mathop{\square}_{i=1}^n\rho_i(Y)□i=1n​ρi​(X)≤□i=1n​ρi​(Y) for all X,Y∈L∞X,Y\in L^\inftyX,Y∈L∞ with X≤YX\le YX≤Y a.s.

The proof of Theorem 3 uses this twice, citing Lemma 1 of Liu, Wang and Wei (2020). No other ρᵢ needs any property.

Preamble
import Mathlib
import Definitions.Def_TailRiskSharing_TailConv_Setting

open MeasureTheory
Formal statement
namespace TailRiskSharing.TailConv

/-- p. 18 (Lemma 1 of Liu et al. (2020), as used): as long as one of `ρ_1, …, ρ_n` is
monotone, `□_{i=1}^n ρ_i` is monotone (on `L^∞`). -/
theorem infConv_monotone {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω)
    [IsProbabilityMeasure P] (hP : TailRiskSharing.VaRConv.IsAtomless P) (n : ℕ) (hn : 1 ≤ n)
    (ρ : Fin n → (Ω → ℝ) → ℝ) (j : Fin n) (hmono : TailRiskSharing.VaRTail.IsMonotone P (Linf P) (ρ j)) :
    TailRiskSharing.VaRTail.IsMonotoneE P (Linf P) (TailRiskSharing.VaRConv.infConv (Linf P) ρ) := 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. 18, proof of Theorem 3 (Lemma 1 of Liu et al. (2020), as used)
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