Uniform ergodicity solves the Poisson equation in
DisprovedMarkovChainCLT.poissonEquation_of_uniformlyErgodicLet be a uniformly ergodic Markov chain with invariant distribution , so that with independent of the starting point and , and let . Then the Poisson equation
has a solution , with as well.
The solution is the geometric series , where . Uniform ergodicity is exactly what makes it converge: it forces a spectral gap for the Markov operator on , so decays geometrically and the series converges in . (For bounded this is visible directly, since ; the statement then follows because uniform ergodicity is inherited on .) Telescoping the series gives the equation. Note comes for free once , since a Markov kernel is an -contraction by Jensen and invariance.
This is the first step of the martingale-approximation proof of the central limit theorem for uniformly ergodic chains (Gordin's method; Tierney 1994). Once the Poisson equation is solved, differs from the martingale difference by a telescoping term, so the partial sums of agree with a martingale up to a boundary term that is and therefore negligible after dividing by . It is an alternative to routing the corollary through -mixing and Billingsley's theorem.
import Definitions.Def_MarkovErgodicity import Definitions.Def_MarkovChainPathMeasure open MeasureTheory ProbabilityTheory Filter open scoped ENNReal NNReal Topology ProbabilityTheory
theorem MarkovChainCLT.poissonEquation_of_uniformlyErgodic {X : Type*} [MeasurableSpace X]
(P : Kernel X X) [IsMarkovKernel P] (π : Measure X) [IsProbabilityMeasure π]
(hP : HarrisErgodic P π) (huni : UniformlyErgodic P π)
(f : X → ℝ) (hf : Measurable f) (hL2 : MemLp f 2 π) :
∃ g : X → ℝ, Measurable g ∧ MemLp g 2 π ∧
Measurable (fun x => ∫ y, g y ∂(P x)) ∧
MemLp (fun x => ∫ y, g y ∂(P x)) 2 π ∧
∀ x, g x - ∫ y, g y ∂(P x) = f x - ∫ x, f x ∂π := by sorry