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.
Entropy bounds for finite-power Gaussian convolutions
Statement
Let be a real random vector with , and let be independent of with density , . Then has a positive density and finite differential entropy. Each coordinate satisfies , while and . If a side variable admits a conditional law with finite second moment almost surely and is independent of the pair , then each conditional Gaussian convolution has finite entropy and
Facts & Assumptions
Given: A finite-dimensional random vector with finite second moment and independent Gaussian noise of variance per coordinate.
Differential entropy for real densities: when the entropy integral is finite; conditional differential entropy is the average over conditional densities.
Two-user real AWGN multiple-access channel and no-feedback code: each noise has Lebesgue density .
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: a nonnegative measurable function on a sigma-finite product has equal iterated and product integrals.
Proof
The convolution is measurable and strictly positive. Tonelli's theorem [F3] gives integral one. Direct Gaussian integration gives , hence .
Choose with , which exists because the increasing union of the finite-radius balls is . For every , and . Thus for a finite constant ; [F1] and step 1.1 give . The same argument applies to every coordinate marginal and, for almost every , to the conditional law using a radius with positive conditional mass.
For any coordinate density , let , , and let be the matching Gaussian density. The inequality for follows by differentiation and its minimum at ; integrating it against gives . Step 2.1 gives integrability of the entropy term, and the second moment gives integrability of the Gaussian log density. Expanding that log density yields .
Apply the same inequality to the ratio of the joint density of to the product of its coordinate marginals. Step 2.1 makes every log term integrable, and expansion gives .
Under the reference law , the ratio of the joint law of to that reference is . Its mean is one; integrating against the reference gives a nonnegative integral. The logarithm is integrable by step 2.1 and the finite Gaussian second moment. Expanding it gives , and direct integration of gives . Steps 2.1, 3.1 and 3.2 prove the unconditional claims.
Independence of from makes the conditional law of given the convolution of with the same density. For almost every , repeat steps 1.1 and 2.1 with ; applying steps 3.1 and 3.2 coordinatewise gives The conditional version of step 4.1 also gives , so these bounds and step 2.1 make the averaged conditional entropy finite. Averaging the upper bound and applying concavity of to each coordinate separately yields the displayed conditional inequality; each is finite because it is at most .
Depends on
Used by
Dependency tree · two levels
12 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
- Thomas M. Cover and Joy A. Thomas, Elements of Information Theory, 2nd ed., Chapter 8, §8.6 (standard reference, not scraped)
- Abbas El Gamal and Young-Han Kim, Network Information Theory, Lecture Notes 4, Gaussian MAC converse (standard reference, not scraped)