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 KL is measurable for supplied kernels
Statement
Let K,L be probability kernels from a measurable space into a standard-Borel space . Then is -measurable, with allowed. Consequently the integral used to define conditional KL is well-defined.
Facts & Assumptions
Given: AC, the kernels K,L, and the standard-Borel target .
AC supplies the countable generating algebra for standard-Borel E and the Radon–Nikodym density in measurable-space KL. The Axiom of Choice
A standard-Borel space has a countable algebra generating its sigma-algebra and determining finite measures. Standard borel spaces have countable generating and measure determining algebras
For a probability kernel, integration of a nonnegative product-measurable function is measurable in the base variable; signed integrals are measurable when the positive and negative parts are finite. Measurability of integration against a kernel
For probability laws P,Q, KL equals the supremum of over bounded measurable real g. Variational and finite-partition formulas for measurable-space KL
Proof
Given: AC and probability kernels K,L into E.
Let for arbitrary probability measures P,Q on E. [given, choose] For the algebra in [F1], the class of measurable approximable in -measure by members of is a sigma-algebra: complements preserve symmetric-difference measure, finite unions preserve approximation, and a countable union is approximated by first truncating the union using finiteness of and then approximating that finite union. It contains , so it is all of . Hence any bounded measurable real function can be approximated in by bounded simple functions from a countable family of rational-valued simple functions on . On a fixed bound , the functional is continuous under approximation, because is Lipschitz on and . Thus [F3] gives The family is countable and does not depend on P,Q.
For fixed , the functions and are measurable by [F2], applying it to positive and negative parts for the first function. If , then , so its logarithm is measurable. Therefore each candidate is measurable.
Apply the identity in step 1.1 to and for each fixed z. Then , a countable supremum of measurable functions by step 2.1. This proves measurability and makes its nonnegative integral against any supplied base probability well-defined.
Depends on
Used by
Dependency tree · two levels
22 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.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)