The Plünnecke-Ruzsa inequality says that if are finite nonempty subsets of an abelian group and
then for all nonnegative integers ,
Choose a nonempty minimizing
then . We first prove the Petridis minimal-growth lemma
for every finite , by induction on . Remove , write , and let
The new points contributed to by are exactly . Moreover, , so
The induction hypothesis, the identity , and minimality, which gives , yield
Iteration with gives
Finally, the Ruzsa triangle inequality gives
as required.
Construct greedily. Begin with one element of . While some satisfies
adjoin to . The first translate contributes points to , and each later translate contributes at least new points. Therefore
and hence
When the process stops, every satisfies . Each point in this intersection has the form
and 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 gives
so . Thus
Assume and put
This set is symmetric, contains zero, and the Plünnecke-Ruzsa inequality gives
It also contains , so for every ,
To control , observe again by Plünnecke-Ruzsa that
Apply the Ruzsa covering lemma with and . There is a set with such that
Consequently is a -approximate group. Taking a sufficiently large absolute constant gives

Articles by others on the same topic (0)

There are currently no matching articles.