Scribd
Upload
24 views3 pages

Example Set Operation

Uploaded by

Caroline Balila
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
24 views3 pages

Example Set Operation

Uploaded by

Caroline Balila
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 310 -- SETS Worksheet (Ch 6)

RELATIONSHIPS:

 Inclusion (subset) 𝑨⊆𝑩 ⟺ [𝒙 ∈ 𝑨 ⇒ 𝒙 ∈ 𝑩]


 Equality 𝑨=𝑩 ⟺ 𝑨 ⊆ 𝑩 𝐚𝐧𝐝 𝑨 ⊇ 𝑩 (double inclusion)
⟺ [𝒙 ∈ 𝑨 ⟺ 𝒙 ∈ 𝑩]
 Proper Subset 𝑨⊂𝑩 ⟺ 𝑨 ⊆ 𝑩 𝐚𝐧𝐝 𝑨 ≠ 𝑩
⟺ [(𝒙 ∈ 𝑨 => 𝒙 ∈ 𝑩) 𝐚𝐧𝐝 (there exists some 𝒂 ∈ 𝑩 − 𝑨)]

OPERATIONS on Sets (new sets from old):

 Set Intersection: 𝑨 ∩ 𝑩 = 𝒙 𝒙 ∈ 𝑨 𝐚𝐧𝐝 𝒙 ∈ 𝑩}


 Set Union: 𝑨 ∪ 𝑩 = 𝒙 𝒙 ∈ 𝑨 𝐨𝐫 𝒙 ∈ 𝑩}
 Set Difference: 𝑨 − 𝑩 = 𝒙 𝒙 ∈ 𝑨 𝐚𝐧𝐝 𝒙 ∉ 𝑩}
 Set Complement: 𝑨𝒄 = 𝑼 − 𝑨 = 𝒙 ∈ 𝑼 𝒙 ∉ 𝑨 } (𝑈 is some universal set containing A)
 POWER Set: 𝓟 𝑨 = 𝑿 𝑿 ⊆ 𝑨}. (the set whose elements are all the subsets of A)
Note that by definition of 𝒫 𝐴 , 𝑋 ⊆ 𝐴 <=> 𝑋 ∈ 𝒫 𝐴
 Cartesian Product: 𝑨 × 𝑩 = (𝒙, 𝒚) 𝒙 ∈ 𝑨 𝐚𝐧𝐝 𝒚 ∈ 𝑩
The set of all ordered pairs (x,y), with x an element of A and y an element of B.
(this is in Ch 7, section 7.7)

Venn Diagrams (useful to visualize sets, but please don’t use in proofs!)

U U U U

A A B A
B B A B

AUB 𝐴∩𝐵 A-B Ac

EMPTY SET: The empty set is the set with no elements: 𝝓 = (a.k.a. the null set)

Exercise: Prove that the empty set is a subset of any set.

Proof:

By definition of subset, ⊆ 𝑨 if and only if 𝒙 ∈ {} ⟹ 𝒙 ∈ 𝑨. Since the empty set has no elements, the hypothesis of
the implication is always false, so the implication is true (“vacuously true”, i.e. true because nothing satisfies the
hypothesis).
Examples:

1) Let 𝐴 = 𝑎, 𝑏, 𝑐, 𝑑, 𝑒 and 𝐵 = 𝑥, 𝑦, 𝑎, 𝑧, 𝑐 .

𝐴 ∩ 𝐵 = {𝑎, 𝑐}

𝐴 ∪ 𝐵 = {𝑎, 𝑏, 𝑐, 𝑑, 𝑒, 𝑥, 𝑦, 𝑧}

𝐴 − 𝐵 = {𝑏, 𝑑, 𝑒}
𝑐
2) −3, 0 = −∞, −3 ∪ (0, ∞)

3) If A={1,2,3} list all the elements of the following sets:

 𝒫 𝐴 = { {}, 𝟏 , 𝟐 , 𝟑 , 𝟏, 𝟐 , 𝟏, 𝟑 , 𝟐, 𝟑 , 𝟏, 𝟐, 𝟑 }

 𝐴 × 𝐴 = { 1,1 , 1,2 , 1,3 , 2,1 , 2,2 , 2,3 , 3,1 , 3,2 , 3,3 }

It’s important to distinguish between subsets and elements, and to use the correct notation!

Example: Suppose A={1,2,3} . Which of the following are correct statements? The boxed ones are correct.

1= 1 , 1∈𝐴, 1 ⊆ 𝐴, {1} ⊆ 𝐴 , {1,2} ⊆ 𝐴 , {1,2} ∈ 𝐴,

1,2 ∈ 𝒫 𝐴 , 1,2 ⊈ 𝒫 𝐴 , { 1,2 } ∈ 𝒫 𝐴 , { 1,2 } ⊆ 𝒫 𝐴

You should recall the following results, and be able to prove them:

Theorem 6.3.4 (this theorem is in the textbook)

(i) Associativity of set union and intersection:

𝑨∪ 𝑩∪𝑪 = 𝑨∩ 𝑩∩𝑪 =

(ii) Commutativity: 𝑨∪𝑩= 𝑨∩𝑩=

(iii) Distributivity: 𝑨∪ 𝑩∩𝑪 = 𝑨∪𝑩 ∩ 𝑨∪𝑪 , 𝑨∩ 𝑩∪𝑪 =

𝒄 𝒄
(iv) De Morgan Laws: 𝑨∪𝑩 = 𝑨∩𝑩 =

(v) Complementation: 𝑨 ∪ 𝑨𝒄 = 𝑨 ∩ 𝑨𝒄 =

𝒄
(vi) Double complement: (𝑨𝒄 ) =
Sample Proofs:

(iii) Use logical arguments from the definitions to show: 𝐴 ∪ 𝐵 ∩ 𝐶 = 𝐴 ∪ 𝐵 ∩ 𝐴 ∪ 𝐶


Remark: Since we need to show that two sets are equal, we need to show double inclusion, generally we need to do
two separate proofs (unless the argument can be written clearly & correctly using " ⟺ " at every step).

Proof: We’ll show the set equality by proving both set inclusions:

1) “⊆ ": Show that 𝐴 ∪ 𝐵 ∩ 𝐶 ⊆ 𝐴 ∪ 𝐵 ∩ 𝐴 ∪ 𝐶 , i.e. that 𝑥 ∈ 𝐴 ∪ 𝐵 ∩ 𝐶 ⟹ 𝑥 ∈ 𝐴 ∪ 𝐵 ∩ 𝐴 ∪ 𝐶 .

𝑥 ∈ 𝐴 ∪ 𝐵 ∩ 𝐶 ⟺ 𝒙 ∈ 𝐴 𝐨𝐫 𝒙 ∈ 𝐵 ∩ 𝐶 (by definition of union)

Case 1: If 𝒙 ∈ 𝐴, then certainly 𝑥 ∈ 𝐴 ∪ 𝐵 and 𝑥 ∈ 𝐴 ∪ 𝐶 (by definition of union applied twice),


so 𝑥 ∈ 𝐴 ∪ 𝐵 ∩ 𝐴 ∪ 𝐶 (by definition of intersection).
Case 2: If 𝒙 ∈ 𝐵 ∩ 𝐶, then 𝒙 ∈ 𝐵 and 𝒙 ∈ 𝐶 (by definition of intersection), so 𝑥 ∈ 𝐴 ∪ 𝐵 and 𝑥 ∈ 𝐴 ∪ 𝐶
(by definition of union, applied twice). Hence 𝑥 ∈ 𝐴 ∪ 𝐵 ∩ 𝐴 ∪ 𝐶 , by definition of intersection.

In all possible cases, 𝑥 ∈ 𝐴 ∪ 𝐵 ∩ 𝐴 ∪ 𝐶 , which proves the desired set inclusion.

2) “⊇ ": Show that 𝐴 ∪ 𝐵 ∩ 𝐶 ⊇ 𝐴 ∪ 𝐵 ∩ 𝐴 ∪ 𝐶 , i.e. that 𝑥 ∈ 𝐴 ∪ 𝐵 ∩ 𝐴 ∪ 𝐶 ⟹ 𝑥 ∈ 𝐴 ∪ 𝐵 ∩ 𝐶 .

𝑥 ∈ 𝐴 ∪ 𝐵 ∩ 𝐴 ∪ 𝐶 ⟺ 𝑥 ∈ 𝐴 ∪ 𝐵 𝑎𝑛𝑑 𝐴 ∪ 𝐶 (by definition of intersection)

⟺ 𝑥 ∈ 𝐴 𝑜𝑟 𝑥 ∈ 𝐵 𝑎𝑛𝑑 𝑥 ∈ 𝐴 𝑜𝑟 𝑥 ∈ 𝐶 (by definition of union)

Case 1: If 𝑥 ∈ 𝐴, then 𝑥 ∈ 𝐴 ∪ 𝐵 ∩ 𝐶 by definition of union.

Case 2: If 𝑥 ∉ 𝐴, then, since it is true that [ 𝑥 ∈ 𝐴 𝑜𝑟 𝑥 ∈ 𝐵 and 𝑥 ∈ 𝐴 𝑜𝑟 𝑥 ∈ 𝐶 ], it must be that 𝑥 ∈ 𝐵 and


𝑥 ∈ 𝐶 (by definition of “or” & “and”), so 𝑥 ∈ 𝐵 ∩ 𝐶 (by definition of intersection). Hence, in this case as well,
𝑥 ∈𝐴∪ 𝐵∩𝐶 .

In all possible cases, 𝑥 ∈ 𝐴 ∪ 𝐵 ∩ 𝐴 ∪ 𝐶 ⟹ 𝑥 ∈ 𝐴 ∪ 𝐵 ∩ 𝐶 , which proves the desired reverse set inclusion.

QED

 You try: prove the counterpart statement: 𝐴 ∩ 𝐵 ∪ 𝐶 = 𝐴 ∩ 𝐵 ∪ (𝐴 ∩ 𝐶)


𝑐
(iv) Use truth tables to prove 𝐴 ∪ 𝐵 = 𝐴𝑐 ∩ 𝐵𝑐

𝒄
𝒙∈𝑨 𝒙∈𝑩 𝒙∈𝑨∪𝑩 𝒙∈ 𝑨∪𝑩 𝒙 ∈ 𝑨𝒄 𝒙 ∈ 𝑩𝒄 𝒙 ∈ 𝑨𝒄 ∩ 𝑩 𝒄

T T T F F F F

T F T F F T F

F T T F T F F

F F F T T T T
Proposition 6.2.4: 𝑨 ∪ 𝑩 = 𝑨 ∩ 𝑩 ∪ 𝑨 − 𝑩 ∪ (𝑩 − 𝑨)

 Prove it by truth tables (in text) and by logical arguments (exercise)

You might also like