Partial Differential Equations/The Fourier transform

From testwiki
Jump to navigation Jump to search

Template:Navigation

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

Template:TextBox

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,yd:|f(x)e2πixy|=|f(x)||e2πixy|=1=|f(x)|

, and therefore x|f(x)e2πixy| is integrable. But then, xf(x)e2πixy is integrable, which is why

df(x)e2πixydx=f^(y)

has a unique complex value, by definition of integrability.

Theorem 8.3: Let fL1(d). Then the Fourier transform of f, f^, is bounded.

Proof:

|df(x)e2πixydx|d|f(x)e2πixy|dxtriangle ineq. for the =d|f(x)|dx|e2πixy|=1fL1(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α1xdα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 yg(y) is the Fourier transform of the function xf(x)'.

Template:TextBox

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)e2πihxdf(x)e2πihxe2πixydx=df(x)e2πix(y+h)dx=f^(y+h)

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

2.

f(x+h)df(x+h)e2πixydx=df(x)e2πi(xh)ydx=e2πihydf(x)e2πixydx=f^(y)e2πihy

3.

f(δx)df(δx)e2πixydx=dδdf(x)e2πi(δ1x)ydx=δddf(x)e2πix(δ1y)dx=δdf^(δ1y)

4.

dg^(x)f(x)dx=ddg(y)e2πixydyf(x)dxDef. of the Fourier transform=ddf(x)g(y)e2πixydydxputting a constant inside the integral=ddf(x)g(y)e2πixydxdyFubini=dg(y)df(x)e2πixydxdypulling a constant out of the integral=dg(y)f^(y)dyDef. of the Fourier transform

The Fourier transform of Schwartz functions

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

Template:TextBox

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ε

Template:TextBox

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 xd:

|ϕ(x)|min{bj=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.

Template:TextBox

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 n0, 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β1xdβdϕ. We choose k{1,,d} such that βk>0 (this is possible since otherwise |β|=0), define

ek:=(0,,0,1kth 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]dxkαϕ(x)e2πixydx=[R,R]d1RRxkαϕ(x)e2πixydxkd(x1,,xk1,xk+1,,xd)=[R,R]d1((αϕ(x)e2πixy)|xk=Rxk=RRRαϕ(x)(2πiyk)e2πixydxk)d(x1,,xk1,xk+1,,xd)

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

dxkαϕ(x)e2πixydx

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

|αϕ(x)|<min{bj=1jkd|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(d1) function

(x1,,xk1,xk+1,,xd)min{bj=1jkd|xj|2,c}+|αϕ(x)(2πiyk)|dxk

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

d1(αϕ(x)(2πiyk)e2πixydxk)d(x1,,xk1,xk+1,,xd)=dαϕ(x)(2πiyk)e2πixydxFubini=d(2πiyβ)ϕ(x)e2πixydxinduction 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 yd, d|ϕ(x)e2πixy|dx< and
  • for all yd, d|ϕ(x)yke2πixy|dx<.

Further,

  • yk(ϕ(x)e2πixy) exists for all (x,y)d×d.

Hence, Leibniz' integral rule implies:

βϕ^(y)=xkαϕ^(y)=ykd(2πix)αϕ(x)e2πixydxinduction hypothesis=dyk(2πix)αϕ(x)e2πixydx=d(2πix)βϕ(x)e2πixydx

3.

ϕ*θ^(y):=d(ϕ*θ)(x)e2πixydxDef. of Fourier transform:=ddϕ(z)θ(xz)dze2πixydxDef. of convolution=dde2πixyϕ(z)θ(xz)dzdxlinearity of the integral=dde2πixyϕ(z)θ(xz)dxdzFubini=dde2πixye2πizyϕ(z)θ(x)dxdzIntegration by substitution using xx+z and b,c:eb+c=ebec=dde2πixyθ(x)dx=θ^(y)ϕ(z)e2πizydzpulling a constant out of the integral=θ^(y)dϕ(z)e2πizydz=ϕ^(y)pulling a constant out of the integral

Template:TextBox

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).

Template:TextBox

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

Template:TextBox

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)))e2πixydy.

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

kN1:ς0dςα(ςα)xn2ς((2πix)β)ας(ϕl(x)ϕ(x))<ϵ.

Further, we may choose N2 such that

kN2:ς0dςα(ςα)ς((2πix)β)ας(ϕl(x)ϕ(x))<ϵ.

Hence follows for kN:=max{N1,N2}:

α((2πix)β(ϕlϕ)))L1:=d|α((2πix)β(ϕl(x)ϕ(x)))|dxdϵmin{x12,,xd2,1}dx=ϵdmin{x12,,xd2,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 xx, 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:

Template:TextBox

Proof:

1. 1(G)=G:

We define

μ:d,μ(ξ):=eπξ2G^(ξ).

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

ξnμ(ξ)=2πξneπξ2G^(ξ)+eπξ2ξnG^(ξ).

Due to 1. of theorem 8.8, we have

2πξnG^(ξ)=ixnG^(ξ)=id(2πxn)eπx2e2πiξxdx;

from 2. of theorem 8.8 we further obtain

ξnG^(ξ)=d(2πixn)eπx2e2πiξxdx.

Hence, μ is constant. Further,

μ(0)=deπx2dx=d12πdex2/2dxsubstitution using x12πdx=1lemma 6.2.

2. 1(G)=G:

By substitution using the diffeomorphism xx,

xd: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{e11x2 if x2<10 if x21

, where c:=B1(0)e11x2dx, is a bump function (see exercise 3.2).

Template:TextBox

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 ckd such that

xkxαβϕ<ck.

Let now ϵ>0 be arbitrary. We choose N1 such that for all nN1

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 nN2

xBR(0):|1ϕ(x/n)|<1/cβ.

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

Template:TextBox

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=1dxj01xjϕ(tx)dt.

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

θj,n(x):=η(x/n)01xjϕ(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)=12πij=1dyj(θj,n)(y).

Hence,

1((ϕn))(0)=d(ϕn)(y)e2πi0y=1dy=12πij=1ddyj(θ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

dyk(θk,n)(y)dy=d1yk(θk,n)(y)dykd(y1,,yk1,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πx2.

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 xd is arbitrary, then 1((ϕ))(x)=ϕ(x) (i. e. 1((ϕ))=ϕ.

Let ϕ𝒮(d) and xd be arbitrary. Due to the definition of 1,

1((ϕ))(x)=d(ϕ)(y)e2πixydy.

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

(ϕ)(y)e2πixy=dϕ(z)e2πizye2πixydz=dθ(z)dze2πizy=(θ)(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 xd be arbitrary. Then we have

(1(ϕ))(y)=1(1(ϕ))(y)=d1(ϕ)(x)e2πixydx=d(ϕ)(x)e2πixydx=1((ϕ))(y)=ϕ(y).

The Fourier transform of tempered distributions

Template:TextBox

Template:TextBox

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.

Template:TextBox

Exercises

Sources

Template:Navigation