Let $P=(p_{ij})_{i,j\in E}$ denote the transition matrix of a Markov chain with finite state space $E$. Why does the following implication hold:
$$ \exists n\in\mathbb{N}: p_{ij}^{(n)}>0~\forall i,j\in E~~\implies P^n\text{ is irreducible for all }n\in\mathbb{N} $$
As far as I see $P^n$ irreducible for a $n\in\mathbb{N}$ means that for each pair $(i,j)$ there exists a $m\in\mathbb{N}$ such that $$ p_{ij}^{(mn)}>0? $$
If yes, then my idea would be that because of the assumption it is $p_{ij}^{(n)}>0$ and $p_{jj}^{(n)}>0$ so that $$ p_{ij}^{(mn)}\geq \underbrace{p_{ij}^{(n)}\cdot p_{jj}^{(n)}\cdot\ldots\cdot p_{jj}^{(n)}}_{\text{m-times}}>0, $$ so that for each pair $(i,j)$ there is a $m\in\mathbb{N}$ such that $p_{ij}^{(mn)}>0$.
Does this make sense or is it nonsense?
Consider the following transition matrix: $$P=\left(\begin{array}{cc}0 & 1 \\ 1 & 0 \end{array} \right) $$
Here I would say $P$ is irreducible but $P^2$ is not. More generally, $P^k$ is irreducible if $k$ is odd but not if $k$ is even. Do you agree, or am I missing something?
All of this is to say the RHS of your statement is false here but the LHS is true ($n=1$ works), so I would seem to have contradicted the statement. What am I missing?
I'm not sure what you're up to with the $m$'s. Could you add a little more text to motivate your operations?