Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2024/iii/paper-129/3/iv/solution

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

New to topics? Read the docs here!