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.
Measurable Lebesgue decomposition of a kernel on a countably generated space
Statement
Let be countably generated, let be a nonzero -finite measure, and let be a probability kernel. There are a jointly measurable and a subprobability kernel such that where and are mutually singular for each .
Facts & Assumptions
Given: The countably generated space, -finite reference measure, and probability kernel in the Statement.
Measurable spaces and measurable sets: a countable generating family yields an increasing sequence of finite partitions generating .
Measure kernel and probability kernel: is measurable and is a probability measure.
Every sigma-finite signed measure admits a Lebesgue decomposition relative to a sigma-finite positive measure and A sigma-finite signed measure that is absolutely continuous with respect to a sigma-finite positive measure has a unique almost-everywhere density: each fixed kernel section has a scalar Lebesgue decomposition and an absolutely continuous density.
Doob submartingale convergence theorem gives almost-sure convergence for a submartingale whose positive parts have uniformly bounded expectations. Levy upward convergence of conditional expectations identifies the almost-sure limit of conditional expectations along an increasing generating sequence with the conditional expectation on the generated sigma-algebra.
Measurability of integration against a kernel: integrating a nonnegative jointly measurable function against a kernel preserves measurability.
Approximation in symmetric difference by a generating algebra: under a finite measure, every measurable set is approximable in symmetric difference by members of a generating algebra.
Finite, sigma-finite, and semifinite measures: a sigma-finite measure admits a countable partition into finite-measure pieces.
The measure with density relative to : integrating a nonnegative measurable density against the reference measure defines a measure.
The Axiom of Choice: select sectionwise RN decompositions and singular support sets, and supply the AC hypotheses of the Doob and Levy convergence theorems in [F4].
Proof
Given: The hypotheses and facts [F1]–[F7], with [A1].
Choose a disjoint measurable partition with and positive total measure. Set and . Then , and is an equivalent probability measure. Its density on is positive. For each fixed , choose from [F3]. Let be increasing finite partitions generating , and set with value zero on zero-measure cells. For a positive-measure cell , its average at level integrates over to the sum of over the positive-measure children , which is at most ; zero-measure parents and all their children have value zero. Thus is a nonnegative -supermartingale. Also , so has uniformly bounded positive-part expectations and [F4] gives a finite almost-sure limit for .
Define , a jointly measurable extended nonnegative function; for each fixed it agrees almost everywhere with the finite limit from step 1.1. The conditional-expectation averages of the integrable density over are defined by on positive-measure cells , and by zero on zero-measure cells. Since , [F4] and the AC hypothesis [A1] give almost everywhere: generates . Cellwise because , with both averages zero on null cells. Taking limits proves almost everywhere.
For a cell at partition level , every has , since the positive-measure level- cells inside contribute only a sub-sum of the kernel masses of a partition of . Fatou therefore gives . By [F8], the left side defines a measure; Fatou at the whole space gives its total mass at most one, so both sides are finite measures. Their sum is a finite measure, and [F6] approximates any measurable set in symmetric difference under that sum; the inequality extends from the generating partition algebra to every measurable set. Choose a singular support with and . Since the left measure has density with respect to , it assigns zero mass to . Applying the inequality to therefore gives . Together with step 2.1, this proves almost everywhere.
Since , set and . Step 3.1 shows sectionwise that , a nonnegative subprobability measure singular to . The integral is measurable in by [F5]; hence is measurable for every , and its sections are countably additive. Thus is a subprobability kernel and the decomposition holds.
Depends on
- The Axiom of Choice
- Finite, sigma-finite, and semifinite measures
- Measurable spaces and measurable sets
- Measure kernel and probability kernel
- The measure with density $f$ relative to $\mu$
- Approximation in symmetric difference by a generating algebra
- Doob submartingale convergence theorem
- Levy upward convergence of conditional expectations
- Every sigma-finite signed measure admits a Lebesgue decomposition relative to a sigma-finite positive measure
- Measurability of integration against a kernel
- A sigma-finite signed measure that is absolutely continuous with respect to a sigma-finite positive measure has a unique almost-everywhere density
Used by
Dependency tree · two levels
51 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)