Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Poisson equation has an L2(π)L^2(\pi)L2(π) solution under the geometric drift condition with f2≤Vf^2 \le Vf2≤V

Proved
MarkovChainCLT.poissonEquation_ae_of_geometricDrift

by Cody Wang · Sep 5, 2026 · Mathlib c5ea003 (Lean v4.30.0)

markov-chainsmartingalemcmcpoisson-equationprobability

Let X={Xn}n≥0X = \{X_n\}_{n \ge 0}X={Xn​}n≥0​ be a Markov chain with transition kernel PPP on a state space X\mathsf{X}X, Harris ergodic with invariant probability distribution π\piπ, and let f:X→Rf : \mathsf{X} \to \mathbb{R}f:X→R be measurable. Suppose V:X→[1,∞)V : \mathsf{X} \to [1,\infty)V:X→[1,∞) is measurable, C⊆XC \subseteq \mathsf{X}C⊆X is a measurable small set, d>0d > 0d>0 and bbb are constants, the geometric drift condition

(PV)(x)−V(x)  ≤  −d V(x)+b 1C(x)(x∈X)(PV)(x) - V(x) \;\le\; -d\,V(x) + b\,\mathbb{1}_C(x) \qquad (x \in \mathsf{X})(PV)(x)−V(x)≤−dV(x)+b1C​(x)(x∈X)

holds with VVV integrable under every P(x,⋅)P(x,\cdot)P(x,⋅), and f2≤Vf^2 \le Vf2≤V pointwise. Write (Pg)(x)=∫g(y) P(x,dy)(Pg)(x) = \int g(y)\,P(x,\mathrm{d}y)(Pg)(x)=∫g(y)P(x,dy) and Eπf=∫f dπE_\pi f = \int f\,\mathrm{d}\piEπ​f=∫fdπ.

Then the Poisson equation for fff has a square-integrable solution: there exists a measurable g:X→Rg : \mathsf{X} \to \mathbb{R}g:X→R such that

  1. g∈L2(π)g \in L^2(\pi)g∈L2(π);
  2. PgPgPg is measurable and Pg∈L2(π)Pg \in L^2(\pi)Pg∈L2(π);
  3. g(x)−(Pg)(x)=f(x)−Eπfg(x) - (Pg)(x) = f(x) - E_\pi fg(x)−(Pg)(x)=f(x)−Eπ​f for π\piπ-almost every xxx.

The role of this statement is to supply the martingale approximation on which the drift route to the Markov chain central limit theorem rests. Given such a ggg, the increments Di=g(Xi+1)−(Pg)(Xi)D_i = g(X_{i+1}) - (Pg)(X_i)Di​=g(Xi+1​)−(Pg)(Xi​) form a stationary, square-integrable martingale difference sequence for the natural filtration of the chain, and the telescoping identity

n (fˉn−Eπf)  =  1n∑i=0n−1Di  +  1n((Pg)(X0)−(Pg)(Xn))\sqrt{n}\,\bigl(\bar f_n - E_\pi f\bigr) \;=\; \frac{1}{\sqrt n}\sum_{i=0}^{n-1} D_i \;+\; \frac{1}{\sqrt n}\bigl((Pg)(X_0) - (Pg)(X_n)\bigr)n​(fˉ​n​−Eπ​f)=n​1​i=0∑n−1​Di​+n​1​((Pg)(X0​)−(Pg)(Xn​))

reduces the central limit theorem for the sample averages fˉn\bar f_nfˉ​n​ to the martingale central limit theorem plus a remainder that vanishes in probability. The hypotheses are exactly those of Theorem 1, condition 1 of the source survey, so the statement isolates the one genuinely Markov-theoretic ingredient of that theorem: the drift condition must be converted into an L2(π)L^2(\pi)L2(π) solution of the Poisson equation, everything after that being general martingale theory.

Formalization Note "Harris ergodic" is encoded by its total-variation characterization: π\piπ is invariant for PPP and ∥Pn(x,⋅)−π∥→0\|P^n(x,\cdot) - \pi\| \to 0∥Pn(x,⋅)−π∥→0 for every starting point xxx. GeoDriftCondition P V d b C carries the integrability of VVV under every P(x,⋅)P(x,\cdot)P(x,⋅) as a conjunct, and IsSmallSet P C is the minorization condition Pn0(x,A)≥ε Q(A)P^{n_0}(x,A) \ge \varepsilon\,Q(A)Pn0​(x,A)≥εQ(A) for x∈Cx \in Cx∈C. The σ\sigmaσ-algebra of the state space is assumed countably generated, the standard general-state-space setting of Meyn and Tweedie, matching the parent theorem. The conclusion asserts the Poisson identity only π\piπ-almost everywhere, which is all the martingale approximation consumes; the classical construction in fact gives it at every xxx. The conclusion's shape deliberately matches the existing platform theorem MarkovChainCLT.poissonEquation_ae_of_uniformlyErgodic, so the two are interchangeable in downstream martingale-approximation arguments.

Preamble
import Definitions.Def_MarkovErgodicity
import Definitions.Def_MarkovDriftMinorization
import Definitions.Def_MarkovChainPathMeasure

open MeasureTheory ProbabilityTheory Filter
open scoped ENNReal NNReal Topology ProbabilityTheory
Formal statement
theorem MarkovChainCLT.poissonEquation_ae_of_geometricDrift {X : Type*} [MeasurableSpace X]
    [MeasurableSpace.CountablyGenerated X]
    (P : Kernel X X) [IsMarkovKernel P] (π : Measure X) [IsProbabilityMeasure π]
    (hP : HarrisErgodic P π) (f : X → ℝ) (hf : Measurable f)
    (V : X → ℝ) (hV : Measurable V) (hV1 : ∀ x, 1 ≤ V x)
    (C : Set X) (hC : MeasurableSet C) (hsmall : IsSmallSet P C)
    (d b : ℝ) (hd : 0 < d) (hdrift : GeoDriftCondition P V d b C)
    (hfV : ∀ x, f x ^ 2 ≤ V x) :
    ∃ 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
G. L. Jones, "On the Markov Chain Central Limit Theorem", Probability Surveys 1 (2004) 299-320, arXiv math/0409112v2, Theorem 1 condition 1 (drift eq. (5), f^2 <= V) and Remark 2, which attributes that condition to Meyn & Tweedie 1993. This theorem isolates the Poisson-equation (martingale-approximation) step of that proof. Original sources: S. P. Meyn & R. L. Tweedie, Markov Chains and Stochastic Stability (Springer 1993; 2nd ed. Cambridge Univ. Press 2009), Chapter 16 'V-Uniform Ergodicity' (Theorem 16.0.1: the geometric drift condition towards a small set is equivalent to V-uniform ergodicity) and Chapter 17, Section 17.4, where the CLT of Theorem 17.0.1 is proved via a square-integrable solution of the Poisson equation; and P. W. Glynn & S. P. Meyn, "A Liapounov bound for solutions of the Poisson equation", Annals of Probability 24 (1996) 916-931, which gives the Lyapunov bound g^2 <= cV on the solution under a drift condition for V with f^2 <= V.

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