Alphabeta Math
Pipeline-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.

General-state MCMC ergodicity and mixing

1 · Prerequisites

2 · Summary

Summary

This page separates invariance from convergence for a general-state Markov kernel. It defines irreducibility, aperiodicity, small and petite sets, drift, and Harris recurrence; proves the measurable-density and small-set results needed on countably generated spaces; and establishes stationary almost-everywhere convergence, the Harris all-start upgrade, uniform ergodicity from whole-space minorization, and a V(x)-weighted geometric rate.

Without Harris recurrence the convergence conclusion is only for pi-almost every start. The drift theorem gives a common geometric rate weighted by V(x): globally finite drift functions yield the bound from every state, while extended drift certificates finite pi-almost everywhere yield it on the full-measure absorbing set {V<infinity}. The bounded-set reduction explicitly supplies the improved drift needed to integrate V under the invariant law. Invariance alone gives neither irreducibility nor convergence. The companion page records periodicity, null-set starts, reducible Gibbs dynamics, sticky chains, and mixing-rate limitations.

3 · Logical flowchart

4 · Definitions, theorems and proofs

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Total variation duality, kernel contraction, and coupling bound

Statement

Let μ,ν be probability measures on (X,X) and let P be a probability kernel on that space. Then ∥μ−ν∥TV=sup⁡f:X→[0,1] X-measurable∣∫f dμ−∫f dν∣, ∥μP−νP∥TV≤∥μ−ν∥TV. If (U,V) is a coupling of μ and ν on a probability space and E is a measurable event on which U=V, then ∥μ−ν∥TV≤P(Ec).

Facts & Assumptions

Given: Two probability measures μ,ν on the same measurable space, a probability kernel P, and, for the coupling conclusion, random elements (U,V) with laws μ,ν and a measurable event E such that U=V on E.

[F1]

Total variation distance for probability laws: total variation is sup⁡A∈X∣μ(A)−ν(A)∣.

[F2]

Measure kernel and probability kernel: P(x,⋅) is a probability measure and x↦P(x,A) is measurable for each A.

[F3]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: nonnegative product-measurable functions may be integrated in either order.

Proof

Given: [F1]–[F3] and the hypotheses in the Statement.

1.1F1F3givenalgebra

For measurable f:X→[0,1], put At={x:f(x)>t} for t∈[0,1]. The identity f(x)=∫011At(x) dt and [F3] give ∫f dμ−∫f dν=∫01[μ(At)−ν(At)] dt. Its absolute value is at most ∫01∣μ(At)−ν(At)∣ dt≤∥μ−ν∥TV by [F1]. Conversely, each indicator 1A is an admissible f and attains the setwise difference for its set A. Taking suprema proves the dual formula.

2.1F1F2step 1.1given

For each A∈X, the function x↦P(x,A) is measurable and takes values in [0,1] by [F2]. Apply step 1.1 to that function to obtain ∣μP(A)−νP(A)∣≤∥μ−ν∥TV. Taking the supremum over A proves kernel contraction.

3.1F1givenalgebra∎

For any A∈X, ∣μ(A)−ν(A)∣=∣E[1A(U)−1A(V)]∣≤E∣1A(U)−1A(V)∣≤P(Ec), because the two indicators agree on E. Taking the supremum over A proves the stated bound.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Petite sets for a Markov kernel

Definition

For a probability kernel P from (X,X) to itself (Measure kernel and probability kernel), a set D∈X is petite if there are a probability measure ν on (X,X) (Probability measures and probability spaces), nonnegative weights (an)n≥1 with ∑n≥1an=1, and a constant α>0 such that ∑n≥1anPn(x,A)≥αν(A)(x∈D, A∈X). This is a randomized-time minorization. A small set requires one fixed time; a petite set permits a common distribution over positive integer times.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Phi-irreducibility for a general-state Markov kernel

Definition

Let (X,X) be a countably generated measurable space (Measurable spaces and measurable sets), P a probability kernel (Measure kernel and probability kernel), and ϕ a nonzero σ-finite measure (Finite, sigma-finite, and semifinite measures) on X. Write Pn for the n-fold kernel iterate. The kernel is ϕ-irreducible if, for every A∈X with ϕ(A)>0 and every x∈X, there is an integer n≥1 such that Pn(x,A)>0. Equivalently, the sum of these nonnegative probabilities over n≥1 is positive. No recurrence or invariant law is part of this definition.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Small-set minorization and geometric drift

Definition

For a probability kernel P on (X,X) (Measure kernel and probability kernel), a measurable set C is (m,ϵ,ν)-small if m≥1 is an integer, 0<ϵ≤1, ν is a probability measure (Probability measures and probability spaces), and Pm(x,A)≥ϵν(A)(x∈C, A∈X). The inequality is pointwise in x and holds for every measurable A.

A geometric drift inequality outside C consists of a finite-valued measurable V:X→[1,∞), constants 0<λ<1 and 0≤b<∞, and PV(x):=∫V(y)P(x,dy)≤λV(x)+b 1C(x)(x∈X). The terms small set and drift are separate hypotheses; neither definition asserts the existence of the other.

When an invariant probability π is specified (Invariant and stationary distribution for a Markov kernel), an extended geometric drift certificate finite π-almost everywhere allows measurable V:X→[1,+∞] with π(V<∞)=1 and the same pointwise inequality, interpreted in the nonnegative extended reals. This is a separate convention from the finite-valued drift function above. The geometric theorem treats this certificate on E={V<∞}; the original finite-valued convention gives the corresponding bound on the whole state space.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Measurable Lebesgue decomposition of a kernel on a countably generated space

Statement

Let (X,X) be countably generated, let μ be a nonzero σ-finite measure, and let K be a probability kernel. There are a jointly measurable p:X×X→[0,∞] and a subprobability kernel S such that K(x,A)=∫Ap(x,y) μ(dy)+S(x,A), where S(x,⋅) and μ are mutually singular for each x.

Facts & Assumptions

Given: The countably generated space, σ-finite reference measure, and probability kernel in the Statement.

[F1]

Measurable spaces and measurable sets: a countable generating family yields an increasing sequence of finite partitions generating X.

[F2]

Measure kernel and probability kernel: x↦K(x,A) is measurable and K(x,⋅) is a probability measure.

[F4]

Doob submartingale convergence theorem gives almost-sure convergence for a submartingale whose positive parts have uniformly bounded expectations. Levy upward convergence of conditional expectations identifies the almost-sure limit of conditional expectations along an increasing generating sequence with the conditional expectation on the generated sigma-algebra.

[F5]

Measurability of integration against a kernel: integrating a nonnegative jointly measurable function against a kernel preserves measurability.

[F6]

Approximation in symmetric difference by a generating algebra: under a finite measure, every measurable set is approximable in symmetric difference by members of a generating algebra.

[F7]

Finite, sigma-finite, and semifinite measures: a sigma-finite measure admits a countable partition into finite-measure pieces.

[F8]

The measure with density f relative to μ: integrating a nonnegative measurable density against the reference measure defines a measure.

[A1]

The Axiom of Choice: select sectionwise RN decompositions and singular support sets, and supply the AC hypotheses of the Doob and Levy convergence theorems in [F4].

Proof

Given: The hypotheses and facts [F1]–[F7], with [A1].

1.1F1F2F3F7A1

Choose a disjoint measurable partition (Ej)j≥1 with μ(Ej)<∞ and positive total measure. Set cj=2−j/(1+μ(Ej)) and c=∑jcjμ(Ej). Then 0<c<∞, and μˉ(A)=c−1∑jcjμ(A∩Ej) is an equivalent probability measure. Its density w=cj/c on Ej is positive. For each fixed x, choose K(x,⋅)=fxμˉ+Sx from [F3]. Let (Pn) be increasing finite partitions generating X, and set fn(x,y)=∑B∈Pn:μˉ(B)>0K(x,B)μˉ(B)1B(y), with value zero on zero-measure cells. For a positive-measure cell B∈Pn, its average at level n+1 integrates over B to the sum of K(x,C) over the positive-measure children C⊆B, which is at most K(x,B); zero-measure parents and all their children have value zero. Thus (fn(x,⋅)) is a nonnegative μˉ-supermartingale. Also ∫fn(x,⋅) dμˉ≤K(x,X)=1, so −fn(x,⋅) has uniformly bounded positive-part expectations and [F4] gives a finite almost-sure limit for fn(x,⋅).

2.1F2F4A1step 1.1

Define f∞(x,y)=lim sup⁡nfn(x,y), a jointly measurable extended nonnegative function; for each fixed x it agrees almost everywhere with the finite limit from step 1.1. The conditional-expectation averages gnx of the integrable density fx over Pn are defined by gnx(y)=μˉ(B)−1∫Bfx dμˉ on positive-measure cells B, and by zero on zero-measure cells. Since ∫fx dμˉ≤1, [F4] and the AC hypothesis [A1] give gnx→fx almost everywhere: Pn generates X. Cellwise gnx≤fn(x,⋅) because ∫Bfx dμˉ≤K(x,B), with both averages zero on null cells. Taking limits proves fx≤f∞(x,⋅) almost everywhere.

3.1F3F4F6F8A1step 2.1

For a cell B at partition level N, every n≥N has ∫Bfn(x,y)μˉ(dy)≤K(x,B), since the positive-measure level-n cells inside B contribute only a sub-sum of the kernel masses of a partition of B. Fatou therefore gives ∫Bf∞(x,y)μˉ(dy)≤K(x,B). By [F8], the left side defines a measure; Fatou at the whole space gives its total mass at most one, so both sides are finite measures. Their sum is a finite measure, and [F6] approximates any measurable set in symmetric difference under that sum; the inequality extends from the generating partition algebra to every measurable set. Choose a singular support Nx with μˉ(Nx)=0 and Sx(Nxc)=0. Since the left measure has density f∞ with respect to μˉ, it assigns zero mass to Nx. Applying the inequality to A∩Nxc therefore gives ∫Af∞ dμˉ≤∫Afx dμˉ. Together with step 2.1, this proves f∞=fx almost everywhere.

4.1F2F3F5step 3.1∎

Since μˉ(dy)=w(y)μ(dy), set p(x,y)=f∞(x,y)w(y) and S(x,A)=K(x,A)−∫Ap(x,y)μ(dy). Step 3.1 shows sectionwise that S(x,⋅)=Sx, a nonnegative subprobability measure singular to μ. The integral is measurable in x by [F5]; hence S(⋅,A) is measurable for every A, and its sections are countably additive. Thus S is a subprobability kernel and the decomposition holds.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

A positive triple set has uniformly overlapping sections

Statement

Let ϕ be a finite nonzero measure on a countably generated measurable space. For measurable A,B⊆X2, define E={(x,y,z):(x,y)∈A, (y,z)∈B}. If ϕ⊗3(E)>0, then there are measurable C,D with ϕ(C),ϕ(D)>0 and γ>0 such that ϕ(A1(x)∩B2(z))≥γ(x∈C, z∈D), where A1(x)={y:(x,y)∈A} and B2(z)={y:(y,z)∈B}.

Facts & Assumptions

Given: The finite measure, countably generated sigma-algebra, and product-measurable sets in the Statement.

[F1]

Measurable spaces and measurable sets: a measurable space consists of a set and a sigma-algebra. Countable generation is an explicit hypothesis here.

[F2]

Approximation in symmetric difference by a generating algebra: under a finite measure every measurable set has arbitrarily close symmetric-difference approximants in a generating algebra.

[F3]

Proof

Given: The hypotheses and facts [F1]–[F3].

1.1F1F2F3givenchoosealgebra

Put η=ϕ⊗3(E)>0. The product measure is finite because ϕ is finite. Fix a generating sequence (Gj)j≥1 for X. Let Pn consist of the nonempty sets ⋂j=1nHj, where each Hj is Gj or Gjc. These are finite partitions and Pn+1 refines Pn. Their finite-union algebras increase and contain every Gj. The union of the corresponding tensor-cell algebras on X3 is therefore an algebra generating X⊗3: it contains every coordinate lift of a Gj, which generate the product sigma-algebra, and all its cells are product-measurable. Apply [F2] to obtain a member H of that algebra with ϕ⊗3(E△H)<η/6. Then ϕ⊗3(H)>5η/6 and ϕ⊗3(H∖E)<η/6<ϕ⊗3(H)/4, so E occupies more than three quarters of H. The set H is a finite union of tensor cells at a common partition level. If every positive-measure cell had occupancy at most three quarters, finite additivity would give the same upper bound on H, a contradiction. Thus some cell U×V×W has positive product measure and ϕ⊗3(E∩(U×V×W))>34ϕ(U)ϕ(V)ϕ(W)>0. Only one finite-algebra approximant and one cell of its finite partition are selected; no conditional-expectation representative or choice axiom is used.

2.1F3step 1.1

Since E⊆A× ⁣yB, Tonelli gives ∫U×V1A(x,y) dϕ(x)dϕ(y)>34ϕ(U)ϕ(V), and likewise ∫V×W1B(y,z) dϕ(y)dϕ(z)>34ϕ(V)ϕ(W). Consequently the sets C={x∈U:ϕ(A1(x)∩V)>34ϕ(V)} and D={z∈W:ϕ(B2(z)∩V)>34ϕ(V)} have positive measure; otherwise the corresponding integral could not exceed three quarters of the rectangle measure.

3.1step 2.1algebra∎

For x∈C and z∈D, both sections occupy more than three quarters of V. The complement of their intersection in V is the union of two sets, each of measure less than ϕ(V)/4. Thus ϕ(A1(x)∩B2(z))≥ϕ(V)/2>0. Set γ=ϕ(V)/2.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Aperiodicity for a general-state Markov kernel

Definition

Let P be a ϕ-irreducible probability kernel (Phi-irreducibility for a general-state Markov kernel) with invariant probability π (Invariant and stationary distribution for a Markov kernel). The chain is aperiodic if there do not exist an integer d≥2 and pairwise disjoint measurable sets X1,…,Xd such that π(X1)>0 and P(x,Xi+1)=1(x∈Xi, 1≤i<d),P(x,X1)=1(x∈Xd). Invariance then gives π(Xi)>0 for every i. The sets need not cover the full state space; the definition rules out any positive-mass cyclic part. Aperiodicity does not itself assert convergence.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Harris recurrence relative to an irreducibility measure

Definition

Let P be ϕ-irreducible with nonzero σ-finite irreducibility measure ϕ. It is Harris recurrent relative to ϕ if for every A∈X with ϕ(A)>0 and every starting state x, the first hitting time τA=inf⁡{n≥0:Xn∈A} satisfies Pr⁡x(τA<∞)=1. This is an all-start almost-sure hitting property; it is stronger than ϕ-irreducibility, which requires only positive probability at some finite time.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A bivariate drift and minorization bound geometric coupling error

Statement

Let Q be a probability kernel, D be (1,ϵ,ν)-small for Q, and let 0<a<1. If 0<ϵ<1, define residual probabilities Rx=(Q(x,⋅)−ϵν)/(1−ϵ) on D and assume B≥max⁡{1,(1−ϵ)sup⁡(x,y)∈D2Rx⊗Ry(h)/a}<∞. If ϵ=1, set B=1 and impose no residual condition. Suppose h:X2→[1,∞) is finite-valued and measurable and Q⊗Q h≤ah off D2. Then there are M<∞ and 0<r<1 such that a coupling of two Q-chains has a measurable split-success time T, with Xn=Yn on {T≤n}, and satisfies Pr⁡x,y(T>n)≤Mh(x,y)rn. Consequently ∥Qn(x,⋅)−Qn(y,⋅)∥TV≤Mh(x,y)rn. For ϵ=1, the transition following the first visit to D2 couples the chains.

Facts & Assumptions

Given: The kernel, one-step minorization, bivariate drift, finite residual bound, and h≥1 in the Statement.

[F1]

Small-set minorization and geometric drift: on D, Q(x,⋅)≥ϵν.

[F2]

Measure kernel and probability kernel: the independent product and residual transition rules define probability transitions.

[F3]

Total variation duality, kernel contraction, and coupling bound: for any coupling, total variation is bounded by the probability that the coupled variables differ.

[F4]

Measurability of integration against a kernel: the residual expectations and stopped-chain expectations are measurable.

[F5]

Finite products of probability kernels are probability kernels: independent coordinate transitions form the product probability kernel.

[F6]

Canonical Markov chain on path space: the coupled kernel transitions have a canonical path realization under the stated AC convention.

[F7]

Discrete strong Markov property: the attempt times obey the discrete strong Markov property.

[A1]

The Axiom of Choice: the canonical path and split-transition construction uses AC as stated by [F6].

Proof

Given: The hypotheses and facts [F1]–[F7], with [A1].

1.1F1F2F4F5F6F7A1given

Run the two coordinates independently until both lie in D. At each such visit, use the minorization to toss a common Bernoulli(ϵ) split: on success draw one shared ν state; on failure draw independently from Rx,Ry. Let T=inf⁡{k+1:the split at time k succeeds}, with inf⁡∅=∞. Record success with a measurable binary flag and evolve synchronously thereafter, without testing equality before success. The shared transition is the pushforward of Q(Xk,⋅) under z↦(z,z); this map is measurable on every measurable space. This construction has the required Q-marginals by [F1], [F2], and [F5].

2.1F1F2F4F7A1step 1.1

Let Nk count failed split transitions completed by time k, with N0=0, and set Zk=a−kB−Nkh(Xk,Yk)1{T>k}. If ϵ=1, a visit to D2 couples on the next transition, so the uncoupled contribution there is zero. If 0<ϵ<1, off D2 the conditional expectation of the next h is at most ah; on D2 the uncoupled transition has probability 1−ϵ and expected h equal to Rx⊗Ry(h). The definition of B bounds its contribution after the extra factor B−1 by ah(x,y), since h≥1. Thus (Zk) is a nonnegative supermartingale in both cases.

3.1step 2.1algebra

For any integer j≥1, the probability of at least j failed attempts is at most (1−ϵ)j. On the event T>k with at most j−1 failures, h≥1 and BNk≤Bj−1, so the supermartingale bound gives Pr⁡(T>k)≤(1−ϵ)j+akBj−1h(x,y).

4.1F3step 3.1algebra∎

Choose θ>0 so aBθ<1 and set j=max⁡(1,⌊θk⌋). Both terms in step 3.1 are bounded by a constant times rk for some r<1. Apply the coupling inequality [F3] to obtain the asserted geometric bound after increasing M to cover the finite initial values of k.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

A drift sublevel enlargement of a small set is petite

Statement

Suppose C is (m,ϵ,ν)-small and PV≤λV+b1C with finite V≥1, 0<λ<1. For every finite d≥1, D=C∪{V≤d} is petite.

Facts & Assumptions

Given: The kernel, small-set minorization and drift inequality in the Statement.

[F1]

Small-set minorization and geometric drift: Pm(x,⋅)≥ϵν on C, and outside C, PV≤λV.

[F2]

Petite sets for a Markov kernel: petite means a fixed probability mixture of positive-time transition kernels dominates a positive multiple of a common probability.

[F3]

Measure kernel and probability kernel: kernel iteration and stopping-time probabilities are measurable.

[F4]

Monotone convergence for the integral: nonnegative sums may be integrated termwise.

[F5]

Discrete strong Markov property: conditional on a finite first entrance time, the chain continues with kernel P.

[A1]

The Axiom of Choice: the canonical path and stopping-time realization use AC as specified by [F5].

Proof

Given: The hypotheses and facts [F1]–[F5], with [A1].

1.1F1F3A1given

If C=∅, then PV≤λV everywhere; iterating gives 1≤PNV(x)≤λNV(x) for every state x and N, impossible for sufficiently large N because V(x)<∞. Thus the hypotheses force C≠∅. Let τC=inf⁡{n≥0:Xn∈C}. The killed kernel K(x,A)=1Cc(x)P(x,A) satisfies KV≤λV off C. Since V≥1, induction gives KN1(x)≤KNV(x)≤λNV(x). Hence for x∈{V≤d}, Pr⁡x(τC≤N)≥1−dλN; for x∈C, τC=0.

2.1F1F5A1step 1.1

For each t≤N, restrict paths to the disjoint event {τC=t} and apply [F5] followed by the small-set minorization. This gives Pt+m(x,A)≥ϵPr⁡x(τC=t)ν(A). Summing over t yields ∑t=0NPt+m(x,A)≥ϵ(1−dλN)ν(A) uniformly on D.

3.1F2F4step 2.1∎

Choose N with dλN≤1/2 and assign weight 1/(N+1) to times m,…,m+N. The resulting probability mixture dominates ϵν/[2(N+1)], so it satisfies the petite definition with positive multiplier α=ϵ/[2(N+1)].

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

An invariant law integrates a drift function bounded on its small set

Statement

Let π be invariant for P, and suppose PV≤λV+b1C with V≥1, 0<λ<1, and sup⁡CV<∞. Then πV<∞.

Facts & Assumptions

Given: The invariant probability and drift inequality in the Statement.

The supremum is interpreted in the extended reals, with sup⁡∅=−∞; the empty-set case is handled separately below.

[F1]

Small-set minorization and geometric drift: V is finite-valued and PV≤λV+b1C pointwise.

[F2]

Invariant and stationary distribution for a Markov kernel: πP=π, including equality of integrals for bounded measurable functions.

[F3]

Measure kernel and probability kernel: P(V∧N) is measurable and bounded by N.

[F4]

Monotone convergence for the integral: ∫(V∧N)dπ↑∫Vdπ.

Proof

Given: The hypotheses and facts [F1]–[F4].

1.1F1F2given

If C=∅, then PV≤λV everywhere. For each integer N≥1, VN=V∧N satisfies PVN−VN≤−(1−λ)V on {V≤N} and PVN−VN≤0 on {V>N}. Invariance for the bounded function VN gives integral zero, so π({V≤N})=0. Since V is finite-valued, these sets increase to the whole space, contradicting that π is a probability. Thus no invariant probability exists in the empty-set case, and the implication is vacuous. Assume C≠∅ below.

1.2F1F3given

Set VN=V∧N. Since VN≤V and VN≤N, PVN≤min⁡(PV,N). On C, PVN−VN≤λsup⁡CV+b. On Cc∩{V≤N} it is at most −(1−λ)V, and on Cc∩{V>N} it is at most zero.

2.1F2step 1.2

Invariance for bounded VN gives ∫(PVN−VN)dπ=0. Using the three pointwise bounds from step 1.2, (1−λ)∫Cc∩{V≤N}V dπ≤(λsup⁡CV+b)π(C)≤λsup⁡CV+b.

3.1F4step 2.1∎

The domains Cc∩{V≤N} increase to Cc; monotone convergence bounds ∫CcVdπ by the right side divided by 1−λ. The integral over C is at most sup⁡CV. Hence πV<∞.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Invariant mass and almost-sure hitting of accessible sets

Statement

Let P have invariant probability π. If a measurable set A has positive probability of being hit from every starting state, then Pr⁡x(τA<∞)=1 for π-almost every x. In addition, if P is ϕ-irreducible and ϕ(A)>0, then π(A)>0 and the positive-hitting hypothesis holds.

Facts & Assumptions

Given: A probability kernel with invariant probability; for the first conclusion, the positive-hitting premise; for the additional conclusion, a ϕ-irreducibility measure and ϕ(A)>0.

[F1]

Phi-irreducibility for a general-state Markov kernel: every ϕ-positive set is reached with positive probability from every state at some finite positive time.

[F2]

Invariant and stationary distribution for a Markov kernel: πPn=π for every n≥0.

[F3]

Canonical Markov chain on path space: under its stated AC convention, iterated kernels define the canonical path law.

[F4]

Discrete strong Markov property: the canonical chain has the strong Markov property at discrete stopping times.

[F5]

Monotone convergence for the integral: increasing countable sums and limits pass through integration.

[F6]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: nonnegative sums and kernel integrals may be interchanged.

[F7]

Measurability of integration against a kernel: integrating a bounded measurable function against a probability kernel gives a measurable function of the starting state.

[A1]

Assume The Axiom of Choice as required by the canonical path-law [F3] and strong Markov [F4] suppliers. The countable level-set arguments below need no measurable selection theorem.

Proof

Given: The invariant law and applicable hypotheses, with [F1]–[F7] and [A1].

1.1F1F2F5F6given

For the additional conclusion, let f(x)=∑n≥1Pn(x,A). By [F1], f(x)>0 everywhere. Tonelli and stationarity give ∫f dπ=∑n≥1π(A). If π(A)=0, this integral is zero, contradicting positivity of f under a probability measure. Hence π(A)>0; [F1] also supplies the positive-hitting premise for the first assertion.

1.2F2F3F5F7A1given

It remains to prove the first assertion under its positive-hitting premise. Set q0=1A and recursively qn+1=1A+1AcPqn, where Pqn(x)=∫qn(y)P(x,dy). Then qn(x)=Pr⁡x(τA≤n); induction and [F7] show each qn is measurable, and qn↑q:=Pr⁡x(τA<∞), so q is measurable. If the bad set {q<1} has positive mass, a countable level-set union gives some δ1>0 for which B1={x:q(x)≤1−δ1} has positive π-measure. For each x∈B1, q(x)>0 and x∉A, so some ℓ0≥1 has Pℓ0(x,A)>0. Countable unions over times and rational thresholds then give a common ℓ0≥1, δ2>0, and B2⊆B1 with π(B2)>0 and Pℓ0(x,A)≥δ2 on B2.

2.1F2F4F5F7step 1.2

Let η=#{k≥1:Xkℓ0∈B2}. At each such visit, the conditional probability of avoiding A at the next ℓ0-step time is at most 1−δ2. Induction using [F4] gives Pr⁡x(τA=∞,η≥r)≤(1−δ2)r for each finite r, and hence Pr⁡x(τA=∞,η=∞)=0. Thus for x∈B2, Pr⁡x(τA=∞,η<∞)≥δ1. To select a measurable positive-mass set with a common finite last-visit bound, for each ℓ≥1 forbid A at every time and also forbid B2 at times kℓ0 with k≥ℓ. For a finite horizon N, let Fn(ℓ)=A∪B2 if n=kℓ0 for some k≥ℓ, and Fn(ℓ)=A otherwise. Set gN,N=1(FN(ℓ))c and recursively set gN,n=1(Fn(ℓ))cPgN,n+1 for n=N−1,…,0. Then gℓ,N=gN,0 is the finite-horizon event probability and is measurable by [F7]. As N→∞, these events decrease to {τA=∞,sup⁡{k≥1:Xkℓ0∈B2}<ℓ}, so continuity from above makes their limit gℓ(x) measurable. The events increase with ℓ and their union is {τA=∞,η<∞}, so gℓ(x)↑ a value at least δ1 on B2. A countable rational threshold selection therefore gives ℓ≥1, δ>0, and B⊆B2 with π(B)>0 and Pr⁡x ⁣(τA=∞, sup⁡{k≥1:Xkℓ0∈B2}<ℓ)≥δ(x∈B).

3.1F2F3F4step 2.1algebra∎

Put L=ℓℓ0 and S=sup⁡{k≥1:XkL∈B}, with S=−∞ if no such visit occurs. For 1≤r≤j, consider the event that XrL∈B, there is no later B-visit at a positive multiple of L, and no hit of A at or after rL. It is a subset of {S=r, XjL∉A}. Stationarity and the Markov property at time rL therefore give Pr⁡π(S=r, XjL∉A)≥∫Bπ(dy)Pr⁡y(τA=∞, S=−∞)≥π(B)δ. Indeed the event in step 2.1 rules out every B2-visit at skeleton indices k≥ℓ, hence every later B-visit at a positive multiple of L=ℓℓ0, as well as every future hit of A. The events S=r are disjoint, so stationarity yields π(Ac)≥jπ(B)δ. Taking j>1/(π(B)δ) contradicts π(Ac)≤1. Therefore the bad set is π-null.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Iterated kernel densities retain convolution lower bounds

Statement

Let P be ϕ-irreducible on a countably generated space, with nonzero σ-finite irreducibility measure ϕ. For each n≥1 there are a jointly measurable pn and a singular residual kernel Sn such that Pn(x,dy)=pn(x,y)ϕ(dy)+Sn(x,dy), and versions may be chosen so that for every r,s≥1 and every x,y, pr+s(x,y)≥∫pr(x,z)ps(z,y)ϕ(dz),pr+s(x,y)≥∫Pr(x,dz)ps(z,y). For every x, ∑n≥1pn(x,y)>0 for ϕ-almost every y.

Facts & Assumptions

Given: The countably generated space, ϕ-irreducible kernel, and irreducibility measure in the Statement.

[F1]

Phi-irreducibility for a general-state Markov kernel: every ϕ-positive set is reached from every state at some finite positive time.

[F2]

Measure kernel and probability kernel: a probability kernel has measurable evaluations and probability-measure sections.

[F3]

Measurable Lebesgue decomposition of a kernel on a countably generated space: each Pn has a jointly measurable density component and singular residual kernel.

[F4]

Measurability of integration against a kernel: integration of a nonnegative product-measurable function against a probability kernel is measurable.

[A1]

The Axiom of Choice: retain the Choice assumption of [F3] and choose countably many sectionwise singular supports.

[F5]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: nonnegative sums and kernel integrals can be interchanged.

Proof

Given: The hypotheses and facts [F1]–[F5], and [A1].

1.1F2F3F4F5A1

Apply [F3] to each Pn, obtaining preliminary densities pn0 and singular residuals Sn. Inductively set p1=p10 and, for n>1, pn(x,y)=max⁡(pn0(x,y),sup⁡1≤k<n∫Pn−k(x,dz)pk(z,y)). For each k<n, the lifted kernel ((x,y),A)↦Pn−k(x,A) is a probability kernel by [F2]. Apply [F4] to this kernel and the nonnegative product-measurable integrand ((x,y),z)↦pk(z,y); finite maxima preserve measurability. Thus the right side is jointly measurable. For each fixed x, composition of kernels gives Pn(x,A)≥∫A∫Pn−k(x,dz)pk(z,y)ϕ(dy). Since Sn(x,⋅) is singular, this domination forces each candidate density to be at most pn0(x,⋅) ϕ-almost everywhere. Thus pn=pn0 ϕ-a.e. for each x, so it is still the density part and has both displayed convolution lower bounds pointwise by construction.

1.2F1F3A1

Fix x. For each n, choose a ϕ-null support Nn of Sn(x,⋅) and let F=⋂n≥1Nnc. Then ϕ(Fc)=0 and every residual assigns zero mass to F. If B⊆F has ϕ(B)>0, [F1] gives an m with Pm(x,B)>0; because the residual gives B zero mass, ∫Bpm(x,y)ϕ(dy)>0.

2.1F5step 1.2∎

Therefore every positive-ϕ subset of F intersects {∑npn(x,⋅)>0} in positive measure. Its complement in F must be ϕ-null; otherwise take that complement as B in step 1.2, which would make every integral zero. Hence the density sum is positive ϕ-almost everywhere.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Whole-space minorization gives uniform geometric ergodicity

Statement

Let P have invariant probability π. If for some m≥1, 0<ϵ≤1, and probability ν, Pm(x,⋅)≥ϵν(⋅)for every x, then for every n≥0, sup⁡x∥Pn(x,⋅)−π∥TV≤(1−ϵ)⌊n/m⌋. Thus this chain is uniformly geometrically ergodic: there are common M<∞ and r<1 with sup⁡x∥Pn(x,⋅)−π∥TV≤Mrn. No converse is asserted. When ϵ=1, the floor bound means 1 for n<m and 0 for n≥m.

Facts & Assumptions

Given: The probability kernel, invariant probability, and whole-space minorization in the Statement.

[F1]

Small-set minorization and geometric drift: the stated lower bound is a probability-kernel minorization.

[F3]

Total variation distance for probability laws: total variation is the supremum over measurable events (up to the stated normalization).

[F4]

Total variation duality, kernel contraction, and coupling bound: a probability kernel contracts total variation.

Proof

Given: The hypotheses and facts [F1]–[F4].

1.1F1F3F4

Write Pm(x,⋅)=ϵν+(1−ϵ)Rx; if ϵ=1, take any probability residual because its coefficient is zero. For probabilities μ,μ′, the common term cancels, so ∥μPm−μ′Pm∥TV≤(1−ϵ)∥μ−μ′∥TV by the event-supremum definition and kernel contraction.

2.1F2F4step 1.1algebra∎

Iterating step 1.1 q=⌊n/m⌋ times and using invariance yields ∥δxPqm−π∥TV≤(1−ϵ)q. Write n=qm+r with 0≤r<m; the remaining Pr contracts total variation and leaves π invariant, so the same bound holds at n. Taking the supremum over x proves the result.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Aperiodicity makes minorization times eventually consecutive

Statement

Let P be ϕ-irreducible (Phi-irreducibility for a general-state Markov kernel) and aperiodic (Aperiodicity for a general-state Markov kernel) with invariant probability π. Let ν≪π be a probability. Suppose every state has some n(x)≥1 and δ(x)>0 with Pn(x)(x,⋅)≥δ(x)ν(⋅). Then there is N such that for every n≥N, νPn≥ϵnν for some ϵn>0.

Facts & Assumptions

Given: Countable generation, the irreducibility and aperiodicity definitions, invariant law, ν≪π, and the statewise minorization.

[F1]

Aperiodicity for a general-state Markov kernel: no disjoint cyclic family of at least two positive-π classes has deterministic transitions to its successors; the family need not cover the space.

[F2]

Measure kernel and probability kernel: kernel iterates act on measures and preserve nonnegative measure inequalities.

[F4]

Phi-irreducibility for a general-state Markov kernel: the underlying measurable space is countably generated.

[F5]

Approximation in symmetric difference by a generating algebra: finite-measure sets are approximable in symmetric difference by the generating algebra.

[F6]

Monotone convergence for the integral: countable nonnegative sums may be integrated termwise.

Proof

Given: The hypotheses and facts [F1]–[F6].

1.1F2F4F5F6given

For n,k≥1, let En,k={x:Pn(x,⋅)≥k−1ν(⋅)}. Fix a countable generating sequence (Gj). The union of the finite Boolean algebras generated by G1,…,Gj is a countable algebra A0 generating X. The inequality defining En,k is equivalent to its restrictions to B∈A0: if those hold, approximate any measurable A under the finite measure Pn(x,⋅)+k−1ν by an algebra set; the difference of the two sides changes by at most that symmetric-difference mass, which tends to zero. Thus En,k=⋂B∈A0{x:Pn(x,B)≥k−1ν(B)} is measurable by [F2] and [F4]. The statewise hypothesis makes their union the whole space. Since ν is a probability, one such set has positive ν-mass. Integrating its inequality gives νPn≥k−1ν(En,k)ν. Thus the set T={n≥1:νPn≥cnν for some cn>0} is nonempty.

2.1F2step 1.1

If r,s∈T, then (νPr)Ps≥crνPs≥crcsν, so T is additive. Let d=gcd⁡(T).

3.1F1F2F4F5F6step 2.1

Suppose d>1. For 1≤i≤d, define Xi={x:∃ℓ≥1, ℓd−i≥1, δ>0, Pℓd−i(x,⋅)≥δν(⋅)}. Every positive witness time n has exactly one representation n=ℓd−i with 1≤i≤d and ℓd−i≥1, so the statewise minorization covers the space by these sets; rational thresholds and the countable testing algebra make them measurable. Put O=⋃i≠j(Xi∩Xj). For every m≥0, νPm(O)=0: otherwise a countable subdivision gives a positive νPm-mass subset of an overlap on which both phase exponents and both positive constants are fixed. Integrating the two minorization inequalities gives two times in T with different residues modulo d, contradicting that d divides every member of T.

4.1F1F2F3F4F5step 3.1

Let S=O∪{x:∃m≥0, Pm(x,O)>0} and Xi′=Xi∖S. Since νPm(O)=0 for every m, ν(S)=0. The Xi′ are disjoint and cover Sc. For x∈Xi′, P(x,S)=0: positive mass on the countable union defining S would, by integration of a positive hitting probability, imply Pm+1(x,O)>0 for some m≥0, contradicting x∉S. Thus P(x,⋃jXj′)=1. If P(x,Xj′)>0 for j≠i+1(modd), countably partition Xj′ by its witnessing exponent and rational minorization constant; one part has positive P(x,⋅)-mass. Integrating the common later minorization after that one-step transition puts x in Xj−1, contradicting disjointness of the Xi′. Thus P(x,Xi+1)=1 for x∈Xi′. Since ν(S)=0, the disjoint classes satisfy ν(⋃iXi′)=1. Absolute continuity gives π(⋃iXi′)>0, so some Xi′ has positive π-mass. Invariance propagates positive mass from each class to its successor, so all Xi′ have positive π-mass. This is a cyclic decomposition, contrary to [F1]. Hence d=1.

5.1step 4.1algebra∎

Choose finitely many t1,…,tq∈T with gcd one. Their nonnegative combinations modulo t1 form the subgroup generated by their residues; gcd one makes this all residues. Choose one represented uj∈T for each residue j. Every sufficiently large integer in residue j is uj+ℓt1 and belongs to T by additivity. The defining positive constant for each such n is ϵn.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A countably generated phi-irreducible chain has a positive-measure small set

Statement

Let (X,X) be countably generated, let P be a probability kernel that is ϕ-irreducible (Phi-irreducibility for a general-state Markov kernel), and let ϕ be a nonzero σ-finite irreducibility measure. Then there are an integer m≥1, a measurable C with ϕ(C)>0, a probability ν with ν(C)>0, and ϵ>0 such that Pm(x,⋅)≥ϵν(⋅) for every x∈C.

Facts & Assumptions

Given: Countable generation, the probability kernel, and ϕ-irreducibility.

[F1]

Phi-irreducibility for a general-state Markov kernel: every positive-ϕ set is reached with positive probability at some finite positive time from every state.

[F2]

Small-set minorization and geometric drift: a small set is a common fixed-time minorization by a probability measure.

[F3]

Iterated kernel densities retain convolution lower bounds: iterated kernel densities satisfy convolution lower bounds and their sum is positive ϕ-almost everywhere from every state.

[F4]

A positive triple set has uniformly overlapping sections: a positive-measure set of composable density pairs has sections with a uniform positive overlap.

[F5]

Measurable spaces and measurable sets: countable generation supplies finite partitions and countable testing algebras.

[A1]

The Axiom of Choice: the density versions and measure representatives in [F3] are selected under AC.

[F7]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: nonnegative product integrals and countable sums can be interchanged.

Proof

Given: The hypotheses and facts [F1]–[F5], [F7], and [A1].

1.1F3F5F7A1given

Write ϕ as a countable disjoint union of measurable finite-measure sets Ej. Set cj=2−j/(1+ϕ(Ej)) and c=∑jcjϕ(Ej). Since ϕ is nonzero and the Ej cover the space, 0<c≤1. Then ϕˉ(A)=c−1∑jcjϕ(A∩Ej) is an equivalent probability measure: it has density cj/c>0 on every Ej, and hence exactly the same null sets and positive sets as ϕ. Replace ϕ by ϕˉ for the rest of the proof. By [F3], for every x the sum ∑npn(x,y) is positive for ϕ-almost every y. Tonelli and countability imply that for ϕ⊗3-almost every (x,y,z), this sum is positive at (x,y) and the corresponding sum at (y,z) is positive. Hence the product of the two sums is positive almost everywhere; its countable expansion shows that some fixed r,s≥1 satisfy ∫pr(x,y)ps(y,z) ϕ(dx)ϕ(dy)ϕ(dz)>0. For a sufficiently small η>0, the set where both factors exceed η still has positive product measure.

2.1F3F4step 1.1

Apply [F4] to A={(x,y):pr(x,y)>η} and B={(y,z):ps(y,z)>η}. Obtain positive-ϕ sets C0,D0 and γ>0 such that their sections overlap by at least γ. The convolution bound [F3] gives pr+s(u,v)≥η2γ for every u∈C0,v∈D0.

3.1F1F5F7step 2.1

Since C0 is ϕ-positive, irreducibility gives ∑k≥1Pk(x,C0)>0 for every x. Integrating over D0 and using Tonelli, some k≥1 has ∫D0Pk(x,C0)ϕ(dx)>0. A positive-level-set subdivision yields G⊆D0 with ϕ(G)>0 and δ>0 such that Pk(x,C0)≥δ for every x∈G.

4.1F2F3step 2.1step 3.1∎

For every x∈G and z∈D0, the second convolution inequality in [F3] gives pr+s+k(x,z)≥∫C0Pk(x,dy)pr+s(y,z)≥δη2γ. Let ν(A)=ϕ(A∩D0)/ϕ(D0) and choose 0<ϵ≤min⁡{1,δη2γϕ(D0)}. Integrating the density over A∩D0 gives Pr+s+k(x,A)≥ϵν(A) for every x∈G. Since G⊆D0 and ϕ(G)>0, ν(G)>0. Thus G is the required small set.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

A petite drift enlargement is small under aperiodicity

Statement

Let P be countably generated, ϕ-irreducible and aperiodic with invariant probability π. Suppose D is petite with probability ν and multiplier α>0, and C⊆D is (m,ϵ,ν)-small for this same ν, with ν(C)>0 and ν≪π. Then D is small at some common time.

Facts & Assumptions

Given: The kernel, irreducibility, aperiodicity, invariant probability, petite inequality on D, and same-measure small-set minorization on C.

[F1]

Petite sets for a Markov kernel: ∑n≥1anPn(x,⋅)≥αν(⋅) on D.

[F2]

Small-set minorization and geometric drift: Pm(y,⋅)≥ϵν on C.

[F3]

Aperiodicity makes minorization times eventually consecutive: once every state can reach a minorization into ν≪π, νPn≥cnν for every sufficiently large n.

[F4]

Phi-irreducibility for a general-state Markov kernel: every positive-ϕ set is accessible from every state.

[F5]

Discrete strong Markov property: the chain restarts from its state at the first entrance time.

[F6]

Invariant and stationary distribution for a Markov kernel: πPn=π for every n≥0.

[A1]

The Axiom of Choice: the canonical path/stopping-time construction uses AC as specified by [F5].

Proof

Given: The hypotheses and facts [F1]–[F5], with [A1].

1.1F1given

The petite inequality on C gives ∑nanPn(x,C)≥αν(C)>0 for every x∈D. Choose M so ∑n>Man<αν(C)/2. Since Pn(x,C)≤Pr⁡x(τC≤n)≤Pr⁡x(τC≤M) for n≤M, the truncated weighted sum gives Pr⁡x(τC≤M)≥q:=αν(C)/2 uniformly on D.

2.1F2F3F4F6step 1.1

Since ν(C)>0 and ν≪π, π(C)>0. To see that every state has positive probability of reaching C, let H={x∈Cc:Pn(x,C)=0 for every n≥1}. Kernel iteration makes H measurable. If x∈H and P(x,Hc)>0, the countable union Hc=C∪⋃n≥1{y:Pn(y,C)>0} has a member of positive P(x,⋅)-mass; integrating the corresponding positive function gives Pn+1(x,C)>0, a contradiction. Thus P(x,H)=1 for every x∈H. Suppose H≠∅ and fix x∈H. Irreducibility then forces ϕ(Hc)=0, since no point of H can reach Hc; hence ϕ(H)>0. For every n≥1, invariance and Pn(x,H)=1 on H give ∫HcPn(x,H) π(dx)=0. Irreducibility says every x∈Hc has Pn(x,H)>0 for some n, so the countable union of these π-null level sets is Hc and π(Hc)=0, contradicting π(C)>0. Therefore H=∅. For x∉C some positive time reaches C by the definition of H; for x∈C, [F2] gives Pm(x,C)≥ϵν(C)>0. Thus for each state there is n(x)≥1 with Pn(x)(x,C)>0; then Pn(x)+m(x,⋅)≥ϵPn(x)(x,C)ν(⋅). By [F3], νPt≥ctν for every t≥N0. Choose L>M+m+N0. For every 0≤s≤M and y∈C, PL−s(y,⋅)≥ϵνPL−s−m(⋅)≥ϵcL−s−mν(⋅). The minimum c>0 over these finitely many s is positive.

3.1F5A1step 1.1step 2.1∎

Decompose at the first hitting time τC=s≤M. The strong Markov property and step 2.1 give PL(x,⋅)≥cν(⋅)Pr⁡x(τC≤M)≥cqν(⋅) for every x∈D. This is one fixed-time minorization, so D is small.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Small-set coupling yields almost-everywhere total-variation convergence

Statement

Let P be countably generated, ϕ-irreducible and aperiodic with invariant probability π. If C is (m,ϵ,ν)-small, ϕ(C)>0, and ν(C)>0, then ∥Pn(x,⋅)−π∥TV→0 for π-almost every x.

Facts & Assumptions

Given: The kernel, irreducibility measure, aperiodicity, invariant law and small set.

[F1]

Phi-irreducibility for a general-state Markov kernel: every positive-ϕ set is accessible from every state.

[F2]

Aperiodicity for a general-state Markov kernel: no cyclic decomposition exists on the stationary irreducible part.

[F4]

Small-set minorization and geometric drift: Pm(x,⋅)≥ϵν on C.

[F5]

Invariant mass and almost-sure hitting of accessible sets: for any stationary kernel, if every start has positive chance to hit a target, stationary almost every start hits it almost surely.

[F6]

Aperiodicity makes minorization times eventually consecutive: νPn≥cnν for all sufficiently large n when ν≪π and each state can reach the minorization.

[F7]

Finite products of probability kernels are probability kernels: independent coordinates define product probability kernels.

[F8]

Total variation duality, kernel contraction, and coupling bound: a coupling bounds total variation by its disagreement probability.

[F9]

Canonical Markov chain on path space: the kernel defines its canonical path law under its stated AC convention.

[F10]

Discrete strong Markov property: the pair chain restarts at discrete stopping times.

[F11]

Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system: finite measures agreeing on measurable rectangles agree on the product sigma-algebra.

[A1]

The Axiom of Choice: the path and split-kernel constructions use AC as specified by [F9].

Proof

Given: The hypotheses and facts [F1]–[F11], with [A1].

1.1F3F4F5

By [F5], π(C)>0. Integrating the small-set inequality over C and using invariance gives π(A)=πPm(A)≥ϵπ(C)ν(A) for all A, hence ν≪π.

2.1F1F2F4F6step 1.1

Fix x. Irreducibility gives kx with Pkx(x,C)>0, so Pkx+m(x,⋅)≥ϵPkx(x,C)ν. By [F6], νPt(C)≥ctν(C)>0 for every sufficiently large t. Thus Pn(x,C)>0 for every sufficiently large n, and in particular Pmq(x,C)>0 for every sufficiently large integer q. This holds for every x.

3.1F3F5F7F11step 2.1

Let Qˉ=(Pm)⊗(Pm). For measurable rectangles A×B, (π2Qˉ)(A×B)=(πPm)(A)(πPm)(B)=π(A)π(B). By [F11], this proves that π2 is invariant for Qˉ. By step 2.1, every starting pair has positive probability of hitting C2 under Qˉ. Apply the stationary positive-hitting lemma [F5] to Qˉ, invariant law π2, and target C2: the stationary pair hits C2 almost surely from π2-almost every pair.

4.1F3F4F5F7F9F10F11A1step 3.1

Start the pair with law π2 and run independent Qˉ transitions before each split attempt. By step 3.1 and [F5], the first hit of C2 occurs almost surely. Its location law is absolutely continuous with respect to π2: for any π2-null set N, the event that the first hit lies in N is contained in ⋃k≥0{Zk∈N}, which has probability zero by stationarity. More generally, if the pair at the start of a waiting period has any subprobability law λ≪π2, then λQˉk≪π2 for every k, because invariance gives Qˉk(z,N)=0 for π2-almost every z; hence its next first-hit location is also absolutely continuous and the hit occurs almost surely by [F5]. At a visit (x,y)∈C2 with 0<ϵ<1, use one common Bernoulli(ϵ) coin: success draws a shared ν value and couples immediately, while failure draws independently from Rx=(Pm(x,⋅)−ϵν)/(1−ϵ) and Ry. Each coordinate retains its Pm marginal. For every π2-null N, stationarity gives Qˉ((x,y),N)=0 for π2-almost every (x,y), while the product expansion gives Qˉ((x,y),⋅)≥(1−ϵ)2Rx⊗Ry; thus the failed endpoint law is absolutely continuous whenever the attempt-state law is. It therefore reaches C2 almost surely again, with an absolutely continuous first-hit law. If ϵ=1, the first split succeeds and no failure branch occurs.

5.1F3F8F9step 4.1algebra∎

Each visit succeeds with probability ϵ, so j successive failures have probability (1−ϵ)j→0. The coupling succeeds almost surely for π2-almost every initial pair. Fubini gives that for π-almost every x, a chain from x couples almost surely to an independent stationary chain. The coupling inequality gives convergence along times mn. For n=mk+s, 0≤s<m, contraction by Ps and invariance of π gives convergence for every n.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Geometric drift yields a bounded small set and bivariate drift

Statement

Let P be countably generated, ϕ-irreducible and aperiodic with invariant probability π. Suppose C is (m,ϵ,ν)-small with ϕ(C)>0 and PV≤λV+b1C for finite V≥1, 0<λ<1. Then there are λ′∈(λ,1) and a ϕ-positive small set C0⊆C with sup⁡C0V<∞ and PV≤λ′V+b1C0 pointwise. Moreover there are a bounded-V small set D, a time L, a minorizing probability ν′, and a<1 such that for Q=PL and h(x,y)=(V(x)+V(y))/2, Q⊗Q h≤ahoff D2. If Q(x,⋅)≥ϵDν′ on D, the residual laws Rx=(Q(x,⋅)−ϵDν′)/(1−ϵD) have sup⁡x,y∈DRx⊗Ry(h)<∞ when ϵD<1; for ϵD=1 no residual branch is needed.

Facts & Assumptions

Given: The irreducibility, aperiodicity, invariant probability, small-set and drift assumptions.

[F1]

Phi-irreducibility for a general-state Markov kernel: every positive-ϕ set is reachable from every state.

[F2]

Small-set minorization and geometric drift: the fixed-time minorization and pointwise drift inequality hold.

[F3]

Invariant mass and almost-sure hitting of accessible sets: π charges each positive-ϕ set.

[F4]

A drift sublevel enlargement of a small set is petite: a drift sublevel enlargement of a small set is petite.

[F5]

A petite drift enlargement is small under aperiodicity: a petite set is small if it contains a small set with the same minorizer, that minorizer charges the small set, and it is absolutely continuous with respect to the invariant law.

[F6]

Aperiodicity makes minorization times eventually consecutive: once ν′≪π and every state reaches a minorization into ν′, ν′Pt≥ctν′ for all sufficiently large t.

[F7]

Aperiodicity for a general-state Markov kernel: aperiodicity excludes cyclic decompositions.

[F9]

Measure kernel and probability kernel: probability kernels have measurable evaluations and probability-measure sections.

[A1]

Assume The Axiom of Choice as inherited from the path and stopping-time constructions in [F4] and [F5].

Proof

Given: The hypotheses and facts [F1]–[F9], with [A1].

1.1F1F2A1given

Choose λ′∈(λ,1) and then d0>b/(λ′−λ) large enough that C0=C∩{V≤d0} has positive ϕ-measure; such a choice exists since V is finite and C is positive. The set C0 remains (m,ϵ,ν)-small and is bounded in V. For x∈C∖C0, b≤(λ′−λ)V(x), while outside C the original drift has no b term. Hence PV≤λ′V+b1C0.

2.1F1F2F3F8F9step 1.1

By [F3], π(C0)>0. Integrating the minorization over C0 gives ν≪π. Iteration of the original drift yields PmV(x)≤λmV(x)+b/(1−λ); for x∈C0 the right side is finite and uniformly bounded. Since Pm(x,⋅)≥ϵν, it follows that νV≤ϵ−1PmV(x)<∞. Irreducibility and ϕ(C0)>0 give some k≥0 with νPk(C0)>0. Put ν′=νPk. For any A with π(A)=0, invariance gives ∫Pk(x,A)π(dx)=π(A)=0, so Pk(x,A)=0 for π-almost every x; since ν≪π, this implies ν′(A)=∫Pk(x,A)ν(dx)=0. Thus ν′≪π. Also ν′V<∞, and C0 is small at time m+k with minorizer ν′.

3.1F1F2F4F5F6A1step 1.1step 2.1

Choose any finite d1 large enough that 2b/((1−λ′)(d1+1))<1. Put D=C0∪{V≤d1}, which is bounded in V. By [F4], there are weights (an), α>0, and a probability μ such that ∑n≥1anPn(x,⋅)≥αμ on D. Put m0=m+k, so C0 is (m0,ϵ,ν′)-small. By [F1], every state reaches C0 at some positive time; a countable union therefore gives j≥1 with μPj(C0)>0. Composition yields μPj+m0≥ϵμPj(C0)ν′. Thus the shifted mixture ∑n≥1anPn+j+m0 makes D petite with minorizer ν′. Since ν′(C0)>0 and ν′≪π, [F5] gives some ℓ≥1, β>0, and probability η with Pℓ(x,⋅)≥βη on D. Again [F1] gives j′≥1 with ηPj′(C0)>0. Hence, for L0=ℓ+j′+m0, PL0(x,⋅)≥δ0ν′, where δ0=βϵηPj′(C0)>0 on D. Each state also reaches a positive minorization into ν′ by reaching C0 and then running m0 steps. For every sufficiently large t, [F6] gives ν′Pt≥ctν′; hence PL0+t(x,⋅)≥δ0ctν′ for x∈D.

4.1F2F7F9step 2.1step 3.1algebra∎

Iterating the improved drift gives PLV≤λ′LV+B0 with B0=b/(1−λ′). Choose t in step 3.1 large enough that L=L0+t also satisfies a:=λ′L+2B0d1+1<1. If (x,y)∉D2, at least one coordinate has V>d1, so h≥(d1+1)/2. Therefore Q⊗Q h≤λ′Lh+B0≤ah. The set D is bounded in V, and QV is uniformly bounded on D by the drift bound. The minorizer ν′ has finite V-moment by step 2.1, so the residual laws have uniformly finite V-moment and their product expectation of h is bounded.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

General-state Markov-chain convergence under recurrence conditions

Statement

Let P be countably generated, ϕ-irreducible (Phi-irreducibility for a general-state Markov kernel) and aperiodic (Aperiodicity for a general-state Markov kernel) with invariant probability π. Then ∥Pn(x,⋅)−π∥TV→0 for π-almost every x. If P is Harris recurrent relative to ϕ (Harris recurrence relative to an irreducibility measure), convergence holds for every starting state.

Facts & Assumptions

Given: The kernel, irreducibility, aperiodicity, invariant probability and, for the all-start conclusion, Harris recurrence.

[F1]

Aperiodicity for a general-state Markov kernel: no positive-mass cyclic family has deterministic transitions to its successor.

[F2]

Harris recurrence relative to an irreducibility measure: every positive-ϕ set is hit almost surely from every state.

[F4]

Total variation distance for probability laws: total variation is the supremum of measurable event-probability differences.

[F5]

A countably generated phi-irreducible chain has a positive-measure small set: a countably generated irreducible chain has a small set C with ϕ(C)>0 and ν(C)>0.

[F6]

Small-set coupling yields almost-everywhere total-variation convergence: aperiodicity and such a small set imply π-almost-everywhere convergence.

[F7]

Approximation in symmetric difference by a generating algebra: finite-measure events are approximable by a countable generating algebra, making the total-variation supremum countable.

[F8]

Discrete strong Markov property: at the finite hitting time, the future law is the kernel iterate from the hit state.

[F9]

Canonical Markov chain on path space: the transition kernel has its canonical path law under the declared choice convention.

[F10]

Dominated convergence: bounded pointwise-convergent functions may be integrated through limits under a finite measure.

[A1]

The Axiom of Choice: the path-law construction uses AC as specified in [F9].

Proof

Given: The hypotheses and facts [F1]–[F9], with [A1].

1.1F1F3F5F6F7

Apply [F6] under the aperiodicity and invariance hypotheses [F1] and [F3]. This gives convergence on a set G with π(G)=1. The set is measurable because [F7] expresses total variation as a supremum over the countable generating algebra.

2.1F2F3F7step 1.1

Assume Harris recurrence and let N be any π-null measurable set. If ϕ(N)>0, [F2] says every start hits N almost surely. Averaging over π would give stationary probability one to ever hitting N, but stationarity gives Pr⁡π(Xn∈N)=π(N)=0 for each n, and a countable union gives probability zero. Therefore every π-null set is ϕ-null. In particular ϕ(Gc)=0, so ϕ(G)>0.

3.1F2step 2.1

Harris recurrence [F2] implies every start hits G at a finite time T almost surely. For fixed x, split the time-n law according to T>n/2 and T≤n/2. The first contribution is at most Pr⁡x(T>n/2)→0.

4.1F3F4F7F8F9F10A1step 3.1∎

On T≤n/2, the strong Markov property [F8] gives conditional law Pn−T(XT,⋅), with XT∈G. For each fixed t, let λt be the finite law of XT on {T=t}. For any measurable event A, conditioning on T and XT bounds the absolute event-probability difference from π(A) by Pr⁡x(T>n/2)+∑t≤n/2∫G∥Pn−t(y,⋅)−π∥TV λt(dy). Taking the supremum over A gives the same bound for total variation. For fixed K and n≥2K, the terms with t≤K tend to zero by [F10]: the distance functions are measurable by [F7], converge pointwise on G, and are bounded by one; the terms with K<t≤n/2 are at most Pr⁡x(T>K). Also Pr⁡x(T>n/2)→0. Letting first n→∞ and then K→∞ proves convergence. The path law is supplied by [F9] under [A1].

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Geometric ergodicity under drift and small-set minorization

Statement

Let P be countably generated, ϕ-irreducible and aperiodic with invariant probability π. Suppose a ϕ-positive small set C and finite-valued V≥1 satisfy PV≤λV+b1C for 0<λ<1. Then there are M<∞ and 0<r<1 such that ∥Pn(x,⋅)−π∥TV≤MV(x)rn(x∈X, n≥0). This is geometric ergodicity with a V-weighted bound.

Under the same kernel, ϕ-positive small-set and drift-constant hypotheses, the result also holds if V:X→[1,+∞] is measurable and finite π-almost everywhere, with the drift inequality holding pointwise in the extended sense. Then E={V<∞} is measurable, absorbing and of full π-measure, and the displayed bound holds for every x∈E. Thus extended certificates give the common geometric rate for π-almost every start, while globally finite certificates give it for every start.

Facts & Assumptions

Given: The kernel, irreducibility, aperiodicity, invariant probability, small set and drift inequality in the Statement.

[F1]

Phi-irreducibility for a general-state Markov kernel: positive-ϕ sets are reachable from every state.

[F2]

Aperiodicity for a general-state Markov kernel: no cyclic decomposition exists.

[F3]

Small-set minorization and geometric drift: the common minorization and drift inequalities hold.

[F5]

Total variation distance for probability laws gives the event-supremum definition of total variation. Total variation duality, kernel contraction, and coupling bound bounds it by coupling disagreement and contracts it under a probability kernel.

[F6]

Geometric drift yields a bounded small set and bivariate drift: there is a bounded-V, ϕ-positive small subset C0 with improved pointwise drift PV≤λ′V+b1C0 for some λ′<1; a skeleton and bounded small set also satisfy the bivariate drift/minorization hypotheses.

[F7]

A bivariate drift and minorization bound geometric coupling error: those hypotheses yield a geometric coupling bound.

[F8]

An invariant law integrates a drift function bounded on its small set: an invariant probability integrates a finite-valued drift function when its drift set is bounded in that function.

[F9]

A nonnegative measurable function with finite integral is finite almost everywhere: finite nonnegative integral implies the integrand is finite almost everywhere under the integrating measure. Measure kernel and probability kernel gives pointwise probability sections and measurable evaluations for the restricted kernel construction.

[F10]

Invariant mass and almost-sure hitting of accessible sets: each positive-ϕ set has positive invariant probability.

[A1]

Assume The Axiom of Choice as inherited from the path and stopping-time suppliers used by [F6] and [F7].

Proof

Given: The hypotheses and facts [F1]–[F10].

1.1F1F2F3F4F6F7F8A1

First assume V is finite-valued. By [F6], choose the bounded-V small subset C0 and λ′∈(λ,1) with PV≤λ′V+b1C0. Its boundedness is exactly the hypothesis needed for [F8], which now gives πV<∞. Apply the remaining conclusions of [F6] to obtain a skeleton Q=PL, bounded small set D, function h(x,y)=(V(x)+V(y))/2, and constants satisfying the hypotheses of [F7]. Since D is bounded in V, the residual split expectation is uniformly finite.

1.2F1F3F4F9F10givenconstruct

Now allow the extended certificate and put N={V=+∞} and E=Nc. These sets are measurable and π(N)=0. If x∈E, the pointwise drift bound has finite right side, so PV(x)<∞. Apply [F9] to V under the probability measure P(x,⋅) to obtain P(x,N)=0. Thus E is absorbing, including for every iterate. Also ϕ(N)=0: otherwise [F10] would give π(N)>0. Hence ϕ(C∩E)=ϕ(C)>0, in particular C∩E is nonempty, and ϕ∣E remains a nonzero sigma-finite irreducibility measure.

2.1F4F5F6F7F8A1step 1.1

For every fixed pair x,y, [F7] gives ∥Qk(x,⋅)−Qk(y,⋅)∥TV≤M0h(x,y)r0k with constants independent of the pair. For each measurable event A, invariance and the pointwise event bound imply ∣Qk(x,A)−π(A)∣=∣∫[Qk(x,A)−Qk(y,A)]π(dy)∣≤M0r0k∫h(x,y)π(dy). The integrand on the left is a difference of measurable kernel evaluations; no measurable selection of pairwise couplings is needed. By step 1.1, ∫h(x,y)π(dy)=12(V(x)+πV)≤12(1+πV)V(x)<∞. Taking the event supremum [F5] gives the required V(x)-weighted bound at skeleton times.

2.2F1F2F3F4F9step 1.2construct

Restrict the state space to E with its trace sigma-algebra and set PE(x,A)=P(x,A) for trace-measurable A⊆E. Absorption makes this a probability kernel, with invariant probability π∣E; a countable generator of X restricts to a countable generator on E. Original irreducibility supplies positive finite-time access to every positive-ϕ∣E set from each x∈E. For the original (m,ϵ,ν)-minorization on C, choose x∈C∩E. Since Pm(x,N)=0, minorization gives ν(N)=0, so C∩E is small for PE with probability ν∣E. Any positive-π∣E cyclic part for PE would consist of original measurable subsets of E with the same pointwise transitions under P, contradicting the actual aperiodicity definition [F2], which excludes such a part without requiring it to cover the state space. Finally V∣E is finite-valued and satisfies the original drift inequality with drift set C∩E.

3.1F4F5step 2.1algebra

Write n=Lk+s, 0≤s<L. The finite set of residual powers Ps contracts total variation and the stationary law remains π. Absorb the finite factor and r0−s/L over s=0,…,L−1 into a single M, and put r=r01/L. Then the asserted bound holds for every n.

4.1F5step 3.1step 1.2step 2.2∎

Apply the finite-valued result proved in steps 1.1, 2.1, 3.1 to (E,PE,ϕ∣E,π∣E,V∣E,C∩E). It gives constants M<∞ and 0<r<1 and the weighted bound for every x∈E. Both Pn(x,⋅) and π are supported on E, so their total variation on the original space equals their total variation on the trace space: every event is replaced by its intersection with E. Thus precisely the displayed original-space bound holds on E, a full-π absorbing set. If V is globally finite, E=X and the first branch is recovered.

5 · Examples, counterexamples and false statements

None yet.

Sources