A uniform L¹ approximation by Gaussian-convergent sequences forces a Gaussian limit
ProvedMarkovChainCLT.tendstoInDistribution_gaussian_of_L1_approxThe truncation closure of a central limit theorem. Let be a sequence of real random variables on a probability space, and suppose it is approximated, uniformly in , by a family of auxiliary sequences indexed by :
Suppose moreover that each auxiliary sequence satisfies a central limit theorem, as , and that the variances converge, . Then .
Discussion. This is the standard "" or approximation lemma that closes a truncation argument. Its content is that convergence in distribution, although not itself an notion, is stable under perturbations that are small uniformly in . The uniformity is essential: without it one would have to diagonalise, choosing , and the conclusion could fail. Note also that the auxiliary variables need not be measurable in any strong sense — the almost-everywhere measurability contained in each hypothesis is enough.
Where this is used. For the central limit theorem for a square-integrable observable of a uniformly ergodic Markov chain, one sets the truncation of at level , and . The bounded-observable theorem provides the CLT for each ; the bound on the variance of partial sums gives , uniformly in , which tends to by dominated convergence; and the Cauchy property of , obtained from the characteristic function, supplies the limiting variance. This lemma then delivers the theorem.
Proof. Weak convergence on is tested by bounded Lipschitz functions. Fix such an , with Lipschitz constant and range of diameter at most ; the latter bounds , so all the integrals below converge. Given , choose so large that both — possible because centred Gaussians depend weakly continuously on the variance — and . For that fixed , the hypothesis gives for all large . Finally, for every , the Lipschitz bound and monotonicity of the integral give . Adding the three estimates completes the proof.
import Mathlib.MeasureTheory.Function.ConvergenceInDistribution import Mathlib.Probability.Distributions.Gaussian.Real import Mathlib.MeasureTheory.Integral.Bochner.Set import Mathlib.MeasureTheory.Measure.Portmanteau open Filter MeasureTheory ProbabilityTheory open scoped ENNReal NNReal Topology
theorem MarkovChainCLT.tendstoInDistribution_gaussian_of_L1_approx {Ω : Type*}
[MeasurableSpace Ω] (μ : Measure Ω) [IsProbabilityMeasure μ]
(Y : ℕ → Ω → ℝ) (W : ℕ → ℕ → Ω → ℝ) (v : ℕ → ℝ≥0) (c : ℝ≥0) (δ : ℕ → ℝ)
(hY : ∀ n, Measurable (Y n))
(hW : ∀ K, TendstoInDistribution (W K) atTop (id : ℝ → ℝ) (fun _ => μ)
(gaussianReal 0 (v K)))
(hint : ∀ K n, Integrable (fun ω => |Y n ω - W K n ω|) μ)
(hδ : ∀ K n, ∫ ω, |Y n ω - W K n ω| ∂μ ≤ δ K)
(hδ0 : Tendsto δ atTop (𝓝 0))
(hv : Tendsto (fun K => (v K : ℝ)) atTop (𝓝 (c : ℝ))) :
TendstoInDistribution Y atTop (id : ℝ → ℝ) (fun _ => μ) (gaussianReal 0 c) := by sorry