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.
Geometric and uniform ergodicity for MCMC CLTs
Definition
Let be a probability kernel with invariant probability on a measurable space . Write for its -step transition probability and use for probability measures.
The chain is geometrically ergodic if there are a measurable finite function and such that
It is uniformly ergodic if this bound holds with bounded on . These are convergence-rate properties, not conclusions about a particular function's CLT or long-run variance. If a proof needs , that integrability is an additional stated hypothesis unless a cited theorem establishes it.
Depends on
Used by
- A total-variation rate bounds strong-mixing coefficients Lemma
- Geometric ergodicity and reversibility give exponential rho-mixing Lemma
- Harris geometric ergodicity admits an integrable total-variation envelope Lemma
- Uniform ergodicity bounds the uniform-mixing coefficient Lemma
- Zero-variance geometric Markov sums have a uniform strong rate Lemma
- Strong consistency of overlapping batch means Theorem
- Strong invariance principle for geometrically ergodic chains Theorem
- Sufficient MCMC CLT regimes Theorem
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
- Galin L. Jones, On the Markov Chain Central Limit Theorem, §2 (standard reference, not scraped)
- Gareth O. Roberts and Jeffrey S. Rosenthal, General State Space Markov Chains and MCMC Algorithms, §§3–4 (standard reference, not scraped)