280 CHAPTER 11. FUNDAMENTAL TRANSFORMS

It remains to consider the case where f has polynomial growth. Thus x→ f (x)e−|x|2∈

L1 (Rn) . Therefore, for all ψ ∈ G ,

0 =∫

f (x)e−|x|2ψ (x)dx

because e−|x|2ψ (x) ∈ G . Therefore, by the first part, f (x)e−|x|

2= 0 a.e. ■

Note that “polynomial growth” could be replaced with a condition of the form

| f (x)| ≤ K(

1+ |x|2)m

ek|x|α , α < 2

and the same proof would yield that these functions are in G ∗. The main thing to observeis that almost all functions of interest are in G ∗.

Theorem 11.6.9 Let f be a measurable function with polynomial growth,

| f (x)| ≤C(

1+ |x|2)N

for some N,

or let f ∈ Lp (Rn) for some p ∈ [1,∞]. Then f ∈ G ∗ if f (φ)≡∫

f φdx.

Proof: Let f have polynomial growth first. Then the above integral is clearly welldefined and so in this case, f ∈ G ∗.

Next suppose f ∈ Lp (Rn) with ∞ > p≥ 1. Then it is clear again that the above integralis well defined because of the fact that φ is a sum of polynomials times exponentials of theform e−c|x|2 and these are in Lp′ (Rn). Also φ → f (φ) is clearly linear in both cases. ■

This has shown that for nearly any reasonable function, you can define its Fourier trans-form as described above. You could also define the Fourier transform of a finite Borel mea-sure µ because for such a measure ψ→

∫Rn ψdµ is a linear functional on G . This includes

the very important case of probability distribution measures.

11.6.2 Fourier Transforms of Functions In L1 (Rn)

First suppose f ∈ L1 (Rn) . As mentioned, you can think of it as being in G ∗ and so onecan take its Fourier transform as described above. However, since it is in L1 (Rn) , there isa natural way to define its Fourier transform. Do the two give the same thing?

Theorem 11.6.10 Let f ∈ L1 (Rn) . Then F f (φ) =∫Rn gφdt where

g(t) =(

12π

)n/2 ∫Rn

e−it·x f (x)dx

and F−1 f (φ) =∫Rn gφdt where g(t) =

( 12π

)n/2 ∫Rn eit·x f (x)dx. In short,

F f (t)≡ (2π)−n/2∫Rn

e−it·x f (x)dx,

F−1 f (t)≡ (2π)−n/2∫Rn

eit·x f (x)dx.

280 CHAPTER 11. FUNDAMENTAL TRANSFORMSIt remains to consider the case where f has polynomial growth. Thus x — f (x) et €L' (R"). Therefore, for all we Y,0= [Foe wixjasbecause e~/*!” w(x) € GY. Therefore, by the first part, f (x) es! =Oae.Note that “polynomial growth” could be replaced with a condition of the formIf | <K(1+)xP) "et <2and the same proof would yield that these functions are in Y*. The main thing to observeis that almost all functions of interest are in Y*.Theorem 11.6.9 Lez f be a measurable function with polynomial growth,\NLf (x)| < c( + |x| ) for some N,or let f € L? (IR") for some p € [1,]. Then f « Y* if f (0) = f fodx.Proof: Let f have polynomial growth first. Then the above integral is clearly welldefined and so in this case, f € Y*.Next suppose f € L? (IR") with co > p > 1. Then it is clear again that the above integralis well defined because of the fact that @ is a sum of polynomials times exponentials of theform e~¢*!” and these are in L?” (R”). Also @ + f (@) is clearly linear in both cases. llThis has shown that for nearly any reasonable function, you can define its Fourier trans-form as described above. You could also define the Fourier transform of a finite Borel mea-sure [t because for such a measure Y + fn Wdu is a linear functional on Y. This includesthe very important case of probability distribution measures.11.6.2 Fourier Transforms of Functions In L! (R”)First suppose f € L' (IR"). As mentioned, you can think of it as being in Y* and so onecan take its Fourier transform as described above. However, since it is in L! (IR”), there isa natural way to define its Fourier transform. Do the two give the same thing?Theorem 11.6.10 Let f € L' (R"). Then Ff (¢) = fen godt wherec= ($Y Lem rooarand F~' f () = fin gddt where g(t) = (3) Jian et* f (x) dx. In short,PA) = 2m"? | eM f(wadx,nF-| f(t) = 2a)" [ olf F(x) dx.n