Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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.

Geometric ergodicity and reversibility give exponential rho-mixing

Statement

Assume AC. Let P be a probability kernel on (X,X) with invariant probability π, and consider its stationary output process X. Assume it is ϕ-irreducible (Phi-irreducibility for a general-state Markov kernel), aperiodic (Aperiodicity for a general-state Markov kernel), and Harris recurrent relative to its nonzero σ-finite irreducibility measure ϕ (Harris recurrence relative to an irreducibility measure). Suppose it is geometrically ergodic in the sense of Geometric and uniform ergodicity for MCMC CLTs and reversible with respect to π in the symmetric-flow sense of General-state reversibility by symmetric flow measure. Then there are C<∞ and r∈(0,1) such that its maximal-correlation mixing coefficient satisfies ρX(n)≤Crn(n≥1).

Facts & Assumptions

Given: AC, the stationary P-chain and all the hypotheses in the Statement.

[A1]

AC covers the conditional-expectation and path-law interfaces used below. (The Axiom of Choice)

[F1]

Geometric ergodicity supplies a measurable finite M≥0 and a common r∈(0,1) with ∥Pk(x,⋅)−π∥TV≤M(x)rk for every x and k≥1. (Geometric and uniform ergodicity for MCMC CLTs)

[F2]

Reversibility means that the probability flow measure π(dx)P(x,dy) is invariant under coordinate interchange. (General-state reversibility by symmetric flow measure)

[F3]

The square-integrable kernel conditional-expectation identity holds with zero filling on the marginal-null set where an integral is not finite. (Kernel conditional expectations for square-integrable Markov observables)

[F4]

For square-integrable real variables, ∣⟨u,v⟩∣≤∥u∥2∥v∥2. (Cauchy-Schwarz inequality for L2)

[F5]

Dominated convergence passes almost-everywhere limits through integrals under an integrable dominating function. (Dominated convergence)

[F6]

A bounded measurable future-path functional has conditional expectation, given the chain's past through its initial time, equal to a bounded measurable function of the state at that time. (Markov property for bounded future path functionals)

[F7]

For bounded measurable g, E[g(Xj+n)∣Fj]=Png(Xj), where Fj=σ(X0,…,Xj). (Chapman-Kolmogorov equations)

[F8]

Nested conditional expectations satisfy the tower property, and a known factor can be taken out when the products are integrable. (Tower property of conditional expectation, Taking out what is known)

[F9]

Conditional Jensen gives ∣E[V∣G]∣2≤E[V2∣G]. (Conditional jensen inequality)

[F10]

The coefficient ρX(n) is the supremum of absolute correlations over square-integrable past and separated future variables of positive variance. (Strong, uniform, and maximal-correlation mixing coefficients)

Proof

1.1A1F2F3F4F5F7F9given

On real L2(π) put Tf=Pf and H={f:π(f)=0}. By [F3], conditional Jensen and stationarity give ∥Tf∥22≤π(f2) and π(Tf)=π(f). These identities also show that the operator is well defined on almost-everywhere classes. Thus T is a contraction preserving H, and T1=1. For bounded f,g, [F2] gives ⟨f,Tg⟩=⟨Tf,g⟩ by integrating f(x)g(y) against the flow measure. Bounded truncation converges in L2 by [F5], so contraction and [F4] extend this symmetry to all L2 functions. Iterated kernel integration agrees with Tk; for bounded functions this is [F7], and contraction extends the identity to L2 classes.

1.2F1constructalgebra

For probability measures μ,ν and 0≤a≤1, approximate a uniformly by 2−q∑i=12q1{a≥i2−q}. Each indicator integral difference is bounded by the event-supremum TV distance, so ∣μ(a)−ν(a)∣≤∥μ−ν∥TV on taking limits. Applying this to a=(h+∥h∥∞)/(2∥h∥∞) for nonzero bounded measurable h, and separating h=0, gives ∣Pkh(x)−π(h)∣≤2∥h∥∞M(x)rk.

2.1F1step 1.1step 1.2algebra

Put Cm={M≤m} for positive integers m. If bounded h vanishes off Cm and f=h−π(h), symmetry and invariance give ∥Tkf∥22=⟨f,T2kf⟩=∫h(x)(P2kh(x)−π(h)) π(dx) for k≥1. Step 1.2 therefore gives 0≤∥Tkf∥22≤2m∥h∥∞2r2k. Write A=2m∥h∥∞<∞, so ∥Tkf∥2≤Ark. No integral of M over the whole state space has been used.

3.1F4step 1.1step 2.1algebra

For u∈H and a≥1, symmetry and [F4] give ∥Tau∥22=⟨u,T2au⟩≤∥u∥2∥T2au∥2. Repeating with a=1,2,4,…,2ℓ−1 yields ∥Tu∥2≤∥u∥21−2−ℓ∥T2ℓu∥22−ℓ. For the f in step 2.1, if f=0 the bound ∥Tf∥2≤r∥f∥2 is immediate; otherwise A>0 and the last display is at most rA2−ℓ∥f∥21−2−ℓ, tending to r∥f∥2. Hence that bound holds for every such f.

4.1F1F4F5step 1.1step 3.1construct

For u∈H choose a finite measurable representative and put hm=1Cmmax⁡(−m,min⁡(u,m)). Finiteness of M gives hm→u almost everywhere and ∣hm−u∣≤∣u∣, so [F5] gives hm→u in L2. By [F4], π(hm)→0, and therefore hm−π(hm)→u in L2. Applying step 3.1 to these centered functions and taking limits through the contraction T gives ∥Tu∥2≤r∥u∥2. Iteration on H proves ∥Tnu∥2≤rn∥u∥2 for all n≥1. This also covers H={0}.

5.1A1F4F6F7F8F9step 4.1given

Fix j≥0 and bounded centered real U,V measurable respectively for Fj and σ(Xj+n,Xj+n+1,…). By [F6] there is bounded measurable g such that E[V∣Fj+n]=g(Xj+n). Stationarity and [F9] give π(g)=0 and ∥g∥2≤∥V∥2. The tower property and [F7] give E[V∣Fj]=Png(Xj). Taking out U, applying [F4] and stationarity, and then step 4.1, yields ∣E[UV]∣=∣E[UPng(Xj)]∣≤∥U∥2∥Tng∥2≤rn∥U∥2∥V∥2.

6.1F4F5F10step 5.1∎

For general centered square-integrable U,V in the same sigma-algebras, truncate each at levels ±m and subtract its expectation. By [F5] and [F4], these bounded centered variables converge in L2; [F4] passes their covariances and norms to the limit in step 5.1. Dividing by the positive standard deviations and taking the suprema in [F10] proves ρX(n)≤rn. If no positive-variance variables exist, the coefficient is zero by the nonnegative empty-supremum convention. Thus the stated conclusion holds with C=1.

Source notes

Jones, Theorem 2(3), supplies the stated implication. Roberts and Rosenthal, Geometric ergodicity and hybrid Markov chains, Theorem 2 of the author-hosted preprint (published Theorem 2.1), proves the reversible spectral-gap route; its full proof is on PDF pp. 7–10 at https://www.probability.ca/jeff/ftpdir/hybrid.pdf . The proof here instead uses envelope level sets and repeated Cauchy–Schwarz to obtain the operator bound locally. It needs neither an integrable envelope nor a compact or general spectral theorem. The irreducibility, recurrence and aperiodicity hypotheses are retained from the source statement; the explicit common geometric rate and reversibility suffice for this argument.

Depends on

Used by

Dependency tree · two levels

61 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