Fourier Transform

If , we define its Fourier Transform for , by

Proposition

If , then: (i) is the Fourier transform of wherever (ii) is the Fourier transform of wherever (iii) is the Fourier transform of wherever (iv) is the Fourier transform of (v) is the Fourier transform of .

Proof (i) and (ii) directly follow from definitions. For (iii) similarly For (iv), through integration by parts, so letting goes to infinity, we get desired relation.

For (v), we want to show that the derivative of is , let and consider

Since and are of rapid decrease, there exists an integer so that and . Moreover, for , , so , then there exists so that implies

Hence for we have

Theorem

If , then .

The proof is an easy application of the fact that the Fourier transform interchanges differentiation and multiplication. In fact, note that if , its Fourier transform is bounded; then also, for each pair of non-negative integers and , the expression is bounded, since by the last proposition, so it is the Fourier transform of With , we get , so the Fourier transform is bounded, thus we get .