There is a normalization omission in the printed conclusion: the discrepancy of a count of pairs must be bounded by a small function of the energy excess times . We prove this normalized result, then give a counterexample to the literal bound without . Write for the energy excess parameter to avoid confusing it with an element of the third set.
For Fourier analysis on a finite abelian group, use and
Character orthogonality, for and zero otherwise, gives Fourier inversion and the Parseval identity on a finite group:
Put , , . Expanding the constraint by the same character orthogonality gives the additive energy identity
Thus , and every nonconstant Fourier coefficient on a finite abelian group of has modulus at most . Expanding the constraint in the triple count gives
The Cauchy-Schwarz inequality yields
The first squared norm is by the Parseval identity on a finite group. For the second, multiplication by on has kernel size and every element of its image has exactly preimages. Hence
This proves that additive energy controls three-term progression mixing, including for even moduli:
Thus the intended density-error function can be , which tends to zero. For odd moduli the factor can be replaced by one.
To see why the literal unnormalized conclusion is false, take and let all three sets be the subgroup of multiples of . Their densities are . Every choice of three entries of that subgroup determines the fourth entry of an additive quadruple, so its energy is . The excess parameter is
Every pair in the subgroup determines there, giving , whereas . Their difference is , which cannot be bounded by any function of tending to zero. The missing is therefore a genuine source defect, not an alternative Fourier transform normalization.