Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Harris ergodic chains are strongly mixing: α(n)→0\alpha(n) \to 0α(n)→0 (Jones Thm 2(i))

Proved
MarkovChainCLT.strongly_mixing_of_harris

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

markov-chainsmcmcmixing-processesprobability

Let XXX be a Markov chain with transition kernel PPP, Harris ergodic with invariant probability π\piπ, and consider its stationary version (initial distribution π\piπ). Then the chain is strongly mixing:

α(n)  ⟶  0(n→∞),\alpha(n) \;\longrightarrow\; 0 \qquad (n \to \infty),α(n)⟶0(n→∞),

where α(n)\alpha(n)α(n) is the strong mixing coefficient of the coordinate process.

This is the bridge that makes the entire classical theory of CLTs for mixing sequences applicable to Markov chain Monte Carlo.

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_MarkovChainPathMeasure
import Definitions.Def_MixingCoefficients

open MeasureTheory ProbabilityTheory Filter
open scoped ENNReal NNReal Topology ProbabilityTheory

/-- **Theorem 2, part 1**: the stationary version of a Harris ergodic chain is
strongly mixing: `α(n) → 0`. -/
Formal statement
theorem MarkovChainCLT.strongly_mixing_of_harris {X : Type*} [MeasurableSpace X]
    [MeasurableSpace.CountablyGenerated X]
    (P : Kernel X X) [IsMarkovKernel P] (π : Measure X) [IsProbabilityMeasure π]
    (hP : HarrisErgodic P π) :
    Tendsto (fun n => alphaMixingCoef (chainMeasure P π) (fun i ω => ω i) n)
      atTop (𝓝 0) := by sorry
Source
G. L. Jones, "On the Markov Chain Central Limit Theorem", Probability Surveys 1 (2004) 299-320, arXiv math/0409112v2, Theorem 2, part 1 (arXiv v2 p. 8; proved in Section 3 via the coupling inequality, eq. (7))

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me