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.
Communication is an equivalence relation
Statement
For a countable transition matrix on , communication is an equivalence relation on , and its equivalence classes partition .
Facts & Assumptions
Given: A countable state space and its transition matrix .
Accessibility means exactly when for some . Accessibility, communication, and irreducibility
Communication is mutual accessibility: means and . Accessibility, communication, and irreducibility
The zero-step row satisfies , so each state is accessible from itself. Accessibility, communication, and irreducibility
Proof
By [F3], , hence and for every . The definition in [F2] is symmetric in , so communication is symmetric.
Suppose and . By [F1], choose with and . The nonnegative series in [F4] contains the term at , so . Thus . The argument permits either witness length to be zero.
If and , then gives by step 1.2, and gives by the same step. Therefore , proving transitivity of communication.
Define . Reflexivity makes each contain , so these classes cover . If , symmetry and transitivity give ; then every member of either class belongs to the other, so . Thus distinct classes are disjoint and the classes partition .
If , there are no states or classes and the assertion is vacuous. If has one state, step 1.1 gives its sole class. Absorbing or otherwise degenerate rows cause no exception: the proof uses only zero-step identity and positive accessibility witnesses. No global choice is made; for each fixed triple in step 1.2, the two existential witnesses are used locally.
Depends on
Used by
Dependency tree · two levels
8 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
- Levin, Peres and Wilmer, Markov Chains and Mixing Times, second edition (standard reference, not scraped)