Compact implies Sequentially Compact

  • Thread starter Thread starter boopbeep
  • Start date Start date
  • Tags Tags
    Compact
boopbeep
Messages
2
Reaction score
0
Homework Statement [/b]
I need help proving that if X is a metric space and E a subset of X is compact, then E is sequentially compact.


I know I need to consider a sequence x_n in E, and I want to say that there is a point a in E and a radius r > 0 so that Br(a) [the ball of radius r with center a] contains x_k for infinitely many k's. If I show this, then I think I can conclude that any subsequence of x_n converges to a. Can someone please help?
 
Physics news on Phys.org
So... your conjecture is that every sequence in a compact metric space is actally convergent?
 
No, that is not one of the assumptions...my second paragraph in the problem description is a hint in the back of the textbook as to how to go about the problem.
 
If any subsequence of xn converges to a, then xn converges to a too. Rather, what you can conclude is a single subsequence of xn converges to a (which is what sequential compactness is about)
 
Office_Shredder said:
If any subsequence of xn converges to a, then xn converges to a too. Rather, what you can conclude is a single subsequence of xn converges to a (which is what sequential compactness is about)

This is not true- consider a_n=(-1)^n=1,-1,1,-1,1,-1,...

Then a_{2n}=1 is a subsequence that converges to 1, but a_n does not converge at all- nonetheless to 1.
 
Office_Shredder said:
If any subsequence of xn converges to a, then xn converges to a too. Rather, what you can conclude is a single subsequence of xn converges to a (which is what sequential compactness is about)

cfgauss36 said:
This is not true- consider a_n=(-1)^n=1,-1,1,-1,1,-1,...

Then a_{2n}=1 is a subsequence that converges to 1, but a_n does not converge at all- nonetheless to 1.


Office Shredder meant "if every subsequence". He chose the wrong word.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top