ITCC0123

DISCRETE MATHEMATICS
CONSUELO GUTIERREZ CRUZ
Associate Professor V
Department of Arts and Sciences
Bataan Peninsula State University
City of Balanga, Bataan
SET THEORY
Venn Diagram
Set Operations
Algebra of Sets
 VENN DIAGRAM
graphical representation of set. Named after
the English mathematician John Venn, who
introduced
𝕌
their use in
1881.

𝑨 𝑩
 VENN DIAGRAM
• In Venn diagrams the universal set U,
which contains all the objects under
consideration, is represented by a 𝕌
rectangle. Inside this rectangle, circles or
other geometrical figures are used to
represent sets.
• Sometimes points are used to represent 𝑨 𝑩
the particular elements of the set.
• Venn diagrams are often used to indicate
the relationships between sets.
 VENN DIAGRAM
Example:
Venn diagram for the Set of Vowels
𝑼
⚫ a
⚫ u ⚫ e
𝑽

⚫ o ⚫ i
 Set operations
• UNION ∪
Let A and B be sets.
𝑼
The union of the sets A and B,
denoted by 𝑨 ∪ 𝑩, is the set
that contains those elements
that are either in A or in B, or
in both. 𝑨 ∪ 𝑩 is shaded

𝑨 ∪ 𝑩 = {𝒙 | 𝒙 ∈ 𝑨 ∨ 𝒙 ∈ 𝑩}
 Set operations
• INTERSECTION ∩
Let A and B be sets.
𝑼
The intersection of the sets A
and B, denoted by A ∩ B, is
the set containing those
elements in both A and B.
𝑨 ∩ 𝑩 = {𝒙 | 𝒙 ∈ 𝑨 ∧ 𝒙 ∈ 𝑩} 𝑨 ∩ 𝑩 is shaded
 Set operations
• COMPLEMENT 𝑨′

The complement of a set, 𝑼

denoted 𝑨′, is the set of all
elements in the given universal
set 𝑼 that are not in 𝑨.
𝑨′ = {𝒙 ∈ 𝑼: 𝒙 ∉ 𝑨}
𝑨′ is shaded
 Set operations
• DIFFERENCE 𝑨 − 𝑩
𝑼
The relative complement or set
difference of sets A and B,
denoted A – B, is the set of all
elements in A that are not in B.
𝑨 − 𝑩 is shaded

𝑨 − 𝑩 = 𝒙 ∈ 𝑼: 𝒙 ∈ 𝑨 𝐚𝐧𝐝 𝒙 ∉ 𝑩
 examples
A. Given:
𝑴 = 𝒙 𝒙 𝒊𝒔 𝒕𝒉𝒆 𝒍𝒆𝒕𝒕𝒆𝒓 𝒊𝒏 𝒕𝒉𝒆 𝒘𝒐𝒓𝒅 "𝒎𝒂𝒕𝒉𝒆𝒎𝒂𝒕𝒊𝒄𝒔"
𝑵 = 𝒙 𝒙 𝒊𝒔 𝒕𝒉𝒆 𝒍𝒆𝒕𝒕𝒆𝒓 𝒊𝒏 𝒕𝒉𝒆 𝒘𝒐𝒓𝒅 "𝒅𝒊𝒔𝒄𝒓𝒆𝒕𝒆"
1. Use the roster method to describe sets M and N.
 examples
2. Find: 𝐚 𝑴 ∪ 𝑵 𝐛 𝑴 ∩ 𝑵 𝐜 𝑴 − 𝑵 𝒅 𝑵 − 𝑴
𝑴 = {𝒎, 𝒂, 𝒕, 𝒉, 𝒆, 𝒊, 𝒄, 𝒔} 𝑵 = {𝒅, 𝒊, 𝒔, 𝒄, 𝒓, 𝒆, 𝒕}

𝐚 𝑴∪𝑵=
𝐛 𝑴∩𝑵=
𝐜 𝑴−𝑵=
𝒅 𝑵−𝑴=
 examples
B. Given:
𝑼 = 𝒙 𝟎 ≤ 𝒙 ≤ 𝟏𝟎 𝑭 = 𝟑𝒙 𝟎 ≤ 𝒙 ≤ 𝟑
𝑮 = 𝟑𝒙 − 𝟏 𝟏 ≤ 𝒙 < 𝟑
List the elements of:
a. 𝑭 ∪ 𝑮 e. 𝑭′ i. 𝑭 − 𝑮
b. 𝑭 ∩ 𝑮 f. 𝑮′ j. 𝑮 − 𝑭
c. 𝑭 ∪ 𝑮 ′ g. 𝑭′ ∩ 𝑮′
d. 𝑭 ∩ 𝑮 ′ h. 𝑭′ ∪ 𝑮′
 examples
B. Given:
𝑼 = 𝒙 𝟎 ≤ 𝒙 ≤ 𝟏𝟎 𝑭 = 𝟑𝒙 𝟎 ≤ 𝒙 ≤ 𝟑
𝑮 = 𝟑𝒙 − 𝟏 𝟏 ≤ 𝒙 < 𝟑
𝑼 = {𝟎, 𝟏, 𝟐, … , 𝟏𝟎} 𝑭 = {𝟎, 𝟑, 𝟔, 𝟗}
𝑮 = {𝟓, 𝟖}
(𝒂)𝑭 ∪ 𝑮=
(𝒃)𝑭 ∩ 𝑮=
 examples
𝑼 = {𝟎, 𝟏, 𝟐, … , 𝟏𝟎} 𝑭 = {𝟎, 𝟑, 𝟔, 𝟗}
𝑮 = {𝟓, 𝟖}
𝒄 𝑭 ∪ 𝑮 ′=
𝒅 𝑭∩𝑮 ′ =
𝒆 𝑭′ =
𝒇 𝑮′ =
 examples
𝑼 = {𝟎, 𝟏, 𝟐, … , 𝟏𝟎} 𝑭 = {𝟎, 𝟑, 𝟔, 𝟗}
𝑮 = {𝟓, 𝟖}
𝒈 𝑭′ ∩ 𝑮′ =
𝒉 𝑭′ ∪ 𝑮′=
𝒊 𝑭−𝑮=
𝒋 𝑮−𝑭=
 examples
Suppose that 𝑴 is the set of BSInfoTech
students at BPSU and 𝑵 is the set of
students in discrete mathematics at BPSU.
Express each of these sets in terms of 𝑴
and 𝑵.
a. the set of BSInfoTech students taking
Discrete Mathematics at BPSU.
b. the set of BSInfoTech students at
BPSU who are not taking Discrete
Mathematics .
 examples
c. the set of students at BPSU who
either are BSInfoTech students
or are taking Discrete
Mathematics .

d. the set of students at BPSU who

either are not BSInfoTech
students or are not taking
Discrete Mathematics .
 Set operations
• CARTESIAN PRODUCT

Let A and B be sets. The Cartesian product of A

and B, denoted by A × B, is the set of all ordered
pairs (a, b), where a ∈ A and b ∈ B. Hence,
𝑨 × 𝑩 = {(𝒂, 𝒃)|𝒂 ∈ 𝑨 ∧ 𝒃 ∈ 𝑩}.
 Set operations
1. What is the Cartesian 2. Show that the Cartesian
product of A = {1, 2} and product 𝑩 × 𝑨 is not equal to
B = {a, b, c}? the Cartesian product 𝑨 × 𝑩
 Set operations
3. What is the Cartesian product 𝐀 × 𝐁 × 𝐂, where
𝐀 = {𝟎, 𝟏}, 𝐁 = {𝟏, 𝟐}, 𝐚𝐧𝐝 𝐂 = {𝟎, 𝟏, 𝟐} ?
 Set operations
4. Suppose that 𝑨 = {𝟏, 𝟐}, find (a) 𝑨𝟐 ; (b) 𝑨𝟑 .
 LAWs OF SETS
Sets involving the operations of union, intersection,
complement and difference satisfy properties which are
referred as Laws of the algebra of sets.
1.COMMUTATIVE LAWS. The order in which the sets are taken
does not affect the result.
𝑨∪𝑩=𝑩∪𝑨 𝑨∩𝑩=𝑩∩𝑨
2.ASSOCIATIVE LAWS. The grouping in which the sets are
taken does not affect the result.
𝑨∪ 𝑩∪𝑪 = 𝑨∪𝑩 ∪𝑪 𝑨∩ 𝑩∩𝑪 = 𝑨∩𝑩 ∩𝑪
 LAW OF SETS

3. IDENTITY LAWS. A set operated to another called the

identity element gives the set itself.
𝑨 ∪ ∅ = 𝑨, for union of sets, the identity element
is the empty set.
𝑨 ∩ 𝑼 = 𝑨, for intersection of sets, the identity
element is the universal set.
 LAW OF SETS
4. INVERSE OR COMPLEMENT LAWS. This involves
inside and outside of a set.
𝑨 ∪ 𝑨′ = 𝑼 𝑨 ∩ 𝑨′ = ∅

5. DISTRIBUTIVE LAWS. These laws involve three sets

with two different operations, distributing the first
operation over the second one.
𝑨∪ 𝑩∩𝑪 = 𝑨∪𝑩 ∩ 𝑨∪𝑪
𝑨∩ 𝑩∪𝑪 = 𝑨∩𝑩 ∪ 𝑨∩𝑪
 LAW OF SETS

6. DE MORGAN’S LAWS. The complement of the union of

sets, A and B is the intersection of the respective
complement of A and B. The statement holds upon
interchanging the words union and intersection.
′
𝑨 ∪ 𝑩 = 𝑨′ ∩ 𝑩′ ′
𝑨 ∩ 𝑩 = 𝑨′ ∪ 𝑩′
 PRINCIPLE OF DUALITY
The dual E∗ of E is the equation obtained by replacing each occurrence of ∪, ∩, U
and ∅ in E by ∩, ∪, ∅, and U, respectively.