Is There a Mistake in Rudin's Analysis Regarding Closed Sets?

  • Context: Graduate 
  • Thread starter Thread starter jessicaw
  • Start date Start date
  • Tags Tags
    Analysis Mistake
Click For Summary
SUMMARY

The discussion centers on the analysis of closed sets as presented in Rudin's work. It establishes that for a finite union of closed sets, the closure operation distributes, leading to the conclusion that the closure of the union of sets is equal to the union of their closures. However, this property fails for infinite unions, as demonstrated with the example of rational numbers. The participants clarify that while the inclusion of closures holds for finite unions, it does not extend to infinite unions, contradicting Rudin's claim.

PREREQUISITES
  • Understanding of closed sets in topology
  • Familiarity with closure operations in set theory
  • Knowledge of finite versus infinite unions
  • Basic concepts of real analysis, particularly from Rudin's "Principles of Mathematical Analysis"
NEXT STEPS
  • Study the properties of closure operations in topology
  • Explore the implications of finite versus infinite unions of sets
  • Review examples of closed sets and their closures in real analysis
  • Read Rudin's "Principles of Mathematical Analysis" for deeper insights into closed sets
USEFUL FOR

Mathematicians, students of topology, and anyone studying real analysis who seeks to understand the nuances of closed sets and their properties in different contexts.

jessicaw
Messages
54
Reaction score
0
Let [tex]B_n=\cup_{i=1}^n A_i[/tex].
[tex]\overline{B_n}[/tex] is the smallest closed subset containing [tex]B_n[/tex].
Note that
[tex]\cup_{i=1}^n \overline{A_i}[/tex] is a closed subset containing [tex]B_n[/tex].
Thus,
[tex]\overline{B_n}\supset \cup_{i=1}^n \overline{A_i}[/tex]Isn't the truth should be that
[tex]\overline{B_n}[/tex] is the smallest?
How come claim that
[tex]\cup_{i=1}^n \overline{A_i}[/tex] is even smaller?
 
Physics news on Phys.org
I agree; the fact that the union of closures is a closed subset containing B_n, combined with minimality of cl(B_n), gives
[tex]\overline{B_n}\subset \cup_{i=1}^n \overline{A_i}.[/tex]
In fact the reversed inclusion
[tex]\overline{B_n}\supset \cup_{i=1}^n \overline{A_i}[/tex]
also holds if the union is finite (i.e. the closure operation distributes over finite unions), but not if the union is infinite. But that requires a different argument, so I don't know what Rudin is doing (I don't have his book).
 
For example, we could argue as follows:
[tex]A_i\subseteq \overline{A_i}\ \forall i[/tex]

[tex]\Rightarrow \bigcup_i A_i\subseteq \bigcup_i \overline{A_i}[/tex]

[tex]\Rightarrow \overline{\bigcup_i A_i}\subseteq \overline{\bigcup_i \overline{A_i}}[/tex]

A finite union of closed sets is closed, so if I is finite then

[tex]\overline{\bigcup_i \overline{A_i}}=\bigcup_i \overline{A_i}[/tex]

which proves the reversed inclusion

[tex]\overline{\bigcup_i A_i}\subseteq \bigcup_i \overline{A_i}.[/tex]

However, an infinite union of closed sets is not necessarily closed, making this argument stop working. Indeed, consider

[tex]I=\mathbb{Q},\ A_q=\{q\}.[/tex]

Then

[tex]\overline{A_q}=\overline{\{q\}}=\{q\}[/tex].

Hence

[tex]\overline{\bigcup_{q\in I}A_q}=\overline{\mathbb{Q}}=\mathbb{R}[/tex]

[tex]\bigcup_{q\in I}\overline{\{q\}}=\mathbb{Q}.[/tex]
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
4K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K