Escolar Documentos
Profissional Documentos
Cultura Documentos
Homework assignment 1
X
u
||(j )||1 :=
|j |;
||(j )||2 := t
|j |2 .
j=1
j=1
1. We first prove that (an ) is a Cauchy sequence on the real line (with
respect to its usual metric |x y|). Let > 0 be given. Then since
(xn ) is Cauchy there is some integer N1 such that d(xm , xn ) < 2 for all
m, n > N1 . Also, since (yn ) is Cauchy there is some integer N2 such
that d(ym , yn ) < 2 for all m, n > N2 . Let N = max(N1 , N2 ).
Now let m, n be any integers with m, n > N . Then both m, n > N1
and m, n > N2 , and hence d(xm , xn ) < 2 and d(ym , yn ) < 2 . Hence by
the generalized triangle inequality, see p.4(1):
n
X
n1 = 1
j=1
and
v
uX
u n
1
n2 = n1 = n 2 .
||x||2 = t
j=1
u X
X
u
|j | = ||(j )||1 .
|j | =
||(j )||2 = t
|j |2 5 t
j=1
j=1
j=1
x2 = ( 41 , 41 , 14 , 41 , 0, 0, 0, );
x3 = ( 81 , 81 , 18 , 81 , 81 , 81 , 18 , 18 , 0, 0, 0, );
1). We also
The `1 norm of xn is ||xn || = 2n 2n = 1, hence xn B(0;
(n)
see that xn M , for if we write xn = (j ) then we have for all j 5 2n :
(n)
(n)
|j | = |2n | = 2n 5 j 1 , and for all j > 2n : |j | = 0 5 j 1 . Hence
(x1 , x2 , x3 , ) is a sequence of points in M .
However, the distance between any two points in the sequence (x1 , x2 , x3 , )
is = 1. [Proof: For any 1 5 n < m we have
2
X
n
||xn xm || =
j=1
2
X
m
|2
|+
j=2n +1
|0 2
|+
j=2m +1
|0 0|
as n .
1 = y(t1 );
2 = y(t2 ) 1 x1 (t2 );
= y(t ) x (t ) x (t );
3
3
1 1 3
2 2 3
()
This proves that for any y C[0, 1] there is at most one choice of
scalars 1 , 2 , R such that limn ||y (1 x1 + + n xn )|| = 0.
We now prove that the choice of scalars in (*) above really works,
i.e. that if we choose 1 , 2 , R as in (*) then we indeed have
limn ||y (1 x1 + + n xn )|| = 0.
k1
X
j=1
k1
X
j=1
j xj (tk ) + k 1 + 0 + + 0
In conclusion, we have Sn (tk ) = y(tk ) for all k {1, 2, , n}. Furthermore, since each function x1 , x2 , , xn is linear at all points t
/
{t1 , , tn }, so is the function Sn (t). Hence: Sn (t) is in fact the
piecewise linear function which satisfies Sn (tk ) = y(tk ) for all k
{1, 2, , n} and which is linear at all points t
/ {t1 , , tn }.
From this, we can now prove that limn ||y Sn || = 0: Since y(t) is
continuous and [0, 1] is compact, y(t) is actually uniformly continuous
over [0, 1]. Hence, given > 0 there is some integer M Z+ such that
for all t, t0 [0, 1] with |t t0 | < M 1 we have |y(t) y(t0 )| < . Since
the set {t1 , t2 , } is dense in [0, 1] there is some number N Z+ such
that each of the intervals
1
1
2
2
3
1
[0, 3M
], [ 3M
, 3M
], [ 3M
, 3M
], , [ 3M
, 1]
3M
tk t
t tj
Sn (tj ) +
Sn (tk ).
tk t j
tk t j
Hence:
tk t
t
t
j
(Sn (tj ) y(t)) +
(Sn (tk ) y(t))
|Sn (t) y(t)| =
tk t j
tk t j
tk t
t
t
j
=
(y(tj ) y(t)) +
(y(tk ) y(t))
tk t j
tk t j
tk t
t tj
5
+
= .
tk t j
tk t j
The above argument works for any t [0, 1]. Hence |Sn (t) y(t)| 5
for any t [0, 1]. Hence ||Sn y|| 5 . This is true for any n = N .
We have proved that for any > 0 there is some N Z+ such that
||Sn y|| 5 for all n = N . Hence limn ||y Sn || = 0. In other
words: limn ||y (1 x1 + + n xn )|| = 0.
Hence we have proved that for every y C[0, 1] there is a unique
choice of scalars 1 , 2 , R such that
lim ||y (1 x1 + + n xn )|| = 0.