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.
Circular complex Gaussian maximizes differential entropy at fixed second moment
Statement
Assume AC. Let have a Lebesgue density, finite mean , finite differential entropy, and positive-definite real covariance matrix for . Put . Then Equality holds exactly for the circular complex Gaussian law with density .
Facts & Assumptions
Given: AC and the density, mean, entropy, and positive-definite real covariance hypotheses in the Statement.
The Axiom of Choice: AC is required by the Gaussian-law and entropy supplier.
Gaussian maximizes differential entropy at fixed positive-definite covariance: a real vector with positive-definite covariance and finite differential entropy satisfies , with equality exactly for the matching real Gaussian law.
Proof
Identify with the real vector . This identification preserves Lebesgue measure and the differential-entropy integral, so [F1] with gives
Let be the eigenvalues of . Then , because . Substitution into step 1.1 gives . Equality requires equality in [F1] and , so is Gaussian with real covariance , exactly . Conversely, substituting that circular Gaussian density gives entropy .
Depends on
Used by
Dependency tree · two levels
5 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
- Yury Polyanskiy and Yihong Wu, Information Theory: From Coding to Learning, author prepublication (standard reference, not scraped)
- John Duchi, Lecture Notes on Statistics and Information Theory (standard reference, not scraped)