Alphabeta Math
TheoremStatement: 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 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.

Depends on

Used by

Dependency tree · two levels

37 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