CLT under polynomial drift: , (Jones Thm 1(ii))
ProvedMarkovChainCLT.clt_of_polynomial_driftLet 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 is measurable, is a measurable small set, , , the polynomial drift condition
holds with integrable under every , and satisfies together with and pointwise.
Then the chain satisfies the central limit theorem for : there is a single asymptotic variance such that for every initial distribution of the chain,
This extends the drift route to chains converging only at a polynomial rate (Jarner–Roberts, Theorem 4.2), the regime of many heavy-tailed MCMC samplers.
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. The -algebra of the state space is additionally assumed countably generated, the standard general-state-space setting of Meyn and Tweedie.
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 2** (Jarner–Roberts 2002, Theorem 4.2): a Harris ergodic
chain satisfying the polynomial drift condition towards a small set, with
`|f| ≤ V^{τ+η-1}` for some `1 - τ ≤ η ≤ 1` such that `E_π V^{2η} < ∞`,
satisfies the CLT for every initial distribution. -/
theorem MarkovChainCLT.clt_of_polynomial_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) (hτ0 : 0 ≤ τ) (hτ1 : τ < 1)
(hdrift : PolyDriftCondition P V d b τ C)
(η : ℝ) (hη0 : 1 - τ ≤ η) (hη1 : η ≤ 1)
(hVint : Integrable (fun x => V x ^ (2 * η)) π)
(hfV : ∀ x, |f x| ≤ V x ^ (τ + η - 1)) :
SatisfiesCLT P π f := by sorry