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.
Sufficient MCMC CLT regimes
Statement
Assume AC. Let be countably generated, let be a -irreducible probability kernel (Phi-irreducibility for a general-state Markov kernel, Measure kernel and probability kernel), aperiodic (Aperiodicity for a general-state Markov kernel), and Harris recurrent relative to (Harris recurrence relative to an irreducibility measure) with invariant probability , and let be a stationary -chain whose canonical left shift preserves its path law and whose shift-invariant measurable events have probability zero or one. We take the initial law to be , which implies stationarity by Invariant initial law makes a Markov chain stationary. Let be Borel with . Define only when the covariance series is absolutely convergent and the CLT is established, as in Long-run variance for a stationary Markov chain.
Each of the following six conditions is sufficient for absolute convergence of the covariance series and
- has polynomial total-variation rate of order with an integrable envelope (Polynomial ergodicity with an integrable rate envelope), and is essentially bounded under (there is with -almost everywhere).
- has polynomial total-variation rate of order with an integrable envelope (Polynomial ergodicity with an integrable rate envelope), for some (The space as the quotient by null functions), and .
- is geometrically ergodic (Geometric and uniform ergodicity for MCMC CLTs) and for some (The space as the quotient by null functions).
- is geometrically ergodic (Geometric and uniform ergodicity for MCMC CLTs) and , with .
- is geometrically ergodic (Geometric and uniform ergodicity for MCMC CLTs), reversible with respect to in the symmetric-flow sense (General-state reversibility by symmetric flow measure), and (The space as the quotient by null functions).
- is uniformly ergodic (Geometric and uniform ergodicity for MCMC CLTs) and (The space as the quotient by null functions).
In case 4, the displayed logarithmic moment implies : on one has , and on one has .
When , the zero-variance lemma Zero covariance long-run variance gives a degenerate CLT under absolute summability gives the degenerate normal limit from absolute covariance summability. Finite variance of alone is not one of the sufficient conditions.
Facts & Assumptions
Given: AC, the stationary Harris-ergodic chain and centered real function in the Statement, and any one of its six sufficient regimes.
The Axiom of Choice is assumed by the local probability, conditional-expectation and sequence-CLT suppliers. The Statement already includes this hypothesis.
A measurable observation does not increase stationary mixing coefficients makes stationary and bounds each of its mixing coefficients by the corresponding chain coefficient.
Polynomial ergodicity with an integrable rate envelope gives the pointwise polynomial total-variation bound with . Geometric and uniform ergodicity for MCMC CLTs gives the geometric bound with finite measurable envelope, or with bounded envelope in the uniform case.
The bounded-future Markov property and iterated-kernel identity are Markov property for bounded future path functionals and Chapman-Kolmogorov equations. The event-supremum convention is Total variation distance for probability laws, and known factors can be taken out using Taking out what is known.
Strong-mixing CLTs under bounded, moment, and logarithmic-moment conditions proves absolute covariance summability and the normal limit for bounded observations with summable alpha, for the stated alpha-summability condition, or for exponential alpha with the logarithmic moment.
Harris geometric ergodicity admits an integrable total-variation envelope supplies an integrable geometric envelope under the stated Harris, irreducibility and aperiodicity hypotheses. A total-variation rate bounds strong-mixing coefficients then bounds alpha by that geometric rate.
Geometric ergodicity and reversibility give exponential rho-mixing gives exponential rho for a stationary reversible geometrically ergodic chain under the stated recurrence hypotheses. A rho-mixing CLT for square-integrable stationary sequences proves the covariance-summable CLT when rho is summable.
Uniform ergodicity bounds the uniform-mixing coefficient gives exponential phi under uniform ergodicity. A uniform-mixing CLT for square-integrable stationary sequences proves the covariance-summable CLT when the square roots of phi are summable.
Zero covariance long-run variance gives a degenerate CLT under absolute summability handles zero covariance long-run variance by a finite covariance expansion. Long-run variance for a stationary Markov chain identifies the covariance sum only after absolute convergence and the CLT have been established.
For , , and for the series diverges proves convergence of for every real .
Proof
Given: The hypotheses and any one of the six regimes in the Statement.
Put . This is a centered stationary real sequence by [F1]. It is square-integrable in every case: boundedness suffices in case 1, the power moment suffices in cases 2 and 3 on the probability space, and cases 5 and 6 assume . In case 4, split at : on the bounded part , and on the other part , so the stated logarithmic moment implies . All sequence suppliers below therefore have their centering, stationarity and second-moment premises.
Suppose a pointwise rate is available with . For any past event and separated future event , [F3] supplies with and . Approximating uniformly by dyadic averages of its superlevel indicators gives : each indicator discrepancy is bounded by the defining event supremum. Consequently Taking the suprema and then applying [F1] gives . No measurability of an uncountable total-variation supremum is needed, because its measurable envelope bounds each event discrepancy pointwise.
In case 1, take in step 1.2. Since , grouping bounds each block of by ; [F9] makes the resulting geometric series finite. Thus . The bounded branch of [F4] gives absolute covariance summability and the asserted normal limit for the normalized sums of . This uses the whole approved range .
In case 2, put . Step 1.2 gives . The exact assumption says , so the same dyadic argument and [F9] make these bounds summable. The power-moment branch of [F4] proves the same covariance and distribution conclusions.
In cases 3 and 4, [F5] replaces the possibly nonintegrable original envelope by a finite integrable geometric envelope with some rate . Thus by [F1] and [F5]. In case 3, every positive power of this bound is summable, so the branch of [F4] applies. In case 4, its exponential/logarithmic-moment branch applies directly. Each yields absolute covariance summability and the normal limit without strengthening the given moment assumption.
In case 5, reversibility and the geometric-rate assumptions allow [F6] to give for some . By [F1], , so its series is summable. The rho-mixing theorem in [F6] proves the required covariance-summable CLT.
In case 6, [F7] gives for some . By [F1], . The uniform-mixing theorem in [F7] therefore gives the same conclusions.
In all six cases the covariance series is absolutely convergent, its sum is finite and nonnegative, and the normalized sum converges to the centered normal with precisely that covariance sum. If the sum is zero, [F8] also proves the degenerate limit directly in , so no division by an asymptotic variance is made. Stationarity makes and equal in law. The established limit is therefore exactly the displayed limit in the Statement, and only now does [F8] identify its variance as .
Depends on
- The Axiom of Choice
- Aperiodicity for a general-state Markov kernel
- General-state reversibility by symmetric flow measure
- Geometric and uniform ergodicity for MCMC CLTs
- Harris recurrence relative to an irreducibility measure
- The space $L^p(\mu)$ as the quotient by null functions
- Long-run variance for a stationary Markov chain
- Measure kernel and probability kernel
- Phi-irreducibility for a general-state Markov kernel
- Polynomial ergodicity with an integrable rate envelope
- Total variation distance for probability laws
- Geometric ergodicity and reversibility give exponential rho-mixing
- A total-variation rate bounds strong-mixing coefficients
- Harris geometric ergodicity admits an integrable total-variation envelope
- A measurable observation does not increase stationary mixing coefficients
- Uniform ergodicity bounds the uniform-mixing coefficient
- Zero covariance long-run variance gives a degenerate CLT under absolute summability
- Chapman-Kolmogorov equations
- For $|r| < 1$, $\sum_{k \ge 0} r^k = 1/(1-r)$, and for $|r| \ge 1$ the series diverges
- Invariant initial law makes a Markov chain stationary
- Markov property for bounded future path functionals
- A rho-mixing CLT for square-integrable stationary sequences
- Strong-mixing CLTs under bounded, moment, and logarithmic-moment conditions
- Taking out what is known
- A uniform-mixing CLT for square-integrable stationary sequences
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
92 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, Theorem 9 and Corollaries 1–5 (standard reference, not scraped)
- Charles J. Geyer, Markov Chain Monte Carlo Lecture Notes, §§4.8–4.9 (standard reference, not scraped)
- Gareth O. Roberts and Jeffrey S. Rosenthal, General State Space Markov Chains and MCMC Algorithms, §5 (standard reference, not scraped)