McLeish's master inequality for the characteristic function of a bounded martingale difference sum
ProvedMartingale.norm_charFun_sub_const_leLet be a filtration on a probability space and let be an adapted, integrable, uniformly bounded martingale difference sequence: a.s., , and everywhere. Fix and , and suppose that along every path
- the squared variation is bounded: , and
- the increments are small at scale : for every .
Then for every complex constant , writing ,
What it does. This is the single inequality that carries McLeish's argument from the algebraic decomposition to the central limit theorem. It bounds the distance between the characteristic function of and an arbitrary target constant by two explicitly controllable quantities: a third-moment term and the distance from the random Gaussian factor to .
Everything after this point is limit-taking with no further structure. Choosing :
- the third-moment term is dominated by , which vanishes under the negligibility hypothesis;
- the second term vanishes whenever , by continuity of and bounded convergence.
Hence for every , and Lévy's continuity theorem gives .
Why an arbitrary constant is the right formulation. The martingale property enters only through the exact identity . Because the expectation is exactly , subtracting a constant is the same as subtracting , and the difference factors as
This step fails for a random : one would be left with the extra term , which need not vanish. That is exactly why the random Gaussian factor cannot be used directly as the comparison object and must itself be compared to the constant — the second term on the right-hand side.
The role of . The prefactor is the uniform bound on , coming from . In McLeish's general theorem this pointwise bound is replaced by uniform integrability of ; the pathwise bound assumed here is the form in which the hypothesis is available in the applications (bounded or truncated arrays), and it keeps the estimate completely explicit.
import Mathlib.Probability.Martingale.Basic import Mathlib.MeasureTheory.Function.ConvergenceInDistribution import Mathlib.Probability.Distributions.Gaussian.Real open MeasureTheory ProbabilityTheory Filter open scoped ENNReal NNReal Topology ProbabilityTheory
theorem Martingale.norm_charFun_sub_const_le {Ω : Type*} {m0 : MeasurableSpace Ω}
(P : Measure Ω) [IsProbabilityMeasure P] (ℱ : Filtration ℕ m0)
(Z : ℕ → Ω → ℝ) (hmeas : ∀ k, Measurable (Z k))
(hadapt : ∀ k, Measurable[ℱ k] (Z k))
(hint : ∀ k, Integrable (Z k) P)
(hmds : ∀ k, P[Z (k + 1) | ℱ k] =ᵐ[P] 0)
(hcent : ∫ ω, Z 0 ω ∂P = 0)
(C : ℝ) (hbdd : ∀ k ω, |Z k ω| ≤ C)
(θ M : ℝ) (n : ℕ)
(hvar : ∀ ω, ∑ k ∈ Finset.range n, Z k ω ^ 2 ≤ M)
(hsmall : ∀ k ∈ Finset.range n, ∀ ω, |θ * Z k ω| ≤ 1)
(c : ℂ) :
‖(∫ ω, Complex.exp (Complex.I * θ * ((∑ k ∈ Finset.range n, Z k ω : ℝ) : ℂ)) ∂P) - c‖
≤ Real.exp (θ ^ 2 * M / 2) *
∫ ω, ((∑ k ∈ Finset.range n, |θ * Z k ω| ^ 3)
+ ‖((Real.exp (-(θ ^ 2 * ∑ k ∈ Finset.range n, Z k ω ^ 2) / 2) : ℝ) : ℂ) - c‖) ∂P := by sorry