Definition 9.

Let ℜ be a relation in a set A , we say that ℜ is transitive if (a,b) ∈ ℜ and (b,c)

∈ ℜ implies that (a,c) ∈ ℜ
Assignment:
1. Let 𝐴 = {1,2,3,4,5} and ℜ = {(2,5), (3,4), (5,3), (1,4), (2,3)}. Is ℜ transitive?

2. Consider ℜ = {(x,y)| x ∈ ℤ, y ∈ ℤ, 𝑥 ≡ 𝑦 𝑚𝑜𝑑 5} . Is ℜ transitive?

The Equivalence
Relation
Andrew J. Siducon
Instructor
Recall:
A relation ℜ from of A to B is subset of A x B.

Notation:
Let ℜ be a relation from A to B.
if (x,y) ∈ ℜ, we write xℜy.
if (x,y) ∉ ℜ, we write xℜy.
Recall:

D7. Let ℜ be a relation in a set A. We call ℜ a reflexive relation if for

every a ∈ A, (a,a) ∈ ℜ or aℜa.

D8. Let ℜ be a relation in a set A , we say that ℜ is symmetric if (a,b) ∈

ℜ implies that (b,a) ∈ ℜ

D9. Let ℜ be a relation in a set A , we say that ℜ is transitive if (a,b) ∈

ℜ and (b,c) ∈ ℜ implies that (a,c) ∈ ℜ
Definition 10.
A relation ℜ in a set is an equivalence relation if:
(i) ℜ is reflexive
(ii) ℜ is symmetric
(iii) ℜ is transitive

Example:

The relation ℜ = {(x,y)| x ∈ ℤ, y ∈ℤ, 𝑥 ≡𝑦 𝑚𝑜𝑑 5} is an

equivalence relation.
Example:
In ℚ , define ℜ by aℜb if a ≤ b. Is ℜ an equivalence relation?
Example:
On the set {(x,y)} of all ordered pairs of positive integers,
define 𝑥1 , 𝑦1 ~ 𝑥2 , 𝑦2 if 𝑥1 𝑦2 = 𝑥2 𝑦1 . Show that ~ defines
an equivalence relation?
Exercise no. 3
1. Let a relation ℜ on the set ℤ defined by nℜ𝑚 if and only if mn> 0.
Is ℜ an equivalence relation?

2. Let S = ℤ+ , a ~ b if a − b is divisible by 2. Is S an equivalence

relation?