Rudin Theorem 2.41

  • Thread starter Dschumanji
  • Start date
  • #1
153
1

Main Question or Discussion Point

I am currently reading Principles of Mathematical Analysis by Walter Rudin. I am a bit confused with theorem 2.41. He is trying to show at one point that if E is a set in ℝk and if every infinite subset of E has a limit point in E, then E is closed and bounded.

The proof starts by assuming that E is not bounded. He then says that if this is the case, then E contains points xn such that |xn| > n for each positive integer n. He then constructs a set S that contains all these points xn. Next he says "The set S ... is infinite and clearly has no limit point in ℝk..."

I don't see how it is obvious that there is no limit point in ℝk.
 
Last edited:

Answers and Replies

  • #2
jgens
Gold Member
1,581
50
I don't see how it is obvious that there is no limit point in ℝk.
Suppose S has a limit point and consider the ball of radius 1 about this point. Does it contain infinitely many elements of S?
 
  • #3
153
1
Suppose S has a limit point and consider the ball of radius 1 about this point. Does it contain infinitely many elements of S?
I see where you are heading. I came up with a proof using a similar idea:

Let p [itex]\in[/itex] ℝk and suppose that it is a limit point of S.

There exists a positive integer n such that n ≤ |p| < n+1. Let C be the set of all y [itex]\in[/itex] ℝk such that |y| < n+1. C is an open set and p [itex]\in[/itex] C, so there exists a neighborhood N around p such that N [itex]\subset[/itex] C.

Due to the construction of S, there can be at most n points of S in C and thus there can be at most n points in N. Since n is a finite number, p cannot be a limit point (theorem 2.20 of Rudin).

This shows there are no limit points in ℝk and thus no limit points in E. Therefore E must be bounded.

I believe that this proof is correct, but it hardly seems obvious.
 
Last edited:
  • #4
jgens
Gold Member
1,581
50
I believe that this proof is correct, but it hardly seems obvious.
Your proof is fine. Try not to worry about people like Rudin claiming that things are obvious. The more you learn and the more you get a feel for a particular subject, the more obvious things become.
 
  • #5
153
1
Your proof is fine. Try not to worry about people like Rudin claiming that things are obvious. The more you learn and the more you get a feel for a particular subject, the more obvious things become.
Thanks for the support!

It seems Rudin likes to use proof by intimidation more than anything. :tongue:
 
  • #6
jgens
Gold Member
1,581
50
It seems Rudin likes to use proof by intimidation more than anything.
This is actually something I like about Rudin. I always took it as a challenge to understand the material well enough to get why Rudin claimed something was obvious and this helped me learn the material properly. Just keep filling in all the details he leaves out and it will all seem obvious to you soon enough.
 

Related Threads on Rudin Theorem 2.41

  • Last Post
Replies
2
Views
2K
  • Last Post
Replies
1
Views
3K
  • Last Post
Replies
11
Views
2K
  • Last Post
Replies
5
Views
2K
  • Last Post
Replies
2
Views
3K
  • Last Post
Replies
5
Views
4K
Replies
3
Views
1K
Replies
10
Views
3K
Replies
3
Views
2K
Replies
7
Views
3K
Top