(8.3) |
Suppose, however, that we are dealing with a function that is not periodic in . We can think of such a function as one that is periodic in with a period that tends to infinity. Does this mean that we can still represent as a Fourier series? Consider what happens to the series (8.2) in the limit , or, equivalently, . The series is basically a weighted sum of sinusoidal functions whose wavenumbers take the quantized values . Moreover, as , these values become more and more closely spaced. In fact, we can write
In the continuum limit, , the summations in the previous expression become integrals, and we obtain where , , and . Thus, for the case of an aperiodic function, the Fourier series (8.2) morphs into the so-called Fourier transform (8.10). This transform can be inverted using the continuum limits (i.e., the limit ) of Equations (8.7) and (8.8), which are readily shown to be respectively. (See Exercise 5.) The previous equations confirm that and . The Fourier-space (i.e., -space) functions and are known as the cosine Fourier transform and the sine Fourier transform of the real-space (i.e., -space) function , respectively. Furthermore, because we already know that any periodic function can be represented as a Fourier series, it seems plausible that any aperiodic function can be represented as a Fourier transform. This is indeed the case.When sinusoidal waves of different amplitudes, phases, and wavelengths are superposed, they interfere with one another. In some regions of space, the interference is constructive, and the resulting wave amplitude is comparatively large. In other regions, the interference is destructive, and the resulting wave amplitude is comparatively small, or even zero. Equations (8.10)–(8.12) essentially allow us to construct an interference pattern that mimics any given function of position (in one dimension). Alternatively, they allow us to decompose any given function of position into sinusoidal waves that, when superposed, reconstruct the function. Let us consider some examples.
Consider the “top-hat” function,
See Figure 8.1. Given that and , it follows from Equations (8.11) and (8.12) that if is even in , so that , then , and if is odd in , so that , then . Hence, because the top-hat function (8.13) is even in , its sine Fourier transform is automatically zero. On the other hand, its cosine Fourier transform takes the form(8.14) |
As a second example, consider the so-called Gaussian function,
As illustrated in Figure 8.2, this is a smoothly-varying even function of that attains its peak value at , and becomes completely negligible when . Thus, is a measure of the “width” of the function in real (as opposed to Fourier) space. By symmetry, the sine Fourier transform of the preceding function is zero. On the other hand, the cosine Fourier transform is readily shown to be where(8.17) |
(8.19) |