Fourier transform III - Properties of the Fourier transform

The Fourier transform (and inverse transform) enjoys a long list of very nice properties.

Linearity


Since the Fourier transform and inverse transform are both defined by definite integrals, it is straightforward to verify they inherit the usual linearity properties of integration, namely that for any pair of function f and g (for which the Fourier transform exists) we have

F(f+g)=Ff+Fg,

and for any constant c we have

F(cf)=cFf

(and similarly for the inverse transform).

For example, if f(t)=2Π(t)3Λ(t), then

(Ff)(s)=2(FΠ)(s)3(FΛ)(s)=2sinc(s)3sinc2(s).

"Signal reversal"


Observe that

(Ff)(s)=f(t)e2πit(s)dt=f(t)e2πitsdt=(F1f)(s).

Note that for the last equality we are now thinking of the inverse Fourier transform as taking in a function of t and returning a function of s. While that is opposite of our default convention, remember that our default convention is just that: a default way to name the variables for the function we start with and the transformed function. Variable names can always be changed to whatever you want, though!

Similarly,

(F1f)(t)=(Ff)(t).

Here's one way to think about what's happening. If we think of a function f(t) as a "signal", then we can define the reverse signal f by

f(t)=f(t).

Note that we are not saying inverse, but reverse. The graph of f looks like the "reverse" of the graph of f, i.e., the reflection across the y-axis. For example, the image below shows that graph of a function f(t) in red, and the graph of its reverse in blue:

signalReversal.png|900

Properties of signal reversal

You can easily verify the following properties about reversal:

  1. (f)=f
  2. f is even f=f
  3. f is odd f=f
  4. (Ff)=F1f
  5. (F1f)=Ff
  6. F(f)=F1f
  7. F(f)=(Ff)
  8. F1(f)=(F1f)

(I'll probably add in the shorts proofs of each of these properties at some point, but none are diabolical, I promise.)

Using reversal to compute some Fourier transforms

Let's assume for the moment that we do indeed have F1sinc=Π. We can now use the reversal properties to compute the (forward) Fourier transform of sinc:

Fsinc=(F1sinc)=Π=Π.

Similarly, if we assume we do indeed have F1sinc2=Λ, then we can immediately deduce

Fsinc2=(F1sinc2)=Λ=Λ.

Fourier transforms of even and odd functions

Suppose f is an even function, i.e., f=f. Then

(Ff)=F(f)=Ff,

and so Ff is also an even function. We've already seen three examples of this: the rectangle function, the triangle function and the Gaussian function are all even, and their Fourier transforms were all even, as well.

Similarly, if f is an odd function (so f=f), then

(Ff)=F(f)=F(f)=Ff,

and so Ff is also an odd function.

Conjugate symmetry for real-valued functions

Suppose f is a real-valued function (like it always is for us). You can then easily show that

(Ff)=Ff.

For example, when f(t) is our one-sided exponential decay function, we have

(Ff)(s)=11+2πis.

Sure enough, we have

(Ff)(s)=(Ff)(s)=112πis=(11+2πis)=(Ff)(s).

Example: Two-sided exponential decay

Consider the two-sided exponential decay function

g(t)=e|t|={et, for t<0et, for t0

If we let f(t) be our one-sided exponential decay function from earlier, then notice that for every value of t except t=0 we have

g(t)=f(t)+f(t).

It follows that

(Fg)(s)=(Ff)(s)+(Ff)(s)=11+2πis+(Ff)(s)=11+2πis+112πis=21+4π2s2.

Shifting and stretching


Suppose f(t) is a function with a known Fourier transform. One of the first things we learn in precalculus is how manipulating the inputs and outputs of a function affects the graph of that function. For example, we know that the curve defined by y=f(t+b) looks like the curve defined by y=f(t) shifted to the left by b units, while the curve defined by y=f(at) looks like the curve defined by y=f(t) horizontally compressed by a factor of |a| (and reflected across the y-axis if a<0.)

It turns out that we have similar knowledge about how the Fourier transform of a function is affected when we modify the input (or outputs) of the function.

Let's focus just on modifying the inputs, since the linearity of the Fourier transform makes handling adjustments to the outputs fairly easy. Suppose we f has a Fourier transform and we want to determine the Fourier transform of the related function g(t)=f(at+b), where a and b are some real constants (with a0). By definition, we have

(Fg)(s)=g(t)e2πitsdt=f(at+b)e2πitsdt.

We will make the substitution u=at+b, so that du=adt. If a>0, then the bounds remain the same and we find that

f(at+b)e2πitsdt=1af(u)e2πiubasdu=1af(u)e2πibsae2πusadu=e2πisbaaf(u)e2πiusadu.

On the other hand, if a<0, then we instead have

f(at+b)e2πitsdt=e2πisbaaf(u)e2πiusadu=e2πisbaaf(u)e2πiusadu

We can use a single formula to capture both situations if we use the absolute value function:

f(at+b)e2πitsdt=e2πisba|a|f(u)e2πiusadu

In any case, the integral on the right-hand side is exactly the Fourier transform of f, only evaluated at sa instead of at s. We have therefore proven the following:

The stretch-and-shift property of the Fourier transform

Suppose f has a Fourier transform and a,b are real numbers (with a0). Let g(t)=f(at+b). Then

(Fg)(s)=1|a|e2πisba(Ff)(sa).

Example

Consider the function graphed below:

shiftStretchRect.png|900

This looks like a shifted and stretched version of the graph of our usual rectangle function. It hasn't been altered vertically in any way, but the width of the above rectangle is 2 (whereas the width of the usual rectangle is 1) and its now centered at t=3 (whereas the usual rectangle is centered at t=0). We can now conclude that the above curve is defined by

y=Π(12(t3))=Π(12t32).

We can now immediately conclude that the Fourier transform of the function g(t)=Π(12t32) is

(Fg)(s)=e2πis321212(FΠ)(s12)=2e6πissinc(2s).

Suggested next notes


Fourier transform IV - Derivatives