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

Diminishing adaptation

Definition

Let (X,X) and (Γ,G) be nonempty measurable spaces (Measurable spaces and measurable sets). Let π be a probability measure on (X,X), and let (Pγ)γ∈Γ be a jointly measurable family of probability kernels on X: for every A∈X, (γ,x)↦Pγ(x,A) is G⊗X-measurable and each Pγ is a probability kernel (Measure kernel and probability kernel). Assume that π is invariant for every fixed kernel, meaning πPγ=π (Invariant and stationary distribution for a Markov kernel).

An adaptive MCMC process is a pair of measurable processes (Xn,Γn)n≥0 with Xn∈X, Γn∈Γ, and natural filtration Fn=σ(X0,Γ0,…,Xn,Γn), such that for every A∈X, P(Xn+1∈A∣Fn)=PΓn(Xn,A)a.s. The update rule for Γn+1 may depend on the history through time n+1; it is required only to make Γn+1 a measurable random variable.

For n≥0, define the adaptation size Dn:=sup⁡x∈X∥PΓn+1(x,⋅)−PΓn(x,⋅)∥TV, where total variation uses the convention ∥μ−ν∥TV=sup⁡A∈X∣μ(A)−ν(A)∣ (Total variation distance for probability laws). Assume each Dn is measurable; it lies in [0,1]. The process has diminishing adaptation if Dn→0 in probability as n→∞. This condition does not require Γn to converge.

Depends on

Used by

Dependency tree · two levels

17 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