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.
Finite-block perturbation bound for adaptive MCMC
Statement
Let be an adaptive MCMC process with adaptation sizes as in Diminishing adaptation. For integers and , define the frozen-kernel mixture by Then is a probability measure and where the inner sum is for .
Facts & Assumptions
Given: The jointly measurable probability-kernel family and adaptive process in Diminishing adaptation, with its stated one-step conditional law and measurable .
Diminishing adaptation: conditional on , has law and .
Total variation duality, kernel contraction, and coupling bound: total variation is the supremum over measurable -valued tests, and a test integral difference is bounded by the total variation distance of its laws.
Measurability of integration against a kernel: integration of a product-measurable function against a probability kernel is measurable.
Monotone convergence for the integral: increasing nonnegative measurable functions converge under integration.
Proof
Given: [F1]–[F3] and the hypotheses in the Statement.
Fix measurable. For , set , so . Joint kernel measurability and [F3] make each measurable in and . Also .
The conditional transition rule [F1] and the identity in step 1.1 give Indeed, each summand is the difference between and , and these differences telescope from through .
By [F2] and the triangle inequality applied pointwise to successive kernels, . Both sides are measurable, by step 1.1 and the assumed measurability of the . Taking expectations bounds the absolute value of the th summand in step 2.1 by . Summing gives the displayed bound for every such ; take the supremum using [F2]. For pairwise disjoint , countable additivity of each and [F4] give by monotone convergence; also . Thus is a probability measure.
Depends on
Used by
Dependency tree · two levels
26 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)