Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1.13 -- expected hitting times of an irreducible chain are finite

Proved
MarkovMixing.summable_hitting_tails

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

markov-chainsmixing-timesprobability

For an irreducible chain and any states x,zx,zx,z, the expected first hitting time Ex(τz+)\mathbb{E}_x(\tau_z^+)Ex​(τz+​) is finite. Formally: the tail probabilities Px{τz+>t}\mathbb{P}_x\{\tau_z^+>t\}Px​{τz+​>t}, expressed as finite sums of trajectory weights, form a summable family in ttt -- their sum being the expectation by the tail-sum formula EY=∑t≥0P{Y>t}\mathbb{E}Y=\sum_{t\ge0}\mathbb{P}\{Y>t\}EY=∑t≥0​P{Y>t}.

Preamble
import Definitions.Def_mm_path
Formal statement
namespace MarkovMixing

/-- **Lemma 1.13** (LPW): for an irreducible chain, `E_x(τ⁺_z) < ∞` for all
states `x, z` — formalized as summability of the tail probabilities
`P_x{τ⁺_z > t}`, whose sum is the expectation. -/
theorem summable_hitting_tails {V : Type*} [Fintype V] [DecidableEq V]
    (P : Matrix V V ℝ) (hP : IsStochastic P) (hirr : Irreducible P) (x z : V) :
    Summable (fun t : ℕ => avoidTailProb P x z 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 1.5.2, Lemma 1.13, p. 11

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