Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1.22 -- the time reversal of a chain

Proved
MarkovMixing.time_reversal

by Shuze Chen · Aug 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

markov-chainsmixing-timesprobability

For an irreducible chain with stationary distribution π\piπ, the time reversal P^(x,y)=π(y)P(y,x)/π(x)\hat P(x,y)=\pi(y)P(y,x)/\pi(x)P^(x,y)=π(y)P(y,x)/π(x) is a stochastic matrix, π\piπ is stationary for P^\hat PP^, and started from π\piπ the reversed chain traverses every trajectory with the same probability as the original chain traverses the reversed trajectory:

π(x0)P(x0,x1)⋯P(xt−1,xt)=π(xt)P^(xt,xt−1)⋯P^(x1,x0).\pi(x_0)P(x_0,x_1)\cdots P(x_{t-1},x_t)=\pi(x_t)\hat P(x_t,x_{t-1})\cdots\hat P(x_1,x_0).π(x0​)P(x0​,x1​)⋯P(xt−1​,xt​)=π(xt​)P^(xt​,xt−1​)⋯P^(x1​,x0​).
Preamble
import Definitions.Def_mm_path
Formal statement
namespace MarkovMixing

/-- **Proposition 1.22** (LPW): for an irreducible chain with stationary
distribution `π`, the time reversal `P̂` is a stochastic matrix, `π` is
stationary for `P̂`, and started from `π` the chain run through `P̂` traverses
every trajectory with the same probability as the original chain traverses the
reversed trajectory. -/
theorem time_reversal {V : Type*} [Fintype V] [DecidableEq V]
    (P : Matrix V V ℝ) (hP : IsStochastic P) (hirr : Irreducible P)
    (π : V → ℝ) (hπ : IsStationary P π) :
    IsStochastic (timeReversal P π) ∧ IsStationary (timeReversal P π) π ∧
    ∀ (t : ℕ) (ω : Fin (t + 1) → V),
      π (ω 0) * pathWeight P ω =
        π (ω (Fin.last t)) * pathWeight (timeReversal P π) (fun i => ω i.rev) := by
  sorry

end MarkovMixing
Source
D. A. Levin, Y. Peres, E. L. Wilmer, Markov Chains and Mixing Times, AMS 2009, https://documents.epfl.ch/groups/i/ip/ipg/www/2013-2014/Random_Walks/markovmixing.pdf, Section 1.6, Proposition 1.22, p. 15

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