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.
The common-density Metropolis–Hastings ratio
Statement
Assume AC. Let be standard Borel (Standard Borel spaces) and let be a sigma-finite positive measure (Finite, sigma-finite, and semifinite measures) on it. Let the target probability have a finite-valued nonnegative measurable density , and suppose the proposal kernel has a finite-valued nonnegative jointly measurable density , so and for every and . Let be the forward proposal flow and let be its transpose. Put There is a jointly measurable version of given by The version chosen by Metropolis–Hastings kernel agrees with this common-density version -almost everywhere; values on a forward-flow null set do not alter the accepted flow.
Facts & Assumptions
Given: AC, a standard-Borel space, a sigma-finite , a probability target with density , and a probability proposal kernel with jointly measurable density as in the statement.
The Axiom of Choice: AC says every family of nonempty sets has a choice function.
Metropolis–Hastings kernel: the forward flow is , and the algorithm chooses a jointly measurable -valued version of , where is the greatest common submeasure.
A prior and model kernel define a joint law: a probability target and probability kernel define a probability measure on the product sigma-algebra, and integration of a nonnegative product-measurable function against it is iterated integration.
The product sigma-algebra and its finite iterates and For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique: exists, has the rectangle formula, and is sigma-finite.
Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system: two measures agree on the product sigma-algebra if they agree on its generating rectangles and on an increasing finite-measure exhaustion of rectangles.
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: nonnegative product-measurable functions on may be integrated in either order.
Arithmetic and lattice operations preserve measurability whenever they are defined and Extended-real-valued measurable functions: finite products, minima, finite sums, scalar multiples, and threshold sets of measurable functions are measurable.
Coordinate maps and permutations are measurable on finite products and Composition with a Borel measurable outer map preserves measurability: the coordinate swap is measurable, as are compositions of measurable maps.
The common submeasure of two finite densities: if two finite flows have nonnegative densities with respect to the same sigma-finite measure , their greatest common submeasure has density with respect to .
Every nonnegative measurable function is the increasing limit of simple measurable functions and Monotone convergence for the integral: nonnegative measurable functions are increasing limits of simple functions, and those limits pass through nonnegative integrals.
Integrating against a Radon-Nikodym derivative recovers integration against the measure: for simple and a measure with density , ; applying [F9] extends this identity to nonnegative measurable integrands.
The Radon-Nikodym derivative as an almost-everywhere equivalence class and A sigma-finite signed measure that is absolutely continuous with respect to a sigma-finite positive measure has a unique almost-everywhere density: a Radon–Nikodym derivative is an almost-everywhere class, and two measurable densities for the same measure agree almost everywhere.
Proof
Given: The hypotheses in the statement and the accepted-flow construction.
Put . The lift is product-measurable because the preimage of each Borel set is the rectangle . Each section is measurable: for fixed , the class of all with is a sigma-algebra containing every measurable rectangle, so it contains . Since and are product-measurable, [F6] makes their product measurable, and [F5] makes measurable, where the equality is the given density identity for . The density identity for and [F10], first for simple functions and then for by [F9] and monotone convergence, give Substituting the expression for and applying Tonelli [F5] yields Thus is a density of the forward probability flow with respect to .
Let and define . By [F7], is measurable, so is a measure. On a rectangle , using the product-measure convention . Choose increasing measurable with . The rectangles increase to and have equal finite measure for and . Measurable rectangles form a generating pi-system, so [F3]–[F4] give . For every nonnegative product-measurable , the identity holds first for indicators from , then for simple functions by finite addition, and for all such by [F9]. Applying it to yields Hence is the reverse-flow density.
Apply [F8] to the finite probability measures and the sigma-finite reference measure . Their greatest common submeasure has density , so
Define on and on . It takes values in . For a real , ; for , for the set is empty. Each set is measurable by [F6], so is jointly measurable. By its definition, everywhere. For any , choose nonnegative simple . The simple density identity [F10] gives ; monotone convergence on both sides then gives Thus is a version of .
On , algebra gives On its specified value is , which is permissible because . The algorithm's chosen derivative and are two versions of the same Radon–Nikodym derivative, so [F11] makes them equal -almost everywhere. This proves the common-density ratio and the forward-zero convention without asserting pointwise uniqueness on null sets.
Depends on
- The Axiom of Choice
- Measures on sigma-algebras
- Probability measures and probability spaces
- Measure kernel and probability kernel
- Standard Borel spaces
- Finite, sigma-finite, and semifinite measures
- The product sigma-algebra and its finite iterates
- Extended-real-valued measurable functions
- The Radon-Nikodym derivative as an almost-everywhere equivalence class
- A sigma-finite signed measure that is absolutely continuous with respect to a sigma-finite positive measure has a unique almost-everywhere density
- For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique
- Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
- Arithmetic and lattice operations preserve measurability whenever they are defined
- Composition with a Borel measurable outer map preserves measurability
- Coordinate maps and permutations are measurable on finite products
- Every nonnegative measurable function is the increasing limit of simple measurable functions
- Monotone convergence for the integral
- Integrating against a Radon-Nikodym derivative recovers integration against the measure
- A prior and model kernel define a joint law
- The common submeasure and its bounded density
- The common submeasure of two finite densities
- Metropolis–Hastings kernel
Used by
- Metropolis-adjusted Langevin algorithm (MALA) Algorithm
- A proposal with disconnected support Example
- A three-state random-walk Metropolis kernel Example
- A two-state independence sampler Example
- MALA corrects the Gaussian ULA proposal with a Hastings ratio Example
- Rejection creates a self-transition Example
- MALA preserves its target probability exactly Theorem
Dependency tree · two levels
79 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)