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.
General-state reversibility by symmetric flow measure
Definition
Let be a measurable space, let be a probability kernel on it, meaning that is a probability measure for each and is measurable for each (Measure kernel and probability kernel), and let be a probability measure, that is a countably additive measure of total mass one (Probability measures and probability spaces). The product sigma-algebra is generated by measurable rectangles (The product sigma-algebra and its finite iterates). The joint flow measure of is the probability measure on given, for each , by
Existence, countable additivity, and the nonnegative iterated-integral identity for this measure follow from A prior and model kernel define a joint law. Let be the coordinate-swap map. It is measurable because the preimage of a measurable rectangle is and such rectangles generate the product sigma-algebra. Define the transpose measure by .
The kernel is reversible with respect to when This definition uses equality of measures and requires no density, standard Borel assumption, or prior assumption that is invariant.
Depends on
Used by
- A systematic composition of reversible kernels need not be reversible Counterexample
- A finite reversible two-state Markov kernel Example
- A symmetric random walk on the circle Example
- A uniformly ergodic adaptive refresh family Example
- Geometric ergodicity and reversibility give exponential rho-mixing Lemma
- General-state reversibility implies invariance Theorem
- Metropolis–Hastings flow is reversible and invariant Theorem
- Sufficient MCMC CLT regimes Theorem
Dependency tree · two levels
17 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
- Gareth O. Roberts and Jeffrey S. Rosenthal, General State Space Markov Chains and MCMC Algorithms, Probability Surveys 1 (2004) (standard reference, not scraped)
- Sean P. Meyn and Richard L. Tweedie, Markov Chains and Stochastic Stability (1993), Chapter 10 (standard reference, not scraped)