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 with uniform target , let and for , where . Starting from , choose the deterministic schedule . 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.
Measure kernel and probability kernel: the displayed rows define probability kernels.
Invariant and stationary distribution for a Markov kernel: invariance means .
Total variation distance for probability laws: total variation is the supremum of setwise probability differences.
Diminishing adaptation: is the supremum over states of successive-kernel total variation distances.
Containment for adaptive MCMC: containment requires boundedness in probability of the current fixed-kernel convergence times, uniformly over iteration .
Verification
Given: [F1]–[F5] and the Example.
Each row of is a probability vector, and for fixed and the evaluation is affine in . Hence the family is jointly measurable on the stated finite discrete state space and Borel parameter space. Also . The same projection identity gives so for each fixed . Thus all individual kernels are ergodic for the common invariant target.
The difference of two successive rows is , so .
Let and . The law recursion gives . Since and , the elementary bound for yields . Hence , so the marginal law does not converge to .
For , the formula in step 1.1 shows for both states as . Thus for every finite , the probability of 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.