College of Information Technology

First Semester, A.Y. 2024-2025

MODULE 3
Set Operations

Course Description: Discrete Mathematics

Introduction

This module entitled Set Operations will explore the basic operations that can be performed on sets, including
union, intersection, difference, complement, and set identities. Understanding these operations is crucial as they form
the basis for various applications in mathematics, computer science, and everyday problem-solving.

Date and Time Allotment

(3 hours)
I. Objectives

At the end of the end of this module, students should be able to:
a. Identify the different set operations.
b. Explains the theory of set operations.
c. Apply the theory of set operations.

II. Lecture
Set Operations

I. Union of Sets - The union of sets A and B (denoted by A∪B) is the set of elements which are in A, in B, or in both A and
B. Hence, A∪B={x|x∈A OR x∈B}.
Example:
A = {10,11,12,13} B = {13,14,15} then,
A∪B = {10,11,12,13,14,15}
(The common element occurs only once)

II. Set Intersection - The intersection of sets A and B (denoted by A∩B) is the set of elements which are in both A and B.
Hence, A∩B={x|x∈A AND x∈B}.
Example:
If A = {2, 5, 7} and B = {1, 2, 5, 8}, then
A∪B = {2, 5}

III. Difference of Sets/ Relative Complement - The set difference of sets A and B (denoted by A–B) is the set of elements
which are only in A but not in B. Hence, A−B={x|x∈A AND x∉B}
Example:
A={10,11,12,13}
B={13,14,15}

(A−B) = {10,11,12}

(B−A)={14,15}
Prepared by:
CHARISH L. APELADO
Instructor
 Here, we can see (A−B)≠(B−A)

IV. Complement of a Set - The complement of a set A (denoted by A′) is the set of elements which are not in set A.
Hence, A′={x|x∉A}. More specifically, A′=(U−A) where U is a universal set which contains all objects.
Examples:
If A={x|x belongstosetofoddintegers} then A′={y|y doesnotbelongtosetofoddintegers}

U = 0, 1, 2, 3, 4, 5, 6, 7, 8, 9
P = 3, 6, 9
Q = 2, 4, 6, 8

P’ = 0, 1, 2, 4, 5, 7, 8
Q’ = 0, 1, 3, 5, 7, 9
SET IDENTITIES
One way of proving set identities is using three different methods. These methods are presented to illustrate that there are
often many different approaches to the solution of a problem.
One way of proving that two sets are equal is to show that one of the sets is a subset of the other and vice versa. This
type of proof is illustrated by establishing the second of the De Morgan’s laws.
Here are the lists of Set Identities:

Set Identities
Identity Name
A ∪∅= A Identity Laws
A ∩ B= A
A ∪ U=U Domination Laws
A ∩∅ =∅
A ∪ A=A Idemponent Law
A ∩ A=A
A ∪ B=B ∪ A Commutative Laws
A ∩ B=B ∩ A
A ∪ ( B∪ C )= ( A ∪ B ) ∪ C Associative Laws
A ∩ ( B ∩C ) =( A ∩B ) ∩C
A ∩ ( B ∪ C )= ( A ∩ B )( A ∩C ) Distributive Laws
A U ( B ∩C )=( A ∪ B)( A ∪ C )

III. Application/Activity
Instruction: Given the sets provided, perform various set operations to find the results.
1. Let A = {1, 2, 3, 4, 5} and B = {0, 3, 6}. Find

Prepared by:
CHARISH L. APELADO
Instructor
 a. A ∪ B
b. A – B
c. A ∩ B
d. B – A
2. Let A = {0, 2, 4, 6, 8, 10}, B = {0, 1, 2, 3, 4, 5, 6}, C = {4, 5, 6, 7, 8, 9, 10}. Find
a. A ∩ B∩ C
b. ( A ∪ B ) ∩ C
c. A ∪ B∪ C
d. ( A ∩ B)∪C

IV. Assessment
Direction. Using the provided sets, carry out the specified set operations to determine the results.
Given the sets U = {1,2,3,4,5,6} S = {2,4,6} T = {1,2,4} V = {4,5,6}.
1. Prove that S ∪ U=U
2. Prove that T ∪V =V ∪ T
3. 𝑆 ∪ (𝑇 ∩ 𝑉)
4. (𝑆 ∪ 𝑇) ∩ 𝑉
5. (𝑆 ∪ 𝑇)′
6. (𝑉 ∪ 𝑆)′
7. 𝑆 ∩ (𝑉 ∩ 𝑇′)
8. 𝑆′ ∩ 𝑉′
9. 𝑆′ ∪ 𝑇 ∩ 𝑉′
10. 𝑇 ∪ 𝑉′ ∪ 𝑆′

V. Other References
 Jonathan B Cabero et al., (2010), Discrete Mathematics
 Maribeth Fernandez (2010), Discrete Mathematics
 [Link]

Prepared by:
CHARISH L. APELADO
Instructor