I have a matrix $A \in \mathbb{R}^{n \times n}$ such that its elements are all non-negative values.
I know that for any $k$, $A^k$ has elements on the diagonal which are smaller or equal to 1.
Can I show that the largest eigenvalue of $A$ is smaller than 1? I am pretty sure that's true, but I am not completely sure.