Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-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 kernel

Definition

Assume AC. The Metropolis–Hastings procedure takes as input a standard-Borel space (X,X) (Standard Borel spaces), a target probability measure π (Probability measures and probability spaces), and a probability kernel Q from (X,X) to itself (Measure kernel and probability kernel).

  1. On the product sigma-algebra (The product sigma-algebra and its finite iterates), form the proposal-flow measure μ (Measures on sigma-algebras) on X×X by μ(C)=∫XQ(x,Cx) π(dx),Cx={y:(x,y)∈C}. This is a probability measure by A prior and model kernel define a joint law. Let τ(x,y)=(y,x) and set μT(C)=μ(τ−1C).

  2. Set η=μ∧μT, the greatest measure dominated by both flows. Put λ0=μ+μT, which is a finite measure by Nonnegative scalar multiples and countable weighted sums of measures are measures, and choose nonnegative measurable representatives f=dμ/dλ0 and g=dμT/dλ0 with f+g=1 everywhere after modification on a λ0-null set. Define α(x,y)={min⁡{1,g(x,y)/f(x,y)},f(x,y)>0,1,f(x,y)=0. This is a jointly measurable version of dη/dμ taking values in [0,1].

  3. For x∈X, compute the integrated acceptance probability a(x)=∫Xα(x,y) Q(x,dy) and rejection probability r(x)=1−a(x).

  4. Return the transition rule P(x,A)=∫X1A(y)α(x,y) Q(x,dy)+1A(x)r(x),A∈X. 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 P(x,⋅) for a π-null set of starting states. The theorem Metropolis–Hastings flow is reversible and invariant ↗ proves that P is a probability kernel and that π is invariant; the procedure alone does not assert irreducibility, uniqueness, convergence, a rate, or a CLT.

Depends on

Used by

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