Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Chan–Geyer and polynomial-ergodicity CLTs (Jones Cor 2)

Proved
MarkovChainCLT.clt_of_geometric_or_polynomial

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

markov-chainsmcmcprobability

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. Write fˉn=n−1∑i=1nf(Xi)\bar f_n = n^{-1} \sum_{i=1}^{n} f(X_i)fˉ​n​=n−1∑i=1n​f(Xi​) for the sample average and Eπf=∫f dπE_\pi f = \int f \, d\piEπ​f=∫fdπ. Assume one of the following three conditions: (1) the chain is geometrically ergodic and Eπ∣f∣2+δ<∞E_\pi |f|^{2+\delta} < \inftyEπ​∣f∣2+δ<∞ for some δ>0\delta > 0δ>0; (2) the chain is polynomially ergodic of order mmm with EπM<∞E_\pi M < \inftyEπ​M<∞ for the rate constant MMM, and Eπ∣f∣2+δ<∞E_\pi |f|^{2+\delta} < \inftyEπ​∣f∣2+δ<∞ for some δ>0\delta > 0δ>0 with mδ>2+δm\delta > 2 + \deltamδ>2+δ; (3) the chain is polynomially ergodic of order m>1m > 1m>1 with EπM<∞E_\pi M < \inftyEπ​M<∞, and ∣f∣<B|f| < B∣f∣<B π\piπ-almost surely for some BBB.

Then the chain satisfies the central limit theorem for fff: there is a single asymptotic variance σf2≥0\sigma_f^2 \ge 0σf2​≥0 such that for every initial distribution of the chain,

n (fˉn−Eπf)→dN(0,σf2)(n→∞).\sqrt{n}\,\bigl(\bar f_n - E_\pi f\bigr) \xrightarrow{d} N(0, \sigma_f^2) \qquad (n \to \infty).n​(fˉ​n​−Eπ​f)d​N(0,σf2​)(n→∞).

Case (1) is the Chan–Geyer CLT, the most frequently cited sufficient condition in the MCMC literature; cases (2)–(3) are its polynomial analogues.

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 (equivalent to the classical aperiodic, ψ\psiψ-irreducible, positive Harris recurrent definition; the "every xxx" quantifier is exactly the Harris property). Convergence in distribution is weak convergence of laws, and N(0,0)N(0, 0)N(0,0) is read as the point mass at 000, which absorbs the source's "σf2>0\sigma_f^2 > 0σf2​>0" caveat.

Preamble
import Definitions.Def_MarkovErgodicity
import Definitions.Def_MarkovChainPathMeasure

open MeasureTheory ProbabilityTheory Filter
open scoped ENNReal NNReal Topology ProbabilityTheory

/-- **Corollary 2** (case 1: Chan–Geyer 1994): a Harris ergodic chain satisfying one
of: (1) geometric ergodicity with `E_π |f|^{2+δ} < ∞` for some `δ > 0`;
(2) polynomial ergodicity of order `m` with integrable constant and
`E_π |f|^{2+δ} < ∞` with `mδ > 2+δ`; (3) polynomial ergodicity of order `m > 1`
with integrable constant and `f` bounded `π`-a.s. — satisfies the CLT for every
initial distribution. -/
Formal statement
theorem MarkovChainCLT.clt_of_geometric_or_polynomial {X : Type*} [MeasurableSpace X]
    (P : Kernel X X) [IsMarkovKernel P] (π : Measure X) [IsProbabilityMeasure π]
    (hP : HarrisErgodic P π) (f : X → ℝ) (hf : Measurable f)
    (hcase :
      (GeometricallyErgodic P π ∧
        ∃ δ : ℝ, 0 < δ ∧ Integrable (fun x => |f x| ^ (2 + δ)) π) ∨
      (∃ m δ : ℝ, 0 < δ ∧ 2 + δ < m * δ ∧ PolynomiallyErgodicL1 P π m ∧
        Integrable (fun x => |f x| ^ (2 + δ)) π) ∨
      (∃ m : ℝ, 1 < m ∧ PolynomiallyErgodicL1 P π m ∧
        ∃ B : ℝ, ∀ᵐ x ∂π, |f x| < B)) :
    SatisfiesCLT P π f := by sorry
Source
G. L. Jones, "On the Markov Chain Central Limit Theorem", Probability Surveys 1 (2004) 299-320, arXiv math/0409112v2, Corollary 2 (arXiv v2 p. 10); case 1: K. S. Chan & C. J. Geyer, Ann. Statist. 22 (1994), discussion of Tierney

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