Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 5.1, p. 446 — F_X⁻¹(U) has the law of X, and F_{X₂} ≤ F_{X₁} gives F_{X₁}⁻¹(U) ≤ F_{X₂}⁻¹(U)

Proved
ConvexRiskFn.Order.quantile_coupling

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

couplingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantilestochastic-order

Let (Ω,F,P)(\Omega,\mathcal F,P)(Ω,F,P) be a probability space carrying a uniform random variable UUU (measurable, P(U≤t)=tP(U\le t)=tP(U≤t)=t for t∈[0,1]t\in[0,1]t∈[0,1]). For a random variable XXX with cdf FXF_XFX​, write FX−1(t)=inf⁡{s:FX(s)≥t}F_X^{-1}(t)=\inf\{s:F_X(s)\ge t\}FX−1​(t)=inf{s:FX​(s)≥t} and X^:=FX−1(U)\widehat X:=F_X^{-1}(U)X:=FX−1​(U).

  1. For every measurable XXX, X^\widehat XX is a random variable with the same distribution as XXX:
P(FX−1(U)≤t)=P(X≤t)for all t∈R.P\big(F_X^{-1}(U)\le t\big)=P(X\le t)\qquad\text{for all } t\in\mathbb R.P(FX−1​(U)≤t)=P(X≤t)for all t∈R.
  1. For measurable X1,X2X_1,X_2X1​,X2​ with FX2(t)≤FX1(t)F_{X_2}(t)\le F_{X_1}(t)FX2​​(t)≤FX1​​(t) for all ttt,
FX1−1(U) ≤ FX2−1(U)almost surely.F_{X_1}^{-1}(U)\ \le\ F_{X_2}^{-1}(U)\qquad\text{almost surely.}FX1​−1​(U) ≤ FX2​−1​(U)almost surely.

This is the quantile construction of the proof of Lemma 5.1: it realizes two random variables ordered by ⪰st\succeq_{\mathrm{st}}⪰st​ as pointwise ordered random variables with the same laws on the same space.

Formalization Note The paper says "for all ω∈Ω\omega\in\Omegaω∈Ω". The Lean states the order almost surely: U∈(0,1)U\in(0,1)U∈(0,1) only almost surely, and outside (0,1)(0,1)(0,1) the paper's F−1F^{-1}F−1 is ±∞\pm\infty±∞ while the Lean real infimum returns 000.

Preamble
import Mathlib
import Definitions.Def_StochasticOrders_MonotoneConvex_IcxOrder
import Definitions.Def_ConvexRiskFn_Order_Setting
open MeasureTheory
Formal statement
namespace ConvexRiskFn.Order

/-- Proof of Lemma 5.1, p. 446: for a uniform random variable `U`, `X̂ := F_X⁻¹(U)` is a random
variable with the distribution of `X`, and `F_{X₂} ≤ F_{X₁}` gives `F_{X₁}⁻¹(U) ≤ F_{X₂}⁻¹(U)`
(almost surely: `U ∈ (0, 1)` only almost surely). -/
theorem quantile_coupling {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (U : Ω → ℝ) (hU : IsUniformRV P U) :
    (∀ X : Ω → ℝ, Measurable X →
        Measurable (fun ω => cdfInv (cdfOf P X) (U ω)) ∧
        ∀ t : ℝ, P {ω | cdfInv (cdfOf P X) (U ω) ≤ t} = P {ω | X ω ≤ t}) ∧
    (∀ X₁ X₂ : Ω → ℝ, Measurable X₁ → Measurable X₂ →
        (∀ t : ℝ, cdfOf P X₂ t ≤ cdfOf P X₁ t) →
        ∀ᵐ ω ∂P, cdfInv (cdfOf P X₁) (U ω) ≤ cdfInv (cdfOf P X₂) (U ω)) := by sorry

end ConvexRiskFn.Order
Source
Ruszczyński, Shapiro, Optimization of convex risk functions, Math. Oper. Res. 31 (2006), p. 446, proof of Lemma 5.1, second paragraph
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).

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