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.
Conditional independence under kernel extension and conditioning
Statement
Assume AC. Let be random elements in arbitrary measurable spaces. Suppose and that the joint law of is obtained from the law of by a probability kernel depending only on . Then No regular conditional law on an unspecified measurable space is assumed: is supplied in the hypotheses.
Facts & Assumptions
Conditional independence is the bounded-function conditional-product identity, and conditional expectation is determined by its event integrals. Conditional independence given a sigma-algebra, Conditional expectation given a sigma algebra
Integration of a bounded measurable function against a supplied probability kernel is measurable. Measure kernel and probability kernel, Measurability of integration against a kernel
Dynkin's theorem, simple approximation and monotone convergence extend identities on generating rectangles to bounded measurable functions. Dynkin's pi-lambda theorem, Every nonnegative measurable function is the increasing limit of simple measurable functions, Monotone convergence for the integral
Conditional expectations satisfy the tower property under AC. Tower property of conditional expectation, The Axiom of Choice
Proof
Given: The random elements, supplied kernel and conditional independence in the statement.
Fix bounded measurable and set . Conditional independence implies for every bounded measurable : test its conditional-product identity against and then the defining conditional expectation of . Rectangle indicators generate , so [F3] gives for every bounded -measurable . Equivalently . All extensions can be made for each fixed : the class of testing events is a lambda-system by complements and disjoint countable unions; bounded versions and monotone convergence justify the sums. No common null set for all functions is needed.
For bounded measurable define , bounded and measurable by [F2]. Kernel integration gives , where the middle identity is step 1.1. Thus . In taking out bounded measurable conditioning factors here, the event-integral definition first proves the rule for simple factors and [F3] proves it for bounded factors. This proves the first claimed independence. Testing the same calculation with rectangle factors in and using [F3] also gives .
Since is -measurable, [F4] yields . For bounded , conditioning first on in step 2.1 and then on gives . The bounded-factor rule justified in step 2.1 applies at both stages. This is the second claimed independence by [F1]. Singleton state spaces and constant kernels obey the same identities.
Source notes
Aldous–Chewi Lecture 9, Definition 9.1 and the complete Splice Lemma 9.2 proof give the conditional-expectation testing method. Their Borel-space disintegration assertion is not imported: the present lemma assumes its kernel and proves the stated arbitrary-space extension locally.
Depends on
- Conditional independence given a sigma-algebra
- Conditional expectation given a sigma algebra
- Measure kernel and probability kernel
- Measurability of integration against a kernel
- Tower property of conditional expectation
- Dynkin's pi-lambda theorem
- Monotone convergence for the integral
- Every nonnegative measurable function is the increasing limit of simple measurable functions
- The Axiom of Choice
Used by
Dependency tree · two levels
35 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
- Aldous–Chewi, Probability Theory, Lecture 9, Definition 9.1 and Lemma 9.2, printed pp. 35–36 (standard reference, not scraped)