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 , drift function , and constants satisfy the hypotheses of Common drift and strongly aperiodic minorization give a uniform geometric bound, including the strong-aperiodicity condition for every . If , then containment holds for the initial law of , 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 -moment.
Diminishing adaptation: conditional on the history, has law and in probability.
Containment for adaptive MCMC: containment is boundedness in probability of uniformly over .
Small-set minorization and geometric drift: the pointwise common drift inequality is .
Common drift and strongly aperiodic minorization give a uniform geometric bound: there are common and with .
Adaptive MCMC marginal convergence under diminishing adaptation with uniform ergodicity or containment: diminishing adaptation and containment imply marginal convergence in total variation.
Monotone convergence for the integral: expectations of increase to the expectation of nonnegative .
Markov's inequality for random variables: for nonnegative and , .
Proof
Given: The hypotheses and facts [F1]–[F5].
For each , the conditional transition rule [F1] and the drift inequality [F3] give . Take expectations and let by [F6]; assuming , this gives . Starting from the finite initial moment and iterating yields
Fix . Choose and then an integer such that . Markov's inequality [F7] and the moment bound in step 1.1 give for every . On the complementary event [F4] gives , so . This proves containment as defined in [F2].
Diminishing adaptation is [F1], and containment is step 2.1. The containment branch of [F5] therefore gives .
Depends on
- Containment for adaptive MCMC
- Diminishing adaptation
- Invariant and stationary distribution for a Markov kernel
- Small-set minorization and geometric drift
- Markov's inequality for random variables
- Common drift and strongly aperiodic minorization give a uniform geometric bound
- Monotone convergence for the integral
- Adaptive MCMC marginal convergence under diminishing adaptation with uniform ergodicity or containment
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
- Gareth O. Roberts and Jeffrey S. Rosenthal, Coupling and Ergodicity of Adaptive MCMC (standard reference, not scraped)
- Gersende Fort, Adaptive MCMC: theory and methods, Warwick lecture notes (standard reference, not scraped)