Sumset and inverse sumset theorems for Shannon entropy

Abstract

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…