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.
The same-marginal conditional-product law is well-defined
Statement
Assume AC. Let be random elements with standard-Borel value spaces, and let and be supplied conditional laws of and given . The product kernels form a probability kernel. The joint law exists uniquely on the product sigma-algebra and does not depend on the chosen versions of . It has marginal and conditional law for given .
Facts & Assumptions
Given: AC, standard-Borel random elements , and regular conditional laws given .
AC supplies the existence and simultaneous almost-everywhere uniqueness interfaces for standard-Borel regular conditional laws. The Axiom of Choice
The product of two supplied probability kernels is a probability kernel, with rectangle evaluations . The product of two probability kernels is a probability kernel
A probability measure and a probability kernel define a unique joint probability law with the iterated-integral formula. A prior and model kernel define a joint law
Conditional laws of the same standard-Borel random element agree as measures outside one null set. Simultaneous ae uniqueness of regular conditional distributions
Measurable rectangles generate the product sigma-algebra and determine a probability measure by the pi-lambda theorem. The product sigma-algebra and its finite iterates Dynkin's pi-lambda theorem
Proof
Given: The hypotheses in the Statement.
By [F1], is a probability kernel into the standard-Borel product of the X and Y spaces. Apply [F2] with base law and kernel M. It gives a unique probability law R and the displayed rectangle formula; taking and equal to their whole value spaces gives for every measurable , so its Z marginal is . The same rectangle identity is the conditional-law identity for M given Z.
Let be alternative versions. By [F3], there are P_Z-null sets such that for and for . Their product measures agree for every outside . Thus the two joint laws have the same rectangle values for every measurable C,A,B; [F4] then makes the laws equal. This establishes version independence.
Depends on
- The product of two probability kernels is a probability kernel
- A prior and model kernel define a joint law
- Conditional law given a random element
- Disintegration of a joint law on standard borel spaces
- Simultaneous ae uniqueness of regular conditional distributions
- Finite products of standard Borel spaces are standard Borel
- The product sigma-algebra and its finite iterates
- Dynkin's pi-lambda theorem
- The Axiom of Choice
Used by
- Conditional mutual information by a same-marginal product law Definition
- Changing a conditional kernel on a null fiber leaves information unchanged Example
- Coarsening the conditioning variable can increase conditional mutual information Example
- Mutual information is recovered by finite coordinate quantizations Theorem
- Mutual-information chain rule without subtracting infinities Theorem
- Zero information is exactly independence Theorem
Dependency tree · two levels
53 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
- Robert M. Gray, Entropy and Information Theory, corrected author-hosted first edition, Chapter 5 §§5.3 and 5.5 (standard reference, not scraped)
- Yury Polyanskiy and Yihong Wu, MIT 6.441 Information Theory, Chapter 2 §§2.4 and 2.6 (standard reference, not scraped)