0% found this document useful (0 votes)
26 views3 pages

MATH Assignment 3

This document contains Sam van Betuw's assignment for their MATH301 class. It includes: 1) A proof that the sequence of functions fn converges uniformly to f as n approaches infinity. 2) A proof that the sequence of vectors vn converges in norm to v as n approaches infinity. 3) A proof using previous results to show that the closed ball B(v,r) is closed.

Uploaded by

SamvanBetuw
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
0% found this document useful (0 votes)
26 views3 pages

MATH Assignment 3

This document contains Sam van Betuw's assignment for their MATH301 class. It includes: 1) A proof that the sequence of functions fn converges uniformly to f as n approaches infinity. 2) A proof that the sequence of vectors vn converges in norm to v as n approaches infinity. 3) A proof using previous results to show that the closed ball B(v,r) is closed.

Uploaded by

SamvanBetuw
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 3

Assignment 3 for MATH301

Sam van Betuw


1 April

1. (a) We need to show that kfn − fm k −→ 0 as n, m −→ ∞ independently.


Consider

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

Now, if we take m > n, then m1 < n1 , so 1 − m1 > 1 − n1 . Looking at fn and fm ,


they are equal for 0 ≤ x ≤ 1 − n1 , and 1 ≤ x ≤ 2. Thus the area under their
difference (the integral of their difference) would be zero for x in these ranges,
meaning

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.

Thus since 0 ≤ kfn − fm k2 ≤ n1 , kfn − fm k2 −→ 0 as n −→ ∞ as well, so


kfn − fm k −→ 0 as n, m −→ ∞ independently as required.
(b) We need to show that kfn − f k −→ 0 as n −→ ∞.
Consider,

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 −→ ∞

Thus kfn − f k2 −→ 0 as n −→ ∞, and therefore kfn − f k −→ 0 as n −→ ∞.


Thus fn −→ f as n −→ ∞ as required.

2. We know that kvn − vk −→ 0 as n −→ ∞, and kwn − wk −→ 0 as n −→ ∞. We


need to show that k(vn | wn ) − (v | w)k2 −→ 0 as n −→ ∞. In this case it will
suffice to show that |(vn | wn ) − (v | w)| −→ 0 as n −→ ∞.
Consider,

0 ≤ |(vn | wn ) − (v | w)| = |(vn | wn ) − (vn | w) + (vn | w) − (v | w)|


= |(vn | wn − w) + (vn − v | w)| (By (IP1)
≤ |(vn | wn − w)| + |(vn − v | w)| (by the triangle inequality)
1 1 1 1
≤ (vn | vn ) 2 (wn − w | wn − w) 2 + (vn − v | vn − v) 2 (w | w) 2
(by the Cauchy-Schwarz inequality)
= kvn k kwn − wk + kvn − vk kwk
−→ kvk(0) + (0)kwk as n −→ ∞
=0

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

So kx − vk ≤ r, and therefore x ∈ B̄(v, r). Thus by Proposition 3.2, since {xn } ⊂


B̄(v, r), and xn −→ x =⇒ x ∈ B̄(v, r), B̄(v, r) must be closed.

You might also like