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.
Poisson equation and long-run variance for a stationary AR(1) chain
Example
Take and innovation variance . Let , where the innovations are independent variables and is independent of them. For , the Poisson solution is and the long-run variance is .
Facts & Assumptions
Given: The Gaussian AR(1) chain and observable in the Example.
AC supplies the Markov-chain and conditional-expectation conventions used by the stationary-chain theorem. (The Axiom of Choice)
An invariant initial law makes all finite-dimensional laws stationary. (Invariant initial law makes a Markov chain stationary)
Dominated convergence passes a pointwise-convergent sequence of densities through the Lebesgue integral under one integrable majorant. (Dominated convergence)
For a stationary chain on a countably generated state space, pointwise total-variation convergence for -almost every start implies strong mixing. (Stationary Markov-chain total-variation convergence implies strong mixing)
Strong mixing means , and its coefficient bounds event dependence between separated past and future sigma-algebras. (Strong, uniform, and maximal-correlation mixing coefficients)
The local Poisson theorem proves the martingale decomposition and identifies its variance with the covariance long-run variance under absolute covariance summability. (Poisson-equation martingale decomposition and MCMC CLT)
The covariance long-run variance is when the covariance series is absolutely convergent and the CLT holds. (Long-run variance for a stationary Markov chain)
A stationary real process has a measure-preserving canonical left shift, and ergodicity means every shift-invariant event has probability zero or one. (Stationary process and canonical path shift)
Verification
Put . If independently of , then is normal with mean zero and variance . Thus is invariant, and initializing with gives a stationary chain by [F1].
Iterating the recursion gives when , so with . For each fixed , and , so the Gaussian densities converge pointwise to the density of . For sufficiently large , and . On , ; on , , hence . This gives one integrable majorant for ; with added it also dominates . By [F2], . Therefore for every .
The Borel sigma-algebra of has the countable generating algebra of finite unions of rational half-open intervals and rational rays. Applying [F3] to step 1.2 gives .
Let be an event invariant under every power of the canonical left shift and put . Finite-coordinate cylinders form a generating pi-system. The events approximable in probability by such cylinders form a sigma-algebra: complements preserve symmetric-difference probability, and for a countable union one first truncates by continuity from below and then approximates the finitely many sets. Hence for every there are and with . For , is measurable with respect to , stationarity gives , and shift invariance gives . Thus . Let using step 2.1 and then ; we obtain . By [F7], every invariant event having probability zero or one is precisely ergodicity of the canonical shift.
Set and . Both are in and . The kernel action is , so . Also , whence . Steps 1.1 and 3.1 verify the stationary and ergodic hypotheses of [F5], so this is the Poisson CLT variance.
Iterating the recursion gives . Independence implies . Since , the covariance series is absolutely summable, and [F6] gives . This agrees with step 4.1, including and negative .
Depends on
- The Axiom of Choice
- Invariant and stationary distribution for a Markov kernel
- Long-run variance for a stationary Markov chain
- Strong, uniform, and maximal-correlation mixing coefficients
- Measure kernel and probability kernel
- Stationary process and canonical path shift
- Time-homogeneous Markov chain with transition kernel
- Total variation distance for probability laws
- Stationary Markov-chain total-variation convergence implies strong mixing
- Dominated convergence
- Invariant initial law makes a Markov chain stationary
- Poisson-equation martingale decomposition and MCMC CLT
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
52 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.