Scribd
Upload
35 views3 pages

305 Solutions 01

This document contains solutions to problems on a math assignment. Problem 2 proves that (Ac)c = A by showing double set complementation yields the original set. Problem 3 discusses proofs of two distribution laws. Part (a) outlines one proof, while part (b) provides an alternative proof using de Morgan's laws and the result from Problem 2. Problem 4 proves the equality of sets involving set differences and intersections using distribution laws. Problem 5 proves the complement of the union of set complements over an index set J equals the intersection of the complements of the sets.

Uploaded by

Fatima Ezzahra Ghennami
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
35 views3 pages

305 Solutions 01

This document contains solutions to problems on a math assignment. Problem 2 proves that (Ac)c = A by showing double set complementation yields the original set. Problem 3 discusses proofs of two distribution laws. Part (a) outlines one proof, while part (b) provides an alternative proof using de Morgan's laws and the result from Problem 2. Problem 4 proves the equality of sets involving set differences and intersections using distribution laws. Problem 5 proves the complement of the union of set complements over an index set J equals the intersection of the complements of the sets.

Uploaded by

Fatima Ezzahra Ghennami
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Math 305 Fall 2011

Solutions to Assignment #1

2. To prove that (Ac )c = A, we need to verify the two containments (Ac )c ⊆ A and A ⊆ (Ac )c .
We will begin by showing that (Ac )c ⊆ A. Suppose that x ∈ (Ac )c . By definition of complement,
this means that x ∈/ (Ac ). But this says precisely that x is not in Ac which, by the definition of
complement again, means exactly that x is in A. In other words, x ∈ A. To show the containment
A ⊆ (Ac )c , assume that x ∈ A. By the definition of complement, this means that x is not in Ac .
/ Ac so that x ∈ (Ac )c .
In other words, x ∈

3. (a) The proof of the distribution law A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C) is outlined in Practice


Problem 5.14 on page 43. The solution written out in full detail is on page 46.

(b) One proof that A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C) is to follow the same strategy as in (a) by


showing the two required containments. Another proof that A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)
can be given using de Morgan’s law for two sets (as proved in class on September 8, 2011, or see
Problem #5 below) and the result of Problem #2. That is, if we replace A by Ac and B by B c
and C by C c in part (a), then we obtain

Ac ∪ (B c ∩ C c ) = (Ac ∪ B c ) ∩ (Ac ∪ C c ).

Taking complements of both sides gives

[Ac ∪ (B c ∩ C c )]c = [(Ac ∪ B c ) ∩ (Ac ∪ C c )]c

which by de Morgan’s law is equivalent to

(Ac )c ∩ (B c ∩ C c )c = (Ac ∪ B c )c ∪ (Ac ∪ C c )c .

Using de Morgan’s law three more times shows this is equivalent to

(Ac )c ∩ [(B c )c ∪ (C c )c ] = [(Ac )c ∩ (B c )c ] ∪ [(Ac )c ∩ (C c )c ].

Finally, Problem #2 implies this is equivalent to

A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)

as required.

4. Recall that the definition of A \ B as given in class was

A \ B = {x : x ∈ A and x ∈
/ B}.

Notice, however, that this is exactly the same as the set A ∩ B c . Therefore,

(A \ B) ∪ (A ∩ B) ∪ (B \ A) = (A ∩ B c ) ∪ (A ∩ B) ∪ (B ∩ Ac ).

We are now going to use the distribution law twice. Observe first that

(A ∩ B c ) ∪ (A ∩ B) = A ∩ (B ∪ B c ) = A.

1
Thus, we can substitute this expression into the previous expression to conclude that

(A ∩ B c ) ∪ (A ∩ B) ∪ (B ∩ Ac ) = A ∪ (B ∩ Ac ).

The distribution law now implies that

A ∪ (B ∩ Ac ) = (A ∪ B) ∩ (A ∪ Ac ) = A ∪ B.

In summary, we have shown that

(A \ B) ∪ (A ∩ B) ∪ (B \ A) = A ∪ B

as required.

5. In order to prove that  c


[ \
 Aj  = (Acj )
j∈J j∈J

we will show the two separate containments. To begin, suppose that


 c
[
x∈ Aj 
j∈J

so that by the definition of complement we conclude that


[
x∈/ Aj .
j∈J

But this is the same as saying that x does not below to any one of the sets Aj for j ∈ J. That is,
x ∈ (Aj )c for every j ∈ J so by the definition of intersection, we conclude
\
x∈ (Acj ).
j∈J

On the other hand, if \


x∈ (Acj ),
j∈J

then x ∈ Acj for every j ∈ J which by the definition of complement means that x ∈
/ Aj for any
j ∈ J. But, by the definition of union, this is exactly the same as saying that
[
x∈ / Aj .
j∈J

In other words,  c
[
x∈ Aj 
j∈J

and the proof is complete.

2
6. I am just going to give the answers. You should still prove that the two sets are equal.
[ \
(a) B = [1, 2] and B = {1}.
B∈B B∈B
[ \
(b) B = (1, 2) and B = ∅. Note that (1, 1) = ∅.
B∈B B∈B
[ \
(c) B = [2, ∞) and B = {2}.
B∈B B∈B
[ \
(d) B = [0, 5) and B = [2, 3].
B∈B B∈B

You might also like