Null recurrent chains:
ProvedMarkovMixing.null_recurrent_convergenceLet be an irreducible Markov chain on a countable state space (nonnegative entries, rows summing to one as convergent series, every state reaching every other), and suppose the chain is null recurrent: some state is recurrent — return is certain, — but not positive recurrent — the expected return time diverges. (Simple random walk on or is the standard example.)
The theorem (Theorem 21.17 of Levin–Peres–Wilmer) asserts: for all states ,
A null recurrent chain visits every state infinitely often, yet at any late fixed time it is nowhere in particular: the mass spreads out and no stationary profile is approached — consistent with this mission's equivalence, since a stationary distribution would force positive recurrence. Together with the positive-recurrent convergence theorem, this completes the trichotomy: transient chains escape, null recurrent chains return but diffuse away, positive recurrent chains converge to their stationary distribution.
import Definitions.Def_mm_countable
namespace MarkovMixing
/-- **Theorem 21.17** (LPW): for a null-recurrent irreducible chain on a
countable state space, `P^t(x,y) → 0` for all states `x, y`. -/
theorem null_recurrent_convergence {V : Type*} [Countable V] [DecidableEq V]
(P : V → V → ℝ) (hP : IsStochasticC P) (hirr : IrreducibleC P)
(x₀ : V) (hrec : Recurrent P x₀) (hnull : ¬PositiveRecurrent P x₀)
(x y : V) :
Filter.Tendsto (fun t => stepPow P t x y) Filter.atTop (nhds 0) := by
sorry
end MarkovMixing