Perfect Sets in R^k are uncountable - Issue/problem 2

  • Context: MHB 
  • Thread starter Thread starter Math Amateur
  • Start date Start date
  • Tags Tags
    Sets
Click For Summary

Discussion Overview

The discussion revolves around the proof of Theorem 2.43 from Walter Rudin's "Principles of Mathematical Analysis," which asserts that every non-empty perfect set in $$\mathbb{R}^k$$ is uncountable. Participants express difficulties in understanding the proof, particularly regarding the selection of points and the conditions for constructing neighborhoods.

Discussion Character

  • Technical explanation
  • Conceptual clarification
  • Debate/contested

Main Points Raised

  • Peter questions how the proof can claim the existence of a neighborhood $$V_{n+1}$$ satisfying specific conditions based on the property that every point of $$P$$ is a limit point of $$P$$.
  • Some participants clarify that the points $$x_{1}, x_{2},...$$ are not arbitrarily selected but are assumed to be all the points in a countable set, which is a key aspect of the proof.
  • One participant explains that being a limit point implies the existence of another point $$x_{n+1}$$ in $$V_{n}$$, and provides a method to construct a neighborhood that meets the required conditions.
  • Peter expresses a preference for Stephen Abbott's "Understanding Analysis," stating that it provides a clearer proof of the same theorem, which he finds more pedagogically effective.
  • Another participant agrees with Peter's assessment of Rudin's style, noting its conciseness and terseness, which may not be suitable for self-study.

Areas of Agreement / Disagreement

Participants generally agree on the challenges posed by Rudin's proof and express differing opinions on the clarity of the text. However, there is no consensus on the best approach to understanding the proof, as some prefer Abbott's explanation while others defend Rudin's method.

Contextual Notes

Participants highlight the pedagogical challenges in Rudin's presentation, noting that the proof's reliance on the properties of limit points and the construction of neighborhoods may not be straightforward for all readers.

Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
I am reading Walter Rudin's book, Principles of Mathematical Analysis.

Currently I am studying Chapter 2:"Basic Topology".

I have a second issue/problem with the proof of Theorem 2.43 concerning the uncountability of perfect sets in $$R^k$$.

Rudin, Theorem 2.43 reads as follows:View attachment 3805In the above proof we read:

"Suppose $$V_n$$ has been constructed so that $$V_n \cap P$$ is not empty. Since every point of $$P$$ is a limit point of P, there is a neighbourhood $$V_{n+1}$$ such that

(i) $$\overline{V}_{n+1} \subset V_n
$$

(ii) $$x_n \notin \overline{V}_{n+1}
$$

(iii) $$V_{n+1} \cap P$$ is not empty

... ... "I do not understand how the fact that every point of $$P$$ is a limit point of $$P$$ allows us to claim that there is a $$V_{n+1}$$ such that the above 3 conditions hold ... indeed the whole thing is a bit mysterious, since there is no given process for selecting the points $$x_1, x_2, x_3$$, ... and so $$x_{n+1}$$ may be a considerable distance from $$x_n$$, making it difficult for $$\overline{V}_{n+1} \subset V_n $$ to hold ...

Can someone please explain how the above fact follows ... ...

Peter
 
Last edited:
Physics news on Phys.org
Hi Peter,

The points $x_{1},x_{2},...$ are not selected, Rudin is supposing that the set is countable, so they are all the points.

Being a limit point means that for any neighborhood of $x_{n}$ there are at least one point different from it. In particular, there exist another point that we will call $x_{n+1}$ in $V_{n}$, now we can take a neighborhood of this point satisfying this three conditions, for example doing the following:

As soon as $x_{n+1}\in V_{n}$(open) there exists $\delta>0$ such that $B(x_{n+1},2\delta)\subset V_{n}$
Let $\epsilon=\dfrac{|x_{n}-x_{n+1}|}{2}$, now the ball centered in $x_{n+1}$ with radius $min \{\delta ,\epsilon\}$ clearly satisfies all conditions.
 
Fallen Angel said:
Hi Peter,

The points $x_{1},x_{2},...$ are not selected, Rudin is supposing that the set is countable, so they are all the points.

Being a limit point means that for any neighborhood of $x_{n}$ there are at least one point different from it. In particular, there exist another point that we will call $x_{n+1}$ in $V_{n}$, now we can take a neighborhood of this point satisfying this three conditions, for example doing the following:

As soon as $x_{n+1}\in V_{n}$(open) there exists $\delta>0$ such that $B(x_{n+1},2\delta)\subset V_{n}$
Let $\epsilon=\dfrac{|x_{n}-x_{n+1}|}{2}$, now the ball centered in $x_{n+1}$ with radius $min \{\delta ,\epsilon\}$ clearly satisfies all conditions.
Hi Fallen Angel ... thanks for your help ...

Peter
 
Peter said:
Hi Fallen Angel ... thanks for your help ...

Peter

Hi all,

I understand that the text: Principles of Mathematical Analysis by Walter Rudin is highly regarded, but at times I feel the proofs are stated in less than effective and clear ways pedagogically speaking anyway ... . Indeed In particular I had considerable difficulty in following the proof of Theorem 2.43 that every non-empty perfect set in $$\mathbb{R}^k$$ is uncountable - as indicated in the above post ...

Given this difficulty I went to the text, Understanding Analysis by Stephen Abbott and found a proof of the above theorem in $$\mathbb{R}$$. The proof is essentially the same as the proof in $$\mathbb{R}^k$$ and Abbott's text makes the proof strategy much clearer.

I am producing Abbott's proof for the interests of MHB members:

View attachment 3821
View attachment 3822
https://www.physicsforums.com/attachments/3823

I must say that on this Theorem at least, Abbott gives a VERY clear explanation.Peter
 
Peter said:
Hi all,

I understand that the text: Principles of Mathematical Analysis by Walter Rudin is highly regarded, but at times I feel the proofs are stated in less than effective and clear ways pedagogically speaking anyway ... . Indeed In particular I had considerable difficulty in following the proof of Theorem 2.43 that every non-empty perfect set in $$\mathbb{R}^k$$ is uncountable - as indicated in the above post ...

Given this difficulty I went to the text, Understanding Analysis by Stephen Abbott and found a proof of the above theorem in $$\mathbb{R}$$. The proof is essentially the same as the proof in $$\mathbb{R}^k$$ and Abbott's text makes the proof strategy much clearer.

I am producing Abbott's proof for the interests of MHB members:

View attachment 3821
View attachment 3822
https://www.physicsforums.com/attachments/3823

I must say that on this Theorem at least, Abbott gives a VERY clear explanation.Peter

This was one of the reasons why I didn't recommend Rudin's book as a main text for self-study (in response to one your threads in the chat room). Rudin's style is concise and at times very terse. More than a decade ago, when I was a college student, the text I used for analysis was a Dover book whose level is a bit higher than Rudin's, but suitable for independent study. I'm glad that Abbott's book is working for you.
 
Euge said:
This was one of the reasons why I didn't recommend Rudin's book as a main text for self-study (in response to one your threads in the chat room). Rudin's style is concise and at times very terse. More than a decade ago, when I was a college student, the text I used for analysis was a Dover book whose level is a bit higher than Rudin's, but suitable for independent study. I'm glad that Abbott's book is working for you.
Thanks for those comments Euge ... ...

Yes, your reasoning regarding Rudin was very accurate ...

Always glad to know your views and your advice ...

Thanks again ...

Peter
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 44 ·
2
Replies
44
Views
7K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 16 ·
Replies
16
Views
10K