Geometric ergodicity + detailed balance exponential -mixing (Jones Thm 2(iii))
OpenMarkovChainCLT.rho_mixing_exp_of_geometric_reversibleLet be a Markov chain with transition kernel , Harris ergodic with invariant probability . Suppose the chain is geometrically ergodic and reversible with respect to (detailed balance, the source's eq. (8)). Then the stationary chain is asymptotically uncorrelated with exponentially fast -mixing: there exist and such that
Reversibility holds by construction for Metropolis–Hastings samplers, so this result (Roberts–Rosenthal 1997) is the gateway to second-moment CLTs for the most common MCMC algorithms.
Formalization Note "Harris ergodic" is encoded by its total-variation characterization: is invariant for and for every starting point (equivalent to the classical aperiodic, -irreducible, positive Harris recurrent definition; the "every " quantifier is exactly the Harris property). Convergence in distribution is weak convergence of laws, and is read as the point mass at , which absorbs the source's "" caveat.
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 3** (Roberts–Rosenthal 1997): a geometrically ergodic chain satisfying detailed balance is asymptotically uncorrelated, with exponentially fast ρ-mixing. -/
theorem MarkovChainCLT.rho_mixing_exp_of_geometric_reversible {X : Type*} [MeasurableSpace X]
(P : Kernel X X) [IsMarkovKernel P] (π : Measure X) [IsProbabilityMeasure π]
(hP : HarrisErgodic P π) (hgeo : GeometricallyErgodic P π)
(hrev : Kernel.IsReversible P π) :
∃ c θ : ℝ, 0 ≤ c ∧ 0 < θ ∧ ∀ n : ℕ, 1 ≤ n →
rhoMixingCoef (chainMeasure P π) (fun i ω => ω i) n ≤ c * Real.exp (-θ * n) := by sorry
Read-back
What the Lean code literally says, in plain math · claude-fable-5
Let be a type with a σ-algebra (no countable-generation assumption), a Markov kernel from to itself (each a probability measure), and a probability measure on . Hypotheses: (i) Harris ergodicity: is invariant for and for every , , with the -fold iterate ( = identity) and (real supremum, no factor ); (ii) geometric ergodicity, unfolded as: there exist a function and a real with for all , , and for every and every — note that is required to be neither measurable nor -integrable, only pointwise nonnegative; (iii) Kernel.IsReversible P π, Mathlib's reversibility (detailed-balance) condition: the joint law of one step from stationarity — drawn from , then from — is invariant under swapping the two coordinates; equivalently for all measurable . Conclusion: there exist reals and with (zero allowed) and such that for every integer (nothing claimed at ), , where is the bundle's ρ-mixing coefficient of the coordinate process under the stationary path measure (the Ionescu–Tulcea measure on with , ). Unfolded, is the real supremum (sSup) of the set of values over all and all real-valued functions on path space such that is measurable with respect to the σ-algebra generated by coordinates , is measurable with respect to the σ-algebra generated by coordinates , and both lie in ; the covariance and variances are taken under . Note Lean's division convention: when or the quotient is the junk value , so degenerate (e.g. constant) pairs contribute to the supremum, and the set is therefore nonempty; a real sSup of an unbounded set would be by convention. The single pair must serve all simultaneously (existential before universal).
Confirmed by the mission captain (proposal self-audit).