Course Code: ITE 048 Discrete Structure

Module #10 Student Activity Sheet

Name:Kristian Eisen M. Meninao_________________ Class number: ________ Section: ____________

Schedule: BSCS1-PUCU1_______________________________Date: _______________

Lesson title: Relation, Equivalence and Partition Materials:

SAS and Supplementary reading
Lesson Objectives:
At the end of the session, students should be able to: References:
1. Recall basic concepts in sets as applied to relations. • Johnsonbaugh, Richard (2018).
2. Create a graph and show relationships to one or more Discrete Mathematics (8th Ed.)
elements or nodes.
3. Define and understand relations and its elements. • www.tutorialspoint.com/discrete_
4. Understand equivalence relations. mathematics
5. Demonstrate relations into graphs.
6. Determine elements showing partition.

A. LESSON PREVIEW/REVIEW

Introduction

On the previous lesson try to recall some of the important key notes of the lesson after your periodical
examination.

On this lesson. It is about rules of inference in which sets will have a relationship based on the
elements. Later, the sets in their relations will be represented into digraphs.

A relation can be thought of as a table that lists the relationship of elements to other elements.
Table 1 below shows which students are taking which subject. For example, Bill is taking
Discrete Structures. In terminology of relations, we would say that Bill is related to Discrete
Structures and that Mary is related to History.

This document is the property of PHINMA EDUCATION 1

 Course Code: ITE 048 Discrete Structure
Module #10 Student Activity Sheet

Name:Kristian Eisen M. Meninao_________________ Class number: ________ Section: ____________

Schedule: BSCS1-PUCU1_______________________________Date: _______________

So let’s get started.

B. MAIN LESSON

Content Notes

A relation is a rule that describes the relationship between

two sets of numbers. We can represent a relation as a set of
ordered pairs, a table, a mapping, or a graph.

What does relation mean in math? The relation definition in

math helps a viewer understand how the independent
variable, x, and the dependent variable, y, are related t o each
other. If this relation is represented as an ordered pair, the x
and y relationship is written (x, y).

Consider this relation math example, if we sampled the students in a classroom and measured their
height and weight, one data point in the relation could be written as (50, 90).

Given example, the student is 50 inches tall and weighs 90 pounds. We could continue
collecting data from all the students in the classroom and create a set of ordered pairs
that represented the classroom.

(50, 90), (62, 102), (55, 98), (60, 109), (60, 102), (52, 93), (51, 84), (53, 91)

In this example, 8 students are measured for their height and weight and the data is
written as an ordered pair such that x is the height of the student in inches and y is the
weight of the student in pounds.

The domain of a function is the set of all possible input values, or x-values.

For the example above, the domain would be all of the heights in the data sample. We would
write that as Domain: {50, 51, 52, 53, 55, 60, 62}. The range of a function is the set of all
This document is the property of PHINMA EDUCATION 2
 Course Code: ITE 048 Discrete Structure
Module #10 Student Activity Sheet

Name:Kristian Eisen M. Meninao_________________ Class number: ________ Section: ____________

Schedule: BSCS1-PUCU1_______________________________Date: _______________

possible output values, or y-values. For the example above, the range would be all of the
weights in the data sample. We would write that as Range: {84, 90, 91, 93, 98, 102, 109}.

Notice that in both the domain and range, the numbers are ordered from least to greatest.
Representation of Relations

Relations can be represented using different techniques. There are four main representations
of relations. These are given as follows:

• Set Builder Form: It is a mathematical notation where the rule that associates the two
sets X and Y is clearly specified. If there are two sets X = {5, 6, 7} and Y = {25, 36, 49}.
The rule is that the elements of X are the positive square root of the elements of Y.

In set-builder form this relation can be written as R {(a, b): a is the positive square root of
b, a X, b Y}.

• Roster Form: In roster form, all the possible ordered pairs of the two sets that follow the
given relation are written. Using the same example as mentioned above, the relation, the
elements of set X are the positive square roots of the elements of set B is represented
as R = {(5, 25), (6, 36), (7, 49)}.
• Arrow Diagram: Such a diagram is used to
visually represent the relation between the
elements of the two given sets. The arrow
diagram of the above-mentioned example is given
as:

• Tabular Form: When the input and the output of a relation are expressed in the form of
a table it is known as the tabular representation of a relation. In this, a table is drawn
with two columns.

This document is the property of PHINMA EDUCATION 3

 Course Code: ITE 048 Discrete Structure
Module #10 Student Activity Sheet

Name:Kristian Eisen M. Meninao_________________ Class number: ________ Section: ____________

Schedule: BSCS1-PUCU1_______________________________Date: _______________

The first one denotes the input and the

second expresses the output. Using the
relation that the elements of X = {5, 6, 7}
are the positive square roots of the
elements of Y = {25, 36, 49}, the table is
given as follows:

Types of Relations

Two sets can have different types of connections thus, different kinds of relations are needed
so as to classify these connections. The main types of relations are listed below:

1. Empty Relation
An empty relation is one where any element of a set is neither mapped to an element
of another set nor to itself. This relation is denoted as R = ∅. For example, P = {3, 7,
9} and the relation on P, R = {(x, y) where x + y = 76}. This will be an empty relation
as no two elements of P are added up to 76.

2. Universal Relation
If all the elements belonging to one set are mapped to all the elements of another set
or to itself then such a relation is known as a universal relation. It is written as R = X ×
Y where each element of X is related to every element of Y. Example, P = {3, 7, 9}, Q =
{12, 18, 20} and R = {(x, y) where x < y}.

3. Identity Relation
If all elements in a set are related to itself then it becomes an identity relation. It is
written as I = {(x, x) : for all x ∈ X}. For example P = {3, 7, 9} then I = {(3, 3), (7, 7), (9,
9)}

This document is the property of PHINMA EDUCATION 4

 Course Code: ITE 048 Discrete Structure
Module #10 Student Activity Sheet

Name:Kristian Eisen M. Meninao_________________ Class number: ________ Section: ____________

Schedule: BSCS1-PUCU1_______________________________Date: _______________

4. Inverse Relation
If the elements of one set are the inverse pairs of another set then such a relation is
known as an inverse relation. In other words, the inverse of a relation is an inverse
relation. The inverse of a relation R is denoted as R-1. i.e., R-1 = {(y, x) : (x, y) ∈ R}

5. Reflexive Relation
In a set, if all the elements are mapped to themselves then it is a reflexive relation.
Thus, if x ∈ X then a reflexive relation is defined as (x, x) ∈ R. For example, P = {7, 1}
then R = {(7, 7), (1, 1)} is a reflexive relation.

6. Symmetric Relation
A relation is said to be a symmetric relation if one set, X, contains ordered pairs, (x, y)
as well as the reverse of these pairs, (y, x). In other words, if (x, y) ∈ R then (y, x) ∈ R
for the relation to be symmetric. Suppose P = {3, 4}, then a symmetric relation can be
R = {(3, 4), (4, 3)}.

7. Transitive Relation
Suppose (x, y) R and (y, z) R then R is a transitive relation if and only if (x, z) R.
For example, P = {p, q, r}, then a transitive relationcan be R = {(p, q), (q, r), (p, r)}

8. Equivalence Relation
An equivalence relation is a type of relation that is symmetric, transitive, and reflexive.

9. One to One Relation

In a one-to-one relation each element of one set will be mapped to a distinct element
in another set. For example, suppose there are two sets P = {1, 2, 3} and Q = {a, b,
c}. Then a one to one relation can be R = {(1, a), (2, b), (3, c)}

10. One to Many Relation

In a one-to-many relation, a single element of one set will be mapped to more than
one element in another set. For example, given two sets P = {1, 2, 3} and Q = {a, b,
c}, a one to many relation is written as R = {(2, a), (2, b), (2, c)}

This document is the property of PHINMA EDUCATION 5

 Course Code: ITE 048 Discrete Structure
Module #10 Student Activity Sheet

Name:Kristian Eisen M. Meninao_________________ Class number: ________ Section: ____________

Schedule: BSCS1-PUCU1_______________________________Date: _______________

11. Many to One Relation

If more than one element of one set are mapped to a single distinct element of another
set then such a relation is referred to as many to one relation. For example, P = {1, 2,
3} and Q = {a, b, c}, then R = {(1, a), (2, a), (3, a)} is a many to one relation.

12. Many to Many Relation

In a many-to-many relation, one or more elements of one set will be mapped to the
same or a different element of another set. If P = {1, 2, 3} and Q = {a, b, c}, then R =
{(2, a), (3, a), (2, c)} is an example of a many to many relation.

What is a digraph is short for directed graph, and it is a diagram

composed of points called vertices (nodes) and arrows called
arcs going from a vertex to a vertex.

For example the figure is a digraph with 3 vertices and 4 arcs.

In this figure the vertices are labeled with numbers 1, 2, and 3.
What is Equivalence Relation?

An equivalence relation is a binary relation defined on a set X such that the

relation is reflexive, symmetric and transitive. If any of the three conditions (reflexive, symmetric and
transitive) does not hold, the relation cannot be an equivalence relation. The equivalence relation
divides the set into disjoint equivalence classes. Any two elements of the set are said to be equivalent
if and only if they belong to the same equivalence class. An equivalence relation is generally denoted
by the symbol '~'.

A relations in math’s for real numbers R defined on a set A is said to be an equivalence relation
if and only if it is reflexive, symmetric and transitive. They are often used to group together
objects that are similar, or equivalent. It satisfies the following conditions for all elements a, b, c
∈ A:

This document is the property of PHINMA EDUCATION 6

 Course Code: ITE 048 Discrete Structure
Module #10 Student Activity Sheet

Name:Kristian Eisen M. Meninao_________________ Class number: ________ Section: ____________

Schedule: BSCS1-PUCU1_______________________________Date: _______________

• Reflexive - R is reflexive if (a, a) ∈ R

for all a ∈ A
• Symmetric - R is symmetric if and
only if (a, b) ∈ R ⇒ (b, a) ∈ R for all a,
b∈A
• Transitive - R is transitive if and only
if (a, b) ∈ R and (b, c) ∈ R ⇒ (a, c) ∈ R
for all a, b, c ∈ A

Examples of Equivalence Relation

• 'Is equal to (=)' is an equivalence relation on any set of numbers A as for all elements a,
b, c ∈ A, we have a = a, a = b ⇒ b = a, and a = b, b = c ⇒ a = c. This implies (=) is reflexive,
symmetric and transitive.
• 'Is similar to (~)' defined on the set of triangles: It is reflexive, symmetric, and transitive.
• 'Has the same birthday' defined on the set of people: It is reflexive, symmetric, and
transitive.
• 'Is congruent to' defined on the set of triangles is an equivalence relation as it is reflexive,
symmetric, and transitive.
• 'Congruence modulo n (≡)' defined on the set of integers: It is reflexive, symmetric, and
transitive.
• 'Has the same absolute value' defined on the set of real numbers is an equivalence relation
as it is reflexive, symmetric, and transitive.

Definitions Related to Equivalence Relation

Now, we will understand the meaning of some terms related to equivalence relation such as
equivalence class, partition, quotient set, etc. Consider an equivalence relation R defined on
set A with a, b ∈ A.

• Equivalence Class - An equivalence class is a subset B of A such (a, b) ∈ R for all a,

b ∈ B and a, b cannot be outside of B. Mathematically, an equivalence class of a is
This document is the property of PHINMA EDUCATION 7
 Course Code: ITE 048 Discrete Structure
Module #10 Student Activity Sheet

Name:Kristian Eisen M. Meninao_________________ Class number: ________ Section: ____________

Schedule: BSCS1-PUCU1_______________________________Date: _______________

denoted as [a] = {x ∈ A: (a, x) ∈ R} which contains all elements of A which are related
'a'. All elements of A equivalent to each other belong to the same equivalence class.
In other words, all elements belonging to the same equivalence class are equivalent
to each other.
• Partition - A partition of set A is a non-empty set of disjoint subsets of A such that no
element of A is in two subsets of A and elements belonging to the same subset are
related to each other. The union of subsets in the partition is equal to set A.
• Quotient Set - A quotient set is a set of all equivalence classes of an equivalence
relation denoted by A/R = {[a]: a ∈ A}

Partition of a set
A collection of disjoint subsets of a given set. The union of the subsets must equal the
entire original set.

For example, one possible partition of {1, 2, 3, 4, 5, 6} is {1, 3}, {2}, {4, 5, 6}.

Partition of a set, say S, is a collection of n disjoint subsets, say P1, P1, ... Pn that satisfies the
following three conditions −
• Pi does not contain the empty set.
[ Pi ≠ { ∅ } for all 0 < i ≤ n ]
• The union of the subsets must equal the entire original set.
[ P1 ∪ P2 ∪ ... ∪ Pn = S ]
• The intersection of any two distinct sets is empty.
[ Pa ∩ Pb = { ∅ }, for a ≠ b where n ≥ a, b ≥ 0 ]
Example
Let S = { a, b, c, d, e, f, g, h }
One probable partitioning is { a }, { b, c, d }, { e, f, g, h }
Another probable partitioning is { a, b }, { c, d }, { e, f, g, h }

Skill-building Activities
Score : _______

This document is the property of PHINMA EDUCATION 8

 Course Code: ITE 048 Discrete Structure
Module #10 Student Activity Sheet

Name:Kristian Eisen M. Meninao_________________ Class number: ________ Section: ____________

Schedule: BSCS1-PUCU1_______________________________Date: _______________

I. Instruction: Answer the following questions below. Write the letter of answer before the
number.

1. State whether true or false: All functions are relations. A

a. True
b. False
2. If A = {a, b, c}, B = {5, 2, 7, 8, 9} and R = {(a, 2), (b, 2), (c, 2)} then what type of relation
is this? B
a. One to One
b. Many to One
c. One to Many
d. Many to Many
3. The following three conditions are necessary to prove an equivalence relation: C
a. Reflexive, Asymmetric, Transitive
b. Irreflexive, Symmetric, Asymmetric
c. Reflexive, Symmetric, Transitive
d. Antisymmetric, Transitive, Irreflexive
4. State True or False: 'Congruence modulo n (≡)' defined on the set of integers is an
equivalence relation. A
a. True
b. False
5. It is short for directed graph, and it is a diagram composed of points called vertices
(nodes) and arrows called arcs going from a vertex to a vertex. DIGRAPH
6. It is a rule that describes the relationship between two sets of numbers. RELATION

II. Instruction: Given a set, derive the partitions on the following:

1. S = {a, b, c}
{ {1}, {2}, {3} }
{ {1, 2}, {3} }
{ {1, 3}, {2} }
{ {1}, {2, 3} }

This document is the property of PHINMA EDUCATION 9

 Course Code: ITE 048 Discrete Structure
Module #10 Student Activity Sheet

Name:Kristian Eisen M. Meninao_________________ Class number: ________ Section: ____________

Schedule: BSCS1-PUCU1_______________________________Date: _______________

2. S = {a, b}
{{a}, {b}} and {{a, b}}

C. LESSON WRAP-UP

FAQs
1. What is an isolated element?
ANSWER:
It is an element in which no relationship from the other set.
2. What is a loop?
ANSWER:
It is an element that has same relationship. This means that the arrow is pointing its
direction to its own.
3. What is an edge?
ANSWER:
An edge is the line that connects two vertex or as an element of the set.

4) Activity 5: Thinking about Learning (5 mins)

Mark the place in the work tracker which is simply a visual to help you track how much
work you have accomplished and how much work there is left to do. This tracker will be
part of your activity sheet.

To develop habits on thinking about learning, answer the questions below about your
learning experience.

1. How was the module able to help you learn?

This document is the property of PHINMA EDUCATION 10

 Course Code: ITE 048 Discrete Structure
Module #10 Student Activity Sheet

Name:Kristian Eisen M. Meninao_________________ Class number: ________ Section: ____________

Schedule: BSCS1-PUCU1_______________________________Date: _______________

2. What did you realize about the topic?

KEY CORRECTIONS

Skill building answer.

Answer in part 1.
1. A
2. B
3. C
4. A
5. Digraph
6. Relation

Answer in part 2.
Given a set, derive the partitions on the following:

1. S = {a, b, c}
Answers: { {1}, {2}, {3} }
{ {1, 2}, {3} }
{ {1, 3}, {2} }
{ {1}, {2, 3} }
{ {1, 2, 3} }

2. S = {a, b}
Answers: {{a}, {b}} and {{a, b}}
This document is the property of PHINMA EDUCATION 11
 Course Code: ITE 048 Discrete Structure
Module #10 Student Activity Sheet

Name:Kristian Eisen M. Meninao_________________ Class number: ________ Section: ____________

Schedule: BSCS1-PUCU1_______________________________Date: _______________

This document is the property of PHINMA EDUCATION 12