Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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 P be a probability kernel on an arbitrary measurable space (X,X) with invariant probability π. Suppose its stationary Markov chain has strong-mixing coefficients αX(n)≤Crn for n≥1, with 0≤C<∞ and 0<r<1. Let f:X→R be finite measurable with πf=0, π∣f∣q<∞ for a finite q>2, and suppose the absolutely convergent covariance sum is zero: v:=π(f2)+2∑n≥1Cov⁡π(f(X0),f(Xn))=0. Then for every 2<p<q, under the stationary law, max⁡0≤j≤n∣∑k=0j−1f(Xk)∣=o(n1/p)almost surely. The empty sum at j=0 is zero. No ergodicity assumption is needed beyond the stated stationary mixing bound.

If additionally ∥Pn(x,⋅)−π∥TV→0 for every x∈X, 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 P has an everywhere finite measurable common geometric total-variation envelope in the sense of Geometric and uniform ergodicity for MCMC CLTs and f 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 f∈Lq(π), the zero covariance sum, and any fixed 2<p<q. For the all-start conclusion assume also the stated pointwise total-variation convergence; for the final sufficient condition assume the everywhere geometric envelope instead.

[A1]

AC is assumed. The Axiom of Choice

[F1]

Under the stationary geometric strong-mixing and moment hypotheses, there is a finite measurable g∈Lp(π) with f=g−Pg almost everywhere; the covariance series is absolutely convergent and n−1Eπ(∑k=0n−1f(Xk))2→v. Geometric strong mixing gives an Lp Poisson solution

[F2]

For g∈L2(π), Dk+1=g(Xk+1)−Pg(Xk) is square-integrable with E[Dk+1∣Fk]=0, where Fk=σ(X0,…,Xk). Kernel conditional expectations for square-integrable Markov observables

[F3]

On a probability space Lp⊂L2 for p>2; Cauchy–Schwarz bounds products of L2 variables. Conditional expectation preserves means, and a known factor can be taken out when the products are integrable. Finite-measure Lr includes into Lp for p<r, Cauchy-Schwarz for random variables, Basic algebra and order properties of conditional expectation, Taking out what is known

[F4]

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

[F5]

Under AC the canonical Markov path law exists for every initial law. For a bounded product-measurable path functional H, h(x)=ExH(X0,X1,…) is measurable and E[H(Xn,Xn+1,…)∣Fn]=h(Xn). 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

[F6]

Total variation is ∥μ−ν∥TV=sup⁡A∣μ(A)−ν(A)∣. Total variation distance for probability laws

[F7]

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 αX(n)≤π(M)rn 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

1.1A1F1F2F3givenalgebra

Apply [F1] to obtain g∈Lp(π) with f=g−Pg almost everywhere; choose its finite measurable version as in that supplier. By [F3], g∈L2. Stationarity makes the Poisson identity hold at every Xk simultaneously off a countable union of null events. By [F2], on this common event f(Xk)=g(Xk)−g(Xk+1)+Dk+1. Summing gives Sn:=∑k=0n−1f(Xk)=Rn+Mn, with Rn=g(X0)−g(Xn) and Mn=∑k=0n−1Dk+1. No ergodic theorem or central limit theorem has been used.

2.1F1F2F3step 1.1givenalgebra

Put τ2=EπD12. Stationarity of transition pairs gives EDj2=τ2 for every j≥1. If i<j, then Di is Fj−1-measurable, its product with Dj is integrable by [F3], and [F2]–[F3] give E[DiDj]=E[DiE(Dj∣Fj−1)]=0. Thus EMn2=nτ2. The inequality (a−b)2≤2a2+2b2 and stationarity give ERn2≤4∥g∥22. Cauchy–Schwarz [F3] and step 1.1 imply ∣n−1ESn2−τ2∣≤4∥g∥22/n+4∥g∥2τ/n→0. By [F1], the same normalized second moments tend to v=0, so τ2=0. A nonnegative variable of zero expectation is zero almost surely; applying this to each Dj2 and taking the countable intersection shows that all Dj vanish simultaneously. Hence Sn=g(X0)−g(Xn) for every n on one probability-one event.

3.1F4step 1.1step 2.1algebra

Fix ε>0. Pointwise, the number of positive integers k with ∣g(x)∣p>εpk is at most ε−p∣g(x)∣p. Stationarity and [F4], applied first to finite sums and then to their increasing limit, therefore give ∑k≥1Pπ(∣g(Xk)∣>εk1/p)=∑k≥1π(∣g∣p>εpk)≤ε−pπ∣g∣p<∞. Borel–Cantelli [F4], intersected over positive rational ε, yields g(Xk)=o(k1/p) almost surely. On that event, for every ε>0 the sufficiently late terms obey ∣g(Xk)∣≤εk1/p≤εn1/p for k≤n, while the maximum of the finitely many earlier terms divided by n1/p tends to zero. Thus max⁡k≤n∣g(Xk)∣=o(n1/p). Step 2.1 gives max⁡0≤j≤n∣Sj∣≤∣g(X0)∣+max⁡j≤n∣g(Xj)∣=o(n1/p), proving the stationary conclusion.

4.1givenconstructalgebrastep 3.1

For the all-start part, define the original path event E={(xk)k≥0:n−1/p∑k=0n−1f(xk)→0}. 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 sn=∑k=0n−1f(xk), the shifted sum is sn+1−f(x0), and the reverse identity is sn=f(x0)+(sn−f(x0)) with the second term the shifted sum of length n−1. Since f(x0) is finite and ((n+1)/n)1/p and ((n−1)/n)1/p tend to one, either normalized convergence implies the other. Iterating gives invariance under deleting any fixed finite prefix. Also, on every real path, sn=o(n1/p) is equivalent to max⁡j≤n∣sj∣=o(n1/p): the reverse direction is immediate, and the forward direction follows by discarding a finite initial segment and bounding all later ∣sj∣ by εj1/p. Thus it suffices to transfer the event E, rather than any Poisson identity outside a stationary full-measure set.

5.1A1F5step 3.1step 4.1

Let h(x)=Px(E). By [F5], h is measurable and 0≤h≤1. The canonical stationary chain has the same path law as the stationary chain already considered, so step 3.1 gives π(h)=Pπ(E)=1; this equality also follows by applying [F5] at time zero and taking expectations. For every state x and integer n≥1, prefix-deletion invariance and [F5] give h(x)=Ex1E=Ex[h(Xn)]=Pnh(x). These are identities for each canonical starting state, not simultaneous versions of a conditional expectation over an uncountable family of starts.

6.1F5F6step 4.1step 5.1givenconstruct

For any probability measures μ,ν and measurable 0≤h≤1, let hm=2−m∑j=12m1{h≥j2−m}. Then ∣hm−h∣≤2−m and [F6] gives ∣μ(hm)−ν(hm)∣≤∥μ−ν∥TV. Letting m→∞ proves the same bound for h. Under the additional pointwise total-variation assumption, apply it to μ=Pn(x,⋅) and ν=π. Step 5.1 gives h(x)=Pnh(x)→π(h)=1 for every x, hence h(x)=1 everywhere. For any initial law μ, [F5] at time zero gives Pμ(E)=∫h dμ=1. The deterministic equivalence in step 4.1 transfers the uniform maximal rate as well. No moment or support condition on μ is needed.

7.1A1F1F2F3F5F7step 1.1step 2.1step 3.1step 6.1given∎

Finally suppose the everywhere common geometric bound in the Statement holds. Since its envelope is finite at every state, it implies Pn(x,⋅)→π in total variation for every x. 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 f 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 2<p<q is used by [F1] and the L2 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 π∣f∣2+δ+ε<∞ with δ,ε>0, choose p strictly between 2+δ and 2+δ+ε. The proved o(n1/p) rate is stronger than O(n1/(2+δ)log⁡n). 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

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