Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Uniform integrability of Sn2/σn2S_n^2/\sigma_n^2Sn2​/σn2​ under summable ρ\rhoρ-mixing

Proved
MarkovChainCLT.uniformIntegrable_sq_partialSum_of_summable_rho

by Gabewhigham · Sep 5, 2026 · Mathlib c5ea003 (Lean v4.30.0)

central-limit-theoremmixing-processesprobability

Let Y=(Yn)n≥0Y=(Y_n)_{n\ge0}Y=(Yn​)n≥0​ be a measurable, centered, strictly stationary real sequence with Y0∈L2Y_0\in L^2Y0​∈L2 and summable maximal-correlation coefficients ∑nρ(n)<∞\sum_{n}\rho(n)<\infty∑n​ρ(n)<∞, whose positive-lag autocovariance series converges, and whose asymptotic variance

σ2=E[Y02]+2∑k≥1E[Y0Yk]\sigma^2=E[Y_0^2]+2\sum_{k\ge1}E[Y_0Y_k]σ2=E[Y02​]+2k≥1∑​E[Y0​Yk​]

is strictly positive. Write Sn=∑i<nYiS_n=\sum_{i<n}Y_iSn​=∑i<n​Yi​ and σn2=E[Sn2]\sigma_n^2=E[S_n^2]σn2​=E[Sn2​]. Then the normalized squares are uniformly integrable:

{Sn2σn2:n≥1} is uniformly integrable.\Bigl\{\frac{S_n^2}{\sigma_n^2} : n\ge 1\Bigr\}\ \text{is uniformly integrable.}{σn2​Sn2​​:n≥1} is uniformly integrable.

Uniform integrability of the normalized squares is exactly the condition that, by the Cogburn–Denker–Mori–Yoshihara characterization for strongly mixing sequences, is equivalent to the central limit theorem Sn/σn→dN(0,1)S_n/\sigma_n\to_d N(0,1)Sn​/σn​→d​N(0,1). Isolating it turns Ibragimov's ρ\rhoρ-mixing central limit theorem into a purely moment-theoretic statement: everything else in that theorem is the identification of the limiting variance and the change of normalization from σn\sigma_nσn​ to n\sqrt nn​.

Formalization Note Sequences are indexed from 000, so Sn=Y0+⋯+Yn−1S_n=Y_0+\dots+Y_{n-1}Sn​=Y0​+⋯+Yn−1​; for the finitely many indices with σn=0\sigma_n=0σn​=0 the normalized quantity is read as 000. Uniform integrability is meant in the L1L^1L1 sense.

Preamble
import Definitions.Def_MixingCoefficients
import Mathlib.MeasureTheory.Function.UniformIntegrable

open MeasureTheory ProbabilityTheory Filter MarkovChainCLT
open scoped ENNReal NNReal Topology ProbabilityTheory
Formal statement
theorem MarkovChainCLT.uniformIntegrable_sq_partialSum_of_summable_rho
    {Ω : Type*} [MeasurableSpace Ω]
    (P : Measure Ω) [IsProbabilityMeasure P] (Y : ℕ → Ω → ℝ)
    (hY : ∀ n, Measurable (Y n)) (hstat : IsStrictlyStationary P Y)
    (hcent : ∫ ω, Y 0 ω ∂P = 0) (hL2 : MemLp (Y 0) 2 P)
    (hrho : Summable fun n => rhoMixingCoef P Y n)
    (hsum : Summable fun k : ℕ => ∫ ω, Y 0 ω * Y (k + 1) ω ∂P)
    (hvar : 0 < seqAsymptoticVariance P Y) :
    UniformIntegrable
      (fun (n : ℕ) ω => (∑ i ∈ Finset.range n, Y i ω) ^ 2
        / ∫ ω', (∑ i ∈ Finset.range n, Y i ω') ^ 2 ∂P) 1 P := by sorry
Source
G. L. Jones, "On the Markov Chain Central Limit Theorem", Probability Surveys 1 (2004) 299-320, arXiv math/0409112v2, Theorem 7 and eq. (12) (Ibragimov's rho-mixing CLT), read through the uniform-integrability characterization of Theorem 3 (arXiv v2 p. 9; R. Cogburn 1960, M. Denker 1986, T. Mori and K. Yoshihara 1986); original: I. A. Ibragimov, Theory of Probability and Its Applications 20 (1975).

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, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me