Proof of Theorem 5.1, p. 446 — by Jensen's inequality, 𝔼[X | 𝒢] ⪯icx X
ProvedConvexRiskFn.Order.condExp_icx_leconditional-expectationincreasing-convex-orderjensenp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a probability space, , and a -algebra. Then and
that is, for every increasing convex for which both expectations exist.
This is the step of the proof of Theorem 5.1 showing that consistency with forces risk aversion.
Formalization Note The membership is the standing assumption of §5.1 (p. 443), which holds for ; 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.