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 implies invariance
Statement
Let be a measurable space, a probability kernel (Measure kernel and probability kernel) on it, and a probability measure (Probability measures and probability spaces) on it. If is reversible with respect to in the sense of General-state reversibility by symmetric flow measure, then is invariant for : for every ,
Facts & Assumptions
Given: A measurable space , a pointwise probability kernel , and a probability measure for which the joint flow measure is symmetric.
The joint flow measure is the probability measure on the product sigma-algebra defined by , and reversibility means under coordinate swap. (General-state reversibility by symmetric flow measure)
The joint-law construction also gives, for every nonnegative product- measurable , ; in particular its rectangle formula holds. (A prior and model kernel define a joint law)
A probability is invariant for exactly when for every measurable . (Invariant and stationary distribution for a Markov kernel)
A probability kernel has probability-measure rows and measurable event evaluations, and a probability measure has total mass one. (Measure kernel and probability kernel, Probability measures and probability spaces)
Proof
Given: The hypotheses in the statement.
Proof technique: Apply the nonnegative kernel-Tonelli identity to the two marginals of the symmetric joint flow measure.
Fix . By [F2] on , whose section at each is , , a nonnegative integral bounded by one.
Symmetry [F1] and give .
The rectangle formula [F2] gives , since each kernel row has mass one by [F4].
Steps 1.1, 1.2, and 1.3 give for arbitrary , which is invariance by [F3]. The proof uses only nonnegative indicators, with no density, countability, or standard-Borel hypothesis.
Depends on
Used by
Dependency tree · two levels
18 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)