Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Harris geometric ergodicity admits an integrable total-variation envelope

Statement

Assume the Axiom of Choice. Let P be a probability kernel on a measurable space (X,X) with invariant probability π. 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 P is geometrically ergodic in the sense of Geometric and uniform ergodicity for MCMC CLTs. Then there exist a measurable M:X→[0,∞) with π(M)<∞ and r∈(0,1) such that ∥Pn(x,⋅)−π∥TV≤M(x)rn(x∈X, n≥1).

In fact, the same conclusion holds assuming only AC, invariance of π, and the everywhere finite measurable common geometric-rate bound in Geometric and uniform ergodicity for MCMC CLTs, on the original arbitrary measurable space. The construction below derives the needed irreducibility on a restricted sigma-field directly from that bound.

Facts & Assumptions

Given: AC and all hypotheses in the Statement. Denote an everywhere finite measurable envelope in the geometric-ergodicity hypothesis by M0, with rate r0∈(0,1).

[A1]

The Axiom of Choice: AC is assumed for the small-set supplier and the canonical path-space and Markov suppliers below.

[F1]

Geometric and uniform ergodicity for MCMC CLTs: ∥Pn(x,⋅)−π∥TV≤M0(x)r0n for every x and n≥1, with M0 finite and measurable.

[F2]

A kernel has a countably generated stable sub-sigma-field containing a given observable: a real measurable observable belongs to a countably generated sub-sigma-field on which the kernel restricts, with the same iterated transitions on restricted events and the restricted invariant law.

[F3]

A countably generated phi-irreducible chain has a positive-measure small set: a countably generated irreducible chain has a positive-irreducibility-measure small set D, with a minorizing probability ν0 satisfying ν0(D)>0.

[F4]

Geometric small-set renewal convergence gives an integrable exponential hitting moment: a one-step small set of positive invariant mass, whose minorizing-law return probabilities converge geometrically, has a stationary-integrable exponential entrance-time moment.

[F5]

Canonical Markov chain on path space: under AC, the original kernel has canonical chains from every initial law.

[F6]

Discrete strong Markov property: bounded future-path functionals obey the Markov identity at stopping times.

[F7]

Phi-irreducibility for a general-state Markov kernel: irreducibility relative to a nonzero measure means that each positive-measure measurable set is accessible from every state at some positive time.

Proof

Given: The hypotheses in the Statement and the envelope M0,r0 in [F1], with AC [A1].

1.1A1F1F2F3F7given

Apply [F2] to M0 to obtain a countably generated G⊆X, the restricted kernel PG, and invariant probability πG=π∣G. If B∈G has πG(B)>0, [F1] implies Pn(x,B)>0 for all sufficiently large n, for each x, because M0(x) is finite. Thus PG is πG-irreducible by [F7]. Applying [F3] on this countably generated space gives an m≥1, a D∈G with π(D)>0, a probability ν0 on G with ν0(D)>0, and ϵ0>0 such that PGm(x,⋅)≥ϵ0ν0 on D. No small-set assertion on the original sigma-field is being made.

2.1F1step 1.1chooseconstruct

Since M0 is finite everywhere, D∩{M0≤K} increases to D as the positive integer K increases. Choose K so C=D∩{M0≤K} has both π(C)>0 and ν0(C)>0. Choose a finite integer L≥K and put a=ν0(M0≤L)>0, ν(B)=ν0(B∩{M0≤L})/a. Choose 0<ϵ<min⁡(1,ϵ0a). For Q=PGm this gives Q(x,⋅)≥ϵν on C, ν(M0)≤L, and M0≤K on C.

3.1A1F1F2F4F5step 2.1

For n≥1, the restricted-iteration identity in [F2] and [F1] give ∣νQn(C)−π(C)∣≤∫M0(x)r0mnν(dx)≤L(r0m)n. For n=0 the absolute difference is at most 1. Therefore [F4] applies with constant max⁡(1,L) and rate r0m. It supplies s>1 and a measurable H(x)=Ex[sσ], where σ=inf⁡{j≥0:Xjm∈C}, such that π(H)<∞. Indeed the skeleton path restricted to G under the full canonical P-chain has the Q-chain law: its finite-dimensional cylinder probabilities agree by the iterated-kernel identity in [F2]. Thus the same H is the entrance-time moment for the original chain of [F5].

4.1A1F1F5F6step 2.1step 3.1choosealgebra

Choose max⁡(r0,s−1/m)<r1<1, and set S=mσ and K1=max⁡(1,K). Fix A∈X and n≥1. On {S≤n}, decompose into the finitely many events {S=j} and use [F6] to replace the conditional terminal indicator by Pn−j(Xj,A). Since Xj∈C, [F1] bounds its difference from π(A) by K1r0n−j; when j=n, use ∣1A(Xn)−π(A)∣≤1≤K1. On {S>n} use the bound 1. Subtracting π(A) on these two events gives ∣Pn(x,A)−π(A)∣≤Px(S>n)+K1Ex[r0n−S;S≤n]≤(1+K1)r1nH(x). For the final inequality, r1−S≤sσ, and on S≤n one has r0n−S≤r1nr1−S; on S>n, 1≤r1nr1−S. This argument is for each original measurable event A, so taking its supremum controls the full original total variation and does not require measurability of a total-variation supremum.

5.1A1F1step 3.1step 4.1construct∎

The measurable set N={H=∞} is π-null by step 3.1. Define M1(x)=(1+K1)H(x) for x∉N and M1(x)=M0(x) for x∈N. It is measurable and finite everywhere, and π(M1)<∞. Off N, step 4.1 gives the desired bound with rate r1; on N, [F1] gives it because r0<r1. Taking M=M1 and r=r1 proves the stronger conclusion from invariance and the everywhere geometric bound alone: the restricted irreducibility used in step 1.1 was derived there directly. The original additional Harris, irreducibility and aperiodicity hypotheses therefore give the same conclusion as a special case. AC was used precisely through [F3] and the path-space and Markov suppliers [F4], [F5] and [F6].

Depends on

Used by

Dependency tree · two levels

47 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