Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

CLT under polynomial drift: ΔV≤−dVτ+b 1C\Delta V \le -dV^\tau + b\,\mathbb{1}_CΔV≤−dVτ+b1C​, ∣f∣≤Vτ+η−1|f| \le V^{\tau+\eta-1}∣f∣≤Vτ+η−1 (Jones Thm 1(ii))

Proved
MarkovChainCLT.clt_of_polynomial_drift

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π. Suppose V:X→[1,∞)V : \mathsf{X} \to [1, \infty)V:X→[1,∞) is measurable, CCC is a measurable small set, d>0d > 0d>0, 0≤τ<10 \le \tau < 10≤τ<1, the polynomial drift condition

PV(x)−V(x)  ≤  −d V(x)τ+b 1C(x)(x∈X)PV(x) - V(x) \;\le\; -d\, V(x)^{\tau} + 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 η\etaη satisfies 1−τ≤η≤11 - \tau \le \eta \le 11−τ≤η≤1 together with EπV2η<∞E_\pi V^{2\eta} < \inftyEπ​V2η<∞ and ∣f∣≤Vτ+η−1|f| \le V^{\tau + \eta - 1}∣f∣≤Vτ+η−1 pointwise.

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→∞).

This extends the drift route to chains converging only at a polynomial rate (Jarner–Roberts, Theorem 4.2), the regime of many heavy-tailed MCMC samplers.

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. The σ\sigmaσ-algebra of the state space is additionally assumed countably generated, the standard general-state-space setting of Meyn and Tweedie.

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

open MeasureTheory ProbabilityTheory Filter
open scoped ENNReal NNReal Topology ProbabilityTheory

/-- **Theorem 1, condition 2** (Jarner–Roberts 2002, Theorem 4.2): a Harris ergodic
chain satisfying the polynomial drift condition towards a small set, with
`|f| ≤ V^{τ+η-1}` for some `1 - τ ≤ η ≤ 1` such that `E_π V^{2η} < ∞`,
satisfies the CLT for every initial distribution. -/
Formal statement
theorem MarkovChainCLT.clt_of_polynomial_drift {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)) :
    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, Theorem 1, condition 2 (arXiv v2 p. 4, eq. (6) drift); original: S. F. Jarner & G. O. Roberts, Polynomial convergence rates of Markov chains, Ann. Appl. Probab. 12 (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