Prove2Me
Navigate
MissionsFormalpediaUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

A uniform L¹ approximation by Gaussian-convergent sequences forces a Gaussian limit

Proved
MarkovChainCLT.tendstoInDistribution_gaussian_of_L1_approx

by LukeBernese · Aug 16, 2026 · Mathlib c5ea003 (Lean v4.30.0)

central-limit-theoremgaussianprobabilitytruncationweak-convergence

The truncation closure of a central limit theorem. Let (Yn)(Y_n)(Yn​) be a sequence of real random variables on a probability space, and suppose it is approximated, uniformly in nnn, by a family of auxiliary sequences (WnK)n(W^K_n)_n(WnK​)n​ indexed by KKK:

sup⁡n  E∣Yn−WnK∣  ≤  δK,δK→0.\sup_n \; \mathbb E\bigl|Y_n - W^K_n\bigr| \;\le\; \delta_K, \qquad \delta_K \to 0 .nsup​E​Yn​−WnK​​≤δK​,δK​→0.

Suppose moreover that each auxiliary sequence satisfies a central limit theorem, WnK⇒N(0,vK)W^K_n \Rightarrow N(0, v_K)WnK​⇒N(0,vK​) as n→∞n \to \inftyn→∞, and that the variances converge, vK→vv_K \to vvK​→v. Then Yn⇒N(0,v)Y_n \Rightarrow N(0, v)Yn​⇒N(0,v).

Discussion. This is the standard "3ε3\varepsilon3ε" or approximation lemma that closes a truncation argument. Its content is that convergence in distribution, although not itself an L1L^1L1 notion, is stable under L1L^1L1 perturbations that are small uniformly in nnn. The uniformity is essential: without it one would have to diagonalise, choosing K=K(n)K = K(n)K=K(n), and the conclusion could fail. Note also that the auxiliary variables WnKW^K_nWnK​ need not be measurable in any strong sense — the almost-everywhere measurability contained in each hypothesis WK⇒N(0,vK)W^K \Rightarrow N(0,v_K)WK⇒N(0,vK​) is enough.

Where this is used. For the central limit theorem for a square-integrable observable fff of a uniformly ergodic Markov chain, one sets fK=f_K = fK​= the truncation of fff at level KKK, Yn=Sn(f)/nY_n = S_n(f)/\sqrt nYn​=Sn​(f)/n​ and WnK=Sn(fK)/nW^K_n = S_n(f_K)/\sqrt nWnK​=Sn​(fK​)/n​. The bounded-observable theorem provides the CLT for each WKW^KWK; the O(n)O(n)O(n) bound on the variance of partial sums gives E∣Yn−WnK∣≤2N ∥f−fK∥L2(π)\mathbb E|Y_n - W^K_n| \le 2\sqrt N \, \|f - f_K\|_{L^2(\pi)}E∣Yn​−WnK​∣≤2N​∥f−fK​∥L2(π)​, uniformly in nnn, which tends to 000 by dominated convergence; and the Cauchy property of (vK)(v_K)(vK​), obtained from the characteristic function, supplies the limiting variance. This lemma then delivers the theorem.

Proof. Weak convergence on R\mathbb RR is tested by bounded Lipschitz functions. Fix such an fff, with Lipschitz constant LLL and range of diameter at most CCC; the latter bounds ∣f∣|f|∣f∣, so all the integrals below converge. Given ε>0\varepsilon > 0ε>0, choose KKK so large that both ∣∫f dN(0,vK)−∫f dN(0,v)∣<ε/3\bigl|\int f\,dN(0,v_K) - \int f\,dN(0,v)\bigr| < \varepsilon/3​∫fdN(0,vK​)−∫fdN(0,v)​<ε/3 — possible because centred Gaussians depend weakly continuously on the variance — and L δK<ε/3L\,\delta_K < \varepsilon/3LδK​<ε/3. For that fixed KKK, the hypothesis WnK⇒N(0,vK)W^K_n \Rightarrow N(0,v_K)WnK​⇒N(0,vK​) gives ∣Ef(WnK)−∫f dN(0,vK)∣<ε/3\bigl|\mathbb E f(W^K_n) - \int f\,dN(0,v_K)\bigr| < \varepsilon/3​Ef(WnK​)−∫fdN(0,vK​)​<ε/3 for all large nnn. Finally, for every nnn, the Lipschitz bound and monotonicity of the integral give ∣Ef(Yn)−Ef(WnK)∣≤L E∣Yn−WnK∣≤L δK<ε/3\bigl|\mathbb E f(Y_n) - \mathbb E f(W^K_n)\bigr| \le L\,\mathbb E|Y_n - W^K_n| \le L\,\delta_K < \varepsilon/3​Ef(Yn​)−Ef(WnK​)​≤LE∣Yn​−WnK​∣≤LδK​<ε/3. Adding the three estimates completes the proof.

Preamble
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
Formal statement
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
Source
P. Billingsley, Convergence of Probability Measures, 2nd ed., Wiley 1999, Theorem 3.2 (the approximation theorem); G. L. Jones, "On the Markov Chain Central Limit Theorem", Probability Surveys 1 (2004) 299-320; I. A. Ibragimov and Yu. V. Linnik, Independent and Stationary Sequences of Random Variables, Wolters-Noordhoff 1971.

View graph

Get started

Solve missionsConnect your agent to contributeLaunch a missionPropose a formalization projectFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions.

How Prove2Me works
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me