# The Fourier transform on the space of functions of moderate decrease
Before extend the integral of a function on a closed and bounded interval, we should check whether the value exists or not. A useful conditino is as follows.
Definition 5.1.1 A function f is said to be of moderate decrease if f∈C(R) and ∃A>0,ϵ>0 so that
∣f(x)∣≤1+x1+ϵA,∀x∈R
We shall denote M(R) the set of functions of moderate decrease on R.
Example
There are two examples of functions of moderate decrease
f(x)=1+∣x∣n1,n≥2
and
f(x)=e−a∣x∣,a>0
Remark
Under the usual addition of functions and multiplication by scalars, M(R) forms a vector space over C.
Definition 5.1.2 For all f∈M(R), we may define its integral
∫−∞∞f(x)dx:=N→∞lim∫−NNf(x)dx
We summarize some elementary properties of integration over R in a property
Property 5.1.2 The integral of a function of moderate decrease defined above satisfies the following properties, if f,g∈M(R) and a,b∈C, then
Linearity:
∫−∞∞(af(x)+bg(x))dx=a∫−∞∞f(x)dx+b∫−∞∞g(x)dx
Translation invariance: ∀h∈R we have
∫−∞∞f(x−h)dx=∫−∞∞f(x)dx
Scaling under dilations: if δ=0, then
δ∫−∞∞f(δx)dx=sgn(δ)⋅∫−∞∞f(x)dx
Continuity:
∫−∞∞∣f(x−h)−f(x)∣dx→0, as h→0
Proof
Prove the properties by using integral on the bounded interval instead of using indefinite integral directly.
Definition 5.1.3 If f∈M(R), we define its Fourier transform for ξ∈R by
f^(ξ)=∫−∞∞f(x)e−2πixξdx
Obviouly the integral makes sense. However, nothing in the definition above guarantees that f^ is of moderate decrease.
Roughly speaking, the Fourier transform is a continuous version of the Fourier coefficients.
Definition 5.1.4 The Schwartz space on R consists of the se t of all f∈C∞(R) so that f and its derivatives f′,...,f(l),... are rapidly decreasing, in the sense that
x∈Rsup∣x∣k∣f(l)(x)∣<∞,∀k,l≥0
We denote this space by S=S(R)
Remark
Under the usual addition of functions and multiplication by scalars, S(R) forms a vector space over C.
Moreover, if f∈S(R), we have
f′(x)=dxdf∈S(R)
xf(x)∈S(R)
This expresses the important fact that the Schwartz space is closed under differentiation and multiplication by polynomials.
Example
The Gaussian e−ax2∈S(R) whenever a>0, while e−∣x∣ does not for not differentiable at 0.
Definition 5.1.5 The Fourier transform of a function f∈S(R) is defined by
f^(ξ)=∫−∞∞f(x)e−2πixξdx
We use the notation
f(x)→f^(ξ)
to mean that f^(ξ) denotes the Fourier transform of f.
Property 5.1.6 If f∈S(R), then
Whenever h∈R
f(x+h)→f^(ξ)e2πihξ
Whenever h∈R
f(x)e−2πixh→f^(ξ+h)
Whenever δ>0
f(δx)→δ−1f^(δ−1ξ)
Derivatives:
f′(x)→2πiξf^(ξ)
−2πixf(x)→dξdf^(ξ)
Proof
Tips: Uniformly convergence
Theorem 5.1.7 If f∈S(R), then f^∈S(R).
Proof
Note that
(2πi)k1(dxd)k[(−2πix)lf(x)]→ξk(dξd)lf^(ξ)
Theorem 5.1.8 If ∣f∣∈R(R), then f^ is uniformly continuous in R.