Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Chain CLT from a TV rate: Eπ∣f∣2+δ<∞E_\pi|f|^{2+\delta}<\inftyEπ​∣f∣2+δ<∞, ∑γ(n)δ/(2+δ)<∞\sum \gamma(n)^{\delta/(2+\delta)}<\infty∑γ(n)δ/(2+δ)<∞ (Jones Cor 1)

Proved
MarkovChainCLT.clt_of_tv_rate

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 the total-variation rate bound ∥Pn(x,⋅)−π∥≤M(x) γ(n)\|P^n(x, \cdot) - \pi\| \le M(x)\, \gamma(n)∥Pn(x,⋅)−π∥≤M(x)γ(n) holds for all xxx and all n≥1n \ge 1n≥1, with M≥0M \ge 0M≥0 integrable with respect to π\piπ and γ≥0\gamma \ge 0γ≥0 nonincreasing, and that for some δ>0\delta > 0δ>0,

Eπ∣f∣2+δ<∞and∑nγ(n)δ/(2+δ)<∞.E_\pi |f|^{2+\delta} < \infty \qquad \text{and} \qquad \sum_n \gamma(n)^{\delta/(2+\delta)} < \infty.Eπ​∣f∣2+δ<∞andn∑​γ(n)δ/(2+δ)<∞.

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 source's master corollary (its eq. (11)): any total-variation rate plus a matching moment yields the CLT, uniformly over initial distributions; all remaining chain CLTs of the mission are specializations.

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 1**: a Harris ergodic chain with total-variation rate `γ`
(nonnegative, nonincreasing) and integrable constant `M`, and a functional with
`E_π |f|^{2+δ} < ∞` for a `δ > 0` such that `∑_n γ(n)^{δ/(2+δ)} < ∞`, satisfies the
CLT for every initial distribution. -/
Formal statement
theorem MarkovChainCLT.clt_of_tv_rate {X : Type*} [MeasurableSpace X]
    (P : Kernel X X) [IsMarkovKernel P] (π : Measure X) [IsProbabilityMeasure π]
    (hP : HarrisErgodic P π) (f : X → ℝ) (hf : Measurable f)
    (M : X → ℝ) (hM0 : ∀ x, 0 ≤ M x) (hM : Integrable M π)
    (γ : ℕ → ℝ) (hγ0 : ∀ n, 0 ≤ γ n) (hγa : Antitone γ)
    (hrate : ErgodicWithRate P π M γ)
    (δ : ℝ) (hδ : 0 < δ) (hmom : Integrable (fun x => |f x| ^ (2 + δ)) π)
    (hsum : Summable (fun n => γ n ^ (δ / (2 + δ)))) :
    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 1, eq. (11) (arXiv v2 p. 10; proved there from Theorem 5 via Theorem 2(ii) and Meyn-Tweedie Proposition 17.1.6)

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