Exercise 1.2.13

For this exercise, assume Exercise ?? has been successfully completed.

(a)
Show how induction can be used to conclude that ( A 1 A 2 A n ) c = A 1 c A 2 c A n c

for any finite n N

(b)
It is tempting to appeal to induction to conclude ( i = 1 A i ) c = i = 1 A i c

but induction does not apply here. Induction is used to prove that a particular statement holds for every value of n N , but this does not imply the validity of the infinite case. To illustrate this point, find an example of a collection of sets B 1 , B 2 , B 3 , where i = 1 n B i is true for every n N , but i = 1 B i fails.

(c)
Nevertheless, the infinite version of De Morgan’s Law stated in (b) is a valid statement. Provide a proof that does not use induction.

Answers

(a)
1.2.5 Is our base case, Assume ( A 1 A n ) c = A 1 c A n c . We want to show the n + 1 case. Using associativity we have ( ( A 1 A n ) A n + 1 ) c = ( A 1 A n ) c A n + 1 c = ( A 1 c A n c ) A n + 1 c = A 1 c A n c A n + 1 c

(b)
B 1 = { 1 , 2 , } , B 2 = { 2 , 3 , } ,
(c)
First suppose x ( i = 1 A i ) c , then x i = 1 A i meaning x A i for some i , which is the same as x A i c for some i , meaning x i = 1 A i c . This shows ( i = 1 A i ) i = 1 A i c

Now suppose x i = 1 A i c meaning x A i for some i , which is the same as x i = 1 A i implying x ( i = 1 A i ) c . This shows inclusion the other way and completes the proof.

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