Let f be supported on [−21,21] such that f(−21)=f(21)=0. The periodization f1(x)=∑k=−∞+∞f(x−k) makes copies of f to get a function on T.
Let f be C1 so that f1∈C1(T).
(1) Let f^(s) be the Fourier transform of f, let cn be the Fourier coefficients of f1.
Show that f^(n)=cn for n∈Z. In other words, the integral value of Fourier transform of f is equal to the Fourier coefficients of periodization of f. This justifies our usage of notation f^(n) for Fourier coefficients.
A function f on R is called moderate decreasing provided ∣f(x)∣≤1+x2A for some A>0 and x∈R. Let f be a moderate decreasing function on R.
(1) Show that if f is moderate decreasing, then the improper integral ∫−∞+∞f(x)dx converges.
(2) Show that ∫−∞+∞f(x−h)dx=∫−∞+∞f(x)dx.
(3) Show that for a>0, ∫−∞+∞f(ax)dx=a1∫−∞+∞f(x)dx.
(4) Prove that let f be a moderate decreasing continuous function on R. Then fT(x)=∑k=−∞+∞f(x+kT) defines a T-periodic continuous function on R such that fT(x)−f(x)≤CT2π2,∀∣x∣≤2T.
(5) If both f and f^ are moderate decreasing then the Poisson summation formula holds.
Before we did convolution of periodic functions (or circular convolution). Let f,g be supported on (−21,21). Let f1,g1 be the periodization of f,g to 1-periodic functions. Show that f1∗g1=f∗g1, where the left hand side is the periodic convolution ∫01f1(x−y)g1(y)dy, the right hand side is the convolution on R, i.e. ∫−∞+∞f(x−y)g1(y)dy.