Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Distributional limit for a bounded strongly mixing stationary sequence

Proved
MarkovChainCLT.tendstoInDistribution_of_bounded_of_summable_alpha

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), uniformly bounded by a constant BBB almost surely at every time, with summable strong mixing coefficients ∑n≥0α(n)<∞\sum_{n\ge 0}\alpha(n)<\infty∑n≥0​α(n)<∞. Assume also that the positive-lag autocovariance series ∑k≥1E[Y0Yk]\sum_{k\ge 1}E[Y_0Y_k]∑k≥1​E[Y0​Yk​] is absolutely convergent, and define

σ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​]+2k≥1∑​E[Y0​Yk​].

If σ2>0\sigma^2>0σ2>0, then the normalized partial sums obey

1n∑i=0n−1Yi→dN(0,σ2).\frac{1}{\sqrt n}\sum_{i=0}^{n-1}Y_i\xrightarrow{d}N(0,\sigma^2).n​1​i=0∑n−1​Yi​d​N(0,σ2).

This isolates the blocking and distributional-limit component of the bounded case of the Ibragimov–Linnik central limit theorem (Jones, Theorem 5, condition 1), after covariance convergence has been established separately.

Formalization Note Convergence is weak convergence of the laws under the common probability measure PPP; the Gaussian variance is represented by the nonnegative-real coercion of σ2\sigma^2σ2, which equals σ2\sigma^2σ2 under the positivity hypothesis.

Preamble
import Definitions.Def_MixingCoefficients
import Mathlib.MeasureTheory.Function.ConvergenceInDistribution
import Mathlib.Probability.Distributions.Gaussian.Real

open MeasureTheory ProbabilityTheory Filter
open scoped ENNReal NNReal Topology ProbabilityTheory
Formal statement
/-- The blocking/limit component of the Ibragimov–Linnik bounded-case CLT, after
covariance summability has been isolated. -/
theorem MarkovChainCLT.tendstoInDistribution_of_bounded_of_summable_alpha
    {Ω : Type*} [MeasurableSpace Ω]
    (P : Measure Ω) [IsProbabilityMeasure P] (Y : ℕ → Ω → ℝ)
    (hY : ∀ n, Measurable (Y n)) (hstat : IsStrictlyStationary P Y)
    (hcent : ∫ ω, Y 0 ω ∂P = 0)
    (B : ℝ) (hB : ∀ n, ∀ᵐ ω ∂P, |Y n ω| < B)
    (hα : Summable (fun n => alphaMixingCoef P Y n))
    (hsum : Summable (fun k : ℕ => ∫ ω, Y 0 ω * Y (k + 1) ω ∂P))
    (hvar : 0 < seqAsymptoticVariance P Y) :
    TendstoInDistribution
      (fun (n : ℕ) ω => (Real.sqrt n)⁻¹ * ∑ i ∈ Finset.range n, Y i ω)
      atTop (id : ℝ → ℝ) (fun _ => P)
      (gaussianReal 0 (seqAsymptoticVariance P Y).toNNReal) := 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 5, condition 1 (arXiv v2 p. 9); originals: I. A. Ibragimov, Theory Probab. Appl. 7 (1962); I. A. Ibragimov and Yu. V. Linnik, Independent and Stationary Sequences of Random Variables (1971), Ch. 18

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