Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 13 3 ii Solution Created 2026-10-03 Updated 2026-10-14
The positive-power length assertion is an asymptotic one: it requires sufficiently large in terms of the density. Read literally for every , it fails when , and , whose triple sumset is a singleton. We prove the intended result with this necessary qualification and an explicit positive exponent.
Embed the interval into the cyclic group with , and set , . Since all integer triple sums lie in , this embedding introduces no collisions between distinct sums. Use normalized Fourier coefficients on a finite abelian group and normalized convolution on a finite group, and putThe function is nonnegative and has mean , so some satisfies . We show that a whole translated Bohr set is contained in its positive support, hence in the triple sumset.
Put , , and define the large spectrumThe Parseval identity on a finite group gives , soAlso , and therefore . Using Fourier inversion and the convolution theorem on a finite group, for we obtainConsequently . This proves the translated Bohr neighborhood in a triple sumset:It remains to produce a long ordinary integer arithmetic progression in this translate; we supply the simultaneous approximation and the lifting argument. SetThus . Partition the -dimensional unit cube into boxes of side . The pointscontain two in the same box by the pigeonhole principle. Their index difference gives an integer with andIn particular . The identity on the unit circle now shows thatAll residues therefore lie in the triple sumset. Let be their actual integer representatives. Their successive differences are congruent to modulo , and each lies in , which is contained in . There is at most one integer in this interval in any specified residue class, so every difference is the same integer. It is nonzero because . Thus the form an ordinary integer arithmetic progression of distinct elements, even though is composite. Reversing it if necessary makes the common difference positive.
For sufficiently large , we have and , whenceAbsorb this fixed prefactor by decreasing the exponent: withthe last lower bound is at least once is sufficiently large in terms of . This proves a polynomial-length progression in by the polynomial-length progression in a dense triple sumset argument, without replacing the triple sumset by a fourfold difference set.
For fixed positive density , every sufficiently large of size at least has a long arithmetic progression in its triple sumset. Embed it in , where its density is at least . A translated Bohr neighborhood in a triple sumset has bounded rank and fixed positive radius depending only on . A torus pigeonhole principle argument supplies a nonzero step whose small multiples stay in the Bohr set, with polynomially many multiples. All resulting residues have representatives in , an interval shorter than half the modulus, so their successive ordinary integer differences agree and give an actual integer arithmetic progression. The positive constant prefactor is absorbed by reducing the exponent for sufficiently large .