How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Aperiodicity separates ordinary convergence from ergodic averages
Remark
The three convergence results of this page do not assume the same hypotheses, and the difference is exactly aperiodicity. This remark records the comparison; it proves nothing new and asserts no convergence statement beyond the three results it compares. The AC assumptions of those results are retained.
- Convergence to stationarity for irreducible aperiodic positive-recurrent chains assumes, besides countability and the existence of an invariant probability , that is irreducible and aperiodic, and concludes that the ordinary-time laws converge, for every starting state .
- Cesaro convergence for irreducible positive-recurrent chains assumes only irreducibility and positive recurrence, with no aperiodicity hypothesis, and concludes the weaker Cesàro statement for every pair .
- Ergodic theorem for an irreducible positive-recurrent Markov chain makes the same irreducibility-and-positive-recurrence assumption on the process rather than on the -step laws, and concludes the almost-sure pathwise statement for every -integrable and every deterministic start.
Why aperiodicity cannot simply be dropped
The ordinary-time conclusion of the first result is genuinely false without its aperiodicity hypothesis, and the companion page computes two obstructions with no aperiodicity and no randomness:
- the deterministic two-state alternation with is irreducible on a finite state space, hence positive recurrent, with ; from state its law is at even times and at odd times, so for every and the sequence of laws does not converge at all;
- the deterministic directed three-cycle is irreducible with uniform and for every .
In both cases the failure has the same cause: the positive return times of a state are contained in a proper arithmetic progression with , so the -step law keeps cycling through the residue classes of modulo instead of settling. The two ergodic-average results are unaffected, because averaging over all samples every residue class with asymptotic frequency ; for the two examples just named the Cesàro averages equal for every divisible by the period and converge to in general, and the empirical frequencies of the visited states converge to , which is the stationary mass of each state.
Aperiodicity is needed for the ordinary-time convergence theorem from every deterministic start; it is not needed for the Cesàro or almost-sure ergodic averages. A stationary start is a different assertion: if the initial law is , then , equivalently , for every , even for a periodic chain (Invariant initial law makes a Markov chain stationary). This marginal identity does not assert for a deterministic start .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
31 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Durrett, Probability: Theory and Examples, fifth edition, §5.6 (standard reference, not scraped)
- Levin, Peres and Wilmer, Markov Chains and Mixing Times, second edition, §21.3 and Appendix C.1 (standard reference, not scraped)