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 standard-Borel random elements
Definition
Assume AC. Let be random elements with standard-Borel value spaces and , and let , , and be their joint and marginal probability laws. The product law exists by For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique. Define the mutual information in nats by
where is the directional Kullback–Leibler divergence of Kullback–Leibler divergence. This definition remains meaningful when one or both laws have no Lebesgue density and does not subtract differential entropies that may be infinite.
Remarks
The underlying spaces are standard Borel, as defined in Standard Borel spaces. AC is part of the definition's dependency contract through the Radon–Nikodym construction in the KL supplier.
Depends on
Used by
- A Gaussian rate-distortion optimizer need not have a density Counterexample
- General single-letter information rate-distortion function Definition
- Finite Gaussian-vector distortion waterline Example
- Gaussian reference-kernel mutual-information lower bound Lemma
- Finite-dimensional Gaussian vector squared-error rate-distortion function Theorem
Dependency tree · two levels
37 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)