Jump to content

Partial Differential Equations/The Fourier transform

From Wikibooks, open books for an open world
Partial Differential Equations
 ← The heat equation The Fourier transform The wave equation → 

In this chapter, we introduce the Fourier transform. The Fourier transform transforms functions into other functions. It can be used to solve certain types of linear differential equations.

Definition and calculation rules

[edit | edit source]

Definition 8.1:

Let f∈L1(ℝd). Then the Fourier transform of f is defined as follows:

f̂:ℝd→ℝ,f̂(y):=∫ℝdf(x)e−2πix⋅ydx

We recall that f is integrable ⇔ |f| is integrable.

Now we're ready to prove the next theorem:

Theorem 8.2: The Fourier transform of an integrable f is well-defined.

Proof: Since f is integrable, lemma 8.2 tells us that |f| is integrable. But

∀x,y∈ℝd:|f(x)e−2πix⋅y|=|f(x)|⋅|e−2πix⋅y|⏞=1=|f(x)|

, and therefore x↦|f(x)e−2πix⋅y| is integrable. But then, x↦f(x)e−2πix⋅y is integrable, which is why

∫ℝdf(x)e−2πix⋅ydx=f̂(y)

has a unique complex value, by definition of integrability.◻

Theorem 8.3: Let f∈L1(ℝd). Then the Fourier transform of f, f̂, is bounded.

Proof:

|∫ℝdf(x)e−2πix⋅ydx|≤∫ℝd|f(x)e−2πix⋅y|dxtriangle ineq. for the ∫=∫ℝd|f(x)|dx|e−2πix⋅y|=1∈ℝf∈L1(ℝd)◻

Once we have calculated the Fourier transform f~ of a function f, we can easily find the Fourier transforms of some functions similar to f. The following calculation rules show examples how you can do this. But just before we state the calculation rules, we recall a definition from chapter 2, namely the power of a vector to a multiindex, because it is needed in the last calculation rule.

Definition 2.6:

For a vector x=(x1,…,xd)∈ℝd and a d-dimensional multiindex α∈ℕ0d we define xα, x to the power of α, as follows:

xα:=x1α1⋯xdαd

Now we write down the calculation rules, using the following notation:

Notation 8.4:

We write

f(x)→g(y)

to mean the sentence 'the function y↦g(y) is the Fourier transform of the function x↦f(x)'.

Theorem 8.5:

Let f̂ be the Fourier transform of f∈L1(ℝd). Then the following calculation rules hold:

  1. f(x)e−2πih⋅x→f̂(y+h) for arbitrary h∈ℝd
  2. f(x+h)→f̂(y)e2πih⋅y for arbitrary h∈ℝd
  3. f(δx)→δ−df̂(δ−1y) for arbitrary δ>0

If additionally ĝ is the Fourier transform of g∈L1(ℝd), we have

4. ∫ℝdĝ(x)f(x)dx=∫ℝdg(y)f̂(y)dy

Proof: To prove the first rule, we only need one of the rules for the exponential function (and the symmetry of the standard dot product):

1.

f(x)e−2πih⋅x→∫ℝdf(x)e−2πih⋅xe−2πix⋅ydx=∫ℝdf(x)e−2πix⋅(y+h)dx=f̂(y+h)

For the next two rules, we apply the general integration by substitution rule, using the diffeomorphisms x↦x−h and x↦δ−1x, which are bijections from ℝd to itself.

2.

f(x+h)→∫ℝdf(x+h)e−2πix⋅ydx=∫ℝdf(x)e−2πi(x−h)⋅ydx=e2πih⋅y∫ℝdf(x)e−2πix⋅ydx=f̂(y)e2πih⋅y

3.

f(δx)→∫ℝdf(δx)e−2πix⋅ydx=∫ℝdδ−df(x)e−2πi(δ−1x)⋅ydx=δ−d∫ℝdf(x)e−2πix⋅(δ−1y)dx=δ−df̂(δ−1y)

4.

∫ℝdĝ(x)f(x)dx=∫ℝd∫ℝdg(y)e2πix⋅ydyf(x)dxDef. of the Fourier transform=∫ℝd∫ℝdf(x)g(y)e2πix⋅ydydxputting a constant inside the integral=∫ℝd∫ℝdf(x)g(y)e2πix⋅ydxdyFubini=∫ℝdg(y)∫ℝdf(x)e2πix⋅ydxdypulling a constant out of the integral=∫ℝdg(y)f̂(y)dyDef. of the Fourier transform

◻

The Fourier transform of Schwartz functions

[edit | edit source]

In order to proceed with further rules for the Fourier transform which involve Schwartz functions, we first need some further properties of Schwartz functions.

Theorem 8.6:

Let ϕ:ℝd→ℝ be a Schwartz function and let α,β∈ℕ0d. Then the function

x↦xα∂βϕ(x)

is a Schwartz function as well.

Proof:

Let ϱ,ς∈ℕ0d. Due to the general product rule, we have:

∂ςxα∂βϕ(x)=∑ε∈ℕ0dε≤ς(ςε)∂ε(xα)∂ς−ε∂βϕ(x)

We note that for all α and ε, ∂ε(xα) equals to x to some multiindex power. Since ϕ is a Schwartz function, there exist constants cε such that:

‖xϱ∂ε(xα)∂ς−ε∂βϕ‖∞≤cε

Hence, the triangle inequality for ‖⋅‖∞ implies:

‖xϱ∂ςxα∂βϕ‖∞≤∑ε∈ℕ0dε≤ς(ςε)cε◻

Theorem 8.7:

Every Schwartz function is integrable.

Proof:

We use that if the absolute value of a function is almost everywhere smaller than the value of an integrable function, then the first function is integrable.

Let ϕ be a Schwartz function. Then there exist b,c∈ℝ>0 such that for all x∈ℝd:

|ϕ(x)|≤min⁡{b∏j=1d|xj|−2,c}

The latter function is integrable, and integrability of ϕ follows.◻

Now we can prove all three of the following rules for the Fourier transform involving Schwartz functions.

Theorem 8.8:

If ϕ̂ is the Fourier transform of a function ϕ in the Schwartz space 𝒮(ℝd), in addition to the rules in theorem 8.4, also the following rules hold:

  1. ∂αϕ(x)→(2πiy)αϕ̂(y) for arbitrary α∈ℕ0d
  2. (−2πix)αϕ(x)→∂αϕ̂(y) for arbitrary α∈ℕ0d

If additionally θ̂ is the Fourier transform of a θ∈𝒮(ℝd), then

3. ϕ∗θ^(y)=ϕ̂(y)⋅θ̂(y)

Proof:

1.

For the first rule, we use induction over |α|.

It is clear that the claim is true for |α|=0 (then the rule states that the Fourier transform of ϕ is the Fourier transform of ϕ).

We proceed to the induction step: Let n∈ℕ0, and assume that the claim is true for all α∈ℕ0d such that |α|=n. Let β∈ℕ0d such that |β|=n+1. We show that the claim is also true for β.

Remember that we have ∂βϕ:=∂x1β1⋯∂xdβdϕ. We choose k∈{1,…,d} such that βk>0 (this is possible since otherwise |β|=0), define

ek:=(0,…,0,1⏞kth entry,0,…,0)
α:=β−ek

and obtain

∂βϕ=∂xk∂αϕ

by Schwarz' theorem, which implies that one may interchange the order of partial derivation arbitrarily.

Let R∈ℝ>0 be an arbitrary positive real number. From Fubini's theorem and integration by parts, we obtain:

∫[−R,R]d∂xk∂αϕ(x)e−2πix⋅ydx=∫[−R,R]d−1∫−RR∂xk∂αϕ(x)e−2πix⋅ydxkd(x1,…,xk−1,xk+1,…,xd)=∫[−R,R]d−1((∂αϕ(x)e−2πix⋅y)|xk=−Rxk=R−∫−RR∂αϕ(x)(−2πiyk)e−2πix⋅ydxk)d(x1,…,xk−1,xk+1,…,xd)

Due to the dominated convergence theorem (with dominating function x↦∂xk∂αϕ(x)), the integral on the left hand side of this equation converges to

∫ℝd∂xk∂αϕ(x)e−2πix⋅ydx

as R→∞. Further, since ϕ is a Schwartz function, there are b,c∈ℝ>0 such that:

|∂αϕ(x)|<min⁡{b∏j=1j≠kd|xj|−2,c}

Hence, the function within the large parentheses in the right hand sinde of the last line of the last equation is dominated by the L1(ℝd−1) function

(x1,…,xk−1,xk+1,…,xd)↦min⁡{b∏j=1j≠kd|xj|−2,c}+∫−∞∞|∂αϕ(x)(−2πiyk)|dxk

and hence, by the dominated convergence theorem, the integral over that function converges, as R→∞, to:

∫ℝd−1(∫−∞∞∂αϕ(x)(2πiyk)e−2πix⋅ydxk)d(x1,…,xk−1,xk+1,…,xd)=∫ℝd∂αϕ(x)(2πiyk)e−2πix⋅ydxFubini=∫ℝd(2πiyβ)ϕ(x)e−2πix⋅ydxinduction hypothesis

From the uniqueness of limits of real sequences we obtain 1.

2.

We use again induction on |α|, note that the claim is trivially true for |α|=0, assume that the claim is true for all α∈ℕ0d such that |α|=n, choose β∈ℕ0d such that |β|=n+1 and k∈{1,…,d} such that βk>0 and define α:=β−ek.

Theorems 8.6 and 8.7 imply that

  • for all y∈ℝd, ∫ℝd|ϕ(x)e−2πix⋅y|dx<∞ and
  • for all y∈ℝd, ∫ℝd|ϕ(x)∂yke−2πix⋅y|dx<∞.

Further,

  • ∂yk(ϕ(x)e−2πix⋅y) exists for all (x,y)∈ℝd×ℝd.

Hence, Leibniz' integral rule implies:

∂βϕ̂(y)=∂xk∂αϕ̂(y)=∂yk∫ℝd(2πix)αϕ(x)e−2πix⋅ydxinduction hypothesis=∫ℝd∂yk(2πix)αϕ(x)e−2πix⋅ydx=∫ℝd(2πix)βϕ(x)e−2πix⋅ydx

3.

ϕ∗θ^(y):=∫ℝd(ϕ∗θ)(x)e−2πix⋅ydxDef. of Fourier transform:=∫ℝd∫ℝdϕ(z)θ(x−z)dze−2πix⋅ydxDef. of convolution=∫ℝd∫ℝde−2πix⋅yϕ(z)θ(x−z)dzdxlinearity of the integral=∫ℝd∫ℝde−2πix⋅yϕ(z)θ(x−z)dxdzFubini=∫ℝd∫ℝde−2πix⋅ye−2πiz⋅yϕ(z)θ(x)dxdzIntegration by substitution using x↦x+z and ∀b,c∈ℝ:eb+c=ebec=∫ℝd∫ℝde−2πix⋅yθ(x)dx⏞=θ̂(y)ϕ(z)e−2πiz⋅ydzpulling a constant out of the integral=θ̂(y)∫ℝdϕ(z)e−2πiz⋅ydz⏞=ϕ̂(y)pulling a constant out of the integral◻

Theorem 8.9:

Let ϕ∈𝒮(ℝd), and let ϕ̂ be the Fourier transform of ϕ. Then ϕ̂∈𝒮(ℝd).

Proof:

Let α,β∈ℕ0d be two arbitrary d-dimensional multiindices, and let ϕ∈𝒮(ℝd). By theorem 8.6 ∂α((−2πix)βϕ) is a Schwartz function as well. Theorem 8.8 implies:

xα∂βϕ̂=∂α((−2πix)βϕ)^

By theorem 8.3, ∂α((−2πix)βϕ)^ is bounded. Since α,β∈ℕ0d were arbitrary, this shows that ϕ̂∈𝒮(ℝd).◻

Definitions 8.10:

We define the Fourier transform on the Schwartz space to be the function

ℱ:𝒮(ℝd)→𝒮(ℝd),ℱ(ϕ):=ϕ̂.

Theorem 8.9 assures that this function really maps to 𝒮(ℝd). Furthermore, we define the inverse Fourier transform on the Schwartz space to be the function

ℱ−1:𝒮(ℝd)→𝒮(ℝd),ℱ(ϕ):=x↦∫ℝdϕ(y)e2πix⋅ydy.

This function maps to 𝒮(ℝd) since ℱ−1(ϕ)(x)=ϕ̂(−x).

Both the Fourier transform and the inverse Fourier transform are sequentially continuous:

Theorem 8.11:

Let ϕ∈𝒮(ℝd) and let (ϕl)l∈ℕ be a sequence of Schwartz functions such that ϕl→ϕ,l→∞. Then ℱ(ϕl)→ℱ(ϕ),l→∞ and ℱ−1(ϕl)→ℱ−1(ϕ),l→∞, both in the sense of Schwartz function convergence as defined in definition 3.11.

Proof:

1. We prove ℱ(ϕl)→ℱ(ϕ),l→∞.

Let α,β∈ℕ0d. Due to theorem 8.8 1. and 2. and the linearity of derivatives, integrals and multiplication, we have

xα∂β(ℱ(ϕl)(x)−ℱ(ϕ)(x))=∫ℝd∂α((−2πiy)β(ϕl(y)−ϕ(y)))e−2πix⋅ydy.

As in the proof of theorem 8.3, we hence obtain

|xα∂β(ℱ(ϕl)(x)−ℱ(ϕ)(x))|≤‖∂α((−2πix)β(ϕl−ϕ)))‖L1.

Due to the multi-dimensional product rule,

∂α((−2πix)β(ϕl(x)−ϕ(x)))=∑ς∈ℕ0dς≤α(ςα)∂ς((−2πix)β)∂α−ς(ϕl(x)−ϕ(x)).

Let now ϵ>0 be arbitrary. Since ϕl→ϕ as defined in definition 3.11, for each n∈{1,…,d} we may choose N1∈ℕ such that

∀k≥N1:∑ς∈ℕ0dς≤α(ςα)‖xn2∂ς((−2πix)β)∂α−ς(ϕl(x)−ϕ(x))‖∞<ϵ.

Further, we may choose N2∈ℕ such that

∀k≥N2:∑ς∈ℕ0dς≤α(ςα)‖∂ς((−2πix)β)∂α−ς(ϕl(x)−ϕ(x))‖∞<ϵ.

Hence follows for k≥N:=max⁡{N1,N2}:

‖∂α((−2πix)β(ϕl−ϕ)))‖L1:=∫ℝd|∂α((−2πix)β(ϕl(x)−ϕ(x)))|dx≤∫ℝdϵmin⁡{x1−2,…,xd−2,1}dx=ϵ∫ℝdmin⁡{x1−2,…,xd−2,1}dx

Since ϵ>0 was arbitrary, we obtain ℱ(ϕl)→ℱ(ϕ),l→∞.

2. From 1., we deduce ℱ−1(ϕl)→ℱ−1(ϕ),l→∞.

If ϕl→ϕ in the sense of Schwartz functions, then also θl→θ in the sense of Schwartz functions, where we define

θl(x):=ϕl(−x) and θ(x):=ϕ(−x).

Therefore, by 1. and integration by substitution using the diffeomorphism x↦−x, ℱ−1(ϕl)=ℱ(θl)→ℱ(θ)=ℱ−1(ϕ).◻

In the next theorem, we prove that ℱ−1 is the inverse function of the Fourier transform. But for the proof of that theorem (which will be a bit long, and hence to read it will be a very good exercise), we need another two lemmas:

Lemma 8.12:

If we define the function

G:ℝd→ℝ,G(x):=e−π‖x‖2,

then ℱ(G)=G and ℱ−1(G)=G.

Proof:

1. ℱ−1(G)=G:

We define

μ:ℝd→ℝ,μ(ξ):=eπ‖ξ‖2Ĝ(ξ).

By the product rule, we have for all n∈{1,…,d}

∂ξnμ(ξ)=2πξneπ‖ξ‖2Ĝ(ξ)+eπ‖ξ‖2∂ξnĜ(ξ).

Due to 1. of theorem 8.8, we have

2πξnĜ(ξ)=−i∂xnG^(ξ)=−i∫ℝd(2πxn)e−π‖x‖2e2πiξ⋅xdx;

from 2. of theorem 8.8 we further obtain

∂ξnĜ(ξ)=∫ℝd(−2πixn)e−π‖x‖2e2πiξ⋅xdx.

Hence, μ is constant. Further,

μ(0)=∫ℝde−π‖x‖2dx=∫ℝd12πde−‖x‖2/2dxsubstitution using x↦12πdx=1lemma 6.2.

2. ℱ−1(G)=G:

By substitution using the diffeomorphism x↦−x,

∀x∈ℝd:ℱ−1(G)(x)=ℱ(G)(x)=G(x).◻

For the next lemma, we need example 3.4 again, which is why we restate it:

Example 3.4: The standard mollifier η, given by

η:ℝd→ℝ,η(x)=1c{e−11−‖x‖2 if ‖x‖2<10 if ‖x‖2≥1

, where c:=∫B1(0)e−11−‖x‖2dx, is a bump function (see exercise 3.2).

Lemma 8.13:

Let ϕ∈𝒮(ℝd), and for each n∈ℕ define ϕn(x):=η(x/n)ϕ(x). Then ϕn→ϕ,n→∞ in the sense of Schwartz functions.

Proof:

Let α,β∈ℕ0d be arbitrary. Due to the generalised product rule,

∂β(ϕn−ϕ)=∑ς∈ℕ0dς≤β(βς)1n|β−ς|∂β−ςη(x/n)∂ςϕ(x)−∂βϕ(x).

By the triangle inequality, we may hence deduce

|xα∂β(ϕn−ϕ)|≤1n∑ς∈ℕ0dς<β(βς)1n|β−ς|−1|xα∂ςϕ(x)||∂β−ςη(x/n)|+|xα∂βϕ(x)||1−η(x/n)|.

Since both ϕ and η are Schwartz functions (see exercise 3.2 and theorem 3.9), for each ϱ∈ℕ0d we may choose bϱ,cϱ∈ℝ such that

‖∂β−ϱη‖∞<bϱ and ‖xα∂ϱϕ‖∞<cϱ.

Further, for each k∈{1,…,d}, we may choose ck∈ℝd such that

‖xkxα∂βϕ‖∞<ck.

Let now ϵ>0 be arbitrary. We choose N1∈ℕ such that for all n≥N1

1n∑ς∈ℕ0dς<β(βς)1n|β−ς|−1bςcς<ϵ/2.

Further, we choose R∈ℝ>0 such that

‖x‖>R⇒|xα∂βϕ(x)|<ϵ/2.

This is possible since

|xα∂βϕ(x)|≤min⁡{c1|x1|,…,cd|xd|}

due to our choice of c1,…,cd.

Then we choose N2∈ℕ such that for all n≥N2

∀x∈BR(0):|1−ϕ(x/n)|<1/cβ.

Inserting all this in the above equation gives |xα∂β(ϕn−ϕ)|<ϵ for n≥N:=max⁡{N1,N2}. Since α, β and ϵ were arbitrary, this proves ϕn→ϕ in the sense of Schwartz functions.◻

Theorem 8.14:

Let ϕ∈𝒮(ℝd). Then ℱ(ℱ−1(ϕ))=ϕ and ℱ−1(ℱ(ϕ))=ϕ.

Proof:

1. We prove that if ϕ is a Schwartz function vanishing at the origin (i. e. ϕ(0)=0), then ℱ−1(ℱ(ϕ))(0)=0.

So let ϕ be a Schwartz function vanishing at the origin. By the fundamental theorem of calculus, the multi-dimensional chain rule and the linearity of the integral, we have

ϕ(x)=ϕ(x)−ϕ(0)=∫01ddtϕ(tx)dx=∑j=1dxj∫01∂xjϕ(tx)dt.

Defining ϕn(x):=η(x/n)ϕ(x),

θj,n(x):=η(x/n)∫01∂xjϕ(tx)dt,

and multiplying both sides of the above equation by η(x/n), we obtain

ϕn(x)=∑j=1dxjθj,n(x).

Since by repeated application of Leibniz' integral rule for all α∈ℕ0d

∂αθj,n(x)=∑ς≤α(ας)1n|ς|∂ςη(x/n)∫01∂α−ς∂xjϕ(tx)dt,

all the θj,n are bump functions (due to theorem 4.15 and exercise 3.?), and hence Schwartz functions (theorem 3.9). Hence, by theorem 8.8 and the linearity of the Fourier transform (which follows from the linearity of the integral),

ℱ(ϕn)(y)=∑j=1dℱ(xjθj,n)(y)=1−2πi∑j=1d∂yjℱ(θj,n)(y).

Hence,

ℱ−1(ℱ(ϕn))(0)=∫ℝdℱ(ϕn)(y)e−2πi0⋅y⏞=1dy=1−2πi∑j=1d∫ℝd∂yjℱ(θj,n)(y)dy.

Let k∈{1,…,d}. By Fubini's theorem, the fundamental theorem of calculus and since θk,n is a bump function, we have

∫ℝd∂ykℱ(θk,n)(y)dy=∫ℝd−1∫−∞∞∂ykℱ(θk,n)(y)dykd(y1,…,yk−1,yk+1,…,yd)=0.

If we let n→∞, theorem 8.11 and lemma 8.13 give the claim.

2. We deduce from 1. that if ϕ is an arbitrary Schwartz function, then ℱ−1(ℱ(ϕ))(0)=ϕ(0).

As in lemma 8.12, we define

G:ℝd→ℝ,G(x):=e−π‖x‖2.

Let now ϕ be any Schwartz function. Then ϕ−ϕ(0)G is also a Schwartz function (see exercise 3.?). Further, since G(0)=1, it vanishes at the origin. Hence, by 1.,

ℱ−1(ℱ(ϕ−ϕ(0)G))(0)=0.

Further, due to lemma 8.12 and the linearity of the Fourier transform,

0=ℱ−1(ℱ(ϕ−ϕ(0)G))(0)=ℱ−1(ℱ(ϕ))−ϕ(0)G(0).

3. We deduce from 2. that if ϕ is a Schwartz function and x∈ℝd is arbitrary, then ℱ−1(ℱ(ϕ))(x)=ϕ(x) (i. e. ℱ−1(ℱ(ϕ))=ϕ.

Let ϕ∈𝒮(ℝd) and x∈ℝd be arbitrary. Due to the definition of ℱ−1,

ℱ−1(ℱ(ϕ))(x)=∫ℝdℱ(ϕ)(y)e2πix⋅ydy.

Further, if we define θ(z):=ϕ(z+x),

ℱ(ϕ)(y)e2πix⋅y=∫ℝdϕ(z)e−2πiz⋅ye2πix⋅ydz=∫ℝdθ(z)dze−2πiz⋅y=ℱ(θ)(y).

Hence, by 2.,

ℱ−1(ℱ(ϕ))(x)=∫ℝdℱ(θ)(y)dy=ℱ−1(ℱ(θ))(0)=θ(0)=ϕ(x).

4. We deduce from 3. that for any Schwartz function ϕ we have ℱ(ℱ−1(ϕ))=ϕ.

Let ϕ∈𝒮(ℝd) and x∈ℝd be arbitrary. Then we have

ℱ(ℱ−1(ϕ))(y)=ℱ−1(ℱ−1(ϕ))(−y)=∫ℝdℱ−1(ϕ)(x)e−2πix⋅ydx=∫ℝdℱ(ϕ)(−x)e−2πix⋅ydx=ℱ−1(ℱ(ϕ))(y)=ϕ(y).◻

The Fourier transform of tempered distributions

[edit | edit source]

Definition 8.15:

Let 𝒯 be a tempered distribution. We define

ℱ(𝒯)(ϕ):=𝒯(ℱ(ϕ)).

Theorem 8.16:

ℱ(𝒯) is a tempered distribution.

Proof:

1. Sequential continuity follows from the sequential continuity of 𝒯 and ℱ (theorem 8.11) and that the composition of two sequentially continuous functions is sequentially continuous again.

2. Linearity follows from the linearity of 𝒯 and ℱ and that the composition of two linear functions is linear again.◻

Definition 8.17:

Let 𝒯 be a tempered distribution. We define

ℱ−1(𝒯)(ϕ):=𝒯(ℱ−1(ϕ)).

Exercises

[edit | edit source]

Sources

[edit | edit source]
  • Stein, Elias M.; Shakarchi, Rami (2003). Fourier Analysis: An Introduction. Analysis courses 2000/2001. Princeton University Press. ISBN 000-0-000-00000-0. {{cite book}}: Check |isbn= value: invalid prefix (help)
  • Jerry Shurman (2008), Fourier inversion (PDF)
Partial Differential Equations
 ← The heat equation The Fourier transform The wave equation →