We developed the theory of Fourier series on periodic functions, but is it possible to consider an analogous theory on functions of the real line?

For this to work, we must consider functions which vanish towards infinity in some sense, and instead of a series we will try transforming into another function

In our Fourier series definitions, we give

The continuous counterpart is then

This is an important tool in the study of partial differential equations. How do we prove it’s valid and under what assumptions? In this course, we limit ourselves to the Schwartz space of functions

To begin, we clarify , which is only defined if decays as

Definition: A function defined on is said to be of moderate decrease if is continuous and for some , in which case we write

  • This implies is bounded and decays at least as fast as
  • We could just as well use a more lenient definition of

For , exists and satisfies

  1. Linearity:
  2. Translation invariance:
  3. Scaling under dilations:
  4. Continuity: as

These are mostly trivial, although continuity relies on the uniform continuity of in a compact interval

Definition: The Fourier transform of is

Because of the conditions on , the integral is of moderate decrease and we can prove that is well-defined, bounded, continuous, and tends to as

This last point is known as the Reimann-Lebesgue Lemma

But this does not tell us how decays, and whether the resulting integral makes sense

One way we can learn more about is by requiring some more properties from

Definition: The Schwartz space on , denoted , consists of the set of all indefinitely differentiable functions such that and all its derivatives are rapidly decreasing, in the sense that , i.e. faster than polynomial decay

If then and
Also is a vector space over

An important example is , or more generally for

The bump functions also belong to

Although decreases rapidly at infinity, it is not differentiable at so it does not belong to , which is a subset of

We denote the Fourier transform of a function as before, , and we use the notation

Only the fifth property is non-trivial to prove

The fact that the Fourier transform interchanges differentiation with multiplication by makes it a key tool in the theory of differential equations

Theorem: If , then

For any pair and we have is bounded, because by properties 4 and 5 this is the Fourier transform of

So under , our inversion theorem is well-defined, although still not necessarily true

To actually prove this theorem, we will use the Gaussian, which has some special properties

First,




Theorem: If , then




We define

This means is a constant, so , so

As a natural corollary, if and then

The book notes that as , peaks at the origin while gets flatter, which is related to the Heisenberg uncertainty principle

Actually, this function satisfies our properties of good kernels established in the context of the discrete Fourier series,

  1. For ever , we have as

Theorem: The collection is a family of good kernels as

Similar to in the previous material, we apply these good kernels via convolution

Definition: If , their convolution is defined as

Since is of rapid decrease for any fixed , this integral converges

Corollary: If , then uniformly in as

Since is rapidly decreasing, we can establish that it is uniformly continuous


And since ,

We can choose to lower this bound as much as we please; the first integral shrinks because of the third property of good kernels, and the second integral shrinks because of the uniform continuity of

Now if , then

Proving this relies on some intuitive properties of double integrals, which is if we have a continuous function in two variables with and both of moderate decrease then (essentially calculating the same double integral in two ways)

So we can apply this to , where and

Theorem: If , then

This is a key result! How do we prove it?

Let , such that

As , the left hand side goes to and goes to , so we have

Now let
, which proves our result

We can define two mappings and by and , such that is the Fourier transform, and we’ve proven on

Since these transforms differ only by a sign in the exponential, we see , so

Therefore, the Fourier transform is a bijective mapping on the Schwartz space

To get to our final identity, we also need a few more properties,

To show is rapidly decreasing, note that any we have , from which we see that , meaning is bounded

We can show this bound also carries over to the derivatives of by proving the identity for (not trivial, but going to omit here cause I’m tired)

To prove our second property, we look at a change of variables ,

For the third property, we consider which yields and , and is our desired statement

Finally, we equip the Schwartz space with a Hermitian inner product,

We now have the tools to simply prove the Plancherel formula (the continuous analogue to Parseval’s identity)

Theorem: If then

To prove this, we define , so

We clearly have and , so our formula follows directly from the inversion formula with ,

We ultimately are able to achieve the results so far on general , whose proof relates to the fact that the Schwartz functions are a dense subset of the functions

We can also use good kernels to prove the Weierstrass approximation theorem

Theorem: Let be a continuous function on the closed and bounded interval , then for any , there exists a polynomial such that

Let denote an interval containing and let be a continuous function on that equals outside and equals in , bounded by

Since is a family of good kernels and is continuous with compact support, converges uniformly to as tends to

We choose such that

Now, since converges uniformly, we can bound for all , where

This is enough to construct our bound, since



Combined with our earlier bound, we get for and therefore for

Now does this bound prove our theorem? Because is a polynomial in the variable by definition, since and is ultimately a polynomial in