INF1003 Mathematics 1

Tutorial Topic 10 : Relations

General instructions
Submit all exercises to Gradescope (individual submission).
https://www.gradescope.com/courses/851149

INF1003 Mathematics I
1. Let 𝑀𝑅 be the matrix of a relation 𝑅 defined as follows:

1 0 1 0
1 1 0 1
𝑀𝑅 = ( )
1 1 1 0
1 1 0 1

Determine if R is reflexive, symmetric, antisymmetric, or transitive.

2. For the relation 𝑅 on the set 𝐴 = {1, 2, 3, 4}, check whether it is reflexive, symmetric,
anyisymmetric or transitive (and explain).

𝑅: {(2, 2), (2, 3), (2, 4), (3, 2), (3, 3), (3, 4)}

3. For each of the following relations, represented as a directed graph, state if the relafion is
reflexive, symmetric, antisymmetric or transitive. For any property that does not hold, provide
an explanation.

a. b) c)

4. Which of these relations on the set of SIT students are equivalence relations and what are the
equivalence classes for these relations? Don’t forget to explain your answer.

a. {(𝑎, 𝑏)| 𝑎 𝑎𝑛𝑑 𝑏 𝑎𝑟𝑒 𝑡𝑎𝑘𝑖𝑛𝑔 𝑎 𝑚𝑜𝑑𝑢𝑙𝑒 𝑡𝑜𝑔𝑒𝑡ℎ𝑒𝑟}

b. {(𝑎, 𝑏)|𝑎 𝑎𝑛𝑑 𝑏 𝑠𝑡𝑢𝑑𝑦 𝑖𝑛 𝑡ℎ𝑒 𝑠𝑎𝑚𝑒 𝑝𝑟𝑜𝑔𝑟𝑎𝑚𝑚𝑒}

c. {(𝑎, 𝑏)|𝑡ℎ𝑒 𝐺𝑃𝐴 𝑜𝑓 𝑎 𝑖𝑠 𝑒𝑞𝑢𝑎𝑙 𝑡𝑜 𝑜𝑟 𝑔𝑟𝑒𝑎𝑡𝑒𝑟 𝑡ℎ𝑎𝑛 𝑡ℎ𝑒 𝐺𝑃𝐴 𝑜𝑓 𝑏}

d. {(𝑎, 𝑏)| − 0.5 ≤ (𝐺𝑃𝐴 𝑜𝑓 𝑎 − 𝐺𝑃𝐴 𝑜𝑓 𝑏) ≤ 0.5}

e. {(𝑎, 𝑏)| 𝑎 𝑖𝑠 𝑡𝑎𝑘𝑖𝑛𝑔 𝑡ℎ𝑒 𝑠𝑎𝑚𝑒 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑎𝑐𝑎𝑑𝑚𝑖𝑐 𝑐𝑟𝑒𝑑𝑖𝑡𝑠 𝑎𝑠 𝑏}

INF1003 Mathematics I
MATHEMAICS I TOPIC IO : RELATIONS
DONE By : MOHAMED SHEFAN (2401029

1234

+
!
Y

M+ c =
(tuple no, column no .

R =
& (1 ,
17 ,
(1 33 , ,
(2 ,
17 ,
(2 ,
2) ,
(2 ,
4) ,
(3 , 13 ,
(3 ,
2) ,
(3 , 3) ,
(4 , 1) ,
(4 , 2) ,
(4 , 4)3
Reflective :

M
, , = 1 Maz = 1 Mys = 1 Max =

This relation is reflective because .

element is related to itself
every

Symmetric :

Counterexample :

My = 1 E R

M,z = 0 R

Thus ,
this relation is NOT
symmetric .

Antisymmetric :

Counterexample :

Mz ,
= 1 E R

M ,3 = 1 E R

But (3 ,
17 # (1 ,
3)

Thus ,
this relation is NOT
Antisymmetric .

Transitive :

Counterexample :

My = 1 E R

Miz = 1 E R

But My s =
0 R

Thus ,
this relation is NOT transitive
.
REFLEXIVE

Counterexample :

For this relation to be reflexive element S1 2 3

43 must be a relation to itself
every , , , .

However in this relation element [13 and 143 is not relation to itself
.
, a

Therefore, this relation is not reflexive .

Symmetrici
Counterexample :

For if (a is in the relation

this relation to be
symmetric ,
element ,
b)
,
then (b ,
a) must also be in the relation .

(2 , 4) ER
, However (4 ,
2) &R .

Therefore this is not

,
relation
symmetrical

Antisymmetric
Counterexample :

If (a b) ER 1 (b , a) ER then a must be to b Otherwise , this is not

,
, equal .
relation
antisymmetrical
(2 ,
3) ER 1(3 ,
2) ER

However, (2 5) ,
= (3 ,
2) .

Therefore ,
this relation is not
antisymmetrical .

Transitive :

For a relation to be transitive

,
(9 ,
b) ER1(b , C(ER < (a ,
3) ER .

Foreg .
(2 , 3) ER 1 (3 ,
43 ER (2 , 4) ER .

(2 4) is
,
indeed ER .

Therefore this relation is transitive .

,
 a .

·
This relation is reflective as
every element in the relation is a relation to itself . A loop is present at all vertices in the
graph .

from from element 2

·
This relation is
symmetrical as
any arrow element I to element I has a
corresponding ar row to element I

·
This relation is not
antisymmetrical as there exists bidirectional connections between elements .

This relation is transitive because arrows exists from a and and there exists from C to
to 2 2
to y
an arrow
y.
·

b
.

This
·
relation is not reflexive as
every element in the relation is not related to itself. No loop is
present in
any of the vertices in the graph .

·
This relation is not
symmetric as not
every element in the
graph have a bidirectional connection with another element in the relation .

This relation is not exists bidirectional connections between

antisymmetric as there elements in the relation
·
.

This relation is not transitive because it is not the case such that when there exists an arrow from and from 2
X
to y an ar row
y
to
,
·

then there is an arrow from s to 2 .

Foreg . b = e ER 1 e = dER but b = d ER .

C .

This relation is not reflexive element in the relation is not . No

relation to itself loop is present in vertices in the
graph.
as
every a
any
·

·
This relation is not
symmetric as there exist a
peir of elements in the relation that do not have a bidirectional connection (c = d
,
d + a) .

This relation is not exists bidirectional connections between elements in the relation
antisymmetric as there
·

This relation is not transitive because it is not the case such that when there exists fromc from
y and
·
an ar row to an ar row

to 2 then there is an ar row from 3 to 2 For eg C = 2 ER 1 a = b ER but C = b R

Y .
. .

,
Lets take this relation as R
.

Two SIT related if

students are
they are
taking a module
together.
Reflexive property :
Every students takes a module that he/she is taking
.

Symmetric property: If student A and student B take a module

together then student B and student A are
taking a module

together.
Transitive property : Student A and Student Bare
taking a module
together. Student B and Student Care
taking a module
together.
However, that

does Student A and Student Care module Student Band Student C for
taking be
not mean that a
together as
may together
different module that Student A and Student Bare
taking together.

This is not an equivalence relation .

Lets take this relation as R2

Two SIT students related if in the

are
they study same
programmee.
~
Reflexive
property :
Every students
study in a
programme that he/she is
studying
.

Symmetric property : If student A and Student B

study in the same
programme ,
then Student B and Student A are
studying
in the same

~
programme.
Transitive If student A and Student B and student B and Student Care
property : are
studying
in the same
programme studying in the same

Student A and Student Care in the same

programme ,
then we can
say that studying programme
.

Since this relation is reflexive

, symmetric and transitive ,
it is an
equivalence relation.

[ Student a) =
[Student b] =
[Student C] : Estudenta ,
student b
,
student 13
( student 9) : [Student b] = Student a, student b3

I student 2] = E Student 23

Lets take this relation as Rs

On the set of Rs ,
let (a , b) E Rs ,
if and
only if 21 b for any GPA of Students A
,
B ESIT students
-
Reflexive property GPA of student is than or .
itself
greater equal
: a to
X

Symmetric property : GPA of a is

greater than or equal to GPA of b does not mean that GPA of b is
greater than or
equal to GPA of a.

~
Transitive property : GPA of a
being greater than or equal to GPA of b and GPA of b
being greater than or
equal to GPA of C means that GPA of a
,
is

to GPA c
greater than
.
or equal

This is not on
equivalence relation .
Lets take this relation as R4 .

On the set of Ry let (a b) E Ry if and

only if -0 51a-b 10 5 for students a end b E SIT students .
any
.
.

,
,

~
Reflexive property : a minus
by itself will result in O which fells in between 0 .
5 and 0 .
5 .

Symmetric property
: If the difference between GPA of a andb falls within the
range [0
.
5
,
0 .
5) ,
the difference between b and a will

also fall in that

range.
X
Transitive If difference between GPA of b the difference of GPA of b and C falls within the of [-0 5 5)
property and and
a
range
.
: the ,

,
it does not mean that the difference between d and C falls within the
range of [-0 .
5
,
0 .
57 .

For eg . a = 3 5
.
b= 3 . 0 c = 2 5 . a -
b = 0 .
5 ( Ry b = = 0 5
.
ERy bu+ 2 =
c = 1 .
0 Ry
, ,

This relation .
is not an
equivalence

Lets take this relation as R5 .

Two students are related if

they are
taking the same number of academic credits.
~
Reflexive Property :
Any student a are
taking the same number of academic credits as themselves .

~
Symmetric Property : If student a is
taking the same number of academic credits as student b
,
then student b is also
taking the same

number of

academic credits as student .

G
-1 number of number of
Transitive Property If same academic credits as student b and student b is credits
: student a is
taking the 1 taking the
sameacademic
number of

as student c Student is also academic credits es

then
taking the student
a same c
,
1

This relation is an
equivalence relation .

Each equivalence class consists of students of academic credits.

taking the same number
5. Suppose that 𝑅 is the relation on the set of strings of English letters such that 𝑎𝑅𝑏 (𝑎 is related
to 𝑏, also written as (𝑎, 𝑏) ∈ 𝑅 ) if and only if 𝑎 and 𝑏 are of the same length
𝑙(𝑎) = 𝑙(𝑏), where 𝑙(𝑥) is the length of the string 𝑥.
a. Is 𝑅 reflexive?
b. Is 𝑅 symmetric?
c. Is 𝑅 transitive?
d. Is 𝑅 an equivalence relation? If so, what are the equivalence classes?

6. Show that the “divides” relation on the set of positive integers is not an equivalence relation.

7. Define a relation 𝑅 from ℤ to ℤ as follows: ∀(𝑚, 𝑛) ∈ ℤ × ℤ((𝑚, 𝑛) ∈ 𝑅 ⇔ (𝑚 − 𝑛) 𝑖𝑠 𝑜𝑑𝑑).

a. Which of the following are in the relation?
i. (8,2) ii. (1,4) iii. (5, −3) iv.(3,2)
b. List five integers that are related by 𝑅 to 5.
c. Prove that if n is any even integer, then (𝑛, 3) ∈ 𝑅
d. Is 𝑅 an equivalence relation? If so, how many equivalence classes does it have?

INF1003 Mathematics I
a

Yes ! Length of
strings in
any elements of R is the same
length
as itself . (a)-1(a) ER Ca ,
al ER for all
strings a

b .

Yes ! If and (b) of the same then 1(b) (a)

length ((a) 1(b) (a , b) ER
ICa)
length
are and I are of the some .
=

I(b) = 1(a)(b , a) ER
C .

Yes ! If I (2) and 1(b) are of the same

length and I (b) and ICC) of the I (2) and 1(c) of the same length
,
are same
length ,
then are

+ oo .
((a) = /(b) (a , b) ER I(b) = 1 (c) (b , c) ER (((a) = 1x) (a , CER

Since R is reflexive
, symmetric and transitive
,
R is an
equivalence relation .

The equivalence classes of this relation are sets of

strings that have the same
length Each . of the
equivalence class is a set of
strings

of a particular length.
For example :

Equivalence class for

strings of
length I would include all
strings with one character .

GA ,
B ,
C
,
,
D ,
. . .
3
Equivalence class for strings of lengtha would include all
strings with two characters .

(AA BB CC DD , , .B , , . . .

Reflexive : For
any positive integer a
a divides
by itself which
gives the result I . Hence , this relation is reflexive

Symmetric c. For
any positive integers a and b
,
the result of a - b
may not be the same as the result of b. 2 . Hence
,
this relation is not

symmetric. For
eg : (a , b) = (4 , 2) ER a = b = 4 = 2 = 2 b= a = 2 : 4 = but 2 =
Transitive :
For any positive integers & b and C even if the result of - b and biC is the same ,
it does not mean that the result of G C is the
, ,

same .
Hence ,
this relation is not transitive .

For eg : (9 . b) = (8 ,
4) ER 1 Ob ,
c) = (4 , 2) ER a = b = z = 4 = 2 b =c = 4 = 2 = 2 a + c = z = 2 = 4

However 2 #4.

Although this relation is reflexive

,
the relation is not an
equivalence relation as the relation is not
symmetric and transitive .
Di .
) (8 , 2) & ii .
) (1 , 4] aiii (5 . -3)

8- 2 = 6 (6 is even 1 -
4 = -
3) =
3 is odd) 5 -
c -
3) = 2 (8 is even)

Hence ,
(8 , 2) AR Hence ,
(1 ,
47 E R Hence ,
(5 ,
-3) &R

air .
) (3 2 ,

3-2 = 1(lisodd)

Hence ,
(3 , 2) ER

b. (5 , n) ER

n 30 , 2 ,
4 , 6 , 83

3) ER is 2k for
C .
) (n ,
n an even number
,
let n = some
integer K.

n -
3 = 2k -
3

2k-3 will always be add because

subtracting any odd number with an even number will result in an odd number.

o f n -
3

Since ,
the result will
always be an odd number
,
1

for any (n 3) ER
even
integer n
, , .

d (m n7E R es (m-n) is odd

.
,

Reflexive : (m , m)ER() (m-m) is odd.

this relation
Any integer m minus
by itself will result in O
,
which is an even number R . Hence
,
is not

reflexive

For
eg . (3 ,
3) ER

3- 3 = 0 (0 is even (

Since this relation is not reflexive ,

this relation is not an
equivalence relation .