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.
Positive and null recurrence of a state
Definition
Let a Markov chain with transition matrix and a fixed deterministic initial state be specified, and use for its law. Let
be the first strictly positive return time of Hitting, return, and visit times; it never counts the initial visit at time zero and may equal . A state that is recurrent, that is (Recurrent and transient states), is
- positive recurrent when , and
- null recurrent when .
The expectation is the extended nonnegative integral of the -valued random variable , so it always exists in and the two cases are exhaustive and mutually exclusive for a recurrent state. A state that is transient is in neither subclass, since its return probability is strictly less than one. A finite mean forces almost-sure finiteness: if a nonnegative integer-valued random variable is infinite with positive probability, its extended expectation is . The classification is stated for a fixed specified law ; no simultaneous selection of laws for all states is asserted here.
Depends on
Used by
- A null recurrent chain has no stationary probability Counterexample
- Positive recurrence without aperiodicity does not imply total-variation convergence Counterexample
- Empirical state frequencies converge to stationary masses Example
- Ergodic theorem for an irreducible positive-recurrent Markov chain Theorem
- Positive recurrence and stationary probability for irreducible countable chains Theorem
Dependency tree · two levels
5 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.5 (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)