Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2008/iii/paper-16/1/solution

We prove the Roth theorem on three-term arithmetic progressions by a density increment on an ordinary integer arithmetic progression. The required increment will be small, but depend only on the current subset density.
First establish the increment step. Suppose has subset density and no nonconstant three-term arithmetic progression. Put , regard as a subset of the cyclic group , and set . Then and . Use the normalized Fourier coefficient on a finite abelian group
The character orthogonality geometric-series identity for and zero otherwise gives Fourier inversion on a finite group, Parseval identity on a finite group, and
Since is odd, multiplication by two permutes its frequencies. If one argument is and the other two have absolute value at most one, Cauchy-Schwarz and the Parseval identity on a finite group give .
A modular arithmetic progression whose three entries lie in satisfies the corresponding integer equation: the absolute value of is less than , so congruence to zero forces equality. Thus , since only constant arithmetic progressions remain. Meanwhile, the choices and give at least arithmetic progressions in for . As , this gives . Expand . The seven terms other than the main term are each bounded by . For ,
Consequently a nonzero frequency obeys , where . It is nonzero because .
We turn this coefficient into a local increase. Let . Partition the unit circle into equal intervals and consider the points , , modulo one. Two occupy the same interval, yielding an integer with . Set . If exceeds a sufficiently large absolute multiple of , then and each residue-class arithmetic progression of step in has at least terms. Partition each into pieces of lengths between and , distributing the final remainder among the pieces.
On each such arithmetic progression , the character of a finite abelian group differs from its value at the first point by at most . Write . Therefore
so . But , and hence the sum of the positive is at least . Some piece must consequently satisfy . On that piece,
Also, once , . This proves the one-frequency density increment on an integer interval: for absolute constants , if , there is a arithmetic progression of length at least on which the subset density rises by at least . For example one may decrease to and choose large enough for the displayed elementary inequalities.
Now fix and suppose the required conclusion fails. On each new arithmetic progression, identify its points in order with . This affine identification preserves all integer arithmetic progressions, so its copy of is still progression-free. All densities remain at least . Put , , and choose an integer . Every increment raises the subset density by at least and changes the length by . Iterating the latter inequality gives
Choose . Then every length up to step exceeds , so every increment is available. After increments the subset density exceeds one, a contradiction. Thus
For there are no sets satisfying the subset density assumption. The argument above proves the substantive case without invoking the theorem being asked for.

New to topics? Read the docs here!