Refers to Fourier Analysis by Stein
# Mean-square convergence
Theorem 3.2.1 Suppose f∈R(S1), then we have mean-square convergence of the Fourier series
2π1∫−ππ∣f(θ)−SN(f)(θ)∣2dθ→0, as N→∞
Before the proof of the Theorem 3.2.1, we consider the space R, then let
en(θ)=einθ, ∀n∈N
and obviously
(en,em)=δnm
(f,en)=2π1∫−ππf(θ)e−inθdθ=f^(n)
Now we have the best approximation of the Fourier series
Lemma 3.2.2 If f∈R(S1), then
∣∣f−SN(f)∣∣≤∣∣f−∣n∣≤N∑cnen∣∣
for any complex numbers cn. Moreover, equality holds precisely when cn=f^(n) for all ∣n∣≤N
Proof of Lemma 3.2.2
Tips: Pythagorean theorem
Note that
(f−SN(f),en)=0, ∀∣n∣≤N
moreover
∣∣f∣∣2=∣∣f−SN(f)∣∣2+∣n∣≤N∑∣f^(n)∣2
Proof of Theorem 3.2.1
Tips: Interpolation
Apply Lemma 2.3.4 to approximate f by a family of continuous functions, then apply Corollary 2.5.7.
Theorem 3.2.3 If f∈R(S1), then we have Parseval's identity
n=−∞∑∞∣f^(n)∣2=∣∣f∣∣2=2π1∫−ππ∣f(θ)∣2dθ
that is to say
∣∣f∣∣2=41a02+21n=1∑∞an2+bn2
This identity provides an important connection between the norms in the two vector spaces l2(Z),R.
Corollary 3.2.4 If
Theorem 3.2.5 If f∈R(S1), then we have Riemann-Lebesgue lemma
f^(n)→0, as ∣n∣→∞
an equivalent reformulation of this theorem is that
∫−ππf(θ)sin(Nθ)dθ→0, as N→∞
∫−ππf(θ)cos(Nθ)dθ→0, as N→∞
At last, we give a more general version of the Parseval identity
Lemma 3.2.6 Suppose F,G∈R(S1) with
F∼∑aneinθ,G∼∑bneinθ
then
2π1∫−ππF(θ)G(θ)dθ=n=−∞∑∞anbn
Proof of Lemma 3.2.6
Tips: Polarisation
Note the connection between the inner product and the norm that
(F,G)=41[∣∣F+G∣∣2−∣∣F−G∣∣2+i(∣∣F+iG∣∣2−∣∣F−iG∣∣2)]
which holds in every Hermitian inner product space.
Incidentally, it's from the form
(F+G,F+G)=∣∣F∣∣2+∣∣G∣∣2+2Re(F,G)
Theorem 3.2.7 Suppose f∈R(S1), with f∼∑Aneinx, then for all (a,b)⊂[−π,π], then
2π1∫abf(x)dx=n∈Z∑∫abAneinxdx
Proof of Theorem 3.2.7
Apply Lemma 3.2.6. Let
g(x)=χ(a,b)(x)={01,x∈[−π,π]−(a,b),x∈(a,b)
# Pointwise convergence