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.
A total-variation rate bounds strong-mixing coefficients
Statement
Assume AC. Let be a stationary time-homogeneous Markov chain with invariant probability . Suppose there are a measurable with and such that Then the strong-mixing coefficient of the stationary process satisfies
Facts & Assumptions
Given: AC, a stationary homogeneous Markov chain with kernel and invariant law , an integrable envelope , and the displayed geometric total-variation bound.
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)
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 , , , and a future event . By [F2], for the path indicator defining there is a measurable with . Applying [F3] and the tower property gives . 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 proves .
Apply step 1.2 with and . The given rate then yields for every .
Using [F5], [F2], and [F3], The first inequality uses ; the last follows from the preceding pointwise bound and stationarity of . Since were arbitrary, taking the supremum in [F1] proves the claim.
Source notes
The proof is local: the Markov property converts separated future events to a bounded function of the state, and the total-variation bound controls its expectation. The source's factor convention is matched to the repository definition of total variation as a supremum over events.
Depends on
- The Axiom of Choice
- Geometric and uniform ergodicity for MCMC CLTs
- Invariant and stationary distribution for a Markov kernel
- Measure kernel and probability 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
Dependency tree · two levels
37 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–4 (standard reference, not scraped)
- Charles J. Geyer, Markov Chain Monte Carlo Lecture Notes, §4.8.2 (standard reference, not scraped)