In our last primer we saw the Fourier series, which flushed out the notion that a periodic function can be represented as an infinite series of sines and cosines. While this is fine and dandy, and quite a powerful tool, it does not suffice for the real world. In the real world, very little is truly periodic, especially since human measurements can only record a finite period of time. Even things we wish to explore on this blog are hardly periodic (for instance, image analysis). To compensate, we’ll develop the Fourier transform, which can be thought of as a limiting case of the Fourier series.

We will approach the Fourier transform from two different angles. First, we will take the “limiting case of the Fourier series” notion as far as it will take us (this will be quite far) to motivate the appropriate definitions. In this naive world, we will perform a few interesting computations, and establish the most useful properties of the Fourier transform as an operation. On the other hand, this naive world will be fraught with hand-waving and mathematical laxity. We will make statements that analysts (and people who know about the issues of convergence) would find uncouth.

And so we will redevelop the bulk of the theory from the ground up, and define the Fourier transform on a larger class of things called *distributions*. In doing so, we will circumvent (or rather, properly handle) all of the issues of convergence.

## Fourier and Naivete

The Fourier transform is best thought of as an operation on functions which has some nice properties. One such property is linearity, and a more complex one is its effect on the convolution operation. But if one wants to know where the transform comes from, and this is an important thing to know, then we could interpret it as a generalization of the Fourier series coefficient. Similarly, its inverse can be thought of as a generalization of the Fourier series representation (or, the map taking a function to its Fourier series representation). The generalization we speak of, and the “limiting case” we mentioned earlier, is in the size of the period. In rough terms,

*The Fourier transform is the limit of the Fourier coefficient as the period of the function tends to infinity.*

This is how we will develop the definition of the Fourier transform, and the reader should understand why this is a sensible place to start: a function which has no period is simply a function which has an infinitely large period. Colloquially, one can “spot” periodicity much easier if the period is shorter, and as the period increases, functions start to “look” less and less periodic. So in the limiting case, there is no period.

In order to do this correctly, we should alter some of the definitions we made in our post on Fourier series. Specifically, we want to have an arbitrary period . So instead of making the 1-periodic complex exponential our basic building block, we choose . The reader will check that as varies over all integers, these new complex exponentials still form an orthonormal basis of (well not quite, we have to modify the inner product slightly; see below). Then, using the notation we used last time for the Fourier coefficients , the series is calculated as

where the are computed via the new inner product:

We make another slight alteration in the limits of integration:

This doesn’t change the integral, since a -periodic function has the same integral on any interval of length .

Before we continue, we should show an intuitive aspect of what happens when . We can think of the usual Fourier series representation of a 1-periodic function as a function on the integers whose values are the Fourier coefficients , since the coefficients completely determine the representation of . The interval between the inputs to this mapping is 1, because the function is 1-periodic. If we generalize this to an arbitrary period , then we have functions whose inputs are multiples of . So the intervals between adjacent inputs shrink to . As grows, the inputs are moving closer and closer together. In other words, the Fourier series representation is becoming a *continuous* mapping of the frequency! This viewpoint will motivate our seemingly magical choices to follow, and it partially justifies the common notion that the Fourier transform takes a function “in the time domain” and represents it “in the frequency domain.” It’s a stupid notion for mathematicians, but everyone says it anyway.

So if we try to take the limit immediately, that is, if we use the exact formula above for and try to evaluate , we have issues. The problem rears it’s ugly head when we let be a function with bounded support (that is, is zero everywhere except possibly on a finite interval). If is zero outside of and is finite, then for some large , we have that all of the Fourier coefficients go to zero as . The details:

But as the absolute value of the complex exponential is 1, we can bound this by

,

and as , we see that the whole thing goes to 0.

The solution is (magic!) to scale linearly by , and pull the balancing factor of outside of the coefficients , and into the Fourier series itself. In other words, our new Fourier series is (written with the terms rearranged for good reason)

where the coefficients are

Now we suddenly (magically!) realize that the first equation is just the usual Riemann sum from calculus for the estimate of an integral. If we think of as our variable, then we’d be integrating . And in particular, when the interval between the values goes to 0, the discrete sum converges to an integral by definition. Let us denote the infinitesimal variable to represent this “limit of .” Then we redefine the two above equations with glorious new names:

**Definition**: The *Fourier transform* of a function is the integral

whenever such an integral converges.

The *inverse Fourier transform* of is the integral

whenever such an integral converges.

And so, the Fourier transform above generalizes the Fourier coefficient (the limits of integration go to infinity), while the inverse transform generalizes the Fourier series reconstruction, by our conversion from a discrete sum to an integral.

We should note a few things about this definition, because it is quite a mouthful. First, and *operate on functions*. In other words, they accept a function as input, and their values are functions. Still in other words, the parentheses are like , and not like . We will often omit the parentheses with this implicitly understood precedence. This is also part of why we choose different variables. will often use a different variable than its transform .

Second, returning to our remark about stupid notions, the function can be thought of as being in the “time domain,” where the inputs are instances of time, while the transformed function is in the “frequency domain.” That is, for a given input , the Fourier transform describes how the complex exponential with frequency contributes to the overall function . The set of values of the Fourier transform of is called the *spectrum* of . One can visualize the spectrum, but only indirectly. A complex-valued function is always hard to visualize, so instead one graphs as a function on the real numbers. We then get pretty pictures like this one giving the spectrum of some human-spoken words:

This also explains the humorous comic at the beginning of this post: the thing saying “meow” is the spectrum of a cat, complete with whiskers. The comic also reinforces the idea that is simply an operation on functions. One does not *need* to restrict to operate on functions whose domain is time (indeed, a cat is not a function of time). It’s just an instance in which one can concretely interpret the transform of a function. For example, if one wanted to (and we will shortly), one could wonder about , or even apply arbitrarily many times and see what happens under the limit. The same thing goes for the inverse Fourier transform.

The last big issue we have with the above definition is that it only makes sense when the integral actually converges. We will run into a few examples where this becomes a big problem, but we will sweep these issues under the rug for now (remember, this is still the land of naivete).

Nevertheless, we can do some wonderful computations with this mentality and this new definition. It will benefit us in the long run, because we’ll discover the useful properties of the Fourier transform now, and use those properties to steer the more rigorous formalities later.

## Elementary Transforms and Elementary Properties

Armed with the mighty definition of the Fourier transform, we can take two paths. We can compute the transforms of various elementary functions, or we can develop tools to construct transforms of combinations of functions by computing the transforms of their constituent parts. This is largely the same approach one takes in studying derivatives and integrals in classical calculus: one learns to compute the derivatives of polynomials, logarithms, and exponentials; and then one learns to compute derivatives of products, sums, and compositions of functions. We will operate with the same philosophy for now.

**Example: **Let be the characteristic function of the interval from -1/2 to 1/2. That is, it is the function which is 1 on that interval and zero everywhere else. We will show by appealing directly to the definition of the Fourier transform.

Since is zero outside of the chosen interval, and one inside, we can simplify the integral by adjusting the limits to -1/2 and 1/2, and inside simply using :

And this is quite tractable. Integrating the complex exponential as usual, we have:

Where the last equality follows from the classic identity . The result of this Fourier transform is so pervasive that it has it’s own name: .

**Exercise: **Let be the piecewise function defined as if , and zero otherwise. Prove that .

Again, this one follows straight from the definition, which must be computed piecewise to handle the absolute value.

**Example**: Let be the Gaussian . Then . That is, the Gaussian is fixed by the Fourier transform.

This is a very special property of the Gaussian, hinting at the special relationship between Fourier transforms and smoothness of curves. In order to prove it we need to borrow a fact from complex analysis, that . Note that here the indefinite integral of cannot be expressed in elementary terms, so basic calculus tools are insufficient to prove this fact. A proof is most easily accessible using complex integration and residue theory, and Wikipedia provides a proof that does the same thing using a real parameterization to make it seem more elementary.

To find the Fourier transform, we again appeal to the definition, except this time we use some tricks. First, we differentiate the definition with respect to , and then integrate the result by parts to arrive at an ordinary differential equation, which we know how to solve. Set for ease of notation.

Differentiating with respect to , we have

Performing the differentiation and regrouping terms we have

Now integrating by parts with respect to , and recognizing that the term tends to zero both as , we get

As we claimed earlier, this is a simple ordinary differential equation, which has solution

And here , as we claimed from the beginning. This completes the proof, as .

Next, we will focus on the rules for taking Fourier transforms of functions combined in various ways. First, we note that the Fourier transform is linear, in the very same sense as linear maps between vector spaces in elementary linear algebra. In particular, the linearity of the integral gives

Other easy properties arise from modifying the input of , and using multiplicative properties of the complex exponential. For instance, if we let , we see that . This follows by a simple change of variables in the integral. Letting ,

And we can trivially factor out the needed complex exponential coefficient, and work with as usual. One convenient interpretation of this formula is that a shift in time corresponds to a phase shift in frequency. Once again, we caution that these interpretations are a tool; they can massively confuse the issue when, say, the domain of is frequency to begin with.

Similar considerations give us a formula for the scaled function whose transform is . We leave this as an exercise to the reader (hint: break it into two cases for when ).

Next, we note that the Fourier transform turns derivatives of some functions into a very manageable product. Rigorously, if then

We can prove this by induction. We’ll just prove the base case:

Integrating by parts, we get

And by our boundedness property and the fact that the complex exponential has a constant norm, the first term (evaluated from to ) tends to zero, leaving our desired product. The inductive step follows with the ease of iterated integration by parts. Note that although this example only holds for functions which tend to zero at , next time we will rectify the situation by restricting our theory to functions which are “the best candidates” for the theory of Fourier analysis and eliminate the need for such hypotheses.

## The More Interesting Properties

The final two properties of the Fourier transform that we will inspect are in a sense deeper and more substantial than those above. In particular, we will establish the duality of the Fourier transform, and the effect of Fourier transforms on convolution.

First, the Fourier transform has a few notions of duality. Let denote . One such duality notion is the following, which is a trivial consequence of the definitions of the transform and its inverse:

Similarly, a minor change of variables shows that . Chaining these together, we have the nice identity

A simple corollary is that . This allows us to compute the Fourier transforms of some potentially unmanageable functions. For instance, let us return to our friend the sinc function.

by the symmetry of the characteristic function. On the other hand, it’s ridiculously counterintuitive that the following integral is actually the characteristic function of a finite interval:

In fact, even though we just “proved” that the sinc function has a nice transform, it is hardly clear how to integrate it. In fact, the sinc function is not even (Lebesgue) integrable! Without further qualifications, the above expression is complete nonsense.

Historically, this is the point at which the physicists contact the mathematicians and say, “We dun broked it!” Because the physicists went ahead and used these naively impossible transforms to do amazing things and discover elegant identities, the mathematicians are left to design a sensible theory to support their findings. The field is rife with such inconsistencies, and this is not the last one we will see before consolidating the theory. Perhaps this is in part because successful applications in engineering outpace mathematical rigor. Glibly, they’re racing for profit while the mathematicians want to architect a flawless foundation in which deep theorems are manifestly obvious.

Getting back to the properties of Fourier transforms, we have saved perhaps the most useful one for last. In short, Fourier transforms turn *convolution* into multiplication. Convolutions, both continuous and discrete, make cameo appearances all over applied mathematics, from signal processing and image analysis to quantum mechanics and mathematical finance. In our applications, we will use the following properties of convolution to modify the spectrum of a signal, for such purposes as removing noise, or filtering out low/high/mid frequency regions. Without further ado, the definition:

**Definition:** The *convolution* of and , denoted , is the integral

should such an integral converge. Otherwise the convolution is undefined.

Often convolution is interpreted as some sort of stretch+translation of a function by another, but we find such meager interpretations mathematically flaccid. Convolution is simply an operation that combines functions in an interesting way (perhaps its definition is motivated by the question below). Nevertheless, Wikipedia provides a number of relevant animations showing convolution in action.

So the leading question here is, what happens when one takes the product of ? From the definition, this is

We may combine the integrals into a double integral, and further combine the complex exponentials, getting

Substituting , we have

And swapping the order of integration,

(The parenthetical quantity drove our definition of the convolution to begin with.) And so we have the beautiful identity:

We will use this as follows: multiply the Fourier transform of a signal by an appropriate characteristic function (the characteristic function of the set of “good” frequencies of, say, a sound clip) and then take the inverse transform of the product, getting as a result a modified signal with certain frequencies removed.

There are a few hurdles between here and there (at least, as far as this blog goes). First, we must compensate for our convergence naivete with mathematical rigor. Next time, we will define the class of Schwartz functions, from which we will derive a class of “generalized functions,” intuitively constituting the class of “transformable” functions. After that, we must needs find a suitable discrete approximation of the Fourier transform. In real life, all signals are *sampled* sequences of numbers. As such, we cannot take their integrals, and must convert these continuous notions to operations on sequences. Finally, we need to investigate an algorithm to efficiently compute such a discrete Fourier transform. Then, and only then, may we proceed with writing programs to do great things.

So look forward to all of the above in the coming weeks. Until next time!

I’m enjoying going through your blog archives, especially the “primers”, but i confess I was extremely confused by most of your limiting argument (starting with “The interval between the inputs…”). No matter the value of T, the inputs are always integers, so I’m not sure what is meant by “the interval between them”. Perhaps you mean the interval between the discrete frequencies? I’m also kind of confused by the Riemann sum argument — shouldn’t c_k be evaluated at k/T instead of 1/T for a Riemann sum? I think perhaps the k should be absorbed into s, rather than it being an “infinitesimal variable”.

Yes, by inputs I mean the inputs to the Fourier series representation (which is later the Fourier transform), which are the frequencies k/T. Between adjacent values of k you get a spacing of 1/T. I think as usual the confusion is in the notation. Perhaps I should have written . Then it’s clearer that the inputs are k/T instead of k and 1/T combined arbitrarily into k/T. The subscript of k is supposed to be consistent with the previous primer, but I can see why it’s unclear. And even though k is later “absorbed” into s in the actual definition of the transform, it doesn’t make sense to do that from a Riemann integral perspective (we need a delta x that gets increasingly smaller).

Oh, i see, thanks. I’m still not 100% with the Riemann sum though, you say we’re integrating the function . Does that mean, as a function of x? what happened to t? It seems like the partition values for the riemann sum are {k/T} (spaced 1/T apart), so k should not appear in the function being integrated. To me, it seems like the integrated function (of x) is , using your alternative notation.

Yes you’re right! That one’s a typo 🙂

Good to know I’m not insane. You still have a k subscript though, not sure how to write the function without changing your notation.

Another excellent post!

A quick question about one of the derivations: “The solution is (magic!) to scale linearly by T…” Why does the linear scaling change the complex exponentials in the Fourier series representation of f(t)? (they have become the conjugates of what usually sits there)

Linear scaling doesn’t change the complex exponentials, but rather eliminates the factor of 1/T that sits in front of the integral (and moreover sets us up to view the entire thing as a Riemann sum by viewing 1/T as the variable). The important part is that the Fourier coefficients shouldn’t be going to zero, but it’s okay for the area of the rectangles in the Riemann sum to go to zero since we’re using more and more of them.