SET OPERATIONS

A universal set for a particular problem is a set that contains all the elements of all the sets in the
problem. It is often denoted by a capital U.

There are three set operations we will learn in this section.

 Complement: The complement of a set A, denoted by A’, is the set of all elements in the
universal set that are not in A.

 Union: The union of set A and B, denoted by A ∪ B, is the set containing all the elements that are
elements of set A or of set B or that are in both Sets A and B.
A  B = {x  x  A or x  B }

 Intersection: The intersection of sets A and B, denoted by A ∩ B, is the set containing all
of the elements that are common to both set A and set B.
A  B = {x  x  A and x  B }

 Disjoint Set: Sets that do not have any element in common. Two sets A and B are disjoint if and
only if A  B = .

 Set Difference: The difference of sets A and B is the set of all elements belonging to set A
but not to set B.
A – B = {x | x  A and x  B}

Venn Diagram
 Pictorial representation of set that was developed by the logician John Venn (1834 – 1923)
 The universal set U is represented by a rectangle and other sets of interest within the universal
set are depicted as circular regions.

The Venn diagram below illustrates the different set operations

Complement Union of Sets Intersection of Disjoint Sets Set Difference

of a Set Sets
Memory
Cues: “out of place” “combination” “common” “A only”

Example 1: Let U = {1,2,3,4,5}

A = {1,2,3}
B = {2,3,4}

Find
a. A’ c. A ∪ B
b. A ∩ B d. A – B

Answer:
a. A’ is all of the elements in the Universal set that are not in set A.
Answer: A’ = {4,5}

b. A ∩ B is asking for all of the elements that A and B have in common.

Answer: A ∩ B = {2,3}

c. A ∪ B is asking for all of the elements in A followed by all of the elements in B, then delete any
elements that are written twice. That is, A ∪ B = {1,2,3,2,3,4}
Answer: A ∪ B = {1,2,3,4}

d. A – B means removing the elements of set B in set A

A – B = {1,2,3} – {2,3,4}
What will be left in set A when the elements 2, 3 and 4 in set B are removed?
A – B = {1,2,3} (only 2 and 3 will be removed since there is no 4 in set A)
Answer: A – B = {1}
 The Venn Diagram below can also be used to get a better picture of the given sets.

A B

2
1 4
3
5
U

Example 2: Let U = {a,b,c,d,e,f}

A = {a,b,c}
B = {c,d,e}

Find a. A′ ∩ B b. A ∪ B′ c. B – A

Answer:

a. In A′ ∩ B, we need to find A’, which is all of the elements in U that are not in set A.
A’ = {d,e,f}
Now, getting the intersection of the two sets, A′ ∩ B = {d,e,f} ∩ {c,d,e}
Then, find what the two sets have in common.
Answer: A′ ∩ B = {d,e}

b. A ∪ B′
We need to find B’. B’ = {a,b,f}
Then, A ∪ B′ = {a,b,c} ∪ {a,b,f}
Combining all the 6 elements in a big set then delete the duplicates, i.e. {a,b,c,a,b,f} Answer:
A ∪ B′ = {a,b,c,f}

c. B – A means removing the elements of set A in set B

B – A = {c,d,e} – {a,b,c}

What will be left in set B when the elements a, b and c in set A are removed?
B – A = {c, d, e} (only c will be removed since there is no b and c in set A)

Answer: B – A = {d, e}

A B
d
a c
b e
f
U

Example 3: Let U = {a,b,c,d,e,f}

A = {a,b,c}
B = {c,d,e}
C = {d,e,f}

Find
a. A ∪ B ∪ C
b. (B ∪ C)′
c. A′ ∩ (B ∩ C′)

Answer:
a. A ∪ B ∪ C
We need to work from left to right. First, we will find A ∪ B.
A ∪ B = {a,b,c} ∪ {c,d,e}
A ∪ B = {a,b,c,c,d,e}
A ∪ B = {a,b,c,d,e}.
 Now, we can do the union C part.
We, can rewrite the problem as:
{a,b,c,d,e} ∪ C
{a,b,c,d,e} ∪ {d,e,f}
{a,b,c,d,e,d,e,f}

Answer: A ∪ B ∪ C = {a,b,c,d,e,f}

b. (B ∪ C)′
Work on the operations inside of the parenthesis first. So, we will first find B ∪ C.
B ∪ C = {c,d,e} ∪ {d,e,f}
B ∪ C = {c,d,e,d,e,f}
B ∪ C ={c,d,e,f}
Now, do the complement. The answer will be all the elements of set U except c,d,e,f.

Answer: (B ∪ C)′ = {a,b}

c. A′ ∩ (B ∩ C′)
Simplifying first the operation inside of the parenthesis,
(B ∩ C′) = {c,d,e} ∩ {a,b,c}
= {c}
Then,
A′ ∩ (B ∩ C′) = A’ ∩ {c}
= {d,e,f} ∩ {c}

Answer: ∅ (empty set)

Reference: Operations with Sets. Retrieved from

http://web.gccaz.edu/~johwd63181/MAT142/chapter_1/problems/section%201.4.pdf on August 30,
2018.