Lemma 1.13 -- expected hitting times of an irreducible chain are finite
ProvedMarkovMixing.summable_hitting_tailsmarkov-chainsmixing-timesprobability
For an irreducible chain and any states , the expected first hitting time is finite. Formally: the tail probabilities , expressed as finite sums of trajectory weights, form a summable family in -- their sum being the expectation by the tail-sum formula .
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