Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.18 -- the reflection principle on Z\mathbb{Z}Z

Proved
MarkovMixing.reflection_principle

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

markov-chainsmixing-timesprobability

For simple random walk on Z\mathbb{Z}Z started at k>0k>0k>0 and any j>0j>0j>0: walks of length rrr that touch 000 before time rrr and end at jjj are equinumerous with walks ending at −j-j−j, and walks that touch 000 and end positive are equinumerous with walks ending negative. Stated as exact equalities of counts of ±1\pm1±1 step sequences, which is equivalent to the probabilistic statement since all 2r2^r2r sequences are equally likely.

Preamble
import Definitions.Def_mm_classical
Formal statement
namespace MarkovMixing

/-- **Lemma 2.18** (LPW), the reflection principle for simple random walk on
`ℤ`: for positive `j, k` and horizon `r`, walks from `k` that touch `0` before
time `r` and end at `j` are equinumerous with walks from `k` ending at `-j`;
consequently walks touching `0` and ending positive are equinumerous with
walks ending negative.  (All `2^r` sign sequences being equally likely, these
counting identities are exactly (2.20) and (2.21).) -/
theorem reflection_principle (r : ℕ) (k j : ℤ) (hk : 0 < k) (hj : 0 < j) :
    ((Finset.univ.filter fun ω : Fin r → Bool =>
        (∃ s < r, srwPos k ω s = 0) ∧ srwPos k ω r = j).card =
      (Finset.univ.filter fun ω : Fin r → Bool => srwPos k ω r = -j).card) ∧
    ((Finset.univ.filter fun ω : Fin r → Bool =>
        (∃ s < r, srwPos k ω s = 0) ∧ 0 < srwPos k ω r).card =
      (Finset.univ.filter fun ω : Fin r → Bool => srwPos k ω r < 0).card) := 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 2.7, Lemma 2.18 (Eqs. (2.20)-(2.21)), pp. 30-31

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