Geometric decay of the transition operator on mean-zero functions
ProvedMarkovChainCLT.integral_sq_iterKernel_pow_lecontractiongeometric-decaymarkov-chainprobabilityuniform-ergodicity
Geometric decay of the transition operator on mean-zero functions. If the -step kernel is uniformly close to in total variation — precisely, with — then for every square-integrable with and every ,
What this gives. Uniform ergodicity supplies such an (take small), so : the transition operator decays geometrically on the mean-zero subspace of , with a rate depending only on the chain. Two consequences drive the Markov chain central limit theorem for square-integrable observables:
- Summable covariances. Under the stationary chain, , so by Cauchy–Schwarz , and . Hence with a constant depending only on — the estimate that controls the truncation error when passing from bounded to observables.
- The Poisson equation in . The Neumann series converges in and solves .
Proof. Induction on , with the function generalized so that the induction hypothesis can be applied to rather than to . Three ingredients recur:
- Invariance for all powers: , by induction from .
- Jensen: pointwise almost everywhere, from the nonnegativity of . This gives both integrability of and, with invariance, that still has -mean zero — so the hypotheses of the contraction estimate are preserved along the induction.
- Semigroup: , so almost everywhere (Fubini for a composed kernel, applied at those where is integrable — a full-measure set by invariance).
Then , the last step being one application of the contraction estimate.
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 Function MeasurableSpace MeasureTheory ProbabilityTheory open MarkovChainCLT open scoped ENNReal NNReal Topology
Formal statement
theorem MarkovChainCLT.integral_sq_iterKernel_pow_le {X : Type*} [MeasurableSpace X]
(P : Kernel X X) [IsMarkovKernel P] (π : Measure X) [IsProbabilityMeasure π]
(hinv : Kernel.Invariant P π) (N : ℕ) (ρ : ℝ) (hρ0 : 0 ≤ ρ) (hρ : 4 * ρ ≤ 1 / 4)
(hrate : ∀ x, tvDist (iterKernel P N x) π ≤ ρ)
(h : X → ℝ) (hh : Measurable h) (hL2 : Integrable (fun x => (h x) ^ 2) π)
(hmean : ∫ x, h x ∂π = 0) (j : ℕ) :
∫ x, (∫ y, h y ∂(iterKernel P (j * N) x)) ^ 2 ∂π
≤ (1 / 4 : ℝ) ^ j * ∫ x, (h x) ^ 2 ∂π := by sorrySource
S. P. Meyn and R. L. Tweedie, Markov Chains and Stochastic Stability, 2nd ed., Cambridge 2009, Ch. 16; E. Nummelin, General Irreducible Markov Chains and Non-negative Operators, Cambridge 1984, Ch. 6; 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.