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 countably generated phi-irreducible chain has a positive-measure small set
Statement
Let be countably generated, let 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 , a measurable with , a probability with , and such that for every .
Facts & Assumptions
Given: Countable generation, the probability kernel, and -irreducibility.
Phi-irreducibility for a general-state Markov kernel: every positive- set is reached with positive probability at some finite positive time from every state.
Small-set minorization and geometric drift: a small set is a common fixed-time minorization by a probability measure.
Iterated kernel densities retain convolution lower bounds: iterated kernel densities satisfy convolution lower bounds and their sum is positive -almost everywhere from every state.
A positive triple set has uniformly overlapping sections: a positive-measure set of composable density pairs has sections with a uniform positive overlap.
Measurable spaces and measurable sets: countable generation supplies finite partitions and countable testing algebras.
The Axiom of Choice: the density versions and measure representatives in [F3] are selected under AC.
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].
Write as a countable disjoint union of measurable finite-measure sets . Set and . Since is nonzero and the cover the space, . Then is an equivalent probability measure: it has density on every , and hence exactly the same null sets and positive sets as . Replace by for the rest of the proof. By [F3], for every the sum is positive for -almost every . Tonelli and countability imply that for -almost every , this sum is positive at and the corresponding sum at is positive. Hence the product of the two sums is positive almost everywhere; its countable expansion shows that some fixed satisfy For a sufficiently small , the set where both factors exceed still has positive product measure.
Apply [F4] to and . Obtain positive- sets and such that their sections overlap by at least . The convolution bound [F3] gives for every .
Since is -positive, irreducibility gives for every . Integrating over and using Tonelli, some has . A positive-level-set subdivision yields with and such that for every .
For every and , the second convolution inequality in [F3] gives Let and choose . Integrating the density over gives for every . Since and , . Thus is the required small set.
Depends on
- The Axiom of Choice
- Measurable spaces and measurable sets
- Phi-irreducibility for a general-state Markov kernel
- Small-set minorization and geometric drift
- Measurable Lebesgue decomposition of a kernel on a countably generated space
- Iterated kernel densities retain convolution lower bounds
- A positive triple set has uniformly overlapping sections
- Doob submartingale convergence theorem
- Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
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
- 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)