I'd like to show that [a,b] is sequentially compact. So I pick a sequence in [a,b] , say (xn).(adsbygoogle = window.adsbygoogle || []).push({});

case 1:range(xn) is finite

Then one term, say c is repeated infinitely often. Now we choose the subsequence that has infinitely many similar terms c. It converges to c.

case 2: range of (xn) is infinite.

I know I can prove this using the Bolzano Weierstrass theorem that says that every infinite bounded subset of R has a limit point. But in this case I'd have to prove the theorem. How?

Or I may Try and subdivide [a,b] in two parts and say that one part must contain infinitely many points of the range, and pick a term x_n1 in that part. Next I can choose x_n2 since I have infinitely many terms to choose from. And then continue to subdivide.... But then I'm stuck. I am not sure what I need to do from there or how exactly I need to write this down (how the subdivision part works exactly).

Thanks for your help.

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# [a,b] is sequentially compact

Loading...

Similar Threads for sequentially compact | Date |
---|---|

Conservation of compactness | Oct 30, 2015 |

Killing metric on compact simple groups | Jul 29, 2014 |

Non-compact form of an algebra. | Jul 2, 2013 |

Compact Operators on a Hilbert Space | Jul 12, 2010 |

**Physics Forums - The Fusion of Science and Community**