Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 5.1, p. 446 — by Jensen's inequality, 𝔼[X | 𝒢] ⪯icx X

Proved
ConvexRiskFn.Order.condExp_icx_le

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

conditional-expectationincreasing-convex-orderjensenp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let (Ω,F,P)(\Omega,\mathcal F,P)(Ω,F,P) be a probability space, p≥1p\ge1p≥1, X∈Lp(Ω,F,P)X\in\mathcal L_p(\Omega,\mathcal F,P)X∈Lp​(Ω,F,P) and G⊂F\mathcal G\subset\mathcal FG⊂F a σ\sigmaσ-algebra. Then E[X∣G]∈Lp(Ω,F,P)\mathbb E[X\mid\mathcal G]\in\mathcal L_p(\Omega,\mathcal F,P)E[X∣G]∈Lp​(Ω,F,P) and

E[X∣G] ⪯icx X,\mathbb E[X\mid\mathcal G]\ \preceq_{\mathrm{icx}}\ X,E[X∣G] ⪯icx​ X,

that is, E[u(E[X∣G])]≤E[u(X)]\mathbb E\big[u(\mathbb E[X\mid\mathcal G])\big]\le\mathbb E[u(X)]E[u(E[X∣G])]≤E[u(X)] for every increasing convex u:R→Ru:\mathbb R\to\mathbb Ru:R→R for which both expectations exist.

This is the step of the proof of Theorem 5.1 showing that consistency with ⪰icx\succeq_{\mathrm{icx}}⪰icx​ forces risk aversion.

Formalization Note The membership E[X∣G]∈X\mathbb E[X\mid\mathcal G]\in\mathcal XE[X∣G]∈X is the standing assumption of §5.1 (p. 443), which holds for Lp\mathcal L_pLp​; it is stated as part of the conclusion. The conditional expectation is Mathlib's P[X|m].

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

/-- Proof of Theorem 5.1, p. 446: by Jensen's inequality `𝔼[X | 𝒢] ⪯_icx X` for every σ-algebra
`𝒢 ⊂ ℱ`; together with the standing assumption of §5.1 (p. 443) that `𝔼[X | 𝒢] ∈ 𝒳`. -/
theorem condExp_icx_le {Ω : Type*} (m : MeasurableSpace Ω) [mΩ : MeasurableSpace Ω]
    (hm : m ≤ mΩ) (P : Measure Ω) [IsProbabilityMeasure P] (p : ENNReal) (hp1 : 1 ≤ p)
    (X : Ω → ℝ) (hX : MemLp X p P) :
    MemLp (P[X|m]) p P ∧ StochasticOrders.MonotoneConvex.IcxOrder P P (P[X|m]) X := by sorry

end ConvexRiskFn.Order
Source
Ruszczyński, Shapiro, Optimization of convex risk functions, Math. Oper. Res. 31 (2006), p. 446, proof of Theorem 5.1, display after "we have by Jensen's inequality that" and the sentence "Consequently, 𝔼[X | 𝒢] ⪯icx X"; p. 443, §5.1 standing assumption 𝔼[X | 𝒢] ∈ 𝒳
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