Scribd
Upload
78 views2 pages

A B C A B A C: Math 2534 Quiz: Set Theory Answer Key

This document contains the answer key for a quiz on set theory. It provides proofs for 4 statements using concepts of set theory, such as union, intersection, difference, complements and algebraic properties. The proofs use a formal logical argument structure with steps showing elements are members of particular sets based on the set operations and properties.

Uploaded by

Zhi Chin
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
78 views2 pages

A B C A B A C: Math 2534 Quiz: Set Theory Answer Key

This document contains the answer key for a quiz on set theory. It provides proofs for 4 statements using concepts of set theory, such as union, intersection, difference, complements and algebraic properties. The proofs use a formal logical argument structure with steps showing elements are members of particular sets based on the set operations and properties.

Uploaded by

Zhi Chin
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/ 2

Math 2534 Quiz: Set Theory

ANSWER KEY

1. Use element argument to prove the following:


For all sets A , B , and C ,
A ∪ ( B ∩ C ) = ( A ∪ B) ∩ ( A ∪ C ) .
Proof:
Let A , B , and C be sets. We need to show that:
1) A ∪ ( B ∩ C ) ⊆ ( A ∪ B ) ∩ ( A ∪ C ) AND
2) ( A ∪ B) ∩ ( A ∪ C ) ⊆ A ∪ ( B ∩ C ) .
1) Let x ∈ A ∪ ( B ∩ C ).
x ∈ A ∪ (B ∩ C) ⇒ x ∈ A ∨ x ∈ (B ∩ C) by definition of union
⇒ x ∈ A ∨ [x ∈ B ∧ x ∈ C] by definition of intersection
⇒ [ x ∈ A ∨ x ∈ B] ∧ [ x ∈ A ∨ x ∈ C ] by distributive law of logic
⇒ x ∈ ( A ∪ B) ∧ x ∈ ( A ∪ C ) by definition of union
⇒ x ∈ ( A ∪ B) ∩ ( A ∪ C ) by definition of intersection
So A ∪ ( B ∩ C ) ⊆ ( A ∪ B) ∩ ( A ∪ C ) .
2) Since we can reverse each step in the above argument, we may assume that
if x ∈ ( A ∪ B ) ∩ ( A ∪ C ) , then x ∈ A ∪ ( B ∩ C ).
Now that we have shown both 1) and 2), by the definition of set equality,
A ∪ ( B ∩ C ) = ( A ∪ B) ∩ ( A ∪ C ) .

Use algebra to prove the next 3 statements.

2. For all sets A , B , and C ,


( A − B) − C = A − ( B ∪ C ) .
Proof:
Let A , B , and C be sets.
( A − B) − C = ( A − B) ∩ C C by set difference law
= (A ∩ B ) ∩ C
C C
by set difference law
= A ∩ (B C ∩ C C ) by associative law
= A ∩ (B ∪ C)C by DeMorgan’s law
= A − ( BUC ) by set difference law
So ( A − B) − C = A − ( B ∪ C ) .

1
3. For all sets A and B ,
( B C ∪ ( B C − A))C = B .
Proof:
Let A and B be sets.
( B C ∪ ( B C − A)) C = ( B C ∪ ( B C ∩ A C )) C by set difference law
= (B C )C by absorption law
=B by double complement law
So ( B C ∪ ( B C − A))C = B .

4. For all sets A and B ,


A − ( A ∩ B) = A − B .
Proof:
Let A and B be sets.
A − ( A ∩ B) = A ∩ ( A ∩ B) C by set difference law
= A ∩ (A ∪ B )
C C
by DeMorgan’s law
= ( A ∩ AC ) ∪ ( A ∩ B C ) by distributive law
= φ ∪ (A ∩ BC ) by complement law
= A ∩ BC by identity law
= A− B by set difference law
So A − ( A ∩ B) = A − B .

You might also like