Corollary 1.17 (uniqueness) -- at most one stationary distribution
OpenMarkovMixing.stationary_uniqueAn irreducible chain has at most one stationary distribution: if and are both probability distributions fixed by ( and ), then .
import Definitions.Def_mm_basic
namespace MarkovMixing
/-- **Corollary 1.17** (LPW), uniqueness part: an irreducible chain has at most
one stationary distribution. -/
theorem stationary_unique {V : Type*} [Fintype V] [DecidableEq V]
(P : Matrix V V ℝ) (hP : IsStochastic P) (hirr : Irreducible P)
(π π' : V → ℝ) (hπ : IsStationary P π) (hπ' : IsStationary P π') :
π = π' := by
sorry
end MarkovMixing
Read-back
What the Lean code literally says, in plain math · claude-fable-5
Let be an arbitrary finite type (possibly empty) with decidable equality, and let be a matrix with real entries. Assume: (i) is "stochastic" in the sense that every entry is nonnegative, for all , and every row sums to one, for all ; (ii) is "irreducible" in the sense that for every ordered pair there exists a natural number with — note that is allowed, and since is the identity matrix, the condition is automatically satisfied whenever , so this hypothesis only constrains pairs with ; (iii) are two functions each of which is "stationary" for , meaning that each is a probability distribution on (all values nonnegative and , likewise for ) and each is a fixed point of acting on row vectors from the left, i.e. for every , and likewise for . The conclusion is that as functions on , i.e. for every . (If is empty, the normalization reads , so the stationarity hypotheses are unsatisfiable and the statement holds vacuously; no aperiodicity assumption appears anywhere in the statement.)
Confirmed by the mission captain (proposal self-audit).