Alphabeta Math
CorollaryStatement: 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.

Common drift and minorization give containment under diminishing adaptation, strong aperiodicity, and a finite initial V-moment

Statement

Assume the adaptive MCMC setup and diminishing adaptation of Diminishing adaptation. Suppose the common target, set C, drift function V, and constants satisfy the hypotheses of Common drift and strongly aperiodic minorization give a uniform geometric bound, including the strong-aperiodicity condition νγ(C)=1 for every γ. If E[V(X0)]<∞, then containment holds for the initial law of (X0,Γ0), and the marginal laws converge to π in total variation.

Facts & Assumptions

Given: The adaptive transition rule, diminishing adaptation, common invariant target, shared geometric drift/minorization hypotheses, and finite initial V-moment.

[F1]

Diminishing adaptation: conditional on the history, Xn+1 has law PΓn(Xn,⋅) and Dn→0 in probability.

[F2]

Containment for adaptive MCMC: containment is boundedness in probability of Mϵ(Xn,Γn) uniformly over n.

[F3]

Small-set minorization and geometric drift: the pointwise common drift inequality is PγV≤λV+b1C.

[F4]

Common drift and strongly aperiodic minorization give a uniform geometric bound: there are common M<∞ and 0<ρ<1 with ∥Pγm(x,⋅)−π∥TV≤MV(x)ρm.

[F5]

Adaptive MCMC marginal convergence under diminishing adaptation with uniform ergodicity or containment: diminishing adaptation and containment imply marginal convergence in total variation.

[F6]

Monotone convergence for the integral: expectations of V∧r increase to the expectation of nonnegative V.

[F7]

Markov's inequality for random variables: for nonnegative Z and R>0, P(Z>R)≤EZ/R.

Proof

Given: The hypotheses and facts [F1]–[F5].

1.1F1F3F6givenalgebra

For each r, the conditional transition rule [F1] and the drift inequality [F3] give E[(V∧r)(Xn+1)∣Fn]≤λV(Xn)+b. Take expectations and let r→∞ by [F6]; assuming EV(Xn)<∞, this gives EV(Xn+1)≤λEV(Xn)+b. Starting from the finite initial moment and iterating yields sup⁡n≥0EV(Xn)≤EV(X0)+b1−λ=:K<∞.

2.1F2F4F7step 1.1given

Fix ϵ,δ>0. Choose R≥K/δ and then an integer N≥1 such that MRρN≤ϵ. Markov's inequality [F7] and the moment bound in step 1.1 give P(V(Xn)>R)≤δ for every n. On the complementary event [F4] gives ∥PΓnN(Xn,⋅)−π∥TV≤ϵ, so Mϵ(Xn,Γn)≤N. This proves containment as defined in [F2].

3.1F1F5step 2.1∎

Diminishing adaptation is [F1], and containment is step 2.1. The containment branch of [F5] therefore gives ∥L(Xn)−π∥TV→0.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

32 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