Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck passjudge 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 with loss of containment

Example

On (X,X)=({0,1},2{0,1}) with uniform target π, let (Γ,G)=((0,1],B((0,1])) and Pγ=(1−γ)I+γΠ for γ∈Γ, where Π(x,⋅)=π(⋅). Starting from X0=0, choose the deterministic schedule Γn=2−n−2. Every fixed kernel is ergodic for π and adaptation diminishes, but the adaptive marginal does not converge to π; containment fails.

Facts & Assumptions

Given: The two-state space, uniform target, refresh kernels, deterministic schedule, and initial state in the Example.

[F1]

Measure kernel and probability kernel: the displayed rows define probability kernels.

[F2]

Invariant and stationary distribution for a Markov kernel: invariance means πPγ=π.

[F3]

Total variation distance for probability laws: total variation is the supremum of setwise probability differences.

[F4]

Diminishing adaptation: Dn is the supremum over states of successive-kernel total variation distances.

[F5]

Containment for adaptive MCMC: containment requires boundedness in probability of the current fixed-kernel convergence times, uniformly over iteration n.

Verification

Given: [F1]–[F5] and the Example.

1.1F1F2F3givenalgebra

Each row of Pγ is a probability vector, and for fixed x and A the evaluation Pγ(x,A) is affine in γ. Hence the family is jointly measurable on the stated finite discrete state space and Borel parameter space. Also πPγ=(1−γ)π+γπ=π. The same projection identity Π2=Π gives Pγm(x,⋅)=(1−γ)mδx+(1−(1−γ)m)π, so ∥Pγm(x,⋅)−π∥TV=(1−γ)m/2→0 for each fixed γ. Thus all individual kernels are ergodic for the common invariant target.

1.2F3F4givenalgebra

The difference of two successive rows is (Γn+1−Γn)(π−δx), so Dn=∣Γn+1−Γn∣/2→0.

1.3F2F3givenalgebra

Let r0=1 and rn=∏j=0n−1(1−Γj). The law recursion μn+1=μnPΓn gives μn=rnδ0+(1−rn)π. Since ∑jΓj=1/2 and Γj≤1/4, the elementary bound log⁡(1−u)≥−2u for 0≤u≤1/2 yields rn≥exp⁡(−2∑jΓj)=e−1. Hence ∥μn−π∥TV=rn/2≥e−1/2, so the marginal law does not converge to π.

2.1F3F5step 1.1given∎

For ϵ=1/4, the formula in step 1.1 shows Mϵ(x,Γn)→∞ for both states as Γn→0. Thus for every finite N, the probability of Mϵ(Xn,Γn)≤N is eventually zero, contradicting containment in [F5].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

13 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.