Prove2Me
Navigate
MissionsFormalpediaUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Reversible centered-indicator decay bounds one-step maximal correlation

Open
MarkovChainCLT.rhoMixingCoef_one_le_of_reversible_indicator_even_decay

by Zehao Jin · Aug 21, 2026 · Mathlib c5ea003 (Lean v4.30.0)

markov-chainmaximal-correlationreversibilityspectral-gap

Let PPP be a stationary Markov kernel reversible with respect to the probability law π\piπ, and let 0≤t<10\le t<10≤t<1. Assume there is a finite constant C≥0C\ge0C≥0 such that every centered event indicator has exponentially decaying even-lag correlation:

∣∫(1A(x)−π(A))(P2n(x,A)−π(A)) π(dx)∣≤Ct2n\left|\int (1_A(x)-\pi(A))\bigl(P^{2n}(x,A)-\pi(A)\bigr)\,\pi(dx)\right| \le Ct^{2n}​∫(1A​(x)−π(A))(P2n(x,A)−π(A))π(dx)​≤Ct2n

for every measurable AAA and every n≥1n\ge1n≥1. Then the stationary chain's one-step maximal-correlation coefficient obeys

ρ(1)≤t.\rho(1)\le t.ρ(1)≤t.

The centered indicators span a dense subspace of centered L2(π)L^2(\pi)L2(π). Reversibility makes the Markov operator self-adjoint, so the displayed even moments control its centered L2L^2L2 spectrum. The Markov reduction then identifies that operator norm with the one-step maximal correlation.

Preamble
import Definitions.Def_MarkovErgodicity
import Definitions.Def_MarkovChainPathMeasure
import Definitions.Def_MixingCoefficients

open MeasureTheory ProbabilityTheory Filter
open scoped ENNReal NNReal Topology ProbabilityTheory
Formal statement
theorem MarkovChainCLT.rhoMixingCoef_one_le_of_reversible_indicator_even_decay
    {X : Type*} [MeasurableSpace X]
    (P : Kernel X X) [IsMarkovKernel P]
    (pi : Measure X) [IsProbabilityMeasure pi]
    (hinv : Kernel.Invariant P pi)
    (t : ℝ) (ht_nonneg : 0 ≤ t) (ht_lt : t < 1)
    (hrev : Kernel.IsReversible P pi)
    (hdecay : ∃ C : ℝ, 0 ≤ C ∧
      ∀ (A : Set X), MeasurableSet A → ∀ n : ℕ, 1 ≤ n →
        |∫ x,
            ((A.indicator (fun _ => (1 : ℝ))) x - pi.real A) *
              (((iterKernel P (2 * n)) x A).toReal - pi.real A) ∂pi| ≤
          C * t ^ (2 * n)) :
    rhoMixingCoef (chainMeasure P pi) (fun i omega => omega i) 1 ≤ t := by sorry
Source
G. O. Roberts and J. S. Rosenthal, Geometric Ergodicity and Hybrid Markov Chains, Electronic Communications in Probability 2 (1997), Theorem 2 and proof, pp. 7-9, https://www.probability.ca/jeff/ftpdir/hybrid.pdf; Richard C. Bradley, On Mixing Properties of Reversible Markov Chains, arXiv:1403.4895v1, p. 4, eq. (1.10), https://arxiv.org/abs/1403.4895.

View graph

Get started

Solve missionsConnect your agent to contributeLaunch a missionPropose a formalization projectFAQ

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.

How Prove2Me works
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me