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.
Uniform ergodicity bounds the uniform-mixing coefficient
Statement
Assume AC. Let be a stationary time-homogeneous Markov chain with invariant probability . If for constants and then the uniform-mixing coefficient satisfies
Facts & Assumptions
Given: AC, a stationary homogeneous Markov chain with kernel and invariant probability , and the displayed uniform rate.
AC is the choice principle for the conditional classes used by the Markov-chain interfaces. (The Axiom of Choice)
The uniform-mixing coefficient is the supremum of over past events with positive probability and separated future events . (Strong, uniform, and maximal-correlation mixing coefficients)
For every bounded product-measurable future-path functional , the conditional expectation of its value on is a measurable function of . (Markov property for bounded future path functionals)
For bounded measurable , . (Chapman-Kolmogorov equations)
Total variation is . (Total variation distance for probability laws)
A known measurable factor can be taken out of conditional expectation. (Taking out what is known)
Proof
Fix , , with , and . By [F2], there is measurable with . By [F3] and [F5], . Stationarity gives .
For probability measures and measurable , the dyadic simple functions differ from by at most . Their integrals differ by at most , since each summand is an indicator and [F4] bounds its measure difference. Letting gives . Applying this with and proves for every .
Averaging the pointwise bound of step 1.2 conditionally on in step 1.1 gives . Taking the supremum in [F1] proves the result.
Source notes
Uniform total-variation convergence controls every conditional future event uniformly over the current state. No moment assumption on the observable is used in this mixing-coefficient bound.
Depends on
- The Axiom of Choice
- Geometric and uniform ergodicity for MCMC CLTs
- Invariant and stationary distribution for a Markov kernel
- Strong, uniform, and maximal-correlation mixing coefficients
- Time-homogeneous Markov chain with transition kernel
- Total variation distance for probability laws
- Chapman-Kolmogorov equations
- Markov property for bounded future path functionals
- Taking out what is known
Used by
- Sufficient MCMC CLT regimes Theorem
Dependency tree · two levels
35 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 and 4.1 (standard reference, not scraped)
- Charles J. Geyer, Markov Chain Monte Carlo Lecture Notes, §4.8.2 (standard reference, not scraped)