Let [tex] B_n=\cup_{i=1}^n A_i [/tex].(adsbygoogle = window.adsbygoogle || []).push({});

[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 Forums - The Fusion of Science and Community**

# A mistake from Rudin analysis?

Know someone interested in this topic? Share a link to this question via email,
Google+,
Twitter, or
Facebook

- Similar discussions for: A mistake from Rudin analysis?

Loading...

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