Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 (X,X) 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 p:X→[0,∞), and suppose the proposal kernel has a finite-valued nonnegative jointly measurable density q:X×X→[0,∞), so π(A)=∫Ap dλ and Q(x,A)=∫Aq(x,y) dλ(y) for every x and A. Let μ(dx,dy)=π(dx)Q(x,dy) be the forward proposal flow and let μT be its transpose. Put m(x,y)=p(x)q(x,y),mT(x,y)=p(y)q(y,x). There is a jointly measurable version αcd of d(μ∧μT)/dμ given by αcd(x,y)={min⁡{1,p(y)q(y,x)p(x)q(x,y)},m(x,y)>0,1,m(x,y)=0. 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 p, and a probability proposal kernel Q with jointly measurable density q as in the statement.

[A1]

The Axiom of Choice: AC says every family of nonempty sets has a choice function.

[F1]

Metropolis–Hastings kernel: the forward flow is μ(C)=∫Q(x,Cx) π(dx), and the algorithm chooses a jointly measurable [0,1]-valued version of dη/dμ, where η=μ∧μT is the greatest common submeasure.

[F2]

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.

[F4]

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.

[F5]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: nonnegative product-measurable functions on Λ may be integrated in either order.

[F6]

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.

[F7]

Coordinate maps and permutations are measurable on finite products and Composition with a Borel measurable outer map preserves measurability: the coordinate swap τ(x,y)=(y,x) is measurable, as are compositions of measurable maps.

[F8]

The common submeasure of two finite densities: if two finite flows have nonnegative densities m,mT with respect to the same sigma-finite measure Λ, their greatest common submeasure has density h=min⁡{m,mT} with respect to Λ.

[F9]

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.

[F10]

Integrating against a Radon-Nikodym derivative recovers integration against the measure: for simple s and a measure μ with density m, ∫s dμ=∫sm dΛ; applying [F9] extends this identity to nonnegative measurable integrands.

[F11]

Proof

Given: The hypotheses in the statement and the accepted-flow construction.

1.1F2F3F5F6F9F10given

Put Λ=λ⊗λ. The lift (x,y)↦p(x) is product-measurable because the preimage of each Borel set B is the rectangle p−1(B)×X. Each section Cx is measurable: for fixed x, the class of all D⊆X2 with Dx∈X is a sigma-algebra containing every measurable rectangle, so it contains X⊗X. Since q and 1C are product-measurable, [F6] makes their product measurable, and [F5] makes H(x):=∫X1C(x,y)q(x,y) λ(dy)=Q(x,Cx) measurable, where the equality is the given density identity for Q(x,⋅). The density identity for π and [F10], first for simple functions and then for H by [F9] and monotone convergence, give μ(C)=∫XH(x) π(dx)=∫XH(x)p(x) λ(dx). Substituting the expression for H and applying Tonelli [F5] yields μ(C)=∫X ⁣∫X1C(x,y)p(x)q(x,y) λ(dy)λ(dx)=∫Cm dΛ. Thus m is a density of the forward probability flow with respect to Λ.

2.1F3F4F7F9step 1.1

Let τ(x,y)=(y,x) and define ΛT(C)=Λ(τ−1C). By [F7], τ is measurable, so ΛT is a measure. On a rectangle A×B, ΛT(A×B)=λ(B)λ(A)=λ(A)λ(B)=Λ(A×B), using the product-measure convention 0⋅∞=0. Choose increasing measurable Xn↑X with λ(Xn)<∞. The rectangles Xn×Xn increase to X2 and have equal finite measure for ΛT and Λ. Measurable rectangles form a generating pi-system, so [F3]–[F4] give ΛT=Λ. For every nonnegative product-measurable u, the identity ∫τ−1Cu dΛ=∫Cu∘τ dΛ holds first for indicators from ΛT=Λ, then for simple functions by finite addition, and for all such u by [F9]. Applying it to u=m yields μT(C)=μ(τ−1C)=∫Cm(y,x) dΛ. Hence mT(x,y)=p(y)q(y,x) is the reverse-flow density.

3.1A1F2F3F8step 1.1step 2.1

Apply [F8] to the finite probability measures μ,μT and the sigma-finite reference measure Λ. Their greatest common submeasure η=μ∧μT has density h=min⁡{m,mT}, so η(C)=∫Ch dΛ(C∈X⊗X).

4.1F6F8F9F10givenstep 3.1

Define αcd=h/m on {m>0} and αcd=1 on {m=0}. It takes values in [0,1]. For a real c<0, {αcd>c}=X2; for 0≤c<1, {αcd>c}={m=0}∪({m>0}∩{h−cm>0}); for c≥1 the set is empty. Each set is measurable by [F6], so αcd is jointly measurable. By its definition, αcdm=h everywhere. For any C, choose nonnegative simple sn↑αcd1C. The simple density identity [F10] gives ∫sn dμ=∫snm dΛ; monotone convergence on both sides then gives ∫Cαcd dμ=∫Cαcdm dΛ=∫Ch dΛ=η(C). Thus αcd is a version of dη/dμ.

5.1F1F8F11step 4.1∎

On {m>0}, algebra gives αcd=min⁡{m,mT}m=min⁡{1,p(y)q(y,x)p(x)q(x,y)}. On {m=0} its specified value is 1, which is permissible because μ({m=0})=∫{m=0}m dΛ=0. The algorithm's chosen derivative and αcd 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

Used by

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