06.09.2021 Views

Linear Algebra, Theory And Applications, 2012a

Linear Algebra, Theory And Applications, 2012a

Linear Algebra, Theory And Applications, 2012a

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

441<br />

|a k − a l | < ε 2 .Thenifk>K, it follows n k >Kbecause n 1 ,n 2 ,n 3 , ··· is strictly increasing<br />

as the subscript increases. Also, there exists K 1 such that if k>K 1 , |a nk − a| < ε 2 . Then<br />

letting n>max (K, K 1 ), pick k>max (K, K 1 ). Then<br />

Therefore, the sequence converges. <br />

|a − a n |≤|a − a nk | + |a nk − a n | < ε 2 + ε 2 = ε.<br />

Definition D.0.13 AsetK in R p is said to be sequentially compact if every sequence<br />

in K has a subsequence which converges to a point of K.<br />

Theorem D.0.14 If I 0 = ∏ p<br />

i=1 [a i,b i ] where a i ≤ b i ,thenI 0 is sequentially compact.<br />

Proof: Let {a k } ∞ k=1 ⊆ I 0 and consider all sets of the form ∏ p<br />

i=1 [c i,d i ]where[c i ,d i ]<br />

equals either [ ]<br />

a i , ai+bi<br />

2 or [ci ,d i ]= [ a i+b i<br />

]<br />

2<br />

,b i . Thus there are 2 p of these sets because<br />

there are two choices for the i th slot for i =1, ··· ,p. Also, if x and y are two points in one<br />

∑p<br />

of these sets, |x i − y i |≤2 −1 |b i − a i | where diam (I 0 )=(<br />

i=1 |b i − a i | 2) 1/2<br />

,<br />

( p∑<br />

) 1/2 ( p∑<br />

) 1/2<br />

|x − y| = |x i − y i | 2 ≤ 2 −1 |b i − a i | 2 ≡ 2 −1 diam (I 0 ) .<br />

i=1<br />

i=1<br />

In particular, since d ≡ (d 1 , ··· ,d p )andc ≡ (c 1 , ··· ,c p )aretwosuchpoints,<br />

( p∑<br />

) 1/2<br />

D 1 ≡ |d i − c i | 2 ≤ 2 −1 diam (I 0 )<br />

i=1<br />

Denote by {J 1 , ··· ,J 2 p} these sets determined above. Since the union of these sets equals<br />

all of I 0 ≡ I, it follows that for some J k , the sequence, {a i } is contained in J k for infinitely<br />

many k. Let that one be called I 1 . Next do for I 1 what was done for I 0 to get I 2 ⊆ I 1<br />

such that the diameter is half that of I 1 and I 2 contains {a k } for infinitely many values<br />

of k. Continue in this way obtaining a nested sequence {I k } such that I k ⊇ I k+1 ,andif<br />

x, y ∈ I k ,then|x − y| ≤2 −k diam (I 0 ), and I n contains {a k } for infinitely many values of<br />

k for each n. Then by the nested interval lemma, there exists c such that c is contained in<br />

each I k . Pick a n1 ∈ I 1 . Next pick n 2 >n 1 such that a n2 ∈ I 2 . If a n1 , ··· , a nk have been<br />

chosen, let a nk+1 ∈ I k+1 and n k+1 >n k . This can be done because in the construction, I n<br />

contains {a k } for infinitely many k. Thus the distance between a nk and c is no larger than<br />

2 −k diam (I 0 ), and so lim k→∞ a nk = c ∈ I 0 . <br />

Corollary D.0.15 Let K be a closed and bounded set of points in R p .ThenK is sequentially<br />

compact.<br />

Proof: Since K is closed and bounded, there exists a closed rectangle, ∏ p<br />

k=1 [a k,b k ]<br />

which contains K. Now let {x k } be a sequence of points in K. By Theorem D.0.14, there<br />

exists a subsequence {x nk } such that x nk → x ∈ ∏ p<br />

k=1 [a k,b k ]. However, K is closed and<br />

each x nk is in K so x ∈ K. <br />

Theorem D.0.16 Every Cauchy sequence in R p converges.<br />

Proof: Let {a k } be a Cauchy sequence. By Theorem D.0.11, there is some box ∏ p<br />

i=1 [a i,b i ]<br />

containing all the terms of {a k }. Therefore, by Theorem D.0.14, a subsequence converges<br />

to a point of ∏ p<br />

i=1 [a i,b i ]. By Theorem D.0.12, the original sequence converges.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!