Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The evolving-set identity Pt(x,y)=π(y)π(x)P{x}{y∈St}P^t(x,y)=\frac{\pi(y)}{\pi(x)}\mathbb P_{\{x\}}\{y\in S_t\}Pt(x,y)=π(x)π(y)​P{x}​{y∈St​}

Proved
MarkovMixing.evolving_sets_identity

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

markov-chainsmixing-timesprobability

Let PPP be a Markov chain on a finite state space VVV with strictly positive stationary distribution π\piπ, and write Q(S,y)=∑x∈Sπ(x)P(x,y)Q(S,y)=\sum_{x\in S}\pi(x)P(x,y)Q(S,y)=∑x∈S​π(x)P(x,y) for the stationary flow from a set SSS into a state yyy. The evolving-set process of Morris and Peres is the Markov chain on subsets of VVV that, from the current set SSS, draws uuu uniform on (0,1](0,1](0,1] and passes to the superlevel set {y:Q(S,y)/π(y)≥u}\{y:Q(S,y)/\pi(y)\ge u\}{y:Q(S,y)/π(y)≥u}; its transition probability from SSS to TTT is the length of the interval of thresholds uuu realizing TTT.

The theorem (Lemma 17.12 of Levin–Peres–Wilmer) asserts that the set process contains the original chain: for all states x,yx,yx,y and every time ttt,

Pt(x,y)  =  π(y)π(x)  P{x}{y∈St},P^t(x,y)\;=\;\frac{\pi(y)}{\pi(x)}\;\mathbb P_{\{x\}}\bigl\{y\in S_t\bigr\},Pt(x,y)=π(x)π(y)​P{x}​{y∈St​},

where the right-hand probability is over the evolving-set process started from the singleton {x}\{x\}{x} — the sum of its ttt-step transition probabilities into the sets containing yyy.

Every question about ttt-step transition probabilities is thereby a question about how the random set grows and shrinks. Combined with the martingale property of π(St)\pi(S_t)π(St​) (the companion lemma), this identity is what converts martingale estimates on sets into the mixing and return-probability bounds of this mission.

Preamble
import Definitions.Def_mm_martingale
Formal statement
namespace MarkovMixing

/-- **Lemma 17.12** (LPW): the transition probabilities of the chain are
recovered from the evolving-set process by
`P^t(x,y) = (π(y)/π(x)) P_{{x}}{y ∈ S_t}`. -/
theorem evolving_sets_identity {V : Type*} [Fintype V] [DecidableEq V]
    (P : Matrix V V ℝ) (hP : IsStochastic P)
    (π : V → ℝ) (hπ : IsStationary P π) (hpos : ∀ x : V, 0 < π x)
    (x y : V) (t : ℕ) :
    (P ^ t) x y = π y / π x *
      ∑ T ∈ Finset.univ.filter (fun T : Finset V => y ∈ T),
        ((evolvingSets P π) ^ t) {x} T := 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 17.4, Lemma 17.12, Eq. (17.14), p. 236

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