Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Metropolis–Hastings flow is reversible and invariant

Statement

Assume AC and the hypotheses of Metropolis–Hastings kernel. Its output P is a probability kernel, the joint measure JP(dx,dy)=π(dx)P(x,dy) is symmetric under (x,y)↦(y,x), and π is invariant for P. 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 Q, and the Metropolis–Hastings construction.

[A1]

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

[F1]

Metropolis–Hastings kernel: the algorithm defines P(x,A)=∫1A(y)α(x,y)Q(x,dy)+1A(x)r(x), where α is a jointly measurable [0,1]-valued version of the accepted-flow density and r(x)=1−∫α(x,y)Q(x,dy).

[F2]

Measure kernel and probability kernel: a probability kernel is a measurable family of measures with mass one at every source point.

[F3]

A prior and model kernel define a joint law: for a probability measure π and probability kernel K, the formula J(C)=∫K(x,Cx) π(dx) defines a probability measure and integrates nonnegative product-measurable functions by iterated integration.

[F4]

The common submeasure and its bounded density: the accepted flow η=μ∧μT is the greatest measure dominated by both flows, and α μ=η.

[F5]

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.

[F6]

Invariant and stationary distribution for a Markov kernel: π is invariant for P when ∫P(x,A) π(dx)=π(A) for every measurable A.

[F7]

The product sigma-algebra and its finite iterates: measurable rectangles generate the product sigma-algebra, so the coordinate-swap map is measurable.

[F8]

Every section of a product-measurable function is measurable: each section of a product-measurable function is measurable.

[F9]

The indefinite integral of a nonnegative measurable function is a measure: for a nonnegative measurable h, A↦∫Ah dν is a measure.

[F10]

Nonnegative scalar multiples and countable weighted sums of measures are measures: a finite sum of measures with nonnegative coefficients is a measure.

[F11]

General-state reversibility by symmetric flow measure: reversibility means that the joint flow measure JP(dx,dy)=π(dx)P(x,dy) is symmetric under coordinate swap.

[F12]

General-state reversibility implies invariance: on any measurable state space, a probability kernel reversible with respect to a probability measure leaves that measure invariant.

[F13]

Measures on sigma-algebras: a measure vanishes on the empty set and is countably additive on pairwise disjoint measurable sets.

Proof

Given: AC, π, Q, and the procedure in [F1].

1.1F1F5given

The acceptance function satisfies 0≤α≤1. For each x, 0≤a(x):=∫α(x,y)Q(x,dy)≤1 because Q(x,⋅) is a probability measure. The function a is measurable by [F5], so r(x)=1−a(x) is measurable and takes values in [0,1].

2.1F1F2F5F8F9F10step 1.1algebra

For fixed x, the accepted term A↦∫1A(y)α(x,y)Q(x,dy) is a measure by [F9], since the section y↦α(x,y) is measurable by [F8]. The rejection term A↦r(x)1A(x) is a measure: for disjoint sets at most one can contain x. Their sum is a measure by [F10], and its total mass is a(x)+r(x)=1. For each fixed A, the accepted term is measurable in x by [F5], and the rejection term is measurable since r and 1A are measurable. Thus [F2] applies pointwise and P is a probability kernel.

2.2F7F9step 1.1given

Define δ(x)=(x,x). For every measurable rectangle A×B, δ−1(A×B)=A∩B∈X. Since these rectangles generate X⊗X by [F7], δ is measurable. By [F9], ζ(D):=∫Dr dπ is a measure on (X,X); it is finite because 0≤r≤1 and π(X)=1. Define R(C):=ζ(δ−1C)=∫1C(x,x)r(x) π(dx). It vanishes at the empty set, and preimages of disjoint sets under δ are disjoint; countable additivity of ζ therefore makes R a finite measure on the product sigma-algebra.

3.1A1F1F3F4step 2.1step 2.2

Step 2.1 has established that P is a probability kernel, so [F3] now supplies the joint measure JP. Applying the same joint-law result to the input kernel Q gives the proposal flow μ and its iterated-integral identity. Thus, for every product-measurable C, JP(C)=∫ ⁣∫1C(x,y)α(x,y)Q(x,dy) π(dx)+R(C)=∫Cα dμ+R(C)=η(C)+R(C), where the last equality uses α μ=η from [F4].

4.1F4F7F13step 3.1construct

The coordinate swap τ(x,y)=(y,x) is measurable by [F7] and is an involution. Define ηT(C):=η(τ−1C). 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 μT, its transpose is also dominated by both: for every C, ηT(C)≤μT(C) and ηT(C)≤μ(C). Maximality gives ηT≤η; transposing this inequality and using τ2=id gives η≤ηT. Hence ηT=η.

5.1F7F11step 2.2step 3.1step 4.1algebra

Since τ∘δ=δ, step 2.2 gives R(C)=R(τ−1C) for every product-measurable C. Step 4.1 gives the same symmetry for η, so the decomposition in step 3.1 yields JP(C)=JP(τ−1C) for every C. Thus the joint flow is symmetric, so P is reversible by [F11].

6.1F2F6F12step 2.1step 5.1∎

Steps 2.1 and 5.1 prove that P is a probability kernel reversible with respect to π. The general-state result [F12] applies on this measurable space and gives ∫P(x,A) π(dx)=π(A) for every A∈X. Thus π is invariant in the sense of [F6].

Depends on

Used by

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