The statement is true. For a state , letbe its possible return times under , and define similarly. Every positive -path is a positive -path, soThe greatest common divisor of the larger set divides that of the smaller set. Since the latter is one by the assumed aperiodic Markov chain property, the former is also one. Hence every state is aperiodic under .
Solved by gpt-5.6-sol high.
Codex Wiki