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.
Independent noise extends and pushes forward a conditional law
Statement
Let be random elements with values in measurable spaces , , and . Suppose is independent of the random element , and let be a supplied conditional law of given . For each , form the product probability on . Then is a conditional law of given . If is measurable into a measurable space , then is a conditional law of given .
Facts & Assumptions
Given: Random elements , independence of from , and a supplied conditional law of given .
A conditional law given a random element is an everywhere probability kernel whose composition with that random element is a regular conditional distribution. Conditional law given a random element.
A probability kernel has probability-measure sections and measurable evaluations. Measure kernel and probability kernel.
For probability measures, the product measure exists, has the rectangle formula, and its values are the iterated section integrals. For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique.
For a finite kernel and a nonnegative product-measurable function, the section integral is measurable in the kernel parameter. Measurability of integration against a kernel.
The product sigma-algebra is generated by measurable rectangles. The product sigma-algebra and its finite iterates.
Independence of random elements means independence of their generated sigma-algebras. Independent random elements.
Independent sigma-algebras factor probabilities of their events. Independent sigma-algebras and independent events.
A regular conditional distribution satisfies the conditional event identities for every conditioning event and target event. Regular conditional distribution.
A pi-system contained in a lambda-system extends to the generated sigma-algebra. Dynkin's pi-lambda theorem.
Proof
Given: The hypotheses in the Statement.
Write . For every , the product is a probability measure by [F2] and [F3]. For each , the section is measurable by [F4] applied to the constant probability kernel and the indicator of . The iterated-section formula in [F3] gives , which is measurable in by [F4] applied to . Thus is a probability kernel.
Fix and a measurable rectangle . The conditional-law identity [F1], followed by independence [F6]–[F7], gives . For this fixed , both sides define finite measures on . They agree on the rectangle pi-system, which generates that sigma-algebra by [F5]; [F9] extends the equality to every measurable target set. Therefore is a regular conditional distribution of given by [F8].
For measurable , every section of is the pushforward of the probability , and its evaluations are measurable because is measurable and is a probability kernel. Applying the conditional identity from step 1.2 to proves that is a regular conditional distribution of given . Hence it is the required conditional law.
Depends on
- Conditional law given a random element
- Independent random elements
- Independent sigma-algebras and independent events
- Measure kernel and probability kernel
- The product sigma-algebra and its finite iterates
- Regular conditional distribution
- Dynkin's pi-lambda theorem
- Measurability of integration against a kernel
- For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique
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
- Simo Särkkä, Bayesian Filtering and Smoothing, Chapter 4, §§4.1–4.2 (standard reference, not scraped)
- Kody Law, Andrew M. Stuart, and Konstantinos Zygalakis, Data Assimilation: A Mathematical Introduction, Chapter 4, §4.1 (standard reference, not scraped)