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 Gaussian AR(1) sensor and its long-run variance
Example
Let , , and be as in the Definition, with . Let be the first standard basis vector in and set . For each , the spatially uniform field belongs to and has sensor reading .
Assume AC. Let be a centered (that is, for every ), strictly stationary, jointly Gaussian time-homogeneous Markov chain on with invariant probability , where for every Borel set , and recursion Assume is an independent sequence with common law , independent of ; then the transition kernel is . For and , denotes the normal law with mean and variance ; for it is the point mass at , and for it has density . “Jointly Gaussian” means every finite real linear combination of chain coordinates has law for some and ; “strictly stationary” means every finite-dimensional law is unchanged by nonnegative integer time shifts. The recursion is imposed for every . The associated velocity-field sensor output is . If has velocity units , then and have units , is dimensionless, and the long-run variance has units . This is a mathematical model example, not a reported fluid measurement.
For , its covariance is The covariance series is absolutely summable, and the centered sensor sum satisfies Consequently its covariance long-run variance is .
Example references
Finite-second-moment random velocity sensor law
The L2 velocity sensor is well-defined
Probability measures and probability spaces
Time-homogeneous Markov chain with transition kernel
Invariant and stationary distribution for a Markov kernel
Moments, variance, and covariance on a probability space
For , , and for the series diverges
Weak convergence of borel probability measures
Long-run variance for a stationary Markov chain
Geyer, Markov Chain Monte Carlo Lecture Notes, Sections 4.8.1–4.9
Jones, On the Markov Chain Central Limit Theorem, Section 4.1
Facts & Assumptions
Given: A finite-volume spatial measure space, the normalized weight , a centered strictly stationary jointly Gaussian time-homogeneous Markov chain with the stated transition recursion and independent Gaussian innovations, , , and AC.
AC is an assumption required by the time-homogeneous Markov-chain definition and the long-run-variance supplier (The Axiom of Choice).
The centered, stationary jointly Gaussian AR(1) chain and its independent innovations are the stipulated mathematical probability model in the Example; centering means for every .
The ideal sensor is on spatial velocity fields (Finite-second-moment random velocity sensor law).
The sensor pairing is well-defined on equivalence classes and its centering is finite (The L2 velocity sensor is well-defined).
The Markov-chain transition kernel is the conditional law of the next state given the natural filtration (Time-homogeneous Markov chain with transition kernel).
An invariant distribution satisfies (Invariant and stationary distribution for a Markov kernel).
Variance and covariance are the centered second moment and centered product expectation (Moments, variance, and covariance on a probability space).
For , and (For , , and for the series diverges).
Weak convergence is convergence of integrals against every bounded continuous real function (Weak convergence of borel probability measures).
Dominated convergence passes limits through integrals under one integrable majorant (Dominated convergence).
After the CLT and absolute covariance summability are proved, the covariance series defines the long-run variance (Long-run variance for a stationary Markov chain).
Proof
Given: The assumptions and notation of the Example.
For each scalar , . Thus the random-field sensor output equals .
Independence of from the natural past and its stated law imply for every Borel , with . The stipulated stationary law is invariant in the sense of [F4].
Stationarity and the recursion give , because is centered and independent of . Thus . Iterating the recursion gives ; the innovation sum is centered and independent of , so [F5] yields for every .
Since , [F6] gives and The last equality uses and , so .
The centered sum is normally distributed because the finite vector is jointly Gaussian. Expanding its variance and counting the pairs at lag gives
On the counting-measure space , the summands converge pointwise to and are dominated in absolute value by the summable sequence . By [F8], .
Let have law . Since is centered normal with variance , its law equals that of . For every bounded continuous , pointwise and is bounded by ; [F8] gives convergence of expectations. By [F7], . The chain is stationary Markov, the covariance series is absolutely summable by step 3.1, and the CLT has now been proved, so [F9] identifies as its covariance long-run variance.
Depends on
Finite-second-moment random velocity sensor law
The L2 velocity sensor is well-defined
The Axiom of Choice
Probability measures and probability spaces
Time-homogeneous Markov chain with transition kernel
Invariant and stationary distribution for a Markov kernel
Moments, variance, and covariance on a probability space
For , , and for the series diverges
Weak convergence of borel probability measures
Dominated convergence
Long-run variance for a stationary Markov chain