MATH Assignment 3
MATH Assignment 3
kfn − fm k2 = (fn − fm | fn − fm )
Z 2
= (fn − fm )(x)(fn − fm )(x) dx
0
Z 2
= (fn (x) − fm (x))(fn (x) − fm (x)) dx
0
Z 2
= |fn (x) − fm (x)|2 dx
0
Z 2 Z 1
2
|fn (x) − fm (x)| dx = |fn (x) − fm (x)|2 dx
1
0 1− n
For this range, the difference in the functions is bounded above by 1, thus
giving us that
Z 1 Z 1
2
|fn (x) − fm (x)| dx ≤ 1 dx
1 1
1− n 1− n
= [x]11− 1
n
1
= (1) − (1 − )
n
1
=
n
1
1
n
−→ 0 as n −→ ∞.
We can consider the cases where m < n, or m = n, but the result will follow
similary, as in all cases fn − fm will be bounded above by 1.
Z 2
2
kfn − f k = |fn (x) − f (x)|2 dx as with part (a)
0
Z 1
= |fn (x) − f (x)|2 dx (as, similar to (a) also, the area under the
1
1− n
1
difference of the functions is only non-zero for x between 1 and 1 − )
n
Z 1
≤ 1 dx (bounded above by 1, as before)
1
1− n
= [x]11− 1
n
1
=
n
−→ 0 as n −→ ∞
2
Thus |(vn | wn ) − (v | w)| −→ as n −→ ∞, so k(vn | wn ) − (v | w)k −→ as n −→ ∞
as required.
3. Take {xn } ⊂ B̄(v, r), and suppose that xn −→ x, that is, kxn −xk −→ 0 as n −→ ∞.
Since {xn } ⊂ B̄(v, r), kv − xn k ≤ r for all n. Now we have to show that kx − vk ≤ r.
So,
kx − vk = kx − xn + xn − vk
≤ kx − xn k + kxn − vk (by the triangle inequality)
= kxn − xk + kv − xn k
≤ kxn − xk + r (since xn ⊂ B̄(v, r))
−→ 0 + r as n −→ ∞
=r