Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

An L2(π)L^2(\pi)L2(π) Poisson solution under polynomial drift

Proved
MarkovChainCLT.poissonEquation_ae_of_polynomialDrift

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

markov-chainsmartingalepoisson-equationprobability

Let PPP be a Harris ergodic Markov kernel on a countably generated measurable state space, with invariant probability measure π\piπ. Let V≥1V\ge1V≥1 and fff be measurable, let CCC be a measurable small set, and assume VVV is integrable under P(x,⋅)P(x,\cdot)P(x,⋅) for every xxx. Suppose d>0d>0d>0, b∈Rb\in\mathbb Rb∈R, and 0≤τ<10\le\tau<10≤τ<1 satisfy

PV(x)−V(x)≤−dV(x)τ+b1C(x).PV(x)-V(x)\le-dV(x)^\tau+b\mathbf1_C(x).PV(x)−V(x)≤−dV(x)τ+b1C​(x).

For a real η\etaη satisfying 1−τ≤η≤11-\tau\le\eta\le11−τ≤η≤1, assume

∫V2η dπ<∞,∣f(x)∣≤V(x)τ+η−1for every x.\int V^{2\eta}\,d\pi<\infty, \qquad |f(x)|\le V(x)^{\tau+\eta-1}\quad\text{for every }x.∫V2ηdπ<∞,∣f(x)∣≤V(x)τ+η−1for every x.

Then there is a measurable solution ggg of the centered Poisson equation such that

g∈L2(π),Pg is measurable,Pg∈L2(π),g−Pg=f−π(f)π-almost everywhere.g\in L^2(\pi),\qquad Pg\text{ is measurable},\qquad Pg\in L^2(\pi), \qquad g-Pg=f-\pi(f)\quad\pi\text{-almost everywhere}.g∈L2(π),Pg is measurable,Pg∈L2(π),g−Pg=f−π(f)π-almost everywhere.

Here Pg(x)=∫g(y) P(x,dy)Pg(x)=\int g(y)\,P(x,dy)Pg(x)=∫g(y)P(x,dy) and π(f)=∫f dπ\pi(f)=\int f\,d\piπ(f)=∫fdπ.

This isolates the Poisson-equation ingredient of the polynomial-drift central limit theorem. Its conclusion also supports martingale approximations and bounds for additive functionals, independently of a central limit theorem.

Formalization Note. Harris ergodicity and smallness use the existing mission definitions. The Poisson identity is required only almost everywhere under the invariant measure. The case τ=0\tau=0τ=0 forces η=1\eta=1η=1 and is included.

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_polynomialDrift {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) (hτ0 : 0 ≤ τ) (hτ1 : τ < 1)
    (hdrift : PolyDriftCondition P V d b τ C)
    (η : ℝ) (hη0 : 1 - τ ≤ η) (hη1 : η ≤ 1)
    (hVint : Integrable (fun x => V x ^ (2 * η)) π)
    (hfV : ∀ x, |f x| ≤ V x ^ (τ + η - 1)) :
    ∃ 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), arXiv math/0409112v2, p. 4, Theorem 1(2), equation (6), and Remark 2: https://arxiv.org/pdf/math/0409112. Poisson-equation formulation derived from P. W. Glynn and S. P. Meyn, A Liapounov Bound for Solutions of the Poisson Equation, Annals of Probability 24 (1996), 916–931, equation (8) p. 919 and Theorem 2.3 p. 921: https://web.stanford.edu/~glynn/papers/1996/GM96.pdf. Apply that weighted Poisson theorem after the concave-power drift transformation W=V^eta and F=V^(tau+eta-1); the bound |g| <= const*(W+1) and pi(V^(2*eta))<infinity give L2. The source of the parent CLT is Jarner–Roberts (2002), Theorem 4.2.

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.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me