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.
Mutual information for a finite uniform hypothesis experiment
Definition
Let be an integer, let be probability measures on one measurable sample space, and let be uniform on . Conditional on , let the observation have law . Define the mixture law and the mutual information of this finite experiment by The set function is a probability measure: for disjoint measurable sets , countable additivity of the gives The finite sum commutes with the increasing partial-sum limits of these nonnegative series, so so is countably additive; also and . Here is the directional KL divergence of Kullback–Leibler divergence, and logarithms are natural. For every measurable , , so . Let be a finite-valued nonnegative density representative provided by Kullback–Leibler divergence. If , then for some integer the set has positive -measure. The change-of-measure identity Likelihood-ratio change of measure would give contradicting . Hence almost everywhere. The densities also satisfy -almost everywhere: for each measurable , so and the constant function are both densities of with respect to itself. They agree almost everywhere by A sigma-finite signed measure that is absolutely continuous with respect to a sigma-finite positive measure has a unique almost-everywhere density. For , the positive part of is at most , while its negative part is bounded by in Kullback–Leibler divergence. Thus every term in the finite sum is well-defined and finite.
The uniform prior is part of this definition. A nonuniform prior requires its own weights in the mixture and in the KL average.
Depends on
- The Axiom of Choice
- The cardinality $\lvert A\rvert$ of a finite set
- Kullback–Leibler divergence
- The natural logarithm as the inverse of the exponential function
- Probability measures and probability spaces
- Measures on sigma-algebras
- The Radon-Nikodym derivative as an almost-everywhere equivalence class
- A sigma-finite signed measure that is absolutely continuous with respect to a sigma-finite positive measure has a unique almost-everywhere density
- Likelihood-ratio change of measure
- Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm
Used by
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
- John Duchi, Lecture Notes on Statistics and Information Theory, Chapter 8, §8.4.4, equation (8.4.4) (standard reference, not scraped)