Define a steady-state vector for a transition matrix $T$ as a probability vector $v$ such that $Tv = v$ ($1$ is the eigenvalue for $v$).
Define a transition matrix $T$ as regular if there exist a $k \ge 1$ such that each entry of $T^k$ is non-zero.
Consider the following theorem:
Suppose $T$ is a regular transition matrix such that $x_k = T^kx_0$ (a discrete dynamic system), then there is a unique steady-state vector $v$ such that $Tv = v$. Furthermore, if $x_0$ is any probability vector: $$\lim_{k\to\infty} x_k = \lim_{k\to\infty} T^kx_0 = v$$
Here's the confusion:
Suppose $\lambda$ is an eigenvalue for the $x_0$ mentioned above, then $$T^kx_0 = \lambda^kx_0 \Rightarrow \lim_{k\to\infty} T^kx_0 = \lim_{k\to\infty} \lambda^kx_0$$ Suppose we have real entries and real eigenvalues, then we have few cases:
1) $\lim_{k\to\infty} \lambda^k = \pm\infty$ when $\lambda > 1$ or $\lambda < -1$
2) $\lim_{k\to\infty} \lambda^k = 0$ when $ -1 < \lambda < 1$
3) $\lim_{k\to\infty} \lambda^k = 1$ when $\lambda = 1$
4) $\lim_{k\to\infty}$ oscillate between $1$ and $-1$ when $\lambda = -1$
It seems to me that, besides the trivial case of 3), none of these cases can produce $\lim_{k\to\infty} \lambda^kx_0 = v$. Since $v$ is a unique steady-state vector, in the other $3$ cases, $v$ becomes $0$, $\pm\infty$, or oscillate between $x_0$ and $-x_0$.
I think I'm missing something but I don't know what it is. Can someone care to explain what I'm missing?
If the matrix $T$ is a transition matrix and your assuming $x_0$ is a probability vector and an eingenvector associated to the eingenvalue $\lambda$, $x_0$ must be the steady-state vector $v$ associated with the aingenvalue $\lambda=1$.