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

Finite-block perturbation bound for adaptive MCMC

Statement

Let (Xn,Γn) be an adaptive MCMC process with adaptation sizes Dn as in Diminishing adaptation. For integers n≥0 and N≥1, define the frozen-kernel mixture Qn,N by Qn,N(A):=E ⁣[PΓnN(Xn,A)](A∈X). Then Qn,N is a probability measure and ∥L(Xn+N)−Qn,N∥TV≤∑i=0N−1∑j=0i−1E[Dn+j], where the inner sum is 0 for i=0.

Facts & Assumptions

Given: The jointly measurable probability-kernel family and adaptive process in Diminishing adaptation, with its stated one-step conditional law and measurable Dn.

[F1]

Diminishing adaptation: conditional on Fm, Xm+1 has law PΓm(Xm,⋅) and Dm=sup⁡x∥PΓm+1(x,⋅)−PΓm(x,⋅)∥TV.

[F2]

Total variation duality, kernel contraction, and coupling bound: total variation is the supremum over measurable [0,1]-valued tests, and a test integral difference is bounded by the total variation distance of its laws.

[F3]

Measurability of integration against a kernel: integration of a product-measurable function against a probability kernel is measurable.

[F4]

Monotone convergence for the integral: increasing nonnegative measurable functions converge under integration.

Proof

Given: [F1]–[F3] and the hypotheses in the Statement.

1.1F1F3given

Fix f:X→[0,1] measurable. For i=0,…,N, set gi=PΓnN−if, so gN=f. Joint kernel measurability and [F3] make each gi measurable in (Γn,x) and 0≤gi≤1. Also gi=PΓngi+1.

2.1F1step 1.1algebra

The conditional transition rule [F1] and the identity in step 1.1 give E[f(Xn+N)]−E[PΓnNf(Xn)]=∑i=0N−1E ⁣[(PΓn+i−PΓn)gi+1(Xn+i)]. Indeed, each summand is the difference between E[gi+1(Xn+i+1)] and E[gi(Xn+i)], and these differences telescope from i=0 through N−1.

3.1F1F2F4step 2.1algebra∎

By [F2] and the triangle inequality applied pointwise to successive kernels, ∣(PΓn+i−PΓn)gi+1(Xn+i)∣≤∑j=0i−1Dn+j. Both sides are measurable, by step 1.1 and the assumed measurability of the Dm. Taking expectations bounds the absolute value of the ith summand in step 2.1 by ∑j=0i−1E[Dn+j]. Summing gives the displayed bound for every such f; take the supremum using [F2]. For pairwise disjoint Aℓ, countable additivity of each PΓnN(Xn,⋅) and [F4] give Qn,N(⋃ℓAℓ)=∑ℓQn,N(Aℓ) by monotone convergence; also Qn,N(X)=1. Thus Qn,N 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