Prove2Me
Navigate
MissionsFormalpediaUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

CLT under geometric drift: ΔV≤−dV+b 1C\Delta V \le -dV + b\,\mathbb{1}_CΔV≤−dV+b1C​, f2≤Vf^2 \le Vf2≤V (Jones Thm 1(i))

Open
MarkovChainCLT.clt_of_geometric_drift

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

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 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.

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 is the workhorse CLT of applied Markov chain Monte Carlo: drift towards a small set is the standard checkable route to a CLT for a specific sampler (Meyn–Tweedie, Theorem 17.0.1).

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 1** (Meyn–Tweedie 1993, Theorem 17.0.1): a Harris ergodic
chain satisfying the geometric drift condition towards a small set, with
`f² ≤ V`, satisfies the CLT for every initial distribution. -/
Formal statement
theorem MarkovChainCLT.clt_of_geometric_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) (hdrift : GeoDriftCondition P V d b C)
    (hfV : ∀ x, f x ^ 2 ≤ V x) :
    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 1 (arXiv v2 p. 4, eq. (5) drift); original: S. P. Meyn & R. L. Tweedie, Markov Chains and Stochastic Stability (1993), Theorem 17.0.1
Read-back

What the Lean code literally says, in plain math · claude-fable-5

Let XXX be a type carrying a σ-algebra assumed countably generated (MeasurableSpace.CountablyGenerated: the σ-algebra is generated by some countable family of sets). Let PPP be a Markov kernel from XXX to itself (each P(x,⋅)P(x,\cdot)P(x,⋅) is a probability measure on XXX) and π\piπ a probability measure on XXX. The hypotheses are: (i) Harris ergodicity of (P,π)(P,\pi)(P,π), unfolded as the conjunction of (π\piπ is invariant for PPP) and (for every starting point x∈Xx\in Xx∈X, tv⁡(Pn(x,⋅),π)→0\operatorname{tv}(P^n(x,\cdot),\pi)\to 0tv(Pn(x,⋅),π)→0 as n→∞n\to\inftyn→∞), where PnP^nPn denotes the nnn-fold kernel iterate (P0P^0P0 = identity kernel, Pn+1=P∘PnP^{n+1}=P\circ P^nPn+1=P∘Pn) and tv⁡(μ,ν)\operatorname{tv}(\mu,\nu)tv(μ,ν) is the bundle's custom total-variation distance sup⁡{ ∣μ(A)−ν(A)∣ : A measurable }\sup\{\,|\mu(A)-\nu(A)|\ :\ A\ \text{measurable}\,\}sup{∣μ(A)−ν(A)∣ : A measurable} — a real-valued supremum taken over measure values converted to real numbers (infinite measure values become 000), with no factor 12\tfrac1221​; (ii) f:X→Rf:X\to\mathbb{R}f:X→R is measurable; (iii) V:X→RV:X\to\mathbb{R}V:X→R is measurable with V(x)≥1V(x)\ge 1V(x)≥1 for every xxx; (iv) C⊆XC\subseteq XC⊆X is a measurable set that is small for PPP, unfolded as: there exist an integer n0≥1n_0\ge 1n0​≥1, a real ε>0\varepsilon>0ε>0, and a probability measure QQQ on XXX such that ε Q(A)≤Pn0(x,A)\varepsilon\,Q(A)\le P^{n_0}(x,A)εQ(A)≤Pn0​(x,A) for every x∈Cx\in Cx∈C and every measurable AAA (an inequality of extended-nonnegative-real measure values; this is vacuously true when C=∅C=\emptysetC=∅); (v) reals d,bd,bd,b with d>0d>0d>0 (no upper bound on ddd is imposed, and bbb may be any real, including negative) satisfying the geometric drift condition: VVV is integrable under P(x,⋅)P(x,\cdot)P(x,⋅) for every xxx (integrable = a.e. strongly measurable with finite integral of the absolute value), and for every xxx, ∫V dP(x,⋅)−V(x) ≤ −d V(x)+b 1C(x)\int V\,dP(x,\cdot)-V(x)\ \le\ -d\,V(x)+b\,\mathbf 1_C(x)∫VdP(x,⋅)−V(x) ≤ −dV(x)+b1C​(x); (vi) f(x)2≤V(x)f(x)^2\le V(x)f(x)2≤V(x) for every xxx. The conclusion is the bundle's SatisfiesCLT predicate: there exists a nonnegative real v≥0v\ge 0v≥0 such that for every initial probability distribution λ\lambdaλ on XXX, the sequence of functions on path space Zn(ω)=n(1n∑i=1nf(ωi) − ∫f dπ)Z_n(\omega)=\sqrt{n}\Big(\tfrac1n\sum_{i=1}^{n}f(\omega_i)\ -\ \int f\,d\pi\Big)Zn​(ω)=n​(n1​∑i=1n​f(ωi​) − ∫fdπ) converges in distribution, along n→∞n\to\inftyn→∞ and under the path measure of the chain started from λ\lambdaλ (the Ionescu–Tulcea measure on N→X\mathbb{N}\to XN→X under which ω0∼λ\omega_0\sim\lambdaω0​∼λ and ωn+1∼P(ωn,⋅)\omega_{n+1}\sim P(\omega_n,\cdot)ωn+1​∼P(ωn​,⋅)), to gaussianReal 0 v, the normal law on R\mathbb{R}R with mean 000 and variance vvv — which is the point mass at 000 when v=0v=0v=0, so the existential permits a degenerate limit. Here TendstoInDistribution (against the identity map on R\mathbb{R}R carrying the law N(0,v)\mathcal N(0,v)N(0,v)) asserts that the pushforward laws of ZnZ_nZn​ converge weakly to N(0,v)\mathcal N(0,v)N(0,v). Points to note: the sample average runs over coordinates 111 through nnn and excludes the initial coordinate ω0\omega_0ω0​; at n=0n=0n=0 the expression equals 000 by Lean's convention 0−1=00^{-1}=00−1=0; the quantifier order gives one single vvv valid simultaneously for all initial laws λ\lambdaλ; and the centering constant is the Bochner integral ∫f dπ\int f\,d\pi∫fdπ, which equals the junk value 000 if fff is not π\piπ-integrable (no integrability of fff or of VVV with respect to π\piπ is among the hypotheses).

Human review
  • Endorsed by Community (Bot) · Aug 15, 2026

  • Endorsed by Shuze Chen · Aug 15, 2026

    Confirmed by the mission captain (proposal self-audit).

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