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.
Metropolis–Hastings flow is reversible and invariant
Statement
Assume AC and the hypotheses of Metropolis–Hastings kernel. Its output is a probability kernel, the joint measure is symmetric under , and is invariant for . Symmetry of this joint measure is reversibility. No irreducibility, uniqueness, convergence-rate, or central limit theorem conclusion is asserted.
Facts & Assumptions
Given: AC, a standard-Borel space, a target probability , a proposal probability kernel , and the Metropolis–Hastings construction.
The Axiom of Choice: AC states that every family of nonempty sets has a choice function.
Metropolis–Hastings kernel: the algorithm defines , where is a jointly measurable -valued version of the accepted-flow density and .
Measure kernel and probability kernel: a probability kernel is a measurable family of measures with mass one at every source point.
A prior and model kernel define a joint law: for a probability measure and probability kernel , the formula defines a probability measure and integrates nonnegative product-measurable functions by iterated integration.
The common submeasure and its bounded density: the accepted flow is the greatest measure dominated by both flows, and .
Measurability of integration against a kernel: integration of a nonnegative product-measurable function against a probability kernel is a measurable function of the source point.
Invariant and stationary distribution for a Markov kernel: is invariant for when for every measurable .
The product sigma-algebra and its finite iterates: measurable rectangles generate the product sigma-algebra, so the coordinate-swap map is measurable.
Every section of a product-measurable function is measurable: each section of a product-measurable function is measurable.
The indefinite integral of a nonnegative measurable function is a measure: for a nonnegative measurable , is a measure.
Nonnegative scalar multiples and countable weighted sums of measures are measures: a finite sum of measures with nonnegative coefficients is a measure.
General-state reversibility by symmetric flow measure: reversibility means that the joint flow measure is symmetric under coordinate swap.
General-state reversibility implies invariance: on any measurable state space, a probability kernel reversible with respect to a probability measure leaves that measure invariant.
Measures on sigma-algebras: a measure vanishes on the empty set and is countably additive on pairwise disjoint measurable sets.
Proof
Given: AC, , , and the procedure in [F1].
The acceptance function satisfies . For each , because is a probability measure. The function is measurable by [F5], so is measurable and takes values in .
For fixed , the accepted term is a measure by [F9], since the section is measurable by [F8]. The rejection term is a measure: for disjoint sets at most one can contain . Their sum is a measure by [F10], and its total mass is . For each fixed , the accepted term is measurable in by [F5], and the rejection term is measurable since and are measurable. Thus [F2] applies pointwise and is a probability kernel.
Define . For every measurable rectangle , . Since these rectangles generate by [F7], is measurable. By [F9], is a measure on ; it is finite because and . Define . It vanishes at the empty set, and preimages of disjoint sets under are disjoint; countable additivity of therefore makes a finite measure on the product sigma-algebra.
Step 2.1 has established that is a probability kernel, so [F3] now supplies the joint measure . Applying the same joint-law result to the input kernel gives the proposal flow and its iterated-integral identity. Thus, for every product-measurable , where the last equality uses from [F4].
The coordinate swap is measurable by [F7] and is an involution. Define . This is a measure: measurability of makes the preimages measurable, and preimages preserve the empty set and disjoint countable unions, so [F4, F13] give the measure properties. Since is the greatest measure dominated by both and , its transpose is also dominated by both: for every , and . Maximality gives ; transposing this inequality and using gives . Hence .
Since , step 2.2 gives for every product-measurable . Step 4.1 gives the same symmetry for , so the decomposition in step 3.1 yields for every . Thus the joint flow is symmetric, so is reversible by [F11].
Steps 2.1 and 5.1 prove that is a probability kernel reversible with respect to . The general-state result [F12] applies on this measurable space and gives for every . Thus is invariant in the sense of [F6].
Depends on
- The Axiom of Choice
- Measures on sigma-algebras
- Probability measures and probability spaces
- Measure kernel and probability kernel
- Invariant and stationary distribution for a Markov kernel
- The product sigma-algebra and its finite iterates
- General-state reversibility by symmetric flow measure
- General-state reversibility implies invariance
- Every section of a product-measurable function is measurable
- Measurability of integration against a kernel
- The indefinite integral of a nonnegative measurable function is a measure
- Nonnegative scalar multiples and countable weighted sums of measures are measures
- A prior and model kernel define a joint law
- The common submeasure and its bounded density
- Metropolis–Hastings kernel
Used by
- A proposal with disconnected support Example
- A three-state random-walk Metropolis kernel Example
- A two-state independence sampler Example
- Rejection creates a self-transition Example
- ABC Metropolis–Hastings preserves its augmented tolerance target Theorem
- MALA preserves its target probability exactly Theorem
- PMMH preserves the exact parameter posterior Theorem
- The Metropolized Hamiltonian chain preserves its target Theorem
Cited to discharge well-definedness by Metropolis–Hastings kernel.
Dependency tree · two levels
49 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
- Art B. Owen, Monte Carlo Theory, Methods and Examples, Ch. 11 §§11.3–11.4, printed pp. 15–20 (standard reference, not scraped)
- Gareth O. Roberts and Jeffrey S. Rosenthal, General State Space Markov Chains and MCMC Algorithms, §2 and Proposition 2, printed pp. 4–6 (standard reference, not scraped)