Uniform ergodicity solves the Poisson equation -a.e. in
ProvedMarkovChainCLT.poissonEquation_ae_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 , the equation holding for -almost every .
The solution is the geometric series with . Uniform ergodicity is exactly what makes it converge: the Dobrushin contraction coefficient of is bounded by , and the Dobrushin coefficient dominates the operator norm of on for every by interpolation between and . So decays geometrically, the series converges in , and telescoping it gives the equation. That is then automatic, a Markov kernel being an -contraction by Jensen and invariance.
Why the conclusion is almost-everywhere and not pointwise. An limit is only determined up to a -null set, so no pointwise representative is canonical. More seriously, the left-hand side need not be meaningful at every point: does not give for every , because need not be absolutely continuous with respect to ; at such an the integral is not defined (and is by the usual Bochner convention), so a pointwise equation would force there for no reason. Repairing on the exceptional set does not help, since it breaks the equation at every whose charges that set.
The weakening costs nothing downstream. In the martingale-approximation proof of the central limit theorem the equation is only ever evaluated along the trajectory, and every coordinate of the stationary chain has law , so a -a.e. identity holds almost surely at every coordinate simultaneously (a countable intersection of full-measure events).
This supersedes an earlier version of this statement that quantified over every ; that form is believed unprovable for the reason above.
import Definitions.Def_MarkovErgodicity import Definitions.Def_MarkovChainPathMeasure open MeasureTheory ProbabilityTheory Filter open scoped ENNReal NNReal Topology ProbabilityTheory
theorem MarkovChainCLT.poissonEquation_ae_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