Brief discussion about Fourier transform

Brief discussion about Fourier transform

This is a blog discussing a brief discussion about Fourier transform.

Let us consider real- or complex-valued functions $\color{black}{f(\mathbf{x})}$, where $\color{black}{\mathbf{x}\in \mathbb{R}^d}$. The Fourier transform maps functions $\color{black}{f(\mathbf{x})}$ on spatial domain to Fourier domain $\color{black}{\hat{f}(\mathbf{w})}$, which is defined by

Its inverse Fourier transform is

where $\color{black}{\mathbf{w}\cdot\mathbf{x}}$ is the inner product between the spatial variables $\color{black}{\mathbf{x}}$ and its dual $\color{black}{\mathbf{w}}$.

Here are the several beautiful properties of Fourier transform:

1. Fourier inversion theorem:

Fourier inversion theorem says that for many types of functions it is possible to recover a function from its Fourier transform. Intuitively it may be viewed as the statement that if we know all frequency and phase information about a wave then we may reconstruct the original wave precisely.

2. Differentiation:

The differentiation property implies that to take a differentiation in the spatial domain is equivalent to simply multiply by $\color{black}{i\mathbf{w}}$ in Fourier domain. Here gives the proof:

First let us apply Fourier inversion theorem and rewrite

Keeping in mind that only $\color{black}{\mathrm{exp({i\mathbf{w}\cdot\mathbf{x}})}}$ in the equation above depends on $\color{black}{\mathbf{x}}$, we take a differentiation corresponding to $\color{black}{\mathbf{x}}$,

Therefore, by applying Fourier transform on both sides and taking use of Fourier inversion theorem, we obtain $\color{black}{\mathfrak{F} [\partial_{\mathbf{x}}f]=i\mathbf{w}\mathfrak{F}[f]}$. Furthormore, this property can be generalized to $\color{black}{n^{th}}$ order of differentiation as $\color{black}{\mathfrak{F} [\partial^n_{\mathbf{x}}f]=(i\mathbf{w})^n\mathfrak{F}[f]}$. This becomes especially of help when high order differentiation needs to be calculated, thanks to the fact that Fast Fourier transform (FFT) only takes linearithmic time $\color{black}{O(nlogn)}$ for data with size of

3. Convolution theorem:

The convolution theorem states that the Fourier transform of a convolution is the pointwise product of Fourier transforms. In other words, convolution in the spatial domain equals point-wise multiplication in frequency domain. Proof is provided as following:

Let us consider a convolution

Its Fourier transform reads

Let $\color{black}{\mathbf{z = x - y}}$ and incidentally $\color{black}{d\mathbf{z} = d\mathbf{x}}$,

It is worthy mentioning that this is a very useful property of Fourier transform, particularly when proving central limit theorem for random variables that are independent. More applications will be covered in later posts.

4. Scaling:

By using change of variable, it should not be hard to derive the scaling property of Fourier transform. Despite its simplicity, this property has profound significance when it is related to probability theory. It suggests that if the data has a large variance, i.e. strong dislocation in space, then it has high location in frequency domain and vice versa. It is noted that this is a specific representation of Heisenberg’s uncertainty principle.

Spoiler:

In next post, the relation between Fourier transform and characteristic function will be discussed. In particular, the characteristic function of normal distribution will be derived. See you next time.