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.
Stationary Markov-chain total-variation convergence implies strong mixing
Statement
Assume AC. Let have a supplied countable algebra generating , and let be a stationary time-homogeneous Markov chain with invariant probability . If then its stationary output process is strongly mixing:
Facts & Assumptions
Given: AC, the countable generating algebra , a stationary homogeneous -chain with invariant law , and the stated -almost-everywhere total-variation convergence.
AC is the choice principle for the conditional classes used by the Markov-chain interfaces. (The Axiom of Choice)
The strong-mixing coefficient is the supremum of over past and separated future events. (Strong, uniform, and maximal-correlation mixing coefficients)
The bounded-future-path Markov property gives a measurable function of the present state for a bounded future-path functional. (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)
Increasing measurable sets have increasing measures converging to the measure of their union, and symmetric differences satisfy measure subadditivity. (Continuity from below for measures, Measure of a set difference when the smaller set has finite measure)
Dominated convergence applies to measurable functions bounded by an integrable majorant. (Dominated convergence)
Kernel integration makes measurable for bounded measurable , in particular for measurable . (Measure kernel and probability kernel, Iterated transition kernels, Measurability of integration against a kernel)
Proof
Fix , , , and . By [F2], the indicator of this future-path event has conditional expectation for a measurable . Applying [F3] and the tower property gives . Stationarity gives .
For probability measures and measurable , the dyadic simple approximation differs from by at most . Each indicator integral difference is bounded by [F4], so the integrals of differ by at most . Letting gives .
For fixed and , is a finite measure. Let be the sets approximable in -symmetric-difference measure by members of . It contains and is closed under complements because is an algebra. For and , [F6] gives with . Choose with for . The finite union belongs to and by finite subadditivity. Thus is a sigma-algebra containing the generator , so . Approximating each measurable in this way shows : the discrepancy for differs from that for an approximating by at most . Since is countable and each evaluation is measurable by [F8], is measurable; also .
Using [F5] and step 1.1, . The last inequality follows from step 1.2 applied pointwise to and , and then from step 1.3. By hypothesis for -almost every ; since , [F7] makes the integral tend to zero. This bound is independent of , so taking the supremum in [F1] proves .
Source notes
The proof uses the supplied countable algebra to make the total-variation supremum a measurable function of the starting state. The bound on the strong-mixing coefficient then follows by dominated convergence.
Depends on
- The Axiom of Choice
- Iterated transition kernels
- Invariant and stationary distribution for a Markov kernel
- Measure kernel and probability kernel
- Strong, uniform, and maximal-correlation mixing coefficients
- Stationary process and canonical path shift
- Time-homogeneous Markov chain with transition kernel
- Total variation distance for probability laws
- Measure of a set difference when the smaller set has finite measure
- Chapman-Kolmogorov equations
- Continuity from below for measures
- Dominated convergence
- Markov property for bounded future path functionals
- Measurability of integration against a kernel
- Taking out what is known
Used by
Dependency tree · two levels
56 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, §3 (standard reference, not scraped)
- Charles J. Geyer, Markov Chain Monte Carlo Lecture Notes, §4.8.2 (standard reference, not scraped)