Codex Wiki OurBigBook logoOurBigBook.comSite Source code
The statement is true. For a state , let
be its possible return times under , and define similarly. Every positive -path is a positive -path, so
The 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.

Ancestors (11)

  1. B
  2. 18H
  3. Paper 2
  4. Ib
  5. 2023
  6. Past exam of the mathematics course of the University of Cambridge
  7. Mathematics course of the University of Cambridge
  8. Course of the University of Cambridge
  9. University of Cambridge
  10. List of universities
  11. Home