Dense Bogolyubov-Ruzsa lemma 2026-09-28
For every , if has density at least in a cyclic group of prime order, then contains a proper generalized arithmetic progression of rank and size .
Past exam of the mathematics course of the University of Cambridge 2021 iii Paper 129 4 c Solution 2026-09-28
The Dense Bogolyubov-Ruzsa lemma says that, for every , if has density at least in a cyclic group of prime order, then contains a proper generalized arithmetic progression of rank and size .
Now suppose and . The Ruzsa modelling lemma, taken at a sufficiently high fixed Freiman order, supplies with and a Freiman isomorphism from to a subset , where is prime, , and . Apply the dense Bogolyubov-Ruzsa lemma to and transfer the resulting progression back through the Freiman model. We obtain a proper progressionof rank and size .
The Plünnecke-Ruzsa inequality givesThere are pairs with and , distributed among the sums in . Some therefore has at least representations . Equivalently,Set . Translation and negation preserve properness and rank. Moreover and another use of Plünnecke gives . Thusas required.
Past exam of the mathematics course of the University of Cambridge 2021 iii Paper 129 4 e Solution 2026-09-28
Consider the graphThe hypothesis says exactly that has at least additive quadruples. By the Balog-Szemerédi-Gowers theorem, it contains with and .
Part b gives a Freiman s-isomorphism from to a set , where it is enough to take any fixed . The set has bounded doubling, with a bound depending only on . Part c therefore provides a proper generalized arithmetic progression of rank such that
Write as a proper parameter box. Since , one of its side lengths tends to infinity with . Averaging over all lines parallel to that side gives a line on which has density bounded below in terms of . The Szemerédi theorem quoted in the question then gives, once is sufficiently large in terms of and , a nonconstant -term arithmetic progression in .
The inverse Freiman isomorphism sends it to a -term arithmetic progression in , because each relation between three consecutive terms is an additive-quadruple relation. Write this progression asIts first-coordinate difference cannot be zero: the graph of a function has only one point above each . Hence . On the nonconstant progressionwe haveTaking and , both in , proves the claim.