English

Sumset and inverse sumset theorems for Shannon entropy

Combinatorics 2020-04-08 v5 Probability

Abstract

Let G=(G,+)G = (G,+) be an additive group. The sumset theory of Pl\"unnecke and Ruzsa gives several relations between the size of sumsets A+BA+B of finite sets A,BA, B, and related objects such as iterated sumsets kAkA and difference sets ABA-B, while the inverse sumset theory of Freiman, Ruzsa, and others characterises those finite sets AA for which A+AA+A is small. In this paper we establish analogous results in which the finite set AGA \subset G is replaced by a discrete random variable XX taking values in GG, and the cardinality A|A| is replaced by the Shannon entropy Ent(X)\mathrm{Ent}(X). In particular, we classify the random variable XX which have small doubling in the sense that Ent(X1+X2)=Ent(X)+O(1)\mathrm{Ent}(X_1+X_2) = \mathrm{Ent}(X)+O(1) when X1,X2X_1,X_2 are independent copies of XX, by showing that they factorise as X=U+ZX = U+Z where UU is uniformly distributed on a coset progression of bounded rank, and Ent(Z)=O(1)\mathrm{Ent}(Z) = O(1). When GG is torsion-free, we also establish the sharp lower bound Ent(X+X)Ent(X)+1/2log2o(1)\mathrm{Ent}(X+X) \geq \mathrm{Ent}(X) + {1/2} \log 2 - o(1), where o(1)o(1) goes to zero as Ent(X)\mathrm{Ent}(X) \to \infty.

Keywords

Cite

@article{arxiv.0906.4387,
  title  = {Sumset and inverse sumset theorems for Shannon entropy},
  author = {Terence Tao},
  journal= {arXiv preprint arXiv:0906.4387},
  year   = {2020}
}

Comments

32 pages, no figures. An error in the quantitative bounds in Lemma 6.1 (pointed out by Lampros Gavalakis and Ioannis Kontoyiannis) has been fixed (at the cost of making these bounds exponentially worse)

R2 v1 2026-06-21T13:17:11.351Z