Properties of Fourier Transform
📂Fourier AnalysisProperties of Fourier Transform
Theorem[^1]
Let’s consider Ff,f^ as the Fourier transform of f. Let f∈L1. Then, the following properties hold for the Fourier transform:
- (a) For any real number a,
F[f(x−a)](ξ)=e−iaξf^(ξ)andF[eiaxf(x)](ξ)=f^(ξ−a)
- (b) Define fδ(x):=δ1f(δx) for δ>0. Then,
F[fδ](ξ)=(Ff)(δξ)andF[f(δx)](ξ)=(Ff)δ(ξ)
F[f′](ξ)=iξFf(ξ)
Meanwhile, if xf(x) is integrable,
F[xf(x)](ξ)=i(Ff)′(ξ)
- (d) If g∈L1,
F[f∗g](ξ)=f^(ξ)g^(ξ)
Here, f∗g is the convolution of f and g.
- (d’) For {fn}⊂L1,
F[f1∗f2∗⋯∗fn]=f1^f2^⋯fn^
Explanation
(a) This means the operations of translation and multiplication by an exponential function switch under the transformation. Translating and then transforming multiplies by an exponential function, and multiplying by an exponential function and then transforming results in translation. (b) Similarly, multiplying the variable by δ and taking the operation of δ on the function switch under the transformation. (c) The derivative’s Fourier transform is the same as multiplying the Fourier transform by a constant iξ.
Proof
(a)
F[f(x−a)](ξ)=∫f(x−a)e−iξxdx=∫f(y)e−iξ(y+a)dy=e−iaξ∫f(y)e−iξydy=e−iaξf^(ξ)
The second equality holds by substitution with x−a=y.
F[eiaxf(x)](ξ)=∫f(x)e−iξxeiaxdx=∫f(x)e−i(ξ−a)xdx=f^(ξ−a)
The third equality follows from the definition of the Fourier transform.
■
(b)
Similarly to (a), it can be easily proved.
F[fδ](ξ)=∫fδ(x)e−iξxdx=∫δ1f(δx)e−iξxdx=∫f(y)e−i(δξ)ydy=f^(δξ)
The second equality holds by substitution with δx=y.
F[f(δx)](ξ)=∫f(δx)e−iξxdx=δ1∫f(y)e−i(ξ/δ)ydy=δ1f^(ξ/δ)=f^δ(ξ)=(Ff)δ(ξ)
The third equality holds by substitution with δx=y.
■
(c)
First,
∫0∞f′(x)dx=t→∞lim∫0tf′(x)dt=t→∞limf(t)−f(0)
and since f′∈L1, ∫f′(x)dx exists, and therefore t→∞limf(t) exists. By assumption, because f∈L1, its value is 0. This is the same even when t→−∞limf(t), so
x→±∞limf(x)=0
Therefore,
F[f′](ξ)=∫f′(x)e−iξxdx=[e−iξxf(x)]−∞∞+iξ∫f(x)e−iξxdx=iξ∫f(x)e−iξxdx=iξf^(ξ)
The second equality follows from partial integration. The third equality holds by (eq1).
F[xf(x)](ξ)=∫xf(x)e−iξxdx=idξd∫f(x)e−iξxdx=idξdFf(ξ)=i(Ff)′(ξ)
■
(d)
Considering the general definition of convolution, (d) is in fact a definition rather than a property.
F[f∗g](ξ)=∫(f∗g)(x)e−iξxdx=∫[∫f(x−y)g(y)dy]e−iξxdx=∫[∫f(x−y)g(y)dy]e−iξ(x−y)e−iξydx=∫∫f(x−y)g(y)e−iξ(x−y)e−iξydydx=∫∫f(x−y)g(y)e−iξ(x−y)e−iξydxdy=∫[∫f(x−y)e−iξ(x−y)dx]g(y)e−iξydy=∫[∫f(z)e−iξzdz]g(y)e−iξydy=∫f^(ξ)g(y)e−iξydy=f^(ξ)∫g(y)e−iξydy=f^(ξ)g^(ξ)
The seventh equality holds by substitution with x−y=z.
■
(d')
Since convolution is associative, it immediately follows from (d).
■