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.
Strong, uniform, and maximal-correlation mixing coefficients
Definition
Let be a process on a probability space whose finite-dimensional laws are invariant under common nonnegative time shifts; call this strict stationarity. For , set and . For , define the strong-mixing coefficient by
Define the uniform-mixing coefficient by
For square-integrable real random variables with positive variances, write For each , let consist of the triples such that , are real and square-integrable, and are measurable with respect to and respectively, and both have positive variance. Define the maximal-correlation coefficient by where square-integrability is in the sense of The space as the quotient by null functions. Thus when there is no admissible pair, as for a constant process. The process is called strongly mixing, uniformly mixing, or rho-mixing, respectively, when the corresponding coefficient tends to zero. These coefficients are distinct conditions; no implication between them is included in this definition.
Depends on
Used by
- Poisson equation and long-run variance for a stationary AR(1) chain Example
- A measurable observation does not increase stationary mixing coefficients Lemma
- A total-variation rate bounds strong-mixing coefficients Lemma
- Geometric ergodicity and reversibility give exponential rho-mixing Lemma
- Geometric strong mixing gives an Lp Poisson solution Lemma
- Stationary Markov-chain total-variation convergence implies strong mixing Lemma
- Strong-mixing covariance bound in terms of tail quantiles Lemma
- Two-sided stationary extension preserves maximal-correlation bounds Lemma
- Uniform ergodicity bounds the uniform-mixing coefficient Lemma
- Zero covariance long-run variance gives a degenerate CLT under absolute summability Lemma
- A rho-mixing CLT for square-integrable stationary sequences Theorem
- A uniform-mixing CLT for square-integrable stationary sequences Theorem
- Bounded stationary CLT under summable strong mixing Theorem
- Strong-mixing CLTs under bounded, moment, and logarithmic-moment conditions Theorem
Dependency tree · two levels
9 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)