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.
Iterated kernel densities retain convolution lower bounds
Statement
Let be -irreducible on a countably generated space, with nonzero -finite irreducibility measure . For each there are a jointly measurable and a singular residual kernel such that and versions may be chosen so that for every and every , For every , for -almost every .
Facts & Assumptions
Given: The countably generated space, -irreducible kernel, and irreducibility measure in the Statement.
Phi-irreducibility for a general-state Markov kernel: every -positive set is reached from every state at some finite positive time.
Measure kernel and probability kernel: a probability kernel has measurable evaluations and probability-measure sections.
Measurable Lebesgue decomposition of a kernel on a countably generated space: each has a jointly measurable density component and singular residual kernel.
Measurability of integration against a kernel: integration of a nonnegative product-measurable function against a probability kernel is measurable.
The Axiom of Choice: retain the Choice assumption of [F3] and choose countably many sectionwise singular supports.
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: nonnegative sums and kernel integrals can be interchanged.
Proof
Given: The hypotheses and facts [F1]–[F5], and [A1].
Apply [F3] to each , obtaining preliminary densities and singular residuals . Inductively set and, for , For each , the lifted kernel is a probability kernel by [F2]. Apply [F4] to this kernel and the nonnegative product-measurable integrand ; finite maxima preserve measurability. Thus the right side is jointly measurable. For each fixed , composition of kernels gives . Since is singular, this domination forces each candidate density to be at most -almost everywhere. Thus -a.e. for each , so it is still the density part and has both displayed convolution lower bounds pointwise by construction.
Fix . For each , choose a -null support of and let . Then and every residual assigns zero mass to . If has , [F1] gives an with ; because the residual gives zero mass, .
Therefore every positive- subset of intersects in positive measure. Its complement in must be -null; otherwise take that complement as in step 1.2, which would make every integral zero. Hence the density sum is positive -almost everywhere.
Depends on
- The Axiom of Choice
- Measure kernel and probability kernel
- Phi-irreducibility for a general-state Markov kernel
- Measurable Lebesgue decomposition of a kernel on a countably generated space
- Measurability of integration against a kernel
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Used by
Dependency tree · two levels
28 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)