Exercise 2.3 (De Morgan's Laws)

Let (An)n≥1 be a sequence of sets. Show that

1.
(⋂ ⁡ n=1∞An) c = ⋃ ⁡ n=1∞Anc
2.
(⋃ ⁡ n=1∞An) c = ⋂ ⁡ n=1∞Anc.

Answers

First law.

  • If a ∈⋃ ⁡ n=1∞Anc, then a ∈ Anc for some n ∈ ℕ. In particular, a∉⋂ ⁡ n=1∞An, so we must have a ∈ (⋂ ⁡ n=1∞An)c. This shows that ⋃ ⁡ n=1∞Anc ⊆ (∩n=1∞An)c.
  • Pick an arbitrary a ∈ (⋂ ⁡ n∈ℕAn)c. By the laws of negation in logic, we see that there is no n ∈ ℕ such that a ∈ An. In other words, for all n ∈ ℕ we have a∉An. Therefore, a ∈⋃ ⁡ n∈ℕAnc.

Second law. Follows similarly.

User profile picture
2021-10-30 11:52
Comments