Prove2Me
Navigate
MissionsFormalpediaUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Geometric decay of the autocovariance, with an L2L^2L2 constant

Proved
MarkovChainCLT.abs_integral_mul_iterKernel_le

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

covariancegeometric-decaymarkov-chainprobabilityuniform-ergodicity

The autocovariance of a uniformly ergodic chain decays geometrically. For a bounded measurable rrr with Eπr=0\mathbb E_\pi r = 0Eπ​r=0,

∣∫r (Pdr) dπ∣  ≤  2−⌊d/N⌋ ∥r∥L2(π)2,\Bigl|\int r\,(P^dr)\,d\pi\Bigr| \;\le\; 2^{-\lfloor d/N\rfloor}\,\|r\|_{L^2(\pi)}^2 ,​∫r(Pdr)dπ​≤2−⌊d/N⌋∥r∥L2(π)2​,

whenever the NNN-step kernel satisfies sup⁡x∥PN(x,⋅)−π∥≤ρ\sup_x\|P^N(x,\cdot)-\pi\|\le\rhosupx​∥PN(x,⋅)−π∥≤ρ with 4ρ≤1/44\rho\le1/44ρ≤1/4. Since ∫r (Pdr) dπ=E[r(X0)r(Xd)]\int r\,(P^dr)\,d\pi = \mathbb E[r(X_0)r(X_d)]∫r(Pdr)dπ=E[r(X0​)r(Xd​)] for the stationary chain, this is exactly the statement that the autocovariance function decays geometrically in the lag, with a constant proportional to ∥r∥L2(π)2\|r\|_{L^2(\pi)}^2∥r∥L2(π)2​ rather than to ∥r∥∞2\|r\|_\infty^2∥r∥∞2​.

Why the L2L^2L2 constant matters. The martingale approximation behind the Markov chain central limit theorem is available only for bounded observables. To reach a square-integrable fff one truncates, f=fK+rKf = f_K + r_Kf=fK​+rK​, and must show the discarded part contributes negligibly to the normalized variance. That requires a bound on Var⁡(∑k<nrK(Xk))\operatorname{Var}\bigl(\sum_{k<n}r_K(X_k)\bigr)Var(∑k<n​rK​(Xk​)) in terms of ∥rK∥L2(π)\|r_K\|_{L^2(\pi)}∥rK​∥L2(π)​ — a sup-norm bound is useless, since ∥rK∥∞\|r_K\|_\infty∥rK​∥∞​ does not go to zero. Summing the estimate above over lags gives

∑d≥0∣∫r (Pdr) dπ∣  ≤  2N ∥r∥L2(π)2,\sum_{d\ge0}\Bigl|\int r\,(P^dr)\,d\pi\Bigr| \;\le\; 2N\,\|r\|_{L^2(\pi)}^2 ,d≥0∑​​∫r(Pdr)dπ​≤2N∥r∥L2(π)2​,

because each block of NNN consecutive lags contributes at most N2−q∥r∥22N2^{-q}\|r\|_2^2N2−q∥r∥22​; expanding the square of a partial sum then yields Var⁡(∑k<nr(Xk))=O(n∥r∥L2(π)2)\operatorname{Var}(\sum_{k<n}r(X_k)) = O(n\|r\|_{L^2(\pi)}^2)Var(∑k<n​r(Xk​))=O(n∥r∥L2(π)2​).

Proof. Cauchy–Schwarz would give ∥r∥2∥Pdr∥2\|r\|_2\|P^dr\|_2∥r∥2​∥Pdr∥2​, and ∥Pdr∥2≤2−⌊d/N⌋∥r∥2\|P^dr\|_2 \le 2^{-\lfloor d/N\rfloor}\|r\|_2∥Pdr∥2​≤2−⌊d/N⌋∥r∥2​ by the geometric decay of the transition operator. The proof here uses the equivalent weighted arithmetic–geometric mean inequality, which avoids square roots entirely: with α=2−⌊d/N⌋\alpha = 2^{-\lfloor d/N\rfloor}α=2−⌊d/N⌋,

∣r (Pdr)∣  ≤  12(α r2+α−1(Pdr)2)pointwise,|r\,(P^dr)| \;\le\; \tfrac12\bigl(\alpha\,r^2 + \alpha^{-1}(P^dr)^2\bigr) \qquad\text{pointwise},∣r(Pdr)∣≤21​(αr2+α−1(Pdr)2)pointwise,

since (α∣r∣−∣Pdr∣)2≥0(\alpha|r| - |P^dr|)^2 \ge 0(α∣r∣−∣Pdr∣)2≥0. Integrating and inserting ∥Pdr∥22≤α2∥r∥22\|P^dr\|_2^2 \le \alpha^2\|r\|_2^2∥Pdr∥22​≤α2∥r∥22​ makes the two terms equal, each 12α∥r∥22\tfrac12\alpha\|r\|_2^221​α∥r∥22​, and the bound closes.

Preamble
import Definitions.Def_MarkovErgodicity
import Definitions.Def_MarkovIterKernel
import Definitions.Def_TotalVariationDist
import Mathlib.Probability.Kernel.Invariance
import Mathlib.MeasureTheory.Integral.Bochner.Set

open Filter Finset Function MeasurableSpace MeasureTheory ProbabilityTheory
open MarkovChainCLT
open scoped ENNReal NNReal Topology
Formal statement
theorem MarkovChainCLT.abs_integral_mul_iterKernel_le {X : Type*} [MeasurableSpace X]
    (P : Kernel X X) [IsMarkovKernel P] (π : Measure X) [IsProbabilityMeasure π]
    (hinv : Kernel.Invariant P π) (N : ℕ) (hN : 1 ≤ N) (ρ : ℝ) (hρ0 : 0 ≤ ρ)
    (hρ : 4 * ρ ≤ 1 / 4) (hrate : ∀ x, tvDist (iterKernel P N x) π ≤ ρ)
    (r : X → ℝ) (hr : Measurable r) (Br : ℝ) (hBr : ∀ x, |r x| ≤ Br)
    (hmean : ∫ x, r x ∂π = 0) (d : ℕ) :
    |∫ x, r x * (∫ y, r y ∂(iterKernel P d x)) ∂π|
      ≤ (1 / 2 : ℝ) ^ (d / N) * ∫ x, (r x) ^ 2 ∂π := by sorry
Source
I. A. Ibragimov and Yu. V. Linnik, Independent and Stationary Sequences of Random Variables, Wolters-Noordhoff 1971; S. P. Meyn and R. L. Tweedie, Markov Chains and Stochastic Stability, 2nd ed., Cambridge 2009, Ch. 16-17; L. Tierney, "Markov Chains for Exploring Posterior Distributions", Annals of Statistics 22 (1994) 1701-1728; G. L. Jones, "On the Markov Chain Central Limit Theorem", Probability Surveys 1 (2004) 299-320.

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