Prove2Me
Navigate
MissionsFormalpediaUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Disintegration of the chain law over its first k+1k+1k+1 coordinates

Proved
MarkovChainCLT.chainMeasure_eq_comp_traj

by LukeBernese · Aug 15, 2026 · Mathlib c5ea003 (Lean v4.30.0)

disintegrationionescu-tulceamarkov-chainpath-spaceprobability

Let PPP be a Markov kernel with initial distribution λ\lambdaλ, and let Pλ\mathbb{P}_\lambdaPλ​ be the resulting law on path space. Then for every kkk,

Pλ  =  trajk∘(frk)∗Pλ,\mathbb{P}_\lambda \;=\; \mathrm{traj}_k \circ \bigl(\mathrm{fr}_k\bigr)_*\mathbb{P}_\lambda,Pλ​=trajk​∘(frk​)∗​Pλ​,

where frk(ω)=(ω0,…,ωk)\mathrm{fr}_k(\omega) = (\omega_0,\dots,\omega_k)frk​(ω)=(ω0​,…,ωk​) and trajk\mathrm{traj}_ktrajk​ is the kernel sending an initial segment to the law of the trajectory continuing from it.

What it says. The law of the chain is recovered by drawing its first k+1k+1k+1 coordinates from their own marginal and then continuing with trajk\mathrm{traj}_ktrajk​. This is the disintegration of the path measure over the past up to time kkk — the precise sense in which trajk\mathrm{traj}_ktrajk​ is the conditional law of the trajectory given (X0,…,Xk)(X_0,\dots,X_k)(X0​,…,Xk​), and the form in which conditioning is actually applied.

Why it is needed. Mixing estimates all have the shape: fix a past event AAA and a future event BBB, condition on the first k+1k+1k+1 coordinates, and compare the conditional probability of BBB with its stationary value. The conditioning step is exactly this identity. Once it is available, a past event — which by the identification of the past σ\sigmaσ-algebra is a pullback frk−1(A0)\mathrm{fr}_k^{-1}(A_0)frk−1​(A0​) — becomes a function of the integration variable in the outer integral, while a future event is handled inside trajk(u)\mathrm{traj}_k(u)trajk​(u) by the restart property. Without the disintegration the two identifications have nothing to act on.

Proof. Two observations, both at the level of kernels. First, the marginal: pushing the trajectory kernel forward along frk\mathrm{fr}_kfrk​ gives partialTraj(0,k)\mathrm{partialTraj}(0,k)partialTraj(0,k) precomposed with the embedding of a point as a length-one segment, so (frk)∗Pλ=Q∘λ(\mathrm{fr}_k)_*\mathbb{P}_\lambda = Q \circ \lambda(frk​)∗​Pλ​=Q∘λ for that kernel QQQ. Second, the decomposition: Mathlib's traj0=trajk∘partialTraj(0,k)\mathrm{traj}_0 = \mathrm{traj}_k \circ \mathrm{partialTraj}(0,k)traj0​=trajk​∘partialTraj(0,k) together with the fact that precomposition commutes with composition on the right gives trajk∘Q=\mathrm{traj}_k \circ Q = trajk​∘Q= the trajectory kernel of the chain. Associativity of composition with a measure then turns trajk∘(Q∘λ)\mathrm{traj}_k \circ (Q \circ \lambda)trajk​∘(Q∘λ) into (trajk∘Q)∘λ=Pλ(\mathrm{traj}_k \circ Q) \circ \lambda = \mathbb{P}_\lambda(trajk​∘Q)∘λ=Pλ​.

No hypothesis on λ\lambdaλ beyond being a probability measure is needed; in particular the chain need not be started from an invariant measure.

Preamble
import Definitions.Def_MarkovChainPathMeasure

open Filter Finset Function MeasurableEquiv MeasurableSpace MeasureTheory Preorder ProbabilityTheory
open scoped ENNReal NNReal Topology
open MarkovChainCLT
Formal statement
theorem MarkovChainCLT.chainMeasure_eq_comp_traj {X : Type*} [MeasurableSpace X]
    (P : Kernel X X) [IsMarkovKernel P] (lam : Measure X) [IsProbabilityMeasure lam] (k : ℕ) :
    chainMeasure P lam
      = (Kernel.traj (X := fun _ : ℕ => X) (BanditAlgorithm.markovChainStep P) k)
          ∘ₘ ((chainMeasure P lam).map (frestrictLe (π := fun _ : ℕ => X) k)) := by sorry
Source
C. T. Ionescu Tulcea, "Mesures dans les espaces produits", Atti Accad. Naz. Lincei Rend. 7 (1949) 208-211; O. Kallenberg, Foundations of Modern Probability, 2nd ed., Springer 2002, Ch. 6 and Ch. 8; S. P. Meyn and R. L. Tweedie, Markov Chains and Stochastic Stability, 2nd ed., Cambridge 2009, Ch. 3.

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