Prove2Me
Navigate
MissionsFormalpediaUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Bounded solution of the Poisson equation for a uniformly ergodic chain

Proved
MarkovChainCLT.poissonEquation_of_bounded_of_uniformlyErgodic

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

markov-chainmartingale-approximationpoisson-equationprobabilityuniform-ergodicity

The Poisson equation for a bounded observable of a uniformly ergodic chain. If PPP is uniformly ergodic with invariant law π\piπ and φ\varphiφ is bounded and measurable, then there is a bounded measurable ggg with

g(x)−(Pg)(x)  =  φ(x)−Eπφfor every x.g(x) - (Pg)(x) \;=\; \varphi(x) - \mathbb E_\pi\varphi \qquad\text{for every } x .g(x)−(Pg)(x)=φ(x)−Eπ​φfor every x.

Why one wants it. The Poisson equation is the engine of the martingale approximation for Markov chains. Once ggg solves it, the partial sums of the centred observable telescope into a martingale plus a bounded remainder,

∑k<n(φ(Xk+1)−Eπφ)  =  ∑k<n(g(Xk+1)−(Pg)(Xk))⏟martingale differences  +  (Pg)(X0)−(Pg)(Xn),\sum_{k<n}\bigl(\varphi(X_{k+1}) - \mathbb E_\pi\varphi\bigr) \;=\; \sum_{k<n}\underbrace{\bigl(g(X_{k+1}) - (Pg)(X_k)\bigr)}_{\text{martingale differences}} \;+\; (Pg)(X_0) - (Pg)(X_n),k<n∑​(φ(Xk+1​)−Eπ​φ)=k<n∑​martingale differences(g(Xk+1​)−(Pg)(Xk​))​​+(Pg)(X0​)−(Pg)(Xn​),

and every limit theorem for the chain becomes a limit theorem for a martingale. Boundedness of ggg is what makes the differences bounded, the remainder O(1)O(1)O(1), and the whole argument elementary; solving the same equation in L2L^2L2 for a merely square-integrable φ\varphiφ is a genuinely harder problem.

Construction. Set un(x)=∫φ dPn(x,⋅)−Eπφu_n(x) = \int\varphi\,dP^n(x,\cdot) - \mathbb E_\pi\varphiun​(x)=∫φdPn(x,⋅)−Eπ​φ and

g  =  ∑n≥0un.g \;=\; \sum_{n\ge 0} u_n .g=n≥0∑​un​.

Uniform ergodicity gives sup⁡x∥Pn(x,⋅)−π∥≤Rtn\sup_x\|P^n(x,\cdot)-\pi\| \le Rt^nsupx​∥Pn(x,⋅)−π∥≤Rtn with t<1t<1t<1, and testing against a function bounded by BBB costs at most twice the total variation, so

∣un(x)∣  ≤  2B R tn(n≥1),∣u0(x)∣≤2B.|u_n(x)| \;\le\; 2B\,R\,t^n \quad (n\ge1), \qquad |u_0(x)| \le 2B .∣un​(x)∣≤2BRtn(n≥1),∣u0​(x)∣≤2B.

The series therefore converges uniformly and absolutely, with a majorant that is geometric in nnn and independent of xxx; ggg is bounded, and measurable as a pointwise limit of its partial sums.

Verification. Applying one step of the chain shifts the index. Because Pn∘P=Pn+1P^n \circ P = P^{n+1}Pn∘P=Pn+1 (an easy induction from associativity of kernel composition), Fubini for the composed kernel gives ∫un dP(x,⋅)=un+1(x)\int u_n\,dP(x,\cdot) = u_{n+1}(x)∫un​dP(x,⋅)=un+1​(x), and the geometric majorant justifies exchanging the integral with the sum. Hence

(Pg)(x)  =  ∑n≥0un+1(x)  =  g(x)−u0(x)  =  g(x)−(φ(x)−Eπφ),(Pg)(x) \;=\; \sum_{n\ge0}u_{n+1}(x) \;=\; g(x) - u_0(x) \;=\; g(x) - \bigl(\varphi(x) - \mathbb E_\pi\varphi\bigr),(Pg)(x)=n≥0∑​un+1​(x)=g(x)−u0​(x)=g(x)−(φ(x)−Eπ​φ),

which is the assertion. Note the identity holds at every xxx, not merely π\piπ-almost everywhere, because the convergence is uniform.

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

open MeasureTheory ProbabilityTheory Filter
open MarkovChainCLT
open scoped ENNReal NNReal Topology
Formal statement
theorem MarkovChainCLT.poissonEquation_of_bounded_of_uniformlyErgodic {X : Type*}
    [MeasurableSpace X] (P : Kernel X X) [IsMarkovKernel P] (π : Measure X)
    [IsProbabilityMeasure π] (huni : UniformlyErgodic P π) (φ : X → ℝ) (hφ : Measurable φ)
    (B : ℝ) (hB : ∀ x, |φ x| ≤ B) :
    ∃ g : X → ℝ, Measurable g ∧ (∃ C : ℝ, ∀ x, |g x| ≤ C) ∧
      ∀ x, g x - ∫ y, g y ∂(P x) = φ x - ∫ y, φ y ∂π := by sorry
Source
M. I. Gordin and B. A. Lifsic, "The central limit theorem for stationary Markov processes", Soviet Math. Dokl. 19 (1978) 392-394; E. Nummelin, General Irreducible Markov Chains and Non-negative Operators, Cambridge 1984, Ch. 5; S. P. Meyn and R. L. Tweedie, Markov Chains and Stochastic Stability, 2nd ed., Cambridge 2009, Ch. 17; G. L. Jones, "On the Markov Chain Central Limit Theorem", Probability Surveys 1 (2004) 299-320, Section 2.

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