Distribution Theory and Fourier Analysis

Special Notation

Relatively open: no one in V is infinitely close to any member of U

UV

Compactly Contained: any possible limit points of U lie within V

U⊂⊂V
Definition

We introduce the following important notations to be used for the preceding discussions
• for fLloc1(U) we identify the function f with the distribution f~ from 28
• for fLloc1(U) and φCc(U) we define the pairing

(f,φ)=Uf(x)φ(x)dx

• for uD(U) and φCc(U) we define the pairing

(u,φ)=u(φ)
Remark

It is common to write

(u,φ)=Uu(x)φ(x)dx

as well but take caution that this only makes sense when you write it like this. If you try to isolate u(x) and it as a classical function the result will not make sense

Example

Consider isolating the dirac delta function δ(xx)=12πeik(xx)dk from the fourier decomposition of the wave function

Ψ(x)=12π[12πΨ(x)eikxdx]eikxdk,Ψ(x)=Ψ(x)12πeik(xx)dkdx.

if you took this in a classical sense after attempting to isolate the dirac delta "function" you get for x=x(sifting property)

Ψ(x)=Ψ(x)

which is nonsense

fourier transforms

derivation of fourier transform from fourier series. first consider the complex form of the fourier series

f(t)=n=cnei2πnt/T,

where the coefficients cn are given by

cn=1TT/2T/2f(t)ei2πnt/Tdt.
Question

what happens when T

First recall that fourier are derived for periodic functions with period T. So with T, we effectively are considering aperiodic functions. Next recalling the formula for the coefficients of fourier series as given above we see that by rewrite the coefficient cn in terms of angular frequency ωn=nω0=2πn/T:

cn=1TT/2T/2f(t)eiωntdt=ω02πT/2T/2f(t)eiωntdt,

since ω0=2π/T.
Now substitute back into the series:

f(t)=n=cneiωnt=n=(ω02πT/2T/2f(s)eiωnsds)eiωnt,

where we've used s as the dummy integration variable to avoid confusion with t.
This can be rearranged as:

f(t)=12πn=(T/2T/2f(s)eiωnsds)eiωntω0.

As T:
• The integration limits T/2 to T/2 extend to to .
• The sum n=g(ωn)Δω (where Δω=limT((n+1)w0nw0)=ω0) becomes the integral g(ω)dω, because the discrete points ωn fill the real line densely.

Let g(ω)=f(s)eiωsdseiωt. Then the expression becomes:

f(t)=12π(f(s)eiωsds)eiωtdω.
Remark

notice this kind of looks like the continuous version of the fourier series now and analagously we see that its "coeffcients" can be obtained by the expression in the brackets

we give this a proper definition specifically

Definition

Define the Fourier transform F(ω) (often denoted f^(ω) or F(ω)) as:

F(ω)=f(t)eiωtdt.

The inverse transform is:

f(t)=12πF(ω)eiωtdω.

just like how we did for parsevel theorem previously we aim to find the equivalent for this "continuous version". Specifically we call this the planceral theorem. We will return this after the following important interlude.

Note that we essentially derived fourier transform from fourier series which exists on the space of periodic functions or the circle group(T).

Remark

basically we are approximating with fourier series first then taking the "period to infinity" to get fourier transform

In reality fourier transforms can be applied to functions on Rn not just the circle group. A full approach is one that starts from schwartz functions(which are just certain rapidly decaying functions) to prove the fourier transform pair via fourier inversion formula(see ur 18.155 notes)

Theorem

(Fourier Transform on L2) Assume that fL2(Rn) then the fourier transform f^(as defined above) also lies in L2(Rn) and we have

f^L2(Rn)=(2π)n/2fL2(Rn)
Remark

this means in the case of 1D and the "unitary" fourier transform

F(ω)=12πf(t)eiωtdt.f(t)=12πF(ω)eiωtdω.

we get

|f(x)|2dx=|f^(ξ)|2dξ