Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Exponential α\alphaα-mixing with a Y2log⁡+∣Y∣Y^2\log^+|Y|Y2log+∣Y∣ moment gives absolutely summable autocovariances

Proved
MarkovChainCLT.summable_covariance_of_exp_alpha_of_log_moment

by evgeth · Sep 4, 2026 · Mathlib c5ea003 (Lean v4.30.0)

central-limit-theoremmixing-processesprobability

Let Y=(Yn)n≥0Y=(Y_n)_{n\ge 0}Y=(Yn​)n≥0​ be a measurable, centered, strictly stationary real-valued sequence on a probability space (Ω,F,P)(\Omega,\mathcal F,P)(Ω,F,P) whose strong mixing coefficients decay exponentially, α(n)≤c an\alpha(n)\le c\,a^nα(n)≤can for some constant ccc and some 0≤a<10\le a<10≤a<1, and which satisfies the moment condition

E[Y02log⁡+∣Y0∣]<∞,log⁡+t=max⁡(0,log⁡t).E\bigl[Y_0^2\log^+|Y_0|\bigr]<\infty,\qquad \log^+t=\max(0,\log t).E[Y02​log+∣Y0​∣]<∞,log+t=max(0,logt).

Then the positive-lag autocovariance series is absolutely convergent:

∑k≥1∣E[Y0Yk]∣<∞.\sum_{k\ge 1}\left|E[Y_0Y_k]\right|<\infty.k≥1∑​∣E[Y0​Yk​]∣<∞.

This isolates the covariance-control component of the Doukhan–Massart–Rio central limit theorem (Jones, Theorem 6): it is what makes the asymptotic-variance series σ2=E[Y02]+2∑k≥1E[Y0Yk]\sigma^2=E[Y_0^2]+2\sum_{k\ge 1}E[Y_0Y_k]σ2=E[Y02​]+2∑k≥1​E[Y0​Yk​] well defined. In the source the bound comes from Rio's covariance inequality in terms of the quantile function of ∣Y0∣|Y_0|∣Y0​∣ and the mixing rate, for which the Y2log⁡+∣Y∣Y^2\log^+|Y|Y2log+∣Y∣ moment together with exponential decay of α\alphaα is exactly the summability condition.

Formalization Note Positive lags are indexed as k+1k+1k+1 for k∈Nk\in\mathbb Nk∈N, and real summability is unconditional, hence equivalent to absolute convergence. The stated moment already implies E[Y02]<∞E[Y_0^2]<\inftyE[Y02​]<∞, so square-integrability is not assumed separately.

Preamble
import Definitions.Def_MixingCoefficients
import Mathlib.Analysis.SpecialFunctions.Log.PosLog

open MeasureTheory ProbabilityTheory
Formal statement
/-- The covariance-control component of the Doukhan–Massart–Rio CLT. -/
theorem MarkovChainCLT.summable_covariance_of_exp_alpha_of_log_moment
    {Ω : Type*} [MeasurableSpace Ω]
    (P : Measure Ω) [IsProbabilityMeasure P] (Y : ℕ → Ω → ℝ)
    (hY : ∀ n, Measurable (Y n)) (hstat : IsStrictlyStationary P Y)
    (hcent : ∫ ω, Y 0 ω ∂P = 0)
    (c a : ℝ) (ha0 : 0 ≤ a) (ha1 : a < 1)
    (hα : ∀ n, alphaMixingCoef P Y n ≤ c * a ^ n)
    (hmom : Integrable (fun ω => (Y 0 ω) ^ 2 * Real.posLog |Y 0 ω|) P) :
    Summable (fun k : ℕ => ∫ ω, Y 0 ω * Y (k + 1) ω ∂P) := by sorry
Source
G. L. Jones, "On the Markov Chain Central Limit Theorem", Probability Surveys 1 (2004) 299-320, https://arxiv.org/abs/math/0409112, Theorem 6 (arXiv v2 p. 11); original: P. Doukhan, P. Massart and E. Rio, The functional central limit theorem for strongly mixing processes, Ann. Inst. H. Poincaré Probab. Statist. 30 (1994) 63-82 (special case)

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

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 worksResearch paper
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me