Jump to content

Column stochastic matrix/Positive row/Convergence/Fact/Proof

Proof

Let w∈ℝn be the stationary distribution, which is uniquely determined because of fact  (3). We set

U={(u1⋮un)∣∑i=1nui=0}⊆ℝn.

This is a linear subspace of ℝn of dimension n−1. Due to fact  (2), w has only non-negative entries; therefore, it does not belong to U. Because of

∑i=1n(Mu)i=∑i=1n(∑j=1naijuj)=∑j=1nuj(∑i=1naij)=∑j=1nuj,

U is invariant under the matrix M. Hence,

V=ℝw⊕U

is a direct sum decomposition into invariant linear subspaces. For every u∈U with ∣∣u∣∣sum=1, we have

∣∣Mu∣∣sum<1

due to fact  (2). The sphere of radius 1 is compact with respect to every norm; therefore, the induced maximum norm of M|U is smaller than 1. Because of fact and fact, the sequence Mnu converges for every u∈U to the zero vector.

Let now v∈V be a distribution vector; because of

∑i=1nvi=1=∑i=1nwi,

we can write

v=w+u

with u∈U. Because of

Mmv=Mm(w+u)=Mmw+Mmu=w+Mmu,

and the reasoning before, this sequence converges to w.