Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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 X=(X1,…,Xd) be a real random vector with E∥X∥2<∞, and let Z be independent of X with density (2πN)−d/2e−∥z∥2/(2N), N>0. Then Y=X+Z has a positive density and finite differential entropy. Each coordinate satisfies h(Yk)≤12ln⁡(2πe Var⁡Yk), while h(Y)≤∑kh(Yk) and h(Y)≥h(Z)=d2ln⁡(2πeN). If a side variable S admits a conditional law PX∣S=s with finite second moment almost surely and Z is independent of the pair (X,S), then each conditional Gaussian convolution has finite entropy and h(Y∣S)≤∑k=1d12ln⁡ ⁣(2πe[N+EVar⁡(Xk∣S)]).

Facts & Assumptions

Given: A finite-dimensional random vector X with finite second moment and independent Gaussian noise Z of variance N>0 per coordinate.

[F1]

Differential entropy for real densities: h(f)=−∫fln⁡f when the entropy integral is finite; conditional differential entropy is the average over conditional densities.

[F2]

Two-user real AWGN multiple-access channel and no-feedback code: each noise has Lebesgue density ϕN(z)=(2πN)−1/2e−z2/(2N).

[F3]

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

1.1givenF2F3algebra

The convolution fY(y)=E[(2πN)−d/2e−∥y−X∥2/(2N)] is measurable and strictly positive. Tonelli's theorem [F3] gives integral one. Direct Gaussian integration gives E∥Z∥2=dN, hence E∥Y∥2<∞.

2.1givenF1step 1.1algebra

Choose K with p0:=Pr⁡(∥X∥≤K)>0, which exists because the increasing union of the finite-radius balls is Rd. For every y, fY(y)≤(2πN)−d/2 and fY(y)≥p0(2πN)−d/2e−(∥y∥+K)2/(2N). Thus ∣ln⁡fY(y)∣≤C(1+∥y∥2) for a finite constant C; [F1] and step 1.1 give ∫fY∣ln⁡fY∣<∞. The same argument applies to every coordinate marginal and, for almost every s, to the conditional law PX∣S=s using a radius Ks with positive conditional mass.

3.1F1step 2.1algebraalgebra

For any coordinate density fYk, let μ=EYk, v=Var⁡Yk>0, and let ϕμ,v be the matching Gaussian density. The inequality tln⁡t−t+1≥0 for t≥0 follows by differentiation and its minimum at 1; integrating it against ϕμ,v gives ∫fYkln⁡(fYk/ϕμ,v)≥0. 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 h(Yk)≤12ln⁡(2πev).

3.2F1step 2.1algebraalgebra

Apply the same inequality to the ratio of the joint density of Y to the product of its coordinate marginals. Step 2.1 makes every log term integrable, and expansion gives h(Y)≤∑kh(Yk).

4.1F1F2step 2.1step 3.1step 3.2algebraalgebra

Under the reference law PX(dx)fY(y)dy, the ratio of the joint law of (X,Y) to that reference is ϕN⊗d(y−x)/fY(y). Its mean is one; integrating tln⁡t−t+1≥0 against the reference gives a nonnegative integral. The logarithm is integrable by step 2.1 and the finite Gaussian second moment. Expanding it gives h(Y)−h(Z)≥0, and direct integration of ϕN gives h(Z)=d2ln⁡(2πeN). Steps 2.1, 3.1 and 3.2 prove the unconditional claims.

5.1F1step 1.1step 2.1step 3.1step 3.2step 4.1algebraalgebraalgebra∎

Independence of Z from (X,S) makes the conditional law of Y given S=s the convolution of PX∣S=s with the same N(0,NId) density. For almost every s, repeat steps 1.1 and 2.1 with PX∣S=s; applying steps 3.1 and 3.2 coordinatewise gives h(Y∣S=s)≤∑k=1d12ln⁡ ⁣(2πe[N+Var⁡(Xk∣S=s)]). The conditional version of step 4.1 also gives h(Y∣S=s)≥h(Z), so these bounds and step 2.1 make the averaged conditional entropy finite. Averaging the upper bound and applying concavity of ln⁡ to each coordinate separately yields the displayed conditional inequality; each EVar⁡(Xk∣S) is finite because it is at most EXk2.

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