Proposition 2.13 -- irreducibility of a group walk
ProvedMarkovMixing.group_walk_irreducible_iffmarkov-chainsmixing-timesprobability
The random walk on a finite group with increment distribution is irreducible if and only if the support generates .
Preamble
import Definitions.Def_mm_basic
Formal statement
namespace MarkovMixing
/-- **Proposition 2.13** (LPW): the random walk on a finite group with
increment distribution `μ` is irreducible if and only if the support of `μ`
generates the group. -/
theorem group_walk_irreducible_iff {G : Type*} [Group G] [Fintype G]
[DecidableEq G] (μ : G → ℝ) (hμ : IsDist μ) :
Irreducible (groupWalk μ) ↔ Subgroup.closure {g : G | 0 < μ g} = ⊤ := 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.6.1, Proposition 2.13, p. 28