1. Quizz 11
(1) Let (fn) be a sequence in C[a, b] such that (fn) is convergent to f in (C[a, b], k · k∞).
Prove that
n→∞lim Z b
a
fn(x)dx = Z b
a
f (x)dx.
Proof. Let s =Rb
af (x)dx and sn=Rb
afn(x)dx for n ≥ 1. Since (fn) is convergent to f in (C[a, b], k · k∞), for any > 0, there exists N∈ N such that
kfn− f k∞<
b − a, for any n ≥ N. For any n ≥ N,
|sn− s| ≤ Z b
a
|fn(x) − f (x)|dx
≤ kfn− f k∞· (b − a)
<
b − a· (b − a)
= .
This proves that lim
n→∞sn= s.
(2) Let fn(x) = nx(1 − x2)n for x ∈ [0, 1].
(a) Let x0 ∈ [0, 1]. Prove that
n→∞lim fn(x0) = 0.
Proof. When x0 = 0 or 1, fn(x0) = 0 for all n ≥ 1. Thus lim
n→∞fn(x0) = 0. When 0 < x0 < 1, let r = (1 − x20). Then 0 < r < 1.
Lemma 1.1. For 0 < r < 1, lim
n→∞nrn= 0.
Proof. Since 0 < r < 1, (1/r) > 1. Set (1/r) = 1 + a for a > 0. By binomial theorem and a > 0,
1
rn = (1 + a)n= 1 +
n
X
k=0
n k
ak≥ 1 + na + n(n − 1) 2 a2. This implies that for any n ≥ 1,
0 < nrn< n
1 + na +n(n−1)2 a2 . Since lim
n→∞0 = lim
n→∞
n
1 + na + n(n−1)2 a2 = 0, lim
n→∞nrn = 0 by Sandwich princi-
ple.
Since 0 < x0< 1,
0 < fn(x0) = nx0(1 − x20)n< n(1 − x20)n. By Lemma (1.1) and the Sandwich principle, lim
n→∞fn(x0) = 0.
1
2
(b) Is (fn) convergent to the zero function in (C[0, 1], k · k∞)? (Hint: consider (1)).
Proof. If (fn) is convergent to f in (C[0, 1], k·k∞), by Problem (1), lim
n→∞
Z 1 0
fn(x)dx = Z 1
0
f (x)dx. On the other hand, Z 1
0
fn(x)dx = Z 1
0
nx(1 − x2)ndx = n
2(n + 1), n ≥ 1.
Hence
n→∞lim Z 1
0
fn(x)dx = 1 2 6= 0 =
Z 1 0
f (x)dx.
(3) Let (fn) be a sequence in (C[a, b], k · k∞). Suppose that (fn) is convergent to f in (C[a, b], k · k∞). Prove or disprove that (fn2) is convergent to f2 in (C[a, b], k · k∞).
Proof. Since (fn) is convergent to f in (C[a, b], k · k∞), there exists M > 0 such that kfnk∞≤ M for any n ≥ 1. Hence kf k∞≤ M. For any x ∈ [a, b],
|fn(x) + f (x)| ≤ |fn(x)| + |f (x)| ≤ kfnk∞+ kf k∞≤ 2M.
Therefore kfn+ f k∞≤ 2M for any n ≥ 1. Since (fn) is convergent to f in (C[a, b], k · k∞), for any > 0, there exists N∈ N such that
kfn− f k∞<
2M for n ≥ N. For x ∈ [a, b] and any n ≥ 1,
|fn(x)2− f (x)2| = |fn(x) − f (x)||fn(x) + f (x)| ≤ 2M kfn− f k∞. We find that for any n ≥ 1,
kfn2− f2k∞≤ 2M kfn− f k∞. Hence if n ≥ N,
kfn2− f2k∞≤ 2M kfn− f k∞< 2M · 2M = .
(4) Let (an) be a sequence of real numbers such thatP∞
n=1|an| is convergent. Define f (x) =
∞
X
n=1
ansin nx, x ∈ [0, 2π].
(a) Show that f defines a real valued continuous function on [0, 2π], i.e. f ∈ C[0, 2π].
Proof. Let fn(x) = ansin nx for x ∈ [0, 2π]. If x ∈ [0, 2π],
|fn(x)| = |an|| sin nx| ≤ |an|.
Hence kfnk∞≤ |an| for any n ≥ 1. SinceP∞
n=1|an| is convergent in R,P∞
n=1kfnk∞ is convergent in R. Since (C[0, 2π], k · k∞) is a Banach space,P∞
n=1fnconverges to f in (C[0, 2π], k · k∞). Hence f ∈ C[0, 2π].
3
(b) Let k be a natural number. Find Z 2π
0
f (x) sin kxdx in terms of an. Proof. Let sn(x) = Pn
j=1fj(x) for n ≥ 1 and tn(x) = sn(x) sin kx and t(x) = f (x) sin kx for x ∈ [0, 2π]. For x ∈ [0, 2π] and n ≥ 1,
|tn(x) − t(x)| = |sn(x) − f (x)|| sin kx| ≤ ksn− f k∞.
Therefore ktn− tk∞ ≤ ksn− f k∞ for any n ≥ 1. Since (fn) converges to f in (C[0, 2π], k · k∞), (tn) converges to t in (C[0, 2π], k · k∞). By Problem (1),
n→∞lim Z 2π
0
tn(x)dx = Z 2π
0
t(x)dx.
For n ≥ k, Z 2π
0
tn(x)dx =
n
X
j=1
aj
Z 2π 0
sin jx sin kxdx = πak. We see that
Z 2π 0
f (x) sin kxdx = lim
n→∞
Z 2π 0
tn(x)dx = lim
n→∞πak= πak.
(c) Find
Z 2π 0
|f (x)|2dx in terms of an. Proof. For any n ≥ 1,
ksnf − f2k∞≤ ksn− f k∞kf k∞,
we can show that (snf ) is convergent to f in (C[0, 2π], k · k∞). By Problem (1),
n→∞lim Z 2π
0
sn(x)f (x)dx = Z 2π
0
f (x)2dx.
For n ≥ 1, Z 2π
0
sn(x)f (x)dx =
n
X
k=1
ak Z 2π
0
f (x) sin kxdx =
n
X
k=1
ak· πak. This shows that for n ≥ 1,
Z 2π 0
sn(x)f (x)dx = π ·
n
X
k=1
a2k. This implies that
Z 2π 0
f (x)2dx = lim
n→∞ π ·
n
X
k=1
a2k
!
= π
∞
X
n=1
a2n.