The purpose of this note is to show completeness of the
“Fourier modes”
Because of the Euler formula, the set of exponential Fourier modes
above is completely equivalent to the set of real Fourier modes
The extension to functions that are periodic of some other period than
is a trivial matter of rescaling
.
,
any half period, the exponential Fourier
modes take the more general form
Often, the functions of interest are not periodic, but are required to
be zero at the ends of the interval on which they are defined. Those
functions can be handled too, by extending them to a periodic
function. For example, if the functions
relevant to a problem
are defined only for 0
and must satisfy
0, then extend them to the range ![]()
![]()
0 by setting
and take the range
![]()
![]()
to be the period of a
-
If the half period
becomes infinite, the spacing between the
discrete
values becomes zero and the sum over discrete
values
turns into an integral over continuous
values. This is exactly
what happens in quantum mechanics for the eigenfunctions of linear
momentum. The representation is now no longer called a Fourier
series, but a “Fourier integral.” And the Fourier coefficients
are now
called the “Fourier transform”
.
The basic completeness proof is a rather messy mathematical
derivation, so read the rest of this note at your own risk. The fact
that the Fourier modes are orthogonal and normalized was the subject
of various exercises in chapter 2.6 and will be taken for
granted here. See the solution manual for the details. What this
note wants to show is that any arbitrary periodic function
of period
that has continuous first and second order
derivatives can be written as
First an expression for the values of the Fourier coefficients
is needed. It can be obtained from taking the inner product
between a
generic eigenfunction ![]()
![]()
and the
representation for function
above. Noting that all the inner
products with the exponentials representing
will be zero except
the one for which
,
Now the question is: suppose you compute the Fourier coefficients
from this expression, and use them to sum many terms of the
infinite sum for
,![]()
![]()
to the corresponding large positive value
;
,
To find out, the trick is to substitute the integral for the
coefficients
into the sum and then reverse the order of
integration and summation to get:
The second trick is to split the function
being
integrated into the two parts
and
.
,
and can be taken out, and the second part has the advantage
that it becomes zero at
.

Now if you backtrack what happens in the trivial case that
is
just a constant, you find that
is exactly equal to
in
that case, while the second integral above is zero. That makes the
first integral above equal to one. Returning to the case of general
,
,
.
To manipulate this error and show that it is indeed small for large
,
-
It may be noted that under the stated conditions, the convergence is
uniform; there is a guaranteed minimum rate of convergence regardless
of the value of
.
-
has, the faster the rate of
convergence, and the smaller the number
of terms that you need
to sum to get good accuracy is likely to be. For example, if
has three continuous derivatives, you can do another integration by
parts to show that the convergence is proportional to
1![]()
rather than just 1/
.
The condition for
to have a continuous second derivative can be
relaxed with more work. If you are familiar with the Lebesgue form of
integration, it is fairly easy to extend the result above to show that
it suffices that the absolute integral of
exists, something that
will be true in quantum mechanics applications.