The Plünnecke-Ruzsa inequality says that if are finite nonempty subsets of an abelian group andthen for all nonnegative integers ,
Choose a nonempty minimizingthen . We first prove the Petridis minimal-growth lemmafor every finite , by induction on . Remove , write , and letThe new points contributed to by are exactly . Moreover, , soThe induction hypothesis, the identity , and minimality, which gives , yieldIteration with gives
Construct greedily. Begin with one element of . While some satisfiesadjoin to . The first translate contributes points to , and each later translate contributes at least new points. Thereforeand hence
When the process stops, every satisfies . Each point in this intersection has the formand therefore gives a triple with . Distinct intersection points give distinct , so there are more than such triples.
For , the corresponding sets of possible both have size greater than and hence intersect. Using a common givesso . Thus
Assume and putThis set is symmetric, contains zero, and the Plünnecke-Ruzsa inequality givesIt also contains , so for every ,
To control , observe again by Plünnecke-Ruzsa thatApply the Ruzsa covering lemma with and . There is a set with such thatConsequently is a -approximate group. Taking a sufficiently large absolute constant gives
Articles by others on the same topic
There are currently no matching articles.