In last lecture we defined the Schwartz class of functions. First, we’ll show that the Fourier transform is well behaved in the Schwarz functions
S is closed under Fourier transform.
All the properties of Fourier transform works without further assumptions.
The Fourier transform is invertible.
The Poisson summation formula.
The Fourier transform is isometry with L2 norm on S.
Secondly, the Schwartz functions serves as “test objects” to define a class of distributions that behave well under Fourier transforms, called “tempered distributions”.
By definition, f∈S if and only if ∥f∥(k,l):=supx∈R∣xkf(l)(x)∣<∞ for every k,l≥0. We also let ∥f∥N:=maxk+l=N∥f∥(k,l). The ∥⋅∥(k,l) as well as ∥⋅∥N are semi-norms on S.
Lemma. If f∈S, then xkf(l)(x) is L1 for every (k,l).
Proof of above lemma. We show integrability by showing the function is moderate decreasing. xkf(l)(x)=1+x2xk(1+x)2f(l)(x)=sup∣xk(1+x)2f(l)(x)∣⋅1+x21.
Proof of (1). We need to estimate the (k,l)-seminorms of Ff(s). Using the derivative theorem and multiplication theorem, all functions of the form skdsldlFf(s) is some multiple of Fourier transform of xldxkdkf. But xldxkdkf is L1 because f∈S, then the previous lemma implies boundedness of Fourier transform. □
Second proof. Since f,g∈S, f∗g is moderate decreasing. Indeed, f∗g(x)=∫Rf(x−y)g(y)dy=∫∣y∣≤2∣x∣f(x−y)g(y)dy+∫∣y∣≥2∣x∣f(x−y)g(y)dy. The first term is bounded by ∥g∥L11+(2∣x∣)21 and second term bounded by ∥f∥L11+(2x)21. By the convolution theorem, F(f∗g)=Ff⋅Fg, so F(f∗g)∈S. Then by Fourier inversion, f∗g=F−1F(f∗g)=F−1 of Schwartz function, which is Schwartz. □
The informal derivation of the Fourier transform of rect function in lecture 8 applies to Schwartz functions (even though the Schwartz functions are not compact supported). We make the informal discussion precise as follows.
If f is moderate decreasing on R with ∣f(x)∣≤1+x2C, then
(1) fT(x)=∑k=−∞+∞f(x−kT) converges uniformly.
(2) Let fT(n) be the Fourier coefficients of fT. Then f^T(n)=T1Ff(Tn).
(3) ∣fT(x)−f(x)∣≤T2Cπ2 when x∈[−2T,2T], this C is the same as the C in moderate decreasing condition of f. In particular, this implies ∣fT(x)−f(x)∣→0 uniformly on every bounded subset of R.
Proof.
(1) Note that fT is periodic function, so we only need to consider x in its period, say, x∈[2T,2T]. ∣f(x−kT)∣≤1+(x−kT)2C=1+T2(Tx−k)2C≤1+T2(k−21)2C. Note that ∑k=−∞+∞1+T2(k−21)2C converges, so fT converges uniformly by Wererstrass M-test.
(3) ∣fT(x)−f(x)∣=∣∑k=0,k∈Zf(x−kT)∣≤∑k∈Z,k=01+(x−kT)2C≤T2C∑k=0,k∈ZT21+(Tx−k)21≤T2C⋅2∑k≥1(k−21)21.
To verify the the last inequality, observe that −2T≤x≤2T⟹−21≤Tx≤21⟹(Tx−k)2≥(k−21)2 for every k=0.
Now we summerize three important consequences of the periodization lemma.
When f is in S, the derivatives of f are moderate decreasing so fT is smooth. Then the Fourier series of fT converges uniformly on [−2T,2T], then we obtain
For every x∈R, when T is sufficiently large, x will be in [−2T,2T]. Then (3) of periodization lemma implies fT(x)→f(x). For ϵ>0, choose T,N such that ∣fT(x)−f(x)∣<ϵ and ∣∑n=−NNT1Ff(Tn)e2πiTnx−∫−TN+TNFf(s)e2πixsds∣<ϵ. If Ff is L1 (this is ensured when f∈S), then one can further enlarge N to make ∣∫−∞+∞Ff(s)e2πisxds−∫−TNTNFf(s)e2πisxds∣<ϵ. It follows that by letting T→∞, we get
Apply the Parsval identity to fT we get T1∫−2T2T∣fT(x)∣2dx=∑n=−∞+∞∣fT(n)∣2. By the periodization lemma we get T1∫−2T2T∣fT(x)∣2dx=∑n=−∞+∞∣T1Ff(Tn)∣2⟹∫−2T2T∣fT(x)∣2dx=∑n=−∞+∞∣Ff(nT)∣2⋅T1. The RHS, as a Riemann sum of , goes to ∫−∞+∞∣Ff(s)∣2ds when T→∞; the LHS goes to ∫−∞+∞∣f(x)∣2dx by uniform convergence and previous argument. We have derived
More generally, the Plancherel theorem is true for all L2 functions f on R such that Ff is L2. This is because S is dense in L2.