Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The coordinate process of a chain started from an invariant measure is strictly stationary

Proved
MarkovChainCLT.isStrictlyStationary_chainMeasure

by LukeBernese · Aug 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

markov-chainmixingprobabilitystationarity

Let PPP be a Markov kernel with invariant probability measure π\piπ. Then the coordinate process Yi(ω)=ωiY_i(\omega) = \omega_iYi​(ω)=ωi​ on path space, under the law Pπ\mathbb{P}_\piPπ​ of the chain started from π\piπ, is strictly stationary: for every kkk, the shifted sequence (Yk,Yk+1,Yk+2,… )(Y_k, Y_{k+1}, Y_{k+2}, \dots)(Yk​,Yk+1​,Yk+2​,…) has the same law, as a random element of XN\mathsf{X}^{\mathbb{N}}XN, as (Y0,Y1,Y2,… )(Y_0, Y_1, Y_2, \dots)(Y0​,Y1​,Y2​,…).

Why this is the form actually needed. Strict stationarity — equality of the laws of the whole shifted sequence, not just equality of finite-dimensional marginals one at a time — is the standing hypothesis of the classical central limit theorems for dependent sequences: Ibragimov and Linnik's theorem for strongly mixing sequences, Ibragimov's for ρ\rhoρ-mixing, Billingsley's for ϕ\phiϕ-mixing, and Doukhan–Massart–Rio. Each of these is stated for a strictly stationary sequence, and the way they are applied to a Markov chain is: start the chain from π\piπ, observe that the coordinate process is then strictly stationary, and feed it in. This theorem is that observation.

It is also what makes the mixing coefficients of the chain well defined as functions of the lag alone: the definitions of α(n)\alpha(n)α(n), ρ(n)\rho(n)ρ(n) and ϕ(n)\phi(n)ϕ(n) take a supremum over the split point kkk, and it is stationarity that makes the quantity being supremised independent of kkk.

Proof. By induction on kkk from the one-step shift-invariance σ∗Pπ=Pπ\sigma_*\mathbb{P}_\pi = \mathbb{P}_\piσ∗​Pπ​=Pπ​. For k=0k = 0k=0 there is nothing to prove. For the step, the (k+1)(k{+}1)(k+1)-shift factors as the kkk-shift composed with σ\sigmaσ, so pushing forward along it is pushing forward along σ\sigmaσ first — which leaves Pπ\mathbb{P}_\piPπ​ unchanged — and then along the kkk-shift, which is the induction hypothesis.

Preamble
import Definitions.Def_MarkovChainPathMeasure
import Definitions.Def_MixingCoefficients
import Mathlib.Probability.Kernel.Invariance

open MeasureTheory ProbabilityTheory Filter
open scoped ENNReal NNReal Topology ProbabilityTheory
open MarkovChainCLT
Formal statement
theorem MarkovChainCLT.isStrictlyStationary_chainMeasure {X : Type*} [MeasurableSpace X]
    (P : Kernel X X) [IsMarkovKernel P] (π : Measure X) [IsProbabilityMeasure π]
    (hinv : Kernel.Invariant P π) :
    IsStrictlyStationary (chainMeasure P π) (fun i (ω : ℕ → X) => ω i) := by sorry
Source
S. P. Meyn and R. L. Tweedie, Markov Chains and Stochastic Stability, 2nd ed., Cambridge 2009, Ch. 10 (invariant measures and stationarity); O. Kallenberg, Foundations of Modern Probability, 2nd ed., Springer 2002, Ch. 8; G. L. Jones, "On the Markov Chain Central Limit Theorem", Probability Surveys 1 (2004) 299-320, Section 3.

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me