The Fourier transform decomposes a function into components of different frequencies. Historically, Fourier series were developed to study periodic processes and the heat equation, but Fourier analysis has found applications in diverse areas such as number theory, combinatorics, and signal processing.
The study of the Fourier transform has given rise to entire new areas of mathematics, such as harmonic analysis and functional analysis. In this post, we will only study a small part of the rigorous foundations for Fourier analysis, namely some conditions for the existence of the Fourier transform and its inverse.
The Fourier transform
Firstly, note that our definition for Lebesgue measurable and Lebesgue integrable functions extend naturally to C-valued functions: if f:R→C, write f=u+iv with u,v:R→R. Then we say that f is Lebesgue measurable (resp. integrable) if both u and v are Lebesgue measurable (resp. integrable), and define
∫fdλ=∫udλ+i∫vdλ.
Lemma: (Triangle inequality for integrals) Let f:R→C be such that ∣f∣∈L1(R). Then
∣∣∣∣∫fdλ∣∣∣∣≤∫∣f∣dλ.
Proof: Choose α∈C such that ∣α∣=1 and the first line holds:
Now for f∈L1(R), define the Fourier transform of f by
f(y)=∫f(x)e−ixydλ(x).
Note that the Fourier transform is R-linear, hence C-linear; as such, there is no loss in generality if we restrict ourselves to studying the Fourier transform only on R-valued functions.
An important first example is the Gaussian function, whose Fourier transform is simply a multiple of itself.
Proposition: Let g(x)=2π1e−2x2. Then g(y)=e−2y2.
Proof: By differentiation under the integral sign, converting into a Riemann integral, and integration by parts, we have
where the computation g(0)=∫gdλ=1 is well-known. □
We now establish some properties of the Fourier transform on L1(R).
Proposition: Let f∈L1(R). Then f is continuous and bounded, with supy∣f(y)∣≤∥f∥1.
Proof: Note that both the real and imaaginary parts of f(x)e−ixy are bounded in absolute value by ∣f(x)∣. Hence for any sequence (yn) converging to y, LDCT yields
Hence f is continuous. Now ∣f(y)∣≤∥f∥1 follows from the triangle inequality for integrals. □
Next we list the effects of translation and scaling of the input function on the Fourier transform. These can all be proven with a linear change of variables.
Proposition: Let f∈L1(R).
If F(x)=f(x−k), then F(y)=e−ikyf(y).
If G(x)=f(kx), then G(y)=∣k∣f(ky).
If H(x)=eikxf(x), then H(y)=f(y−k). □
The Fourier transform decays to zero at ±∞:
Riemann–Lebesgue lemma: Let f∈L1(R). Then limy→±∞f(y)=0.
Proof: First we prove the statement for g∈Cc∞(R). Integration by parts gives
We now look at conditions under which we can recover a function f from its Fourier transform f^. Our first result gives f as an explicit formula in terms of f^, but only holds when f^ is sufficiently nice (namely, when it is Lebesgue integrable).
Fourier Inversion Theorem: Let f∈L1(R), and suppose that f∈L1(R). Then for λ-a.e. x∈R, we have
f(x)=2π1∫f(y)eixydλ(y).
In other words, f(x)=2π1f(−x).
Proof: Let g(x)=2π1e−2x2 be the Gaussian function, and let gε(x)=ε1g(εx). Notice that if we define
so applying LDCT (to both the real and imaginary parts) gives
ε→0+lim∫fhεdλ=2π1∫eix0yf(y)dλ(y).
However, since limε→0+∥f∗gε−f∥1=0, which implies that f∗gε converges in measure to f as ε→0+, there is a subsequence (εk) converging to 0 such that
k→∞limf∗gεk(x)=f(x)for λ-a.e. x,
and we are done. □
Fejér’s theorem
However, in general f∈L1(R) does not imply that f∈L1(R). In this case, we can stil recover f from f by a limit process.
Corollary (Fourier Summability Theorem): Let (Kε)ε>0 be an approximate identity, with Kε∈L1(R) for all ε>0. Then for any f∈L1(R)∩Lp(R), the functions
hε(x)=2π1∫f(y)Kε(y)eixydλ(y)
converge to f in Lp(R), ie.
ε→0+lim∥hε−f∥p=0.
Proof: Note that f∗Kε∈L1(R)∩Lp(R). By the Fourier inversion theorem, hε=f∗Kελ-a.e., so
∥hε−f∥p=∥f∗Kε−f∥p→0.□
Next we investigate certain “windowing functions” or “kernels” given by
F(x)=2π1(x/2)2sin2(x/2),H(x)=max(1−∣x∣,0).
The approximate identity Fε(x)=ε1F(εx) is known as Fejér’s kernel.
Proposition: H=2πF and F=H.
Proof: It is clear that H∈L1(R), since it is continuous and has compact support. Also, since ∣F(x)∣≤min(2π1,πx22), we also have F∈L1(R).
Now the first equation follows from direct computation:
Comments (0)
Be the first to comment!