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.
Long-run variance for a stationary Markov chain
Definition
Let be a stationary time-homogeneous Markov chain with invariant probability , and let be real Borel with and . For , set . When the Markov-chain CLT holds with finite variance parameter and , the covariance long-run variance is
This definition does not infer a CLT from covariance summability, or infer that a weak-limit variance equals the covariance sum. Whenever is used as the variance parameter in a CLT or MCSE claim, that equality must be established by the theorem being applied. For example, the local Poisson-equation theorem proves the equality under its square-integrable solution hypotheses.
Remarks
Under stationarity, the finite variance identity is Absolute summability makes the right side converge to by dominated convergence. Equality between this variance limit and a variance parameter from weak convergence is a separate assertion; it is not part of this definition.
Depends on
Used by
- Overlapping batch means for MCMC standard errors Algorithm
- Poisson equation and long-run variance for a stationary AR(1) chain Example
- Poisson-equation martingale decomposition and MCMC CLT Theorem
- Strong consistency of overlapping batch means Theorem
- Strong invariance principle for geometrically ergodic chains Theorem
- Sufficient MCMC CLT regimes Theorem
Dependency tree · two levels
19 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
- 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)
- James M. Flegal and Galin L. Jones, Batch means and spectral variance estimators in Markov chain Monte Carlo (standard reference, not scraped)
- Olle Häggström and Jeffrey S. Rosenthal, On Variance Conditions for Markov Chain CLTs (standard reference, not scraped)