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 central limit theorem for a dependent velocity sensor
Statement
Assume the Axiom of Choice. Let and the centered sensor observable be as in the Definition. The sequences in either branch below are defined on a probability space . General stationary sensor branch. Let be -valued random variables with marginal law and put . More generally, let be Borel measurable and satisfy ; under , this is equivalent to for . Put and assume . Assume is strictly stationary: all its finite-dimensional laws are unchanged by common nonnegative integer shifts. For , define Any one of the following is sufficient: is essentially bounded and ; for some , and ; or for some and . In each case and Zero variance is included. No Markov, Harris, reversibility or state-space countable-generation assumption is needed for this branch. For a Reynolds product sensor, apply this clause to the centered product itself; its moment is an additional hypothesis. For two bounded linear sensors on , a finite moment of is a sufficient product-moment condition. No mixing property or rate is inferred from a fluid equation or the sampling interval.
Additional Markov-chain sufficient regimes. Let be countably generated, let be a probability kernel on with invariant probability , and let be a stationary time-homogeneous -chain whose canonical left shift preserves its path law and whose shift-invariant measurable events have probability zero or one. Assume is -irreducible, aperiodic, and Harris recurrent for a nonzero sigma-finite measure . Here -irreducibility means each -positive measurable set is reached with positive probability after some finite positive number of steps from every state; Harris recurrence means each such set is hit almost surely from every starting state; aperiodicity means there is no integer and pairwise disjoint measurable sets with and for every and , and for every . Invariant means .
For , put . Suppose at least one of the following six regimes holds:
- For some there is a measurable with and for every and f_\psi\mu$.
- For some there is a measurable with and for every and \delta>0f_\psi\in L^{2+\delta}(\mu)m\delta>2+\delta$.
- is geometrically ergodic, meaning for a finite measurable and some , and for some .
- is geometrically ergodic in the same total-variation sense and , with .
- is geometrically ergodic in the same total-variation sense, is reversible in the symmetric-flow sense , and .
- is uniformly ergodic, meaning the geometric total-variation bound holds with bounded on , and .
Then and where is the covariance long-run variance. Here , and for finite means . Also set for and . The zero-variance case is included. This is an asymptotic model deduction; it does not make finite samples normally distributed or establish a physical sensor's stationarity, Markov property, or mixing assumptions. A central limit theorem alone is not a consistency result for an estimated Monte Carlo standard error.
Statement references
Strong-mixing CLTs under bounded, moment, and logarithmic-moment conditions
Strong, uniform, and maximal-correlation mixing coefficients
Finite-second-moment random velocity sensor law
The L2 velocity sensor is well-defined
Long-run variance for a stationary Markov chain
Measure kernel and probability kernel
Time-homogeneous Markov chain with transition kernel
Invariant and stationary distribution for a Markov kernel
Phi-irreducibility for a general-state Markov kernel
Aperiodicity for a general-state Markov kernel
Harris recurrence relative to an irreducibility measure
Geometric and uniform ergodicity for MCMC CLTs
Polynomial ergodicity with an integrable rate envelope
General-state reversibility by symmetric flow measure
The space as the quotient by null functions
Total variation distance for probability laws
Ergodicity relative to an invariant measure
Measure-preserving transformations and systems
Jones, On the Markov Chain Central Limit Theorem, Section 4.1
Geyer, Markov Chain Monte Carlo Lecture Notes, Sections 4.8.1–4.9
Facts & Assumptions
Given: The sensor law, centered observable, choice assumption, stationary Harris-ergodic Markov chain, invariant probability, and any one of the six sufficient regimes in the Statement.
The Axiom of Choice is assumed explicitly; the MCMC supplier uses it through its probability, conditional-expectation, and sequence-CLT interfaces (The Axiom of Choice).
The sensor pairing is a Borel, centered, square-integrable observable for every finite-second-moment law and weight (The L2 velocity sensor is well-defined).
Under the stated base hypotheses and any one of the six listed regimes, the MCMC theorem proves absolute covariance summability and the normal limit with variance equal to the covariance sum (Sufficient MCMC CLT regimes).
Once the CLT and absolute covariance summability hold, the covariance long-run variance is (Long-run variance for a stationary Markov chain).
Under AC, a centered strictly stationary square-integrable real sequence satisfies the covariance-sum CLT under each of the three strong-mixing/moment conditions stated in the general branch (Strong-mixing CLTs under bounded, moment, and logarithmic-moment conditions). The event-supremum coefficient is that of Strong, uniform, and maximal-correlation mixing coefficients.
Proof
Given: The hypotheses and notation of the selected general stationary or Markov branch of the Statement.
In the Markov branch, [F1] makes Borel, centered under , and square-integrable. The state-space, kernel, invariance, stationarity, path-shift, and recurrence assumptions are exactly those required by [F2]; the Statement spells out the rate, reversibility, and moment hypotheses for each of its six cases.
In the general branch, the sensor lemma [F1] supplies centering and square-integrability for ; for the other these are explicit hypotheses. Strict stationarity and the selected mixing/moment condition are also hypotheses, so [A1] and [F4] give absolute covariance summability, nonnegativity of its sum, and the normal limit for . Strict stationarity makes this sum have the same law as , giving the stated convention.
In that Markov branch, apply [F2] to the chain and observable . It gives and the stated centered normal limit with variance equal to the covariance sum; [F3] identifies that sum with . The supplier includes the zero-variance limit and assumes AC explicitly.
For sensor weights , [F1] bounds . Raising this inequality to proves the sufficient state moment. Its finite expectation makes the product integrable; subtracting its finite mean preserves its moment by . The actual mixing condition must still be supplied for this centered product process. Thus both the original Markov regimes and the general stationary/product branches follow without a finite-sample or physical mixing claim.
Depends on
Finite-second-moment random velocity sensor law
The L2 velocity sensor is well-defined
The Axiom of Choice
Sufficient MCMC CLT regimes
Long-run variance for a stationary Markov chain
Measure kernel and probability kernel
Time-homogeneous Markov chain with transition kernel
Invariant and stationary distribution for a Markov kernel
Phi-irreducibility for a general-state Markov kernel
Aperiodicity for a general-state Markov kernel
Harris recurrence relative to an irreducibility measure
Geometric and uniform ergodicity for MCMC CLTs
Polynomial ergodicity with an integrable rate envelope
General-state reversibility by symmetric flow measure
The space as the quotient by null functions
Total variation distance for probability laws
Ergodicity relative to an invariant measure
Measure-preserving transformations and systems
Strong-mixing CLTs under bounded, moment, and logarithmic-moment conditions
Strong, uniform, and maximal-correlation mixing coefficients