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.
Finite KL divergence agrees with measurable-space KL
Statement
Assume AC only for the interface to the published general definition Kullback–Leibler divergence. Let be probability vectors on a finite set , and let , on . Then the measurable-space divergence equals the finite KL sum , with value exactly when some .
Facts & Assumptions
Given: AC, a finite set , and probability vectors on .
The Axiom of Choice: every family of nonempty sets has a choice function. Here AC is assumed only when invoking the current published measurable KL definition; no selection is used to construct the finite density below.
Finite distributions, entropy, divergence, and stochastic matrices: a finite KL sum uses and is if for some coordinate.
Finite probability spaces are exactly finite full-power-set probability spaces: on a finite set, nonnegative weights summing to one define a probability measure on the full power set by .
Absolute continuity of a signed or complex measure with respect to a positive measure: means every measurable -null set is -null.
The Radon-Nikodym derivative as an almost-everywhere equivalence class: for , a Radon–Nikodym derivative is a measurable function class satisfying for every measurable .
Expectation agrees with the published finite weighted sum: on a finite probability space, the expectation of a real function is the sum of its values weighted by the outcome probabilities.
Kullback–Leibler divergence: if , then .
Kullback–Leibler divergence: in the absolutely continuous case, use an RN density , set on and on .
Kullback–Leibler divergence: the measurable KL is in the absolutely continuous case.
Finite probability spaces, outcome weights, events, and event probabilities: a finite probability space has a finite outcome set with nonnegative weights summing to one, and every subset is an event.
Proof
By [F9], the finite vectors define probability spaces on , with every singleton measurable; [F2] gives their event weights. If , then , so [F3] gives . The general definition [F6] and finite convention [F1] both give .
Suppose whenever . If , the finite sum and nonnegativity force for every ; hence for those and . Thus by [F3]. Define when and when . Since every subset of is measurable, this finite function is measurable. For every , [F5] gives , so [F4] identifies as a Radon–Nikodym derivative. It is explicitly constructed; no choice is used in this step.
Under the AC interface assumption [A1], substitute the density from step 1.2 into [F8], using the logarithm convention [F7]. Applying [F5] to for and for gives ; coordinates with contribute by [F1].
Step 1.1 handles support failure, while step 2.1 proves equality with the finite sum when is supported by . These cases exhaust the finite vectors in the Statement.
Depends on
- Finite distributions, entropy, divergence, and stochastic matrices
- Finite probability spaces, outcome weights, events, and event probabilities
- Finite probability spaces are exactly finite full-power-set probability spaces
- Expectation agrees with the published finite weighted sum
- Absolute continuity of a signed or complex measure with respect to a positive measure
- The Radon-Nikodym derivative as an almost-everywhere equivalence class
- Kullback–Leibler divergence
- The Axiom of Choice
Used by
- A finite deterministic copy has mutual information equal to entropy Example
- Changing a conditional kernel on a null fiber leaves information unchanged Example
- Coarsening the conditioning variable can increase conditional mutual information Example
- Variational and finite-partition formulas for measurable-space KL Theorem
Dependency tree · two levels
42 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 first edition (standard reference, not scraped)
- Yury Polyanskiy and Yihong Wu, Information Theory: From Coding to Learning, author prepublication (standard reference, not scraped)