In this question, $A$ is a given irreducible matrix. Suppose that $\forall i \in \llbracket 1, n \rrbracket, a_{i,i} > 0$. Show that $A^{n-1} > 0$ (so $A$ is primitive). Reason in terms of paths in $A$.
In this question, $A$ is a given irreducible matrix.
Suppose that $\forall i \in \llbracket 1, n \rrbracket, a_{i,i} > 0$. Show that $A^{n-1} > 0$ (so $A$ is primitive). Reason in terms of paths in $A$.