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 product of two probability kernels is a probability kernel
Statement
Let , , and be measurable spaces, and let and be probability kernels. For each , let be the finite product probability on . Then is a probability kernel.
Facts & Assumptions
Given: The spaces and probability kernels in the Statement.
Every kernel section is a measure; each event evaluation is measurable, and probability-kernel sections have total mass one. Measure kernel and probability kernel
For probability measures, the finite product measure exists uniquely and satisfies . For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique
Rectangles form a pi-system generating the product sigma-algebra, and a lambda-system containing them contains that sigma-algebra. The product sigma-algebra and its finite iterates Dynkin's pi-lambda theorem
Given: The hypotheses in the Statement.
Proof
For fixed , [F2] gives the probability measure . [F2, given] If and , then which is a measurable function of z by the two kernel assumptions in [F1]. Also for every z.
Let be the class of product-measurable for which is measurable. Step 1.1 shows every rectangle belongs to , and the whole product does as well. If , then , so . If are pairwise disjoint members, then by countable additivity, a pointwise limit of measurable functions. Thus is a lambda-system.
Rectangles are a pi-system generating , so [F3] implies . Every section is a probability by step 1.1; hence z↦ is the claimed probability kernel. All constructions are pointwise and use no choice axiom.
Depends on
Used by
Dependency tree · two levels
21 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
- Yury Polyanskiy and Yihong Wu, MIT 6.441 Information Theory, Chapter 2 §§2.2 and 2.6 (standard reference, not scraped)
- Robert M. Gray, Entropy and Information Theory, corrected author-hosted first edition, Chapter 5 §5.3 (standard reference, not scraped)