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 kernel
Definition
Assume AC. The Metropolis–Hastings procedure takes as input a standard-Borel space (Standard Borel spaces), a target probability measure (Probability measures and probability spaces), and a probability kernel from to itself (Measure kernel and probability kernel).
-
On the product sigma-algebra (The product sigma-algebra and its finite iterates), form the proposal-flow measure (Measures on sigma-algebras) on by This is a probability measure by A prior and model kernel define a joint law. Let and set .
-
Set , the greatest measure dominated by both flows. Put , which is a finite measure by Nonnegative scalar multiples and countable weighted sums of measures are measures, and choose nonnegative measurable representatives and with everywhere after modification on a -null set. Define This is a jointly measurable version of taking values in .
-
For , compute the integrated acceptance probability and rejection probability .
-
Return the transition rule The second term retains every rejected proposal as a self-transition.
The item The common submeasure and its bounded density proves the common-submeasure construction and density-version claims in step 2.
Remarks
An RN derivative is an almost-everywhere equivalence class, not a distinguished pointwise function (The Radon-Nikodym derivative as an almost-everywhere equivalence class). The explicit convention in step 2 selects a measurable version. Changing that version on a -null set leaves the accepted joint flow unchanged, though it can change for a -null set of starting states. The theorem Metropolis–Hastings flow is reversible and invariant ↗ proves that is a probability kernel and that is invariant; the procedure alone does not assert irreducibility, uniqueness, convergence, a rate, or a CLT.
Depends on
- The Axiom of Choice
- Measures on sigma-algebras
- Standard Borel spaces
- Probability measures and probability spaces
- Measure kernel and probability kernel
- Nonnegative scalar multiples and countable weighted sums of measures are measures
- The product sigma-algebra and its finite iterates
- The Radon-Nikodym derivative as an almost-everywhere equivalence class
- Measurability of integration against a kernel
- A prior and model kernel define a joint law
- The common submeasure and its bounded density
Used by
- ABC Metropolis–Hastings on simulator-augmented states Algorithm
- Leapfrog Hamiltonian Monte Carlo Algorithm
- Metropolis-adjusted Langevin algorithm (MALA) Algorithm
- Particle marginal Metropolis–Hastings Algorithm
- Hamiltonian Monte Carlo Definition
- A positive-tolerance ABC-MH stationary law can differ from the exact-data posterior Example
- A proposal with disconnected support Example
- A three-state random-walk Metropolis kernel Example
- A two-state independence sampler Example
- ABC acceptance probability vanishes with the tolerance Example
- Rejection creates a self-transition Example
- The common-density Metropolis–Hastings ratio Lemma
- ABC Metropolis–Hastings preserves its augmented tolerance target Theorem
- MALA preserves its target probability exactly Theorem
- Metropolis–Hastings flow is reversible and invariant Theorem
- PMMH preserves the exact parameter posterior Theorem
- The Metropolized Hamiltonian chain preserves its target Theorem
Dependency tree · two levels
41 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.4, printed pp. 16–20 (standard reference, not scraped)
- Gareth O. Roberts and Jeffrey S. Rosenthal, General State Space Markov Chains and MCMC Algorithms, §2.1 and Proposition 2, printed pp. 4–6 (standard reference, not scraped)