Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Uniform ergodicity solves the Poisson equation π\piπ-a.e. in L2L^2L2

Proved
MarkovChainCLT.poissonEquation_ae_of_uniformlyErgodic

by LukeBernese · Aug 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

markov-chainspoisson-equationprobability

Let XXX be a uniformly ergodic Markov chain with invariant distribution π\piπ, so that ∥Pn(x,⋅)−π∥≤R tn\|P^n(x,\cdot) - \pi\| \le R\,t^n∥Pn(x,⋅)−π∥≤Rtn with RRR independent of the starting point and t<1t < 1t<1, and let f∈L2(π)f \in L^2(\pi)f∈L2(π). Then the Poisson equation

g^−Pg^  =  f−Eπf\hat g - P\hat g \;=\; f - E_\pi fg^​−Pg^​=f−Eπ​f

has a solution g^∈L2(π)\hat g \in L^2(\pi)g^​∈L2(π), with Pg^∈L2(π)P\hat g \in L^2(\pi)Pg^​∈L2(π), the equation holding for π\piπ-almost every xxx.

The solution is the geometric series g^=∑n≥0Pnfˉ\hat g = \sum_{n \ge 0} P^n \bar fg^​=∑n≥0​Pnfˉ​ with fˉ=f−Eπf\bar f = f - E_\pi ffˉ​=f−Eπ​f. Uniform ergodicity is exactly what makes it converge: the Dobrushin contraction coefficient of PnP^nPn is bounded by sup⁡x∥Pn(x,⋅)−π∥≤Rtn\sup_x \|P^n(x,\cdot) - \pi\| \le R t^nsupx​∥Pn(x,⋅)−π∥≤Rtn, and the Dobrushin coefficient dominates the operator norm of PnP^nPn on L0p(π)L^p_0(\pi)L0p​(π) for every ppp by interpolation between L1L^1L1 and L∞L^\inftyL∞. So ∥Pnfˉ∥2\|P^n\bar f\|_2∥Pnfˉ​∥2​ decays geometrically, the series converges in L2L^2L2, and telescoping it gives the equation. That Pg^∈L2P\hat g \in L^2Pg^​∈L2 is then automatic, a Markov kernel being an L2(π)L^2(\pi)L2(π)-contraction by Jensen and invariance.

Why the conclusion is almost-everywhere and not pointwise. An L2L^2L2 limit is only determined up to a π\piπ-null set, so no pointwise representative is canonical. More seriously, the left-hand side need not be meaningful at every point: f∈L2(π)f \in L^2(\pi)f∈L2(π) does not give f∈L1(P(x,⋅))f \in L^1(P(x,\cdot))f∈L1(P(x,⋅)) for every xxx, because P(x,⋅)P(x,\cdot)P(x,⋅) need not be absolutely continuous with respect to π\piπ; at such an xxx the integral ∫g^ dP(x,⋅)\int \hat g \,\mathrm{d}P(x,\cdot)∫g^​dP(x,⋅) is not defined (and is 000 by the usual Bochner convention), so a pointwise equation would force g^(x)=f(x)−Eπf\hat g(x) = f(x) - E_\pi fg^​(x)=f(x)−Eπ​f there for no reason. Repairing g^\hat gg^​ on the exceptional set does not help, since it breaks the equation at every xxx whose P(x,⋅)P(x,\cdot)P(x,⋅) 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 π\piπ, so a π\piπ-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 xxx; that form is believed unprovable for the reason above.

Preamble
import Definitions.Def_MarkovErgodicity
import Definitions.Def_MarkovChainPathMeasure

open MeasureTheory ProbabilityTheory Filter
open scoped ENNReal NNReal Topology ProbabilityTheory
Formal statement
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
Source
L. Tierney, "Markov Chains for Exploring Posterior Distributions", Annals of Statistics 22 (1994) 1701-1728, Theorem 5; the martingale-approximation proof is M. I. Gordin (1969) and C. Kipnis, S. R. S. Varadhan, Comm. Math. Phys. 104 (1986) 1-19, Corollary 1.5. Cited as the route to Corollary 5 in G. L. Jones, "On the Markov Chain Central Limit Theorem", Probability Surveys 1 (2004) 299-320, arXiv math/0409112v2, Remark 8.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

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, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me