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 is -small and with finite , . For every finite , is petite.
Facts & Assumptions
Given: The kernel, small-set minorization and drift inequality in the Statement.
Small-set minorization and geometric drift: on , and outside , .
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.
Measure kernel and probability kernel: kernel iteration and stopping-time probabilities are measurable.
Monotone convergence for the integral: nonnegative sums may be integrated termwise.
Discrete strong Markov property: conditional on a finite first entrance time, the chain continues with kernel .
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].
If , then everywhere; iterating gives for every state and , impossible for sufficiently large because . Thus the hypotheses force . Let . The killed kernel satisfies off . Since , induction gives . Hence for , ; for , .
For each , restrict paths to the disjoint event and apply [F5] followed by the small-set minorization. This gives Summing over yields uniformly on .
Choose with and assign weight to times . The resulting probability mixture dominates , so it satisfies the petite definition with positive multiplier .
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
- Gareth O. Roberts and Jeffrey S. Rosenthal, General State Space Markov Chains and MCMC Algorithms (standard reference, not scraped)
- Randal Douc, Eric Moulines, Pierre Priouret, and Philippe Soulier, Markov Chains (standard reference, not scraped)