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.

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)].

Depends on

Used by

Dependency tree · two levels

31 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