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.
Measure-theoretic mutual information
Definition
Let and be measurable spaces and let be a probability measure on . Its marginals are and . The product probability exists by the finite product-measure theorem. For the absolutely continuous branch , assume AC as required by Kullback–Leibler divergence; the non-absolutely-continuous branch below remains . Define the measure-theoretic mutual information of the joint law by For random elements with joint law , write . The logarithm convention is the natural logarithm, so finite values are in nats as fixed by Information units and logarithm-base convention. The divergence is directional in its two law arguments and is when .
This definition uses only the joint law, not a choice of density or a difference of entropy quantities.
Depends on
- Kullback–Leibler divergence
- Information units and logarithm-base convention
- The Axiom of Choice
- Law or distribution of a random element
- Probability measures and probability spaces
- The product sigma-algebra and its finite iterates
- For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique
Used by
- Law entropy as self-mutual information Definition
- A finite deterministic copy has mutual information equal to entropy Example
- Entropy estimates for complex Gaussian interference converses Lemma
- Power bound for real and complex scalar Gaussian channels Lemma
- Random-cut stationary ergodic block-channel approximation Lemma
- Finite-dimensional Gaussian vector squared-error rate-distortion function Theorem
- Mutual information is recovered by finite coordinate quantizations Theorem
- Mutual-information chain rule without subtracting infinities Theorem
- Self-mutual-information entropy on countable and non-atomic laws Theorem
- Zero information is exactly independence Theorem
Dependency tree · two levels
41 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–5.5 (standard reference, not scraped)
- Yury Polyanskiy and Yihong Wu, MIT 6.441 Information Theory, Chapter 2 §§2.1–2.4 (standard reference, not scraped)
- John Duchi, Lecture Notes on Statistics and Information Theory, Chapter 2 §2.1 (standard reference, not scraped)