For the stated angular-frequency Fourier transform convention, the convolution theorem gives
The Fourier inversion theorem and the assumed absolute integrability therefore imply
Since and the principal argument is ,
All logarithms are , .
By the Fourier inversion theorem and Fubini's theorem,
Thus multiplication of Fourier transforms corresponds to the convolution , which is the convolution theorem in the convention used here.
Use the convention
The Fourier inversion theorem says that, when ,
for almost every .
Since
the Fubini's theorem and Fourier inversion give
Thus the Plancherel theorem identity in this convention is
The inverse integral is a continuous function of , since permits dominated convergence. If is continuous, it and the inverse integral are continuous and agree almost everywhere. They must agree everywhere: otherwise their continuous difference would be nonzero on an open set of positive measure. This is the continuous version of Fourier inversion.
Put
This function is bounded near zero and is at infinity, so and the defining integral for converges absolutely.
For the triangular function
direct integration gives
The Fourier inversion theorem, or equivalently the Fourier transform of a triangular function, therefore yields
In particular whenever . Finally,
This also agrees with the Plancherel theorem applied to and .
We prove the estimate first for in the Schwartz space. By the Fourier inversion theorem and the Cauchy-Schwarz inequality,
The integral is finite because .
For , the elementary bound
gives
The last integral is finite near zero for every and at infinity exactly when . Choose, for example, , which works for every . We obtain
Density of the Schwartz space in extends the estimate and supplies a unique Hölder-continuous representative. Therefore
continuously. This is the Fourier proof of Hölder regularity from a Sobolev norm.
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
For a primitive nonprincipal Dirichlet character modulo , finite Fourier inversion theorem and the primitive Gauss magnitude give this bound uniformly in the interval. Bound the exponential sums by and sum the resulting harmonic series. The general Gauss identity follows from the prime-power identity by the Chinese remainder theorem.
When the continuous Fourier transform of an integrable function vanishes outside , its periodic Fourier coefficients are the integer samples of , with the sign of the index reversed. Projecting in and then applying the Fourier inversion theorem gives the displayed sinc function reconstruction. The Cauchy-Schwarz inequality controls the reconstruction error uniformly in . Bessel's inequality bounds the shifted sinc coefficient vector, giving absolute uniform tails when the sample sequence belongs to .