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.
Zero-variance geometric Markov sums have a uniform strong rate
Statement
Assume AC. Let be a probability kernel on an arbitrary measurable space with invariant probability . Suppose its stationary Markov chain has strong-mixing coefficients for , with and . Let be finite measurable with , for a finite , and suppose the absolutely convergent covariance sum is zero: Then for every , under the stationary law, The empty sum at is zero. No ergodicity assumption is needed beyond the stated stationary mixing bound.
If additionally for every , the same assertion holds under every initial probability law, without a moment assumption on that law. In particular, it holds under every initial law whenever has an everywhere finite measurable common geometric total-variation envelope in the sense of Geometric and uniform ergodicity for MCMC CLTs and has the stated moment, centering and zero covariance sum. No positive one-step minorization, irreducibility or Harris hypothesis is added to this last sufficient condition.
Facts & Assumptions
Given: AC, the stationary geometric strong-mixing hypotheses, finite centered real , the zero covariance sum, and any fixed . For the all-start conclusion assume also the stated pointwise total-variation convergence; for the final sufficient condition assume the everywhere geometric envelope instead.
AC is assumed. The Axiom of Choice
Under the stationary geometric strong-mixing and moment hypotheses, there is a finite measurable with almost everywhere; the covariance series is absolutely convergent and . Geometric strong mixing gives an Lp Poisson solution
For , is square-integrable with , where . Kernel conditional expectations for square-integrable Markov observables
On a probability space for ; Cauchy–Schwarz bounds products of variables. Conditional expectation preserves means, and a known factor can be taken out when the products are integrable. Finite-measure includes into for , Cauchy-Schwarz for random variables, Basic algebra and order properties of conditional expectation, Taking out what is known
Monotone convergence passes increasing finite nonnegative sums through expectation; summable event probabilities imply only finitely many occurrences almost surely. Monotone convergence for the integral, First Borel-Cantelli lemma for events
Under AC the canonical Markov path law exists for every initial law. For a bounded product-measurable path functional , is measurable and . An invariant initial law makes the chain stationary. Canonical Markov chain on path space, Markov property for bounded future path functionals, Invariant initial law makes a Markov chain stationary
Total variation is . Total variation distance for probability laws
An invariant kernel with an everywhere finite measurable common geometric total-variation envelope admits such an envelope integrable under , possibly at a slower geometric rate. That integrable bound implies for the stationary chain. Harris geometric ergodicity admits an integrable total-variation envelope, A total-variation rate bounds strong-mixing coefficients, Geometric and uniform ergodicity for MCMC CLTs
Proof
Apply [F1] to obtain with almost everywhere; choose its finite measurable version as in that supplier. By [F3], . Stationarity makes the Poisson identity hold at every simultaneously off a countable union of null events. By [F2], on this common event . Summing gives , with and . No ergodic theorem or central limit theorem has been used.
Put . Stationarity of transition pairs gives for every . If , then is -measurable, its product with is integrable by [F3], and [F2]–[F3] give . Thus . The inequality and stationarity give . Cauchy–Schwarz [F3] and step 1.1 imply . By [F1], the same normalized second moments tend to , so . A nonnegative variable of zero expectation is zero almost surely; applying this to each and taking the countable intersection shows that all vanish simultaneously. Hence for every on one probability-one event.
Fix . Pointwise, the number of positive integers with is at most . Stationarity and [F4], applied first to finite sums and then to their increasing limit, therefore give . Borel–Cantelli [F4], intersected over positive rational , yields almost surely. On that event, for every the sufficiently late terms obey for , while the maximum of the finitely many earlier terms divided by tends to zero. Thus . Step 2.1 gives , proving the stationary conclusion.
For the all-start part, define the original path event . It is product-measurable, since the condition is a countable combination of inequalities for finite measurable sums. It is invariant under deleting the first coordinate: if , the shifted sum is , and the reverse identity is with the second term the shifted sum of length . Since is finite and and tend to one, either normalized convergence implies the other. Iterating gives invariance under deleting any fixed finite prefix. Also, on every real path, is equivalent to : the reverse direction is immediate, and the forward direction follows by discarding a finite initial segment and bounding all later by . Thus it suffices to transfer the event , rather than any Poisson identity outside a stationary full-measure set.
Let . By [F5], is measurable and . The canonical stationary chain has the same path law as the stationary chain already considered, so step 3.1 gives ; this equality also follows by applying [F5] at time zero and taking expectations. For every state and integer , prefix-deletion invariance and [F5] give . These are identities for each canonical starting state, not simultaneous versions of a conditional expectation over an uncountable family of starts.
For any probability measures and measurable , let . Then and [F6] gives . Letting proves the same bound for . Under the additional pointwise total-variation assumption, apply it to and . Step 5.1 gives for every , hence everywhere. For any initial law , [F5] at time zero gives . The deterministic equivalence in step 4.1 transfers the uniform maximal rate as well. No moment or support condition on is needed.
Finally suppose the everywhere common geometric bound in the Statement holds. Since its envelope is finite at every state, it implies in total variation for every . By [F5] the canonical invariant-initial-law chain is stationary. The stronger arbitrary-measurable-space clause of [F7] supplies a finite integrable geometric envelope, and its mixing implication supplies the stationary geometric strong-mixing bound needed by [F1]. Therefore the proof in steps 1.1, 2.1, 3.1, 4.1, 5.1, 6.1 applies to the stated and zero covariance sum under every initial law. The zero function, a one-state chain, empty partial sums and zero martingale variance are all included; an empty state space admits no invariant probability and does not satisfy the hypotheses. Strict is used by [F1] and the comparison. AC is inherited precisely through [F1], [F2], [F3], [F5] and [F7]. This completes both the stationary result and the asserted all-start sufficient conditions.
Remarks
This is the zero-variance rate only. For a moment with , choose strictly between and . The proved rate is stronger than . It therefore supplies the degenerate error estimate needed in a zero-Brownian-coefficient branch without using regeneration, a martingale CLT, KMT, or a nondegenerate SIP. It establishes no positive-variance Brownian coupling.
The Jones and Doukhan–Massart–Rio full PDFs were retrieved, and the source locations specified above were inspected. Their covariance and mixing methods document provenance; the bounded-dual Poisson supplier, zero-martingale variance comparison, integrated-tail rate and deletion-invariant arbitrary-start transfer are all proved locally here or in the explicit mathematical dependencies.
Depends on
- The Axiom of Choice
- Geometric and uniform ergodicity for MCMC CLTs
- Total variation distance for probability laws
- Geometric strong mixing gives an Lp Poisson solution
- Kernel conditional expectations for square-integrable Markov observables
- Cauchy-Schwarz for random variables
- Taking out what is known
- Basic algebra and order properties of conditional expectation
- Finite-measure $L^r$ includes into $L^p$ for $p < r$
- Monotone convergence for the integral
- First Borel-Cantelli lemma for events
- Canonical Markov chain on path space
- Markov property for bounded future path functionals
- Invariant initial law makes a Markov chain stationary
- Harris geometric ergodicity admits an integrable total-variation envelope
- A total-variation rate bounds strong-mixing coefficients
Used by
Dependency tree · two levels
78 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, §§3–4 (standard reference, not scraped)
- P. Doukhan, P. Massart and E. Rio, The functional central limit theorem for strongly mixing processes, Lemma 1 and Proposition 1 (standard reference, not scraped)