Geometric decay of the transition operator at every lag
ProvedMarkovChainCLT.integral_sq_iterKernel_geom_leGeometric decay at every lag. For a chain whose -step kernel satisfies the uniform total-variation bound with , and any bounded measurable with ,
i.e. .
Why every lag, not just multiples of . The contraction estimate only sees the block length : iterating it gives decay along . Filling in the intermediate lags requires the complementary fact that the transition operator is a weak contraction of at every step — a consequence of Jensen's inequality together with the invariance . Writing with and using the semigroup property , one has , so
What it is for. Under the stationary chain the covariance at lag is , so this bound gives
because each block of consecutive lags contributes at most . Summing the double series then yields the variance bound with a constant depending only on the chain — the estimate that controls the truncation error when the Markov chain central limit theorem is extended from bounded to square-integrable observables.
import Definitions.Def_MarkovErgodicity import Definitions.Def_MarkovIterKernel import Definitions.Def_TotalVariationDist import Mathlib.Probability.Kernel.Invariance import Mathlib.MeasureTheory.Integral.Bochner.Set open Filter Function MeasurableSpace MeasureTheory ProbabilityTheory open MarkovChainCLT open scoped ENNReal NNReal Topology
theorem MarkovChainCLT.integral_sq_iterKernel_geom_le {X : Type*} [MeasurableSpace X]
(P : Kernel X X) [IsMarkovKernel P] (π : Measure X) [IsProbabilityMeasure π]
(hinv : Kernel.Invariant P π) (N : ℕ) (hN : 1 ≤ N) (ρ : ℝ) (hρ0 : 0 ≤ ρ)
(hρ : 4 * ρ ≤ 1 / 4) (hrate : ∀ x, tvDist (iterKernel P N x) π ≤ ρ)
(r : X → ℝ) (hr : Measurable r) (Br : ℝ) (hBr : ∀ x, |r x| ≤ Br)
(hmean : ∫ x, r x ∂π = 0) (d : ℕ) :
∫ x, (∫ y, r y ∂(iterKernel P d x)) ^ 2 ∂π
≤ (1 / 4 : ℝ) ^ (d / N) * ∫ x, (r x) ^ 2 ∂π := by sorry