Theorem 4.1 — Gundy's decomposition f = X + Y + Z of an L¹-bounded martingale, with one stopping time
ProvedBurkholderDFI.Gundy.theorem_4_1Let be a probability space, a filtration, and an -bounded martingale relative to , i.e. . Let be a positive real number. Then there are martingales , all relative to the same -fields , with difference sequences (, , and so on), such that
- , that is, for every ;
where ; 3.
where .
The decomposition splits an -bounded martingale at height into an -bounded part, a part of bounded total variation in , and a part that vanishes identically outside an event of probability at most . It is the martingale analogue of the Calderón–Zygmund decomposition and reduces weak-type estimates for martingale operators to estimates.
Formalization Note The three martingales are Mathlib martingales for the same filtration as ; asserting this is no weaker than the paper, since a martingale indexed from extends to one indexed from by , and the decomposition (1) is required only for , the paper's indices (Lean's index is otherwise free). Likewise the hypothesis that is a Mathlib martingale is no restriction. All norms are computed in with the lower Lebesgue integral: is the square of the supremum over of (not the norm of a limit), the left side of (3) is the integral of the series with , and is a quotient in , finite since and .
import Mathlib import Definitions.Def_BurkholderDFI_SquareFnLp_Martingale open MeasureTheory ProbabilityTheory Filter Topology open scoped ENNReal NNReal
namespace BurkholderDFI.Gundy
/-- Theorem 4.1, p. 23 (Gundy's decomposition, with one stopping time): an `L¹`-bounded martingale
`f` and `λ > 0` admit martingales `X, Y, Z` for the same filtration with `f = X + Y + Z`,
`‖X‖₂² ≤ 2λ‖f‖₁`, `‖Σ_{k ≥ 1} |y_k|‖₁ ≤ 4‖f‖₁` and `P(Z^* > 0) ≤ ‖f‖₁/λ`. -/
theorem theorem_4_1 {Ω : Type*} [mΩ : MeasurableSpace Ω] {P : Measure Ω} [IsProbabilityMeasure P]
{ℱ : Filtration ℕ mΩ} {f : ℕ → Ω → ℝ} (hf : Martingale f ℱ P) (hL1 : BurkholderDFI.SquareFnLp.pNorm P 1 f < ⊤)
(l : ℝ) (hl : 0 < l) :
∃ X Y Z : ℕ → Ω → ℝ, Martingale X ℱ P ∧ Martingale Y ℱ P ∧ Martingale Z ℱ P ∧
(∀ n, 1 ≤ n → f n = X n + Y n + Z n) ∧
BurkholderDFI.SquareFnLp.pNorm P 2 X ^ (2 : ℝ) ≤ ENNReal.ofReal (2 * l) * BurkholderDFI.SquareFnLp.pNorm P 1 f ∧
∫⁻ ω, ∑' k : ℕ, ENNReal.ofReal |BurkholderDFI.SquareFnLp.dseq Y (k + 1) ω| ∂P ≤ 4 * BurkholderDFI.SquareFnLp.pNorm P 1 f ∧
P {ω | 0 < BurkholderDFI.SquareFnLp.maxFn Z ω} ≤ BurkholderDFI.SquareFnLp.pNorm P 1 f / ENNReal.ofReal l := by sorry
end BurkholderDFI.Gundy
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.