McLeish's factor is within of the Gaussian factor
ProvedMartingale.norm_exp_sum_div_prod_sub_gaussian_leLet be real-valued functions on a set , let , let , and fix . If for every , then
What this is. It is the deterministic, pathwise core of McLeish's proof of the martingale central limit theorem: the statement that the second factor in the decomposition
is uniformly close to the Gaussian factor , with an explicit cubic error.
No probability enters here at all — there is no measure, no filtration, no martingale hypothesis. That is the point of the decomposition: it cleanly separates the argument into a probabilistic half, where follows from the martingale property alone, and this analytic half, which is a pathwise inequality about complex numbers.
How the two hypotheses of the CLT are consumed. The bound is useful exactly because of the shape of its right-hand side:
Under the two standard hypotheses on a martingale-difference array — negligibility ( in probability) and convergence of the squared variation ( in probability) — the first factor vanishes and the second stays bounded, so the whole error tends to . Simultaneously the Gaussian factor converges to the constant . Thus , and combining with yields , which is the CLT by Lévy continuity.
Proof. Both sides factor over : the quotient because , and the Gaussian because . Each factor of the first product has modulus at most , since ; each factor of the second lies in . The elementary telescoping estimate for families bounded by then reduces the claim to the single-factor cubic bound at , which is where the hypothesis is used.
import Mathlib.Analysis.SpecialFunctions.Complex.Circle import Mathlib.Analysis.SpecialFunctions.Exponential open Finset
theorem Martingale.norm_exp_sum_div_prod_sub_gaussian_le {Ω : Type*} (Z : ℕ → Ω → ℝ) (θ : ℝ)
(n : ℕ) (ω : Ω) (hsmall : ∀ k ∈ Finset.range n, |θ * Z k ω| ≤ 1) :
‖Complex.exp (Complex.I * θ * ((∑ k ∈ Finset.range n, Z k ω : ℝ) : ℂ))
/ ∏ k ∈ Finset.range n, (1 + Complex.I * θ * (Z k ω : ℂ))
- ((Real.exp (-(θ ^ 2 * ∑ k ∈ Finset.range n, Z k ω ^ 2) / 2) : ℝ) : ℂ)‖
≤ ∑ k ∈ Finset.range n, |θ * Z k ω| ^ 3 := by sorry