Theorem

A TPM is regular if has all positive entries for some .

A regular chain is necessarily irreducible and aperiodic.

Proof of Irreducibility

Definition: A chain is irreducible if all states communicate (). This means for any two states and , it is possible to go from to and from to .

  1. By the definition of a regular chain, there exists some such that for all .
  2. Since , state is accessible from state ().
  3. Similarly, since , state is accessible from state ().
  4. Because every state can reach every other state, they all belong to the same communicating class.
  5. Conclusion: The chain is irreducible.

Proof of Aperiodicity

Definition: A state is aperiodic if its period . The period is the GCD of all such that .

  1. In a regular chain, for all states . This means is one possible time the process can return to state .
  2. If has no zero elements, then will also have no zero elements for all .
    • Why? . To get from to in steps, take one step to some intermediate state , then steps to . Since is all positive, a path always exists.
  3. This implies that if , then as well.
  4. The period must be a common divisor of and .
  5. The only positive integer that divides two consecutive integers ( and ) is 1.
  6. Conclusion: for all states, so the chain is aperiodic.

Summary

  • Irreducible because “all positive entries” means you can get anywhere from anywhere
  • Aperiodic because “all positive entries” means you can return to a state at any time , breaking any fixed “rhythm” or period