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.
Variational and finite-partition formulas for measurable-space KL
Statement
Let be probability measures on one measurable space. For bounded measurable real , put Then Equivalently, for every finite measurable partition of the whole space, where and a term with is . The result includes singular and infinite-divergence cases.
Facts & Assumptions
Given: AC and probability measures on a common measurable space.
AC is the hypothesis used by the Radon–Nikodym definition of measurable-space KL. The Axiom of Choice
If , then ; if with density , then , whose negative part is finite. Kullback–Leibler divergence
KL divergence between probability measures is nonnegative. Kullback–Leibler divergence is nonnegative
On a finite alphabet, measurable-space KL equals the finite sum with the same support conventions. Finite KL divergence agrees with measurable-space KL
Dominated convergence and monotone convergence apply to the stated finite or nonnegative integrals. Dominated convergence Monotone convergence for the integral
Proof
Given: AC and probability measures .
First suppose and . For bounded measurable , let and define by . Then is a probability equivalent to , and . Taking logarithms and integrating under gives . By [F2], . If or , this upper bound is automatic.
If , choose a measurable with . For , and . Thus the bounded-function supremum is in the singular case.
Suppose , let , and set on , with on ; the latter set is P-null. Define , taking on . The negative part of is integrable by [F1]; its clipped negative parts converge by [F4], while the clipped positive parts increase to and converge in integral by [F4]. Hence , including value . Pointwise, Q-a.e. and , so [F4] gives . Therefore and the bounded-function supremum is at least the divergence.
Fix a finite measurable partition and put , . For constants , the simple function has . If some , this expression is unbounded above by taking . Otherwise its supremum over the is : the upper bound follows by applying [F2] to the finite probability vector with masses proportional to , and the lower bound follows by taking when and on cells with . The cases do not affect either sum.
Every bounded measurable is uniformly approximated by finite-valued measurable simple functions. If , then and , so . Thus the supremum over bounded functions equals the supremum over simple functions. Step 2.2 identifies the latter with the supremum over finite partitions; step 2.1 identifies it with . No step subtracts infinite quantities.
Depends on
Used by
Dependency tree · two levels
65 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.2, Theorem 5.2.1 (standard reference, not scraped)
- Yury Polyanskiy and Yihong Wu, MIT 6.441 Information Theory, Chapter 3 §3.4, Theorem 3.7 (standard reference, not scraped)
- John Duchi, Lecture Notes on Statistics and Information Theory, Chapter 5 §5.1, Theorem 5.1.1 (standard reference, not scraped)