Martingale central limit theorem (Brown-McLeish, Lindeberg form)
ProvedMartingale.clt_of_mdsThe martingale central limit theorem. Let be a sequence of square-integrable random variables adapted to a filtration and forming a martingale difference sequence, i.e.
with . Suppose the normalised quadratic variation stabilises,
and that the Lindeberg condition holds: for every ,
Then the normalised partial sums are asymptotically Gaussian:
This is the fundamental limit theorem for dependent sequences, generalising the classical Lindeberg CLT (which is the special case of an independent sequence, where the conditioning is trivial and the quadratic-variation condition is the law of large numbers). It is the engine behind essentially every central limit theorem for Markov chains, stochastic approximation, and time series, since Gordin's martingale-approximation method reduces those to this statement.
Proof route (Brown 1971; McLeish 1974; Hall & Heyde 1980, Theorem 3.2). One shows and appeals to Lévy's continuity theorem. Independence is unavailable, so the characteristic function cannot be factored into a product; McLeish's device is to compare with the product , which is telescoping-friendly because each factor has conditional expectation given the past — this is exactly where the martingale difference property enters. The Lindeberg condition makes the individual increments asymptotically negligible so that the logarithm of the product can be expanded to second order, and the quadratic-variation hypothesis identifies the resulting sum with in the limit.
Stated in the Lindeberg form rather than with a conditional-variance hypothesis because the Lindeberg sum is unconditional and therefore easier to verify: for a stationary difference sequence with it reduces by stationarity to , which is dominated convergence, while the quadratic-variation condition follows from the pointwise ergodic theorem.
import Mathlib.Probability.Martingale.Basic import Mathlib.MeasureTheory.Function.ConvergenceInDistribution import Mathlib.MeasureTheory.Function.ConvergenceInMeasure import Mathlib.Probability.Distributions.Gaussian.Real open MeasureTheory ProbabilityTheory Filter open scoped ENNReal NNReal Topology ProbabilityTheory
theorem Martingale.clt_of_mds {Ω : Type*} {m0 : MeasurableSpace Ω}
(P : Measure Ω) [IsProbabilityMeasure P]
(ℱ : Filtration ℕ m0) (D : ℕ → Ω → ℝ)
(hadapt : Adapted ℱ D) (hmeas : ∀ i, Measurable (D i))
(hL2 : ∀ i, MemLp (D i) 2 P)
(hcent : ∫ ω, D 0 ω ∂P = 0)
(hmds : ∀ i, P[D (i + 1) | ℱ i] =ᵐ[P] 0)
(v : ℝ) (hv : 0 ≤ v)
(hqv : TendstoInMeasure P
(fun (n : ℕ) ω => (n : ℝ)⁻¹ * ∑ i ∈ Finset.range n, D i ω ^ 2) atTop (fun _ => v))
(hlind : ∀ ε : ℝ, 0 < ε → Tendsto
(fun n : ℕ => (n : ℝ)⁻¹ * ∑ i ∈ Finset.range n,
∫ ω, Set.indicator {ω' | ε * Real.sqrt n ≤ |D i ω'|} (fun ω' => D i ω' ^ 2) ω ∂P)
atTop (𝓝 0)) :
TendstoInDistribution
(fun (n : ℕ) ω => (Real.sqrt n)⁻¹ * ∑ i ∈ Finset.range n, D i ω)
atTop (id : ℝ → ℝ) (fun _ => P) (gaussianReal 0 v.toNNReal) := by sorry