Exercise 3.2.9

[De Morgan’s Laws] A proof for De Morgan’s Laws in the case of two sets is outlined in Exercise 1.2.5. The general argument is similar.

(a)
Given a collection of sets { E λ : λ Λ } , show that ( λ Λ E λ ) c = λ Λ E λ c  and  ( λ Λ E λ ) c = λ Λ E λ c

(b)
Now, provide the details for the proof of Theorem 3.2.14.

Answers

(a)
If x ( λ Λ E λ ) c then x λ Λ E λ meaning x E λ for all λ Λ implying x E λ c for all λ Λ and so finally x λ Λ E λ c . This shows ( λ Λ E λ ) c λ Λ E λ c

To show the reverse inclusion suppose x λ Λ E λ c then x E λ for all λ meaning x λ Λ E λ and so the reverse inclusion

λ Λ E λ c ( λ Λ E λ ) c

Is true, completing the proof.

(b)
Let F = F 1 F 2 , if x n F and x = lim x n . Let ( x n k ) be a subsequence of ( x n ) fully contained in F 1 or F 2 . the subsequence ( x n k ) must also converge to x , meaning x is in F 1 or F 2 , the rest is by induction.

Now let F = λ Λ F λ

F c = λ Λ F λ c

Each F λ c is open by Theorem 3.2.13, thus Theorem 3.2.3 (ii) implies F c is open, and so ( F c ) c = F is closed.

User profile picture
2022-01-27 00:00
Comments