For a nonempty integer set with doubling constant at most , Plünnecke-Ruzsa inequality bounds by . Embed the set modulo a sufficiently large auxiliary prime , randomly dilate it, and select the more populated of two half-intervals of representatives. Differences of two pair sums on that half have absolute value less than , so the lift preserves original relations. Every nonzero original difference is uniformly dilated among nonzero residues; avoiding all residues represented by nonzero multiples of of absolute value less than has positive probability when . Reduction modulo then yields a Freiman 2-isomorphism on the selected half.
For a finite nonempty integer set , put . If an integer , some of size at least has a Freiman 2-isomorphism into . Choose an auxiliary prime so large that reduction is injective on and every nonzero element of remains nonzero. Dilate modulo by a uniformly chosen nonzero multiplier. The forbidden residues are those represented by nonzero multiples of of absolute value less than , at most residues. The nonzero elements of occur in opposite pairs; the two elements in each pair have the same bad event. The union bound therefore gives failure probability at most . Choose a multiplier avoiding all these events. Select the more populated of two half-intervals of residues modulo . Differences of two pair sums of representatives then have absolute value less than . An original additive relation must therefore lift to equality in the integers; conversely an equality modulo cannot have a nonzero lifted difference, by the forbidden-residue choice. Reduction modulo is the required isomorphism.
Articles by others on the same topic
There are currently no matching articles.