MAT 229: Linear Algebra II:

Relations

Imaga Ogbu Famous

Department of Mathematics
Covenant University

Imaga O. F. (Dept. of Mathematics) Linear Algebra II Relations 1 / 10

Introduction

Definition
A relation on a nonempty set A is a nonempty set R of ordered pairs
(x, y ) of elements x and y of A.

A relation R is a subset of the Cartesian product A × A.

If (a, b) ∈ R, we write aRb and say a has the relation R to b. If
(a, b) ∈/ R, we write a 6R b.
Example: Let A = {−3, −4, 3, 4} and
R = {(4, −3), (4, 3), (−4, −3)(−4, 3)}. The 4R(−3), 4R3, (−4)R(−3),
(−4)R3, 3 6R 4, (−3) 6R (−4).
Note: Every mapping from A to A is a relation but not every relation is a
mapping.

Imaga O. F. (Dept. of Mathematics) Linear Algebra II Relations 2 / 10

Properties of Relations

A relation R in A is said to be
1 reflexive if (a, a) ∈ R ∀a ∈ A
2 irreflexive if (a, a) ∈
/ R ∀a ∈ A
3 symmetric if (a, b) ∈ R ⇒ (b, a) ∈ R, ∀a, b ∈ A
4 antisymmetric if [(a, b) ∈ R ∧ (b, a) ∈ R] ⇒ a = b ∀a, b ∈ A
5 transitive if [(a, b) ∈ R ∧ (b, c) ∈ R] ⇒ (a, c) ∈ R ∀a, b, c ∈ A.
Example: Let A = {5, 6, 7} and R = {(5, 5), (6, 6), (5, 6), (6, 5)}.
Determine if R is reflexive, symmetric, anti-symmetric, transitive.
Solution: (5, 5), (6, 6) ∈ R but (7, 7) ∈
/ R, hence, R is not reflexive.
(5, 6), (6, 5) ∈ R, hence R is symmetric
(5, 6) ∈ R and (6, 5) ∈ R but 5 6= 6, hence R is not anti-symmetric
(5, 6), (6, 5) ∈ R and (5, 5) ∈ R, hence R is transitive

Imaga O. F. (Dept. of Mathematics) Linear Algebra II Relations 3 / 10

Exercises

1) Let R be a relation on a set A = {1, 2, 3, 4} defined as

R = {(1, 1), (2, 3), (2, 4), (3, 3), (3, 4)}.
Determine which of the five properties are satisfied.
2) Let A = {w , x, y , z} and R = {(w , w ), (x, y ), (y , x), (z, z)}. Show that
R is not transitive.
3) Consider the relation on {1, 2, 3, 4, 5, 6} defined by
R = {(i, j) : |i − j| = 2}. Is R a) Reflexive? b) Symmetric?
c) Transitive?

Imaga O. F. (Dept. of Mathematics) Linear Algebra II Relations 4 / 10

Equivalence Relations I

A relation that is reflexive, symmetric and transitive on a set A is called an

equivalence relation on A.

Example: The relation R defined on the set of integers Z by xRy , if and

only if |x| = |y | is an equivalence relation.
Solution: For arbitrary x, y , z ∈ Z,
1. xRx, since |x| = |x|
2, xRy ⇒ |x| = |y | ⇒ |y | = |x| ⇒ yRx.
3. xRy and yRz, then |x| = |y | and |y | = |z|. Hence, |x| = |z|. Therefore,
xRz.
Example: Let Z be the set of integers and
R = {(a, b) : a, b ∈ Z, a + b is even}. Determine if R is an equivalence
relation.
Solution: Let a ∈ Z, then a + a is even ⇒ (a, a) ∈ R, ∀ a ∈ Z

Imaga O. F. (Dept. of Mathematics) Linear Algebra II Relations 5 / 10

Equivalence Relations II

∴ R is reflexive.
(a + b) ∈ R ⇒ a + b is even ⇒ b + a is even ⇒ (b, a) ∈ R.
∴ R symmetric.
Let (a, b) ∈ R and (b, c) ∈ R. Then a + b is even and b + c is even.
⇒ (a + b) + (b + c) is even, hence (a + c) + 2b is even. Therefore,
(a + c) is even and (a, c) ∈ R. Thus R is transitive.
Therefore, R is an equivalence relation on Z.
1) Let A = {0, 1, 2, 3} and let R be a relation on A such that
R = {(0, 0), (1, 1), (2, 2), (3, 3), (1, 2), (2, 1), (3, 2), (2, 3), (3, 1), (1, 3)}.
Determine if R is an equivalence relation on A.

2) Determine if the relation R defined on the set of integers Z by xRy if

and only if x > y is an equivalence relation.

Imaga O. F. (Dept. of Mathematics) Linear Algebra II Relations 6 / 10

Congruence modulo n

Let Z be the set of integers and n a fixed number. Also let a, b ∈ Z, then
a is said to be congruent to b modulo n if and only if a − b is divisible by
n. It is denoted by a ≡ b (mod n).
12 is congruent to 3 modulo 3 i.e 12 ≡ 3 (mod 3) but 12 is not congruent
to 3 modulo 4 i.e. 12 6≡ 3 (mod 4)

Show that the ’congruent modulo n’ relation is an equivalent relation on Z

Solution: Let a, b ∈ Z and n a fixed number, then
1. a ≡ a (mod n) i.e. a − a is divisible by n. Hence, it is reflexive.
2. Let a ≡ b (mod n), then a − b is divisible by n and b − a is also divisible
by n. This implies that b ≡ a (mod n). Therefore, the relation symmetric.

Imaga O. F. (Dept. of Mathematics) Linear Algebra II Relations 7 / 10

3. Let a ≡ b (mod n) and b ≡ c (mod n) then (a − b) + (b − c) is
divisible by n. This implies that a − c is divisible by n i.e. a ≡ c (mod n).
Therefore the relation is transitive.
Therefore, the relation ’congruence modulo n’ is an equivalence relation in
Z.
Exercise: If x is congruent to y modulo 4, show that the relation
congruence modulo 4 is an equivalence relation.

Imaga O. F. (Dept. of Mathematics) Linear Algebra II Relations 8 / 10

Equivalence Classes

Definition
Let A be a non-empty set and R be a relation on A. For any a ∈ A,
the equivalence class [a] of a is defined by

[a] = {x ∈ A : xRa}

Example: Let A = {1, 3, 5, 7} with a equivalence relation R defined on A

such that R = {(1, 1), (1, 3), (1, 5), (3, 1), (3, 3), (3, 5), (5, 1), (5, 3), (5, 5),
(7, 7), (7, 9), (9, 7), (9, 9)}. The equivalent classes are
[1] = [3] = [5] = {1, 3, 5}
[7] = [9] = {7, 9}
Note that [1] ∪ [7] = A and [1] ∩ [7] = ∅
The set {[1], [7]} is called the partition of A.

Imaga O. F. (Dept. of Mathematics) Linear Algebra II Relations 9 / 10

1. Determine the equivalent classes of the relation R defined on the set of
integers Z by xRy , if and only if |x| = |y |.
2. Determine the equivalent classes of the relation ”x is congruent to y
modulo 4”.

Imaga O. F. (Dept. of Mathematics) Linear Algebra II Relations 10 / 10