Documentation

Atlas.TheoryOfProbability.code.ConvexSubmartingale

theorem convex_comp_martingale_is_submartingale {Ω : Type u_1} {m0 : MeasurableSpace Ω} {μ : MeasureTheory.Measure Ω} [MeasureTheory.IsProbabilityMeasure μ] { : MeasureTheory.Filtration m0} {X : Ω} (hmart : MeasureTheory.Martingale X μ) {φ : } (hφ_convex : ConvexOn Set.univ φ) (hφ_int : ∀ (n : ), MeasureTheory.Integrable (fun (ω : Ω) => φ (X n ω)) μ) :
MeasureTheory.Submartingale (fun (n : ) (ω : Ω) => φ (X n ω)) μ

Convex function of a martingale is a submartingale (Lecture 26/27 claim).

If Xₙ is a martingale w.r.t. the filtration , and φ : ℝ → ℝ is convex with E|φ(Xₙ)| < ∞ for all n, then φ ∘ Xₙ is a submartingale. The proof uses conditional Jensen's inequality together with the martingale property E[Xⱼ | ℱᵢ] = Xᵢ.