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 be a probability kernel on a measurable space 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 is geometrically ergodic in the sense of Geometric and uniform ergodicity for MCMC CLTs. Then there exist a measurable with and such that
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 , with rate .
The Axiom of Choice: AC is assumed for the small-set supplier and the canonical path-space and Markov suppliers below.
Geometric and uniform ergodicity for MCMC CLTs: for every and , with finite and measurable.
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.
A countably generated phi-irreducible chain has a positive-measure small set: a countably generated irreducible chain has a positive-irreducibility-measure small set , with a minorizing probability satisfying .
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.
Canonical Markov chain on path space: under AC, the original kernel has canonical chains from every initial law.
Discrete strong Markov property: bounded future-path functionals obey the Markov identity at stopping times.
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 in [F1], with AC [A1].
Apply [F2] to to obtain a countably generated , the restricted kernel , and invariant probability . If has , [F1] implies for all sufficiently large , for each , because is finite. Thus is -irreducible by [F7]. Applying [F3] on this countably generated space gives an , a with , a probability on with , and such that on . No small-set assertion on the original sigma-field is being made.
Since is finite everywhere, increases to as the positive integer increases. Choose so has both and . Choose a finite integer and put , . Choose . For this gives on , , and on .
For , the restricted-iteration identity in [F2] and [F1] give For the absolute difference is at most . Therefore [F4] applies with constant and rate . It supplies and a measurable , where , such that . Indeed the skeleton path restricted to under the full canonical -chain has the -chain law: its finite-dimensional cylinder probabilities agree by the iterated-kernel identity in [F2]. Thus the same is the entrance-time moment for the original chain of [F5].
Choose , and set and . Fix and . On , decompose into the finitely many events and use [F6] to replace the conditional terminal indicator by . Since , [F1] bounds its difference from by ; when , use . On use the bound . Subtracting on these two events gives For the final inequality, , and on one has ; on , . This argument is for each original measurable event , so taking its supremum controls the full original total variation and does not require measurability of a total-variation supremum.
The measurable set is -null by step 3.1. Define for and for . It is measurable and finite everywhere, and . Off , step 4.1 gives the desired bound with rate ; on , [F1] gives it because . Taking and 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
- Canonical Markov chain on path space
- The Axiom of Choice
- Aperiodicity for a general-state Markov kernel
- Geometric and uniform ergodicity for MCMC CLTs
- Harris recurrence relative to an irreducibility measure
- Invariant and stationary distribution for a Markov kernel
- Measure kernel and probability kernel
- Phi-irreducibility for a general-state Markov kernel
- A kernel has a countably generated stable sub-sigma-field containing a given observable
- Geometric small-set renewal convergence gives an integrable exponential hitting moment
- A countably generated phi-irreducible chain has a positive-measure small set
- Discrete strong Markov property
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
- Galin L. Jones, On the Markov Chain Central Limit Theorem, §2, Remark 1 (standard reference, not scraped)
- Sean P. Meyn and Richard L. Tweedie, Markov Chains and Stochastic Stability, second edition, Theorems 14.3.7, 15.3.3, and 15.4.1 (standard reference, not scraped)