Write . We first prove the needed cancellation of quadratic exponential sums, rather than invoke equidistribution without proof. The number is irrational: writing it as a reduced fraction would make its numerator even from , and then its denominator even as well, a contradiction. Thus is irrational for nonzero integers .
Fix and set for , extending it by zero otherwise. For integers , each term appears exactly times in the shifted sum, so
For any complex numbers , nonnegativity of gives . Apply this special Cauchy-Schwarz inequality to the displayed outer sum, and then expand the inner squared modulus. This gives
For fixed and large , each correlation is the geometric series
whose absolute value is at most , independently of . This follows by multiplying the geometric sum by ; its denominator is nonzero by irrationality. Divide the inequality by and let , keeping fixed. It gives a limit superior at most . Taking arbitrarily large proves
This is the quadratic instance of the Van der Corput inequality for finite scalar sequences, with its proof supplied here.
To turn cancellation into the particular approximation, put and choose an integer . The Fejér kernel is the explicit finite trigonometric polynomial
The expansion follows by counting pairs of indices with difference . Its constant coefficient is one, so the cancellation just proved gives
If , the geometric-series formula gives
For all sufficiently large , the displayed average exceeds . Consequently at least one satisfies
It is a positive integer, as required. Every auxiliary cancellation and kernel identity used in this existence proof has been derived; a smooth cutoff or an unproved Weyl criterion is unnecessary.

Articles by others on the same topic (0)

There are currently no matching articles.