Lemma 12.1 -- basic spectral facts for stochastic matrices
ProvedMarkovMixing.eigenvalue_basicLet be a stochastic matrix on a finite state space (nonnegative entries, rows summing to one). A real number is an eigenvalue of when there is a nonzero function — an eigenfunction — with , where . Recall that is irreducible when every state can reach every other in some number of steps, and aperiodic when the return times to each state have greatest common divisor one.
The theorem (Lemma 12.1 of Levin–Peres–Wilmer) asserts:
- every eigenvalue of satisfies ;
- if is irreducible, every function with is constant — the eigenspace of the eigenvalue is one-dimensional;
- if is irreducible and aperiodic, then is not an eigenvalue of .
These are the basic facts that position the spectrum inside with a simple eigenvalue and excluded, so that the spectral gap of an irreducible aperiodic chain is genuinely positive — the starting point of the spectral theory of Chapters 12–13.
import Definitions.Def_mm_spectral
namespace MarkovMixing
/-- **Lemma 12.1** (LPW): (i) every eigenvalue of a transition matrix has
`|λ| ≤ 1`; (ii) for an irreducible chain the eigenfunctions of eigenvalue `1`
are the constants; (iii) an irreducible aperiodic chain does not have `−1`
as an eigenvalue. -/
theorem eigenvalue_basic {V : Type*} [Fintype V] [DecidableEq V]
(P : Matrix V V ℝ) (hP : IsStochastic P) :
(∀ lam : ℝ, IsEigenvalue P lam → |lam| ≤ 1) ∧
(Irreducible P → ∀ f : V → ℝ, P.mulVec f = f → ∀ x y : V, f x = f y) ∧
(Irreducible P → Aperiodic P → ¬IsEigenvalue P (-1)) := by
sorry
end MarkovMixing
Read-back
What the Lean code literally says, in plain math · claude-fable-5
Read-back: eigenvalue_basic
Let be an arbitrary finite type with decidable equality (the empty type is allowed), and let be a matrix of real numbers assumed to be stochastic in the following sense: every entry satisfies , and every row sums to one, for all . Under this single hypothesis the theorem asserts the conjunction of the following three statements.
(1) For every real number , if is an eigenvalue of — meaning there exists a function that is not identically zero and satisfies the matrix–vector equation , i.e. for all — then . (Only real eigenvalues with a real eigenvector are covered by this eigenvalue notion; complex eigenvalues are not mentioned.)
(2) If is irreducible — here meaning: for every pair of states there exists a natural number (the value is allowed, in which case is the identity matrix) with — then every function satisfying (that is, for all ; no non-vanishing condition is imposed on ) is constant: for all .
(3) If is irreducible (in the sense of (2)) and aperiodic, then is not an eigenvalue of in the sense of (1); that is, there is no nonzero real function with . Here aperiodic means: for every state , the period of equals , where the period of is defined as the supremum (in , where the supremum of an empty or unbounded set is the junk value ) of the set of natural numbers that divide every element of the return set . Note that if the return set of some is empty, every vacuously divides all its elements, the divisor set is unbounded, and the period of that is , so such a chain is not aperiodic under this definition.
Edge cases: when is empty, part (1) and part (3) hold vacuously (no nonzero exists), and part (2)'s conclusion quantifies over no states; also, for empty the row-sum condition in the stochasticity hypothesis is vacuous. The three parts are asserted simultaneously as one conjunction, each with only the hypotheses listed for it.
Confirmed by the mission captain (proposal self-audit).