English

Entropy lower bounds and sum-product phenomena

Combinatorics 2026-04-30 v2 Information Theory math.IT

Abstract

Various lower bounds are established for the entropy of sums, products and their combinations. First, we derive a prime-field analogue of a version of the entropy power inequality established by Tao over torsion-free groups. Next, we prove an entropy sum-product statement: For independent and identically distributed random variables X,XX,X', the maximum of H(X+X){\bf H}(X+X') and H(XX){\bf H}(XX') is bounded below by a linear combination of the entropy and the min-entropy (R\'enyi entropy of order~\infty) of XX. This result, obtained by bounding entropies of the form H(X(Y+Z)){\bf H}\bigl( X(Y+Z)\bigr) from above and below, is valid over arbitrary fields FF. Over F=RF={\bf R}, a slightly stronger inequality is derived. Finally, a weak version of a purely Shannon-entropic sum-product result is developed: If the entropic additive doubling of a random variable XX over an arbitrary field is O(1)O(1), then its multiplicative doubling is at least proportional to H(X){\bf H}(X).

Keywords

Cite

@article{arxiv.2604.20233,
  title  = {Entropy lower bounds and sum-product phenomena},
  author = {Lampros Gavalakis and Marcel K. Goh and Ioannis Kontoyiannis},
  journal= {arXiv preprint arXiv:2604.20233},
  year   = {2026}
}

Comments

22 pages, including references. Updated version with an additional reference

R2 v1 2026-07-01T12:29:50.765Z