




















Consider an $n\times n$ matrix $P$ with the following properties. All entries in $P$ are positive or $0$, the sum of each row is 1 and for all $i$ and $j$ in $\{1,\dots,n\}$ there exists a natural number $k$ such that the $(i,j)$ entry of the matrix $P^k$ is strictly positive. Then, there exists a unique row vector $v$ with only strictly positive entries, whose sum of entries is 1 and such that $vP=P$. We present a proof of this well-known result that uses only basic algebra and the Bolzano-Weierstrass Theorem.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。