In the Fourier series part we mainly studied the convergence of Fourier series, here is a breif summery of points covered in the lectures and the book. It is strongly recommended to read this wikipedia page for a complete summery of convergence of Fourier series:
In the global approach we have the following results:
Regularity of f
Decay of Fourier coefficients
Reason
Integrable
→0
Riemann-Lebesgue lemma
Ck
o(nk1)
Derivative theorem + Riemann-Lebegue Lemma
bounded monotonic
O(n1)
Page 93 exercise 17
Lipschitz
O(n1)
Page 91 Exercise 15
Note that when f is Lipschitz or C1, the decay condition it self does not imply absolute convergence of Fourier series. However, the Fourier series does converges absolutely (Page 92, Exercise 16).
Note that sin(21t)t is continuous, sin((N+21)t)=sin(Nt)cos(21t)+cos(Nt)sin(21t). F(t) is integrable, the right hand side is integrable of the form “integrable ⋅sin(Nt)” and “integrable ⋅cos(Nt)”, which goes to zero as a consequence of Riemann Lebesuge lemma.
Note that we only need F to be bounded near 0, so it sufficies to assume f is merely Lipschitz continuous at x0, i.e. ∣f(x0+t)−f(x0)∣≤C∣t∣ for small enough t.
Example of continuous but everywhere non-differentiable function¶
The Fourier transform can be seen as a generalization of this correspondence to non-periodic functions on R. The idea is that a non-periodic function can be viewed as a “periodic function with period = ∞”.
which is a non-periodic function on R. For any T>1, we can view f as a function defined on [2T,2T], and make it a T-periodic function fT(x):=∑k∈Zf(x−kT). Observe that, when T→∞, fT(x)→f(x). So to use Fourier analysis to study f, we can look at behavior of Fourier coefficients of fT as T→∞.
We can see that when T becomes larger and larger, the Fourier coefficients takes value on a function, more and more slowly with higher and higher “definition”. If you take, for example, ∣n∣≤100, then when T is small, it samples the function T1πssinπs on largher interval but more rough; When T is large, the first 100 coefficients only give you information about the function T1πssinπs on a small interval, but with greater detail. Also, when T is big, the T1 makes the Fourier coefficients small. Let’s get rid of the shrinking by scaling the function back by T. Then we obtained a function g(s) such that TfT(n)=g(Tn), in this case we know that g(s)=πssinπs.
To get the function g in a more intrinsic way, when T is large, Tn samples through the real line. Let s=Tn so that n=sT, then
Note that to be L1 or bounded support is too restrictive for a satisfactory theory of Fourier transforms, we just add this assumption for simplicity. The Fourier transform can be defined on much wider objects, as we shall see later.
The Fourier coefficients can recover the function under certain regularity assumptions or growth conditions (they are the same). One expects same behavior for Fourier transforms.
Suppose we know the Fourier transform of f is F(s), can we recover f? For simplicity let’s assume f is bounded support (we also call it time limited) so that we can obtain its periodization fT without convergence issues. Then we can try to get fT by Fourier series and then recover f by letting T→∞. Using Fourier series expansion on fT and equation TfT(n)=F(Tn) we get
This is an Riemann sum of, which goes to ∫−∞+∞F(s)e2πixsds, when T→∞, and the left hand side goes to f(x). The argument suggests that we can get f back by taking integral