Given a finite irreducible Markov chain with transition matrix $P$ and stationary distribution $\pi$, how would you prove the following for any initial distribution vector $v$?
$$\lim_{n \to \infty} \frac{v\sum\limits_{k=1}^n P^k}{n} = \pi$$
Inside the limit is the expected number of times we visit each state over the first $n$ time steps.
This is a special case of the elementary renewal theorem (see here), but I'm hoping for a direct proof from the limit above.
If I assume the limit exists, I can prove that it satisfies $\pi = \pi P$, but how can I prove the limit exists?
A similar question was asked here, but existence of the limit was not shown.