Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.1, p. 446 — a distribution-invariant ρ is consistent with ⪰icx iff it satisfies (A2) and is risk averse

Proved
ConvexRiskFn.Order.theorem_5_1

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

consistencyincreasing-convex-orderp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1risk-aversionrisk-function

Let (Ω,F,P)(\Omega,\mathcal F,P)(Ω,F,P) be a probability space on which a uniform random variable exists, let p∈[1,∞)p\in[1,\infty)p∈[1,∞) and X=Lp(Ω,F,P)\mathcal X=\mathcal L_p(\Omega,\mathcal F,P)X=Lp​(Ω,F,P). Let ρ:X→R\rho:\mathcal X\to\mathbb Rρ:X→R be distribution invariant: ρ(X1)=ρ(X2)\rho(X_1)=\rho(X_2)ρ(X1​)=ρ(X2​) whenever P(X1≤t)=P(X2≤t)P(X_1\le t)=P(X_2\le t)P(X1​≤t)=P(X2​≤t) for all ttt. Then

ρ is consistent with ⪰icx⟺ρ satisfies (A2) and is risk averse.\rho\ \text{is consistent with}\ \succeq_{\mathrm{icx}}\quad\Longleftrightarrow\quad \rho\ \text{satisfies (A2) and is risk averse.}ρ is consistent with ⪰icx​⟺ρ satisfies (A2) and is risk averse.

Here consistency means: for all X1,X2∈XX_1,X_2\in\mathcal XX1​,X2​∈X, if E[u(X2)]≥E[u(X1)]\mathbb E[u(X_2)]\ge\mathbb E[u(X_1)]E[u(X2​)]≥E[u(X1​)] for every increasing convex uuu for which the expectations exist, then ρ(X2)≥ρ(X1)\rho(X_2)\ge\rho(X_1)ρ(X2​)≥ρ(X1​). (A2) means X≤YX\le YX≤Y a.s. implies ρ(X)≤ρ(Y)\rho(X)\le\rho(Y)ρ(X)≤ρ(Y). Risk aversion means ρ(X)≥ρ(E[X∣G])\rho(X)\ge\rho(\mathbb E[X\mid\mathcal G])ρ(X)≥ρ(E[X∣G]) for every σ\sigmaσ-algebra G⊂F\mathcal G\subset\mathcal FG⊂F, every X∈XX\in\mathcal XX∈X and every version of the conditional expectation.

The theorem characterizes, among law-invariant risk functions, exactly those that respect the increasing convex order, the counterpart of second-order stochastic dominance for costs; mean–risk models such as mean–semideviation and CVaR-based ones are special cases. No convexity of ρ\rhoρ is assumed.

Formalization Note The existence of a uniform random variable and X=Lp\mathcal X=\mathcal L_pX=Lp​, p∈[1,∞)p\in[1,\infty)p∈[1,∞), are the standing assumptions of the rest of §5.2 (p. 445). Elements of X\mathcal XX are functions with MemLp X p P; the order in (A2) is the almost-sure order of Lp\mathcal L_pLp​; the increasing convex order is the published StochasticOrders_MonotoneConvex_IcxOrder.

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

/-- Theorem 5.1, p. 446: under the standing assumptions of §5.2 (`𝒳 = ℒ_p(Ω, ℱ, P)`, `p ∈ [1, ∞)`,
a uniform random variable exists), a distribution-invariant risk function is consistent with the
increasing convex order iff it satisfies (A2) and is risk averse. -/
theorem theorem_5_1 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (p : ENNReal) (hp1 : 1 ≤ p) (hpt : p ≠ ⊤) (hU : ∃ U : Ω → ℝ, IsUniformRV P U)
    (ρ : (Ω → ℝ) → ℝ) (hρ : DistInvariant P p ρ) :
    ConsistentIcx P p ρ ↔ A2 P p ρ ∧ RiskAverse P p ρ := by sorry

end ConvexRiskFn.Order
Source
Ruszczyński, Shapiro, Optimization of convex risk functions, Math. Oper. Res. 31 (2006), p. 446, Theorem 5.1 (with the standing assumptions of §5.2, p. 445, and Definitions 5.1, p. 443, and 5.2, p. 445)
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