Roberts–Rosenthal CLT: geometric ergodicity + detailed balance + (Jones Cor 4)
OpenMarkovChainCLT.clt_of_geometric_reversibleLet be a Markov chain with transition kernel on a state space , Harris ergodic with invariant probability distribution , and let be measurable. Write for the sample average and . Suppose the chain is geometrically ergodic, reversible with respect to (detailed balance, the source's eq. (8)), and
Then the chain satisfies the central limit theorem for : there is a single asymptotic variance such that for every initial distribution of the chain,
The Roberts–Rosenthal CLT: for reversible samplers — Metropolis–Hastings in particular — geometric ergodicity plus a second moment already gives the CLT, with no to spare.
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 open MeasureTheory ProbabilityTheory Filter open scoped ENNReal NNReal Topology ProbabilityTheory /-- **Corollary 4** (Roberts–Rosenthal 1997): a geometrically ergodic Harris chain satisfying detailed balance, with `E_π f² < ∞`, satisfies the CLT for every initial distribution. -/
theorem MarkovChainCLT.clt_of_geometric_reversible {X : Type*} [MeasurableSpace X]
(P : Kernel X X) [IsMarkovKernel P] (π : Measure X) [IsProbabilityMeasure π]
(hP : HarrisErgodic P π) (f : X → ℝ) (hf : Measurable f)
(hgeo : GeometricallyErgodic P π) (hrev : Kernel.IsReversible P π)
(hL2 : MemLp f 2 π) :
SatisfiesCLT P π f := by sorry
Read-back
What the Lean code literally says, in plain math · claude-fable-5
Setting. is an arbitrary type with a measurable-space structure; is a kernel from to assumed (typeclass) to be a Markov kernel ( a probability measure for every ); is a measure on assumed (typeclass) to be a probability measure. Hypotheses. (1) Harris ergodicity: is invariant for ( equals ) and for every , as , where is the -fold iterate ( identity kernel, ) and (no factor ; measure values sent to reals with ; real supremum with junk value if unbounded, set contains via ). (2) is measurable. (3) Geometric ergodicity: there exist and with for all (no measurability or integrability of required), , and for every and every (nothing asserted at ). (4) Reversibility (Kernel.IsReversible P \pi, a Mathlib notion): the joint law on of a pair with and — the composition-product measure — is invariant under swapping the two coordinates; i.e. detailed balance holds: is a symmetric measure on . (5) in the MemLp sense: is -a.e. strongly measurable and . Conclusion ( satisfies the CLT for , unfolded): there exists a nonnegative real such that for every probability measure on — a single for all ; existential over before universal over — the functions converge in distribution to as under the path measure , where: averages over the chain states at times (the time- state is never used; at , and give ); the centering constant is the -mean for every ; is the law on of the time-homogeneous Markov chain with transition kernel started with (, Ionescu–Tulcea); convergence in distribution means for every bounded continuous ; and is the normal law of mean and variance , equal to the Dirac point mass at when (degenerate limit allowed).
Confirmed by the mission captain (proposal self-audit).