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.
Gaussian maximizes differential entropy at fixed positive-definite covariance
Statement
Assume the Axiom of Choice. If a random vector has a Lebesgue density, finite mean , positive-definite covariance , and finite differential entropy , then Equality holds exactly when has the Gaussian law .
Facts & Assumptions
Given: AC and a density of a random vector with finite mean , positive-definite covariance , and finite differential entropy.
The Axiom of Choice: AC is the choice axiom assumed by the Gaussian-law and KL suppliers used below.
A positive-definite multivariate normal law has its Gaussian density: if is positive definite, the law has an everywhere-positive Lebesgue density proportional to .
Kullback–Leibler divergence is nonnegative: , with equality only when , under AC.
Proof
Let be the everywhere-positive Gaussian density in [F1] with mean and covariance . Since is a Lebesgue density and everywhere, the law is absolutely continuous with respect to . The log ratio is integrable: is finite by hypothesis, while is a constant plus a quadratic form and has finite second moments. Hence The last expectation is , by expanding the finite quadratic form and using the covariance entries.
By [F2], the left side in step 1.1 is nonnegative, which rearranges to the displayed entropy bound. Equality holds exactly when , which by [F2] is equivalent to equality of the laws; thus . Conversely, substituting the density into the entropy integral gives equality because its centered quadratic expectation is .
Depends on
Used by
Dependency tree · two levels
50 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
- Sung Hoon Lim, Young-Han Kim, Abbas El Gamal, and Sae-Young Chung, Noisy Network Coding, IEEE Transactions on Information Theory 57(5), 2011 (standard reference, not scraped)
- Abbas El Gamal and Young-Han Kim, Lecture Notes on Network Information Theory, arXiv:1001.3404v4 (standard reference, not scraped)