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
Use normalized Fourier analysis on a finite abelian group. If has density , its large spectrum at level is
The Chang theorem states that this spectrum is contained in a subspace of dimension
Equivalently, it is contained in the span of a dissociated set of that size.
Let have density . Since vanishes on ,
The zero-frequency contribution is , so
Put . Outside , Parseval identity bounds the contribution by
Therefore
because . Chang's theorem places in a subspace of dimension
Set . Then has this codimension, , and adding the zero-frequency term gives
Let have dimension . The value
is a multiple of , and its average over is the density of . If every coset of met , then every value would be at least , forcing . Thus implies that some coset is disjoint from , and therefore
If , part (iii) gives the first alternative. Otherwise , so part (ii) gives a subspace of codimension with
The function is nonnegative and has mean . Hence
It follows that
Iterate part (iv) as a density increment. At a stage with ambient vector space of dimension and relative density , either the sumset contains a coset of a -dimensional subspace, or there is a subspace of codimension and a coset on which the density is at least . Translate that coset back to the subspace. Since the ambient group has characteristic two, this translation does not alter the translated set's sumset.
The densities grow geometrically, so the iteration has stages, while the total codimension lost is
Choose with a sufficiently small absolute . The total codimension is then less than , so every stage still has ambient dimension at least . The density cannot increase indefinitely beyond one; therefore the first alternative must occur. When , take the zero-dimensional subspace; this is the usual integer rounding implicit in the asymptotic dimension bound. Thus
for an absolute .
One normalized form of the Croot-Sisask almost-periodicity theorem is as follows. If finite sets in a group satisfy , , and , then for every function there is with
such that
Apply the Croot-Sisask almost-periodicity theorem with the sampling set , , , and error . Since , the doubling parameter is , and . We obtain with
such that
for every . Every is a sum of elements of . Telescoping these shifts and using translation invariance and the triangle inequality for the Lp norm gives
Put . The probability measure
is supported on . Convolution by averages translates by points in this support, so convexity of the supremum norm gives
Thus
Choose and a sufficiently large absolute constant . Part (iii)'s size bound gives
Let
and choose a maximal dissociated set . The entropy form of the Chang theorem gives
and maximality gives .
Put . If and , expressing as a product of characters in and their inverses gives
For , Parseval identity gives
Also . Fourier inversion theorem therefore yields
once is large enough.
If is empty, interpret as ; the same Fourier estimate, using only the second term, is even stronger.
Part (iii) gives . Applying this at and and using the last estimate gives
Finally . Hence for every , while the support of is . Consequently
The Finite-field Szemerédi theorem for four-term arithmetic progressions says that for every there is such that, for every prime , whenever and has density at least , there exist with and
The Fourier density-increment proof of the Meshulam theorem controls three-term progressions through ordinary Fourier coefficients, equivalently the norm. Four-term progressions are controlled by the Gowers uniformity norm . A function can have small correlation with every linear character while correlating strongly with a quadratic phase; such a function can have small norm but large norm. Ordinary Fourier uniformity therefore does not make the four-term progression count pseudorandom, and a large linear Fourier coefficient need not exist when that count is deficient. Quadratic or higher-order Fourier structure is needed.
For , let
The number of ordered three-term arithmetic progressions in is
By the Cauchy-Schwarz inequality,
The last sum is the additive energy of , namely the number of additive quadruples. If , then
Part (iii) gives at least additive quadruples. By the Balog-Szemerédi-Gowers theorem, there is with
The Freiman-Ruzsa theorem places in a coset progression whose rank is bounded in terms of and which satisfies
Thus has density at least inside .
The Szemerédi theorem in a bounded-rank coset progression says that, for fixed rank and density, every sufficiently large such progression has a nontrivial four-term progression in every subset of that density. If for a sufficiently large , then crosses this threshold. It gives a nontrivial four-term progression in , which is also contained in . This proves the claim with a constant depending only on .

Articles by others on the same topic (0)

There are currently no matching articles.