Math151 Discrete Mathematics (4.

2) Equivalence Relations By: Malek Zein AL-Abidin

King Saud University

College of Science
Department of Mathematics

151 Math Exercises

(4.2)

Equivalence Relations

Malek Zein AL-Abidin

‫ه‬1440
2018
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin

Equivalence Relations

DEFINITION 1 A relation on a set A is called an equivalence relation if it is reflexive, symmetric, and

transitive.

DEFINITION 2 Two elements a and b that are related by an equivalence relation are called equivalent.
the notation a ∼ b is often used to denote that a and b are equivalent elements with respect to a particular
equivalence relation

Equivalence Classes
DEFINITION 3 Let R be an equivalence relation on a set A. The set of all elements that are related to an
element a of A is called the equivalence class of a. The equivalence class of a with respect to R is denoted
by [a] for this equivalence class . [𝑎] = {𝑏 ∈ 𝐴 ∶ 𝑎 𝑅 𝑏}

Equivalence Classes and Partitions

THEOREM 1 Let R be an equivalence relation on a set A. These statements for elements a and b of A are
equivalent:

(i) aRb (ii) [a] = [b] (iii) [a] ∩ [b] ≠ ∅

THEOREM 2 Let R be an equivalence relation on a set S. Then the equivalence classes of R form a
partition of S. Conversely, given a partition ℑ = {{𝐴𝑖 : ∅ ≠ 𝐴𝑖 ⊆ 𝑆 , 𝑖 ∈ 𝐼}} of the set S, there is an
equivalence relation R that has the sets 𝐴𝑖 , i ∈ I , as its equivalence classes .
∀(𝐴𝑖 , 𝐴𝑗 ∈ ℑ) , (𝑖 ≠ 𝑗 → 𝐴𝑖 ∩ 𝐴𝑗 = ∅ )
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
and
⋃ 𝐴𝑖 = 𝑆
𝑖∈𝐼
(Here the notation ⋃𝑖∈𝐼 𝐴𝑖 represents the union of the sets 𝐴𝑖 for all i ∈ I .) Figure 1 illustrates
the concept of a partition of a set.

EXAMPLE 1 Suppose that S = {1, 2, 3, 4, 5, 6}. The collection of sets 𝐴1 = {1, 2, 3}, 𝐴2 = {4, 5}, and
𝐴3 = {6} forms a partition of S, because these sets are disjoint and their union is S.
𝕴 = {{1, 2, 3}, {4, 5}, {6} } where ∀(𝐴𝑖 , 𝐴𝑗 ∈ ℑ) , (𝑖 ≠ 𝑗 → 𝐴𝑖 ∩ 𝐴𝑗 = ∅ ) and ⋃𝑖=1,2,3 𝐴𝑖 = 𝑆

EXAMPLE 2 List the ordered pairs in the equivalence relation R produced by the partition 𝐴1 = {1, 2, 3},
𝐴2 = {4, 5}, and 𝐴3 = {6} of S = {1, 2, 3, 4, 5, 6}, given in Example 1.

Solution: The subsets in the partition are the equivalence classes of R. The pair (a, b) ∈ R if and
only if a and b are in the same subset of the partition. The pairs (1, 1), (1, 2), (1, 3), (2, 1), (2, 2),
(2, 3), (3, 1), (3, 2), and (3, 3) belong to R because 𝐴1 = {1, 2, 3} is an equivalence class; the
pairs (4, 4), (4, 5), (5, 4), and (5, 5) belong to R because 𝐴2 = {4, 5} is an equivalence class;
and finally the pair (6, 6) belongs to R because {6} is an equivalence class. No pair other than
those listed belongs to R .
R = {(1,1), (1,2), (1,3), (2,1), (2,2), (2,3), (3,1), (3,2), (3,3), (4,4), (4,5), (5,4), (5,5), (6,6)}

EXAMPLE 3 Let ~ be a relation defined on ℕ × ℕ , such that:

(𝑚, 𝑛), (𝑝, 𝑞) ∈ ℕ × ℕ (𝑚, 𝑛)~(𝑝, 𝑞) ⇔ 𝑚 + 𝑞 = 𝑝 + 𝑛

(i) Show that ~ is an equivalence relation on ℕ × ℕ .

(ii) Find the equivalence classes [(3,4)] , [(1,1)]

Solution:
(i)
(a) ∀(𝑚, 𝑛) ∈ ℕ × ℕ ⇒ ∵ 𝑚 + 𝑛 = 𝑚 + 𝑛 ⇒ ∴ (𝑚, 𝑛)~(𝑚, 𝑛) ⇒ ∴ ~ is reflexive
(b) (𝑚, 𝑛), (𝑝, 𝑞) ∈ ℕ × ℕ ∶ (𝑚, 𝑛)~ (𝑝, 𝑞) ⇒ 𝑚 + 𝑞 = 𝑝 + 𝑛
⇒ 𝑝+𝑛=𝑚+𝑞
⇒ (𝑝, 𝑞)~(𝑚, 𝑛) ⇒ ∴ ~ is symmetric
(c) (𝑚, 𝑛), (𝑝, 𝑞), (𝑟, 𝑠) ∈ ℕ × ℕ ∶ (𝑚, 𝑛)~ (𝑝, 𝑞) ⇒ 𝑚 + 𝑞 = 𝑝 + 𝑛
( 𝑝, 𝑞)~ (𝑟, 𝑠) ⇒ 𝑝 + 𝑠 = 𝑟 + 𝑞
⇒ 𝑚+𝑞+𝑝+𝑠 = 𝑝+𝑛+𝑟+𝑞
⇒ 𝑚 + 𝑠 = 𝑟 + 𝑛 ⇒ (𝑚, 𝑛)~(𝑟, 𝑠)
⇒ ∴ ~ is transitive
∵ ~ is reflexive , symmetric and transitive ⇒ ∴ ~ is an equivalence relation on ℕ × ℕ .
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
(ii)
[(1,1)] = {(𝑎, 𝑏) ∈ ℕ × ℕ ∶ (𝑎, 𝑏)~(1,1) ⇒ 𝑎 + 1 = 𝑏 + 1 ⇒ 𝑎 = 𝑏}
= {(𝑎, 𝑎): 𝑎 ∈ ℕ} = {(1,1), (2,2), (3,3), … }

[(3,4)] = {(𝑎, 𝑏) ∈ ℕ × ℕ ∶ (𝑎, 𝑏)~(3,4) ⇒ 𝑎 + 4 = 𝑏 + 3 ⇒ 𝑏 = 𝑎 + 1}

= {(𝑎, 𝑎 + 1): 𝑎 ∈ ℕ} = {(1,2), (2,3), (3,4), … } .

EXAMPLE 4 Let S be a relation defined on ℝ such that:

𝑥, 𝑦 ∈ ℝ , 𝑥 𝑺 𝑦 ⇔ 𝑥 2 − 𝑦 2 = 2(𝑦 − 𝑥) ⇔ 𝑥 2 + 2𝑥 = 𝑦 2 + 2𝑦
(i) Show that 𝑺 is an equivalence relation on ℝ .
(ii) Find the equivalence classes [1] , [0]
Solution:
(i)
(a) ∀ 𝑥 ∈ ℝ , 𝑥 2 + 2𝑥 = 𝑥 2 + 2𝑥 ⇒ ∴ 𝑥 𝑆 𝑥 ⇒ ∴ 𝑆 𝑖𝑠 𝑟𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒
(b) 𝑥, 𝑦 ∈ ℝ , 𝑥 𝑆 𝑦 ⇒ 𝑥 2 + 2𝑥 = 𝑦 2 + 2𝑦 ⇒ 𝑦 2 + 2𝑦 = 𝑥 2 + 2𝑥 ⇒ 𝑦 𝑆 𝑥
⇒ ∴ 𝑆 𝑖𝑠 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐

(c) 𝑥, 𝑦, 𝑧 ∈ ℝ ∶ 𝑥 𝑆 𝑦 ⇒ 𝑥 2 + 2𝑥 = 𝑦 2 + 2𝑦
𝑦 𝑆 𝑧 ⇒ 𝑦 2 + 2𝑦 = 𝑧 2 + 2𝑧
⇒ 𝑥 2 + 2𝑥 = 𝑦 2 + 2𝑦 = 𝑧 2 + 2𝑧
⇒ 𝑥 2 + 2𝑥 = 𝑧 2 + 2𝑧
⇒ 𝑥 𝑆 𝑧 ⇒ ∴ 𝑆 𝑖𝑠 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒

∵ 𝑺 𝑖𝑠 𝑟𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒 , 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐 𝑎𝑛𝑑 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒 ⇒ ∴ 𝑺 𝑖𝑠 𝑎𝑛 𝑒𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑐𝑒 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛 𝑜𝑛 ℝ.

(ii)

[0] = {𝑥 ∈ ℝ ∶ 𝑥 𝑆 0 ⇒ 𝑥 2 + 2𝑥 = 02 + 2(0) }
= {𝑥 ∈ ℝ ∶ 𝑥(𝑥 + 2) = 0 } = {−2,0}

[1] = {𝑥 ∈ ℝ ∶ 𝑥 𝑆 1 ⇒ 𝑥 2 + 2𝑥 = 12 + 2(1) = 3}

= {𝑥 ∈ ℝ ∶ 𝑥 2 + 2𝑥 − 3 = 0 ⇒ (𝑥 + 3)(𝑥 − 1) = 0} = {−3,1} .

#
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
EXAMPLE 5 Let T be a relation defined on ℤ such that:

𝑎, 𝑏 ∈ ℤ , 𝑎 𝑇 𝑏 ⇔ |𝑎| = |𝑏|

(i) Show that 𝑇 is an equivalence relation .

(ii) Find ℑ(T) .
Solution:
(i)
1- ∀𝑎 ∈ ℤ , ∵ |𝑎| = |𝑎| ⇒ ∴ 𝑎 𝑇 𝑎 ⇒ ∴ 𝑇 𝑖𝑠 𝑟𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒

2- 𝑎, 𝑏 ∈ ℤ , 𝑎 𝑇 𝑏 ⇔ |𝑎| = |𝑏| ⇒ |𝑏| = |𝑎| ⇒ 𝑏 𝑇 𝑎 ⇒ ∴ 𝑇 𝑖𝑠 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐

3- 𝑎, 𝑏, 𝑐 ∈ ℤ , 𝑎 𝑇 𝑏 ⇔ |𝑎| = |𝑏|
&
𝑏 𝑇 𝑐 ⇔ |𝑏| = |𝑐|

|𝑎| = |𝑏| = |𝑐| ⇒ |𝑎| = |𝑐| ⇒ ∴ 𝑎 𝑇𝑐 ⇒ ∴ 𝑇 𝑖𝑠 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒

∵ 𝑻 𝑖𝑠 𝑟𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒 , 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐 𝑎𝑛𝑑 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒 ⇒ ∴ 𝑻 𝑖𝑠 𝑎𝑛 𝑒𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑐𝑒 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛 𝑜𝑛 ℤ.

(ii)

[𝑎] = {𝑏 ∈ ℤ ∶ |𝑎| = |𝑏|} = {𝑏 ∈ ℤ ∶ 𝑎 = ±𝑏}

= {𝑎, −𝑎}

∴ ℑ(T) = {[𝑎]: 𝑎 ∈ ℤ} = {{0}, {−1,1}, {−2,2}, … } .

#
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin

EXERCISES

1. Let R be the relation defined on the integers set ℤ , such that:

𝑎, 𝑏 ∈ ℤ , 𝑎 𝑅 𝑏 ⇔ 6𝑎 ≡ 𝑏 ( 𝑚𝑜𝑑 5 ) ⇔ 5|(6𝑎 − 𝑏) , 5 devides ( 6𝑎 − 𝑏 )
(𝑖) Show that 𝑅 is an equivalence relation.
(𝑖𝑖) Find the equivalence class [0] .
(𝑖𝑖𝑖) Decide whether 9 ∈ [4] .

Solution: (𝑖) 𝑎 𝑅 𝑏 ⇔ 6𝑎 ≡ 𝑏 ( 𝑚𝑜𝑑 5 ) ⇔ 5|(6𝑎 − 𝑏) ⇒ 6𝑎 − 𝑏 = 5ℎ ∶ ℎ ∈ ℤ

1- ∀ 𝑎 ∈ ℤ , 5|(6𝑎 − 𝑎) = 5𝑎 ⇒ 5|5𝑎 ⇒ ∴ 𝑎 𝑅 𝑎 ⇒ ∴ 𝑅 𝑖𝑠 𝑟𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒
2- 𝑎, 𝑏 ∈ ℤ , 𝑎 𝑅 𝑏 ⇔ 6𝑎 ≡ 𝑏 ( 𝑚𝑜𝑑 5 ) ⇔ 5|(6𝑎 − 𝑏) ⇒ 6𝑎 − 𝑏 = 5ℎ ∶ ℎ ∈ ℤ
𝑏 = 6𝑎 − 5ℎ ⇒ 6 𝑏 − 𝑎 = 6(6𝑎 − 5ℎ ) − 𝑎 = 36𝑎 − 5ℎ − 𝑎
= 35𝑎 − 5ℎ = 5(7𝑎 − ℎ) ⇒ ∴ 5|(6𝑏 − 𝑎) ⇒ 𝑏 𝑅 𝑎 ⇒ ∴ 𝑅 𝑖𝑠 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐

3- 𝑎, 𝑏, 𝑐 ∈ ℤ 𝑎 𝑅 𝑏 ⇔ 6𝑎 ≡ 𝑏 ( 𝑚𝑜𝑑 5 ) ⇔ 5|(6𝑎 − 𝑏) ⇒ 6𝑎 − 𝑏 = 5ℎ ∶ ℎ ∈ ℤ
&
𝑏 𝑅 𝑐 ⇔ 6𝑏 ≡ 𝑐 ( 𝑚𝑜𝑑 5 ) ⇔ 5|(6𝑏 − 𝑐) ⇒ 6𝑏 − 𝑐 = 5𝑘 ∶ 𝑘 ∈ ℤ
⇒ (+)__________________________
6𝑎 + 5𝑏 − 𝑐 = 5ℎ + 5𝑘
6𝑎 − 𝑐 = 5(ℎ + 𝑘 − 𝑏) = 5𝑙
: (ℎ + 𝑘 − 𝑏) = 𝑙 ∈ ℤ ⇒ ∴ 5|6𝑎 − 𝑐 ⇒ ∴ 𝑎 𝑅 𝑐 ⇒ ∴ 𝑅 𝑖𝑠 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒

∵ 𝑅 𝑖𝑠 𝑟𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒 , 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐 𝑎𝑛𝑑 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒 ⇒ ∴ 𝑅 𝑖𝑠 𝑎𝑛 𝑒𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑐𝑒 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛 𝑜𝑛 ℤ .

(𝑖𝑖) [0] = {𝑥 ∈ ℤ ∶ 0 𝑅 𝑥 } = {𝑥 ∈ ℤ: 6(0) − 𝑥 = 5ℎ: ℎ ∈ ℤ}

= {𝑥 ∈ ℤ ∶ 𝑥 = 5(−ℎ) = 5𝑟 ∶ 𝑟 = −5ℎ}

= {… , −15, −10, −5,0,5,10,15, … }

(𝑖𝑖𝑖) ∵ 5| 6(9) − 4 = 50 ⇒ ∴ 9 𝑅 4 ⇒ ∴ 9 ∈ [4]

#
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin

2. Let S be the relation defined on the set 𝐴 = {−2, −1,0,1,2} , such that:
𝑎, 𝑏 ∈ 𝐴 , 𝑎 𝑆 𝑏 ⇔ 3|(𝑎 + 2𝑏) , 3 devides ( 𝑎 + 2𝑏 )
(𝑖) Show that 𝑆 is an equivalence relation.
(𝑖𝑖) Find all equivalence classes .
Solution :
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
3. Let R be the relation defined on the integers set ℤ , such that:
𝑚, 𝑛 ∈ ℤ , 𝑚𝑅𝑛 ⇔ 4|(𝑚 − 𝑛 + 8) , 4 devides ( 𝑚 − 𝑛 + 8 )
(𝑖) Show that 𝑅 is an equivalence relation.
(𝑖𝑖) Show that [10] = [-6] .

Solution :
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
4. Assume T is an equivalence relation defined on the set 𝐴 = {𝑎, 𝑏, 𝑐, 𝑑, 𝑒} ,
and the matrix of T given such that
1 0 1 0 0
0 1 0 0 1
𝑀𝑇 = 1 0 1 0 0
0 0 0 1 0
[0 1 0 0 1]

𝐹𝑖𝑛𝑑 𝑡ℎ𝑒 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑒𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑐𝑒 𝑐𝑙𝑎𝑠𝑠𝑒𝑠 .

Solution :
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
5. Let 𝑇 = {(𝑎, 𝑎), (𝑏, 𝑏), (𝑏, 𝑑), (𝑐, 𝑐), (𝑑, 𝑏), (𝑑, 𝑑)} be a relation defined on the set 𝐴 = {𝑎, 𝑏, 𝑐, 𝑑}
(𝑖) Represent T by the directed graph ( diagraph )
(𝑖𝑖) Show that 𝑅 is an equivalence relation.
(𝑖𝑖𝑖) Find all equivalence classes .
Solution :
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
6. Let R be the relation defined on the set ℤ+ = {1,2,3, … } , such that:
𝑎, 𝑏 ∈ ℤ+ , 𝑎 𝑅 𝑏 ⇔ ( √𝑎 − √𝑏 ) ∈ ℤ , ( √𝑎 − √𝑏 ) 𝑖𝑠 𝑖𝑛𝑡𝑒𝑔𝑒𝑟
(𝑖) Show that 𝑅 is an equivalence relation.
(𝑖𝑖) Decide whether 4 ∈ [9] .

Solution :
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
7. Let S be the relation defined on the set ℕ = {1,2,3, … } , such that:
𝑎, 𝑏 ∈ ℤ , 𝑎 𝑅 𝑏 ⇔ 5𝑎 ≡ 𝑏 ( 𝑚𝑜𝑑 4 ) ⇔ 4|(5𝑎 − 𝑏) , 4 devides ( 5𝑎 − 𝑏 )
(𝑖) Show that 𝑆 is an equivalence relation.
(𝑖𝑖) Find the equivalence class [1] .

Solution:
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
8. Let S be the relation defined on the Rational set ℚ , such that:
𝑥, 𝑦 ∈ ℚ , 𝑥 𝑆 𝑦 ⇔ 𝑥 − 𝑦 ∈ ℤ , ( 𝑥 − 𝑦 ) 𝑖𝑠 𝑖𝑛𝑡𝑒𝑔𝑒𝑟
(𝑖) Show that 𝑆 is an equivalence relation.
9 1
(𝑖𝑖) Decide whether ∈ [ ] or not ?
4 2

Solution: (𝑖)

1- ∀ 𝑥 ∈ ℚ , 𝑥 − 𝑥 = 0 ∈ ℤ ⇒ 𝑥 𝑆 𝑥 ⇒ ∴ 𝑆 𝑖𝑠 𝑟𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒

2- 𝑥, 𝑦 ∈ ℚ , 𝑥 𝑆 𝑦 ⇔ 𝑥 − 𝑦 = 𝑚 ∈ ℤ
) multiply by -1 ( ⇒ 𝑦 − 𝑥 = −𝑚 ∈ ℤ ⇒ ∴ 𝑆 𝑖𝑠 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐

3- 𝑥, 𝑦, 𝑧 ∈ ℤ , 𝑥 𝑆 𝑦 ⇒ 𝑥 − 𝑦 = 𝑚1 ∈ ℤ
&
𝑦 𝑆 𝑧 ⇒ 𝑦 − 𝑧 = 𝑚2 ∈ ℤ
(+) ⇒ __________________________
𝑥 − 𝑧 = 𝑚1 + 𝑚2 = 𝑚 ∈ ℤ
⇒ ∴ 𝑥 𝑆 𝑧 ⇒ ∴ 𝑆 𝑖𝑠 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒

∵ 𝑆 𝑖𝑠 𝑟𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒 , 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐 𝑎𝑛𝑑 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒 ⇒ ∴ 𝑆 𝑖𝑠 𝑎𝑛 𝑒𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑐𝑒 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛 𝑜𝑛 ℚ

9 1 9 2 7 9 1
(𝑖𝑖) ∵ − = − = ∉ ℤ ⇒∴ ∉[ ]
4 2 4 4 4 4 2

1 1 1
[ 2 ] = {𝑥 ∈ ℚ ∶ 𝑥 𝑆 2} = {𝑥 ∈ ℚ ∶ 𝑥 − = 𝑚 ∈ ℤ}
2
1
= {𝑥 ∈ ℚ ∶ 𝑥 = + 𝑚 ∶ 𝑚 ∈ ℤ}
2
3 1 1 3
= {… , − , − ,0 , , ,…}
2 2 2 2

#
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
9. Let S be the relation defined on the set E = {2𝑎| 𝑎 ∈ ℤ} (even Integers set), such that:
𝑚 ,𝑛 ∈ 𝐸 , 𝑚𝑆𝑛 ⇔4|(𝑚+𝑛) , 4 devides ( 𝑚 + 𝑛 )

(𝑖) Show that 𝑆 is an equivalence relation.

(𝑖𝑖) Find the equivalence class [0] .

Solution :
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
10. Let R be the relation defined on the Rational set ℤ∗ = ℤ − {0} , such that:
𝑥, 𝑦 ∈ ℤ∗ , 𝑥 𝑅 𝑦 ⇔ 𝑥𝑦 > 0
(𝑖) Show that 𝑆 is an equivalence relation.
(𝑖𝑖) Find the equivalence classes [−1] , [1]
.

Solution: (𝑖)
1- ∀ 𝑥 ∈ ℤ∗ , 𝑥𝑥 = 𝑥 2 > 0 ⇒ ∴ 𝑥 𝑅 𝑥 ⇒ ∴ 𝑅 𝑖𝑠 𝑟𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒

2- 𝑥, 𝑦 ∈ ℤ∗ , 𝑥 𝑅 𝑦 ⇔ 𝑥𝑦 > 0 ⇒ 𝑦𝑥 > 0 ⇒ 𝑦 𝑅 𝑥 ⇒ ∴ 𝑅 𝑖𝑠 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐

3- 𝑥, 𝑦, 𝑧 ∈ ℤ∗ , 𝑥 𝑅 𝑦 ⇔ 𝑥𝑦 > 0 (1)
&
𝑦 𝑅 𝑧 ⇔ 𝑦𝑧 > 0 (2)
(1) × (2) ⇒ __________________________

⇒ 𝑥 𝑦2 𝑧 > 0
(𝑑𝑒𝑣𝑖𝑑𝑒 𝑏𝑜𝑡ℎ 𝑠𝑖𝑑𝑒𝑠 𝑜𝑛 𝑦 2 > 0 ) ⇒ 𝑥𝑧 > 0 ⇒𝑥𝑅𝑧 ⇒∴ 𝑅 𝑖𝑠 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒

∵ 𝑅 𝑖𝑠 𝑟𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒 , 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐 𝑎𝑛𝑑 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒 ⇒ ∴ 𝑅 𝑖𝑠 𝑎𝑛 𝑒𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑐𝑒 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛 𝑜𝑛 ℤ∗ .

(𝑖𝑖)

[−1] = {𝑥 ∈ ℤ∗ ∶ 𝑥 𝑅 (−1)}
= {𝑥 ∈ ℤ∗ ∶ 𝑥 (−1) = −𝑥 > 0}
= {𝑥 ∈ ℤ∗ ∶ 𝑥 < 0} = ℤ−

[1] = {𝑥 ∈ ℤ∗ ∶ 𝑥 𝑅 (1)}

= {𝑥 ∈ ℤ∗ ∶ 𝑥 (1) = 𝑥 > 0} = ℤ+

#
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
11. Let 𝑆 = {(𝑎, 𝑎), (𝑎, 𝑐), (𝑏, 𝑏), (𝑏, 𝑒), (𝑐, 𝑎), (𝑐, 𝑐), (𝑑, 𝑑), (𝑒, 𝑏), (𝑒, 𝑒)} be a relation defined on the
set 𝐴 = {𝑎, 𝑏, 𝑐, 𝑑, 𝑒}
(𝑖) Show that 𝑆 is an equivalence relation.
(𝑖𝑖) Find all equivalence classes .

Solution: (𝑖)
1- ∵ (𝑎, 𝑎), (𝑏, 𝑏), (𝑐, 𝑐), (𝑑, 𝑑), (𝑒, 𝑒) ∈ 𝑆 ⇒ ∴ 𝑆 𝑖𝑠 𝑟𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒

2- ∵ (𝑎, 𝑐) , (𝑐, 𝑎) ∈ 𝑆 & (𝑏, 𝑒) , (𝑒, 𝑏) ∈ 𝑆 ⇒ ∴ 𝑆 𝑖𝑠 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐

3- ∵ (𝑎, 𝑐) , (𝑐, 𝑎), (𝑎, 𝑎) ∈ 𝑆

& (𝑏, 𝑒) , (𝑒, 𝑏), (𝑏, 𝑏) ∈ 𝑆

& (𝑒, 𝑏), (𝑏, 𝑒), (𝑒, 𝑒) ∈ 𝑆

& (𝑐, 𝑎), (𝑎, 𝑐), (𝑐, 𝑐) ∈ 𝑆 ⇒ ∴ 𝑆 𝑖𝑠 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒

∵ 𝑆 𝑖𝑠 𝑟𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒 , 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐 𝑎𝑛𝑑 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒 ⇒ ∴ 𝑆 𝑖𝑠 𝑎𝑛 𝑒𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑐𝑒 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛 𝑜𝑛 𝐴 .

(𝑖𝑖) [𝑎] = {𝑎, 𝑐}

[𝑏] = {𝑏, 𝑒}

[𝑑] = {𝑑}

⇒ ℑ(S) = {{𝑎, 𝑐}, {b, e}, {d}}

#
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
12. Let S be the relation defined on the set 𝐴 = {0,1,2,3,4} , such that:
𝑎, 𝑏 ∈ 𝐴 , 𝑎 𝑆 𝑏 ⇔ 3|(2𝑎 + 𝑏) , 3 devides ( 2𝑎 + 𝑏 )
(𝑖) Show that 𝑆 is an equivalence relation.
(𝑖𝑖) Find the equivalence classes [0] , [1]
(𝑖𝑖𝑖) Find the number of equivalence classes of the relation S .

Solution :
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
13. Let R be the relation defined on the set ℕ = {1,2,3, … } , such that:
𝑥, 𝑦 ∈ ℕ , 𝑥𝑅𝑦 ⇔ 𝑥+𝑦 𝑖𝑠 𝑒𝑣𝑒𝑛 .
(𝑖) Show that 𝑆 is an equivalence relation.
(𝑖𝑖) Find the equivalence class [2] .
(𝑖𝑖𝑖) Decide whether 4 ∈ [11] or not ?

Solution: (𝑖)
1- ∀ 𝑥 ∈ ℕ , 𝑥 + 𝑥 = 2𝑥 ( 𝑖𝑠 𝑒𝑣𝑒𝑛) ⇒ ∴ 𝑥 𝑅 𝑥 ⇒ ∴ R 𝑖𝑠 𝑟𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒

2- 𝑥, 𝑦 ∈ ℕ , 𝑥 𝑅 𝑦 ⇔ 𝑥 + 𝑦 = 2𝑚 ( 𝑖𝑠 𝑒𝑣𝑒𝑛) ∶ m ∈ ℕ
⇒ 𝑦 + 𝑥 = 2𝑚 ( 𝑖𝑠 𝑒𝑣𝑒𝑛) ⇒ 𝑦 𝑅 𝑥 ∴ R 𝑖𝑠 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐

3- 𝑥, 𝑦, 𝑧 ∈ ℕ , 𝑥 𝑅 𝑦 ⇔ 𝑥 + 𝑦 = 2𝑚1 ( 𝑖𝑠 𝑒𝑣𝑒𝑛) ∶ m1 ∈ ℕ
&
𝑦 𝑅 𝑧 ⇔ 𝑦 + 𝑧 = 2𝑚2 ( 𝑖𝑠 𝑒𝑣𝑒𝑛) ∶ m2 ∈ ℕ

(+) ⇒ __________________________
𝑥 + 2𝑦 + 𝑧 = 2𝑚1 + 2𝑚2
⇒ 𝑥 + 𝑧 = 2(m1 + 𝑚2 − 𝑦) = 2𝑚 ( 𝑖𝑠 𝑒𝑣𝑒𝑛)

: 𝑚 = (m1 + 𝑚2 − 𝑦) ∈ ℕ ⇒ ∴ 𝑥 𝑅 𝑧 ⇒ ∴ R 𝑖𝑠 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒

∵ 𝑅 𝑖𝑠 𝑟𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒 , 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐 𝑎𝑛𝑑 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒 ⇒ ∴ 𝑅 𝑖𝑠 𝑎𝑛 𝑒𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑐𝑒 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛 𝑜𝑛 ℕ .

(𝑖𝑖) [2] = {𝑥 ∈ ℕ: 𝑥 𝑅 2 }
= {𝑥 ∈ ℕ: 𝑥 + 2 = 2𝑚 ∶ 𝑚 ∈ ℕ }
= {𝑥 ∈ ℕ: 𝑥 = 2𝑚 − 2 = 2(𝑚 − 1) = 2𝑘 ∶ 𝑘 = 𝑚 − 1 ∈ ℕ }
= {𝑥 ∈ ℕ: 𝑥 = 2𝑘 , 𝑘 ∈ ℕ } = {2,4,6, … }

(𝑖𝑖𝑖) ∵ 4 + 11 = 15 ( 𝑖𝑠 𝑎𝑛 𝑜𝑑𝑑) ⇒ ∴ 4 ∉ [ 11 ]

#
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
14. Let S be the relation defined on the Rational set ℚ , such that:
𝑎, 𝑏 ∈ ℚ , 𝑎 𝑆 𝑏 ⇔ 𝑎 − 𝑏 = 2𝑚 ∶ 𝑚 ∈ ℤ , (𝑎 − 𝑏) 𝑖𝑠 𝑒𝑣𝑒𝑛 𝑖𝑛𝑡𝑒𝑔𝑒𝑟 .
(𝑖) Show that 𝑆 is an equivalence relation.
(𝑖𝑖) Show that [m] = [0] for every even integer m ,and [n] = [1] for every odd integer n .

Solution: (𝑖)

(𝑖𝑖) [0] = {𝑥 ∈ ℚ ∶ 𝑥 𝑆 0 }
= {𝑥 ∈ ℚ ∶ 𝑥 − 0 = 𝑥 = 𝑚 𝑖𝑠 𝑎𝑛 𝑒𝑣𝑒𝑛 𝑖𝑛𝑡𝑒𝑔𝑒𝑟 }
= [𝑚] ∶ 𝑚 𝑖𝑠 𝑎𝑛 𝑒𝑣𝑒𝑛 𝑖𝑛𝑡𝑒𝑔𝑒𝑟

[1] = {𝑥 ∈ ℚ ∶ 𝑥 𝑆 1 }
= {𝑥 ∈ ℚ ∶ 𝑥 − 1 = 𝑘 𝑖𝑠 𝑎𝑛 𝑒𝑣𝑒𝑛 𝑖𝑛𝑡𝑒𝑔𝑒𝑟 }
= {𝑥 ∈ ℚ ∶ 𝑥 = 𝑘 + 1 = 𝑛 𝑖𝑠 𝑎𝑛 𝑜𝑑𝑑 𝑖𝑛𝑡𝑒𝑔𝑒𝑟 }
= [𝑛] ∶ 𝑛 𝑖𝑠 𝑎𝑛 𝑜𝑑𝑑 𝑖𝑛𝑡𝑒𝑔𝑒𝑟

#
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
15. Let R be the relation defined on the integers set ℤ , such that:
𝑎, 𝑏 ∈ ℤ , 𝑎 𝑅 𝑏 ⇔ 𝑎 ≡ 𝑏 ( 𝑚𝑜𝑑 7 ) ⇔ 7|(𝑎 − 𝑏) , 7 devides ( 𝑎 − 𝑏 )
(𝑖) Show that 𝑅 is an equivalence relation.
(𝑖𝑖) Decide whethere 9 ∈ [2] .
(𝑖𝑖𝑖) If R is defined on the set = {1,5,12,22,35,41,55} , find all equivalence classes .

Solution: (𝑖) 𝑎, 𝑏 ∈ ℤ , 𝑎 𝑅 𝑏 ⇔ 𝑎 ≡ 𝑏 ( 𝑚𝑜𝑑 7 ) ⇔ 7|(𝑎 − 𝑏) ⇒ 𝑎 − 𝑏 = 7𝑚 ∶ 𝑚 ∈ ℤ

1- ∀ 𝑎 ∈ ℤ , 7|(𝑎 − 𝑎) = 0 ⇒ ∴ 𝑎 𝑅 𝑎 ⇒ ∴ 𝑅 𝑖𝑠 𝑟𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒

2- 𝑎, 𝑏 ∈ ℤ , 𝑎 𝑅 𝑏 ⇔ 𝑎 ≡ 𝑏 ( 𝑚𝑜𝑑 7 ) ⇔ 7|(𝑎 − 𝑏) ⇒ 𝑎 − 𝑏 = 7𝑚 ∶ 𝑚 ∈ ℤ
) multiply both sides by -1) ⇒ 𝑏 − 𝑎 = 7(−𝑚) ⇒ 7|(𝑏 − 𝑎) ⇒ 𝑏 𝑅 𝑎 ⇒ ∴ 𝑅 𝑖𝑠 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐

3- 𝑎, 𝑏, 𝑐 ∈ ℤ , 𝑎 𝑅 𝑏 ⇔ 𝑎 ≡ 𝑏 ( 𝑚𝑜𝑑 7 ) ⇔ 7|(𝑎 − 𝑏) ⇒ 𝑎 − 𝑏 = 7𝑚1 ∶ 𝑚1 ∈ ℤ

&
𝑏 𝑅 𝑐 ⇔ 𝑏 ≡ 𝑐 ( 𝑚𝑜𝑑 7 ) ⇔ 7|(𝑏 − 𝑐) ⇒ 𝑏 − 𝑐 = 7𝑚2 ∶ 𝑚2 ∈ ℤ
(+) ⇒ _____________________________
𝑎 − 𝑐 = 7(𝑚1 + 𝑚2 ) = 7𝑚
: 𝑚 = (𝑚1 + 𝑚2 ) ∈ ℤ ⇒ 7|(𝑎 − 𝑐) ⇒ 𝑎 𝑅 𝑐 ⇒ ∴ 𝑅 𝑖𝑠 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒

∵ 𝑅 𝑖𝑠 𝑟𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒 , 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐 𝑎𝑛𝑑 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒 ⇒ ∴ 𝑅 𝑖𝑠 𝑎𝑛 𝑒𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑐𝑒 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛 𝑜𝑛 ℤ .

(𝑖𝑖) ∵ 9 − 2 = 7 ⇒ 7|(9 − 2) ⇒ ∴ 9 𝑅 2 ∴ 9 ∈ [ 2 ]

(𝑖𝑖𝑖) [1] = {1,22}

[5] = {5,12}
[35] = {35}
[41] = {41,55}

ℑ(R) = {{1,22}, {5,12}, {35}, {41,55}}

#
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
16.Let R be the relation defined on the integers set ℤ , such that:
𝑎, 𝑏 ∈ ℤ , 𝑎 𝑅 𝑏 ⇔ 𝑎2 ≡ 𝑏 2 ( 𝑚𝑜𝑑 7 ) ⇔ 7|(𝑎2 − 𝑏 2 ) , , 7 devides ( 𝑎2 − 𝑏 2 )
(𝑖) Show that 𝑅 is an equivalence relation.
(𝑖𝑖) Find ℑ(𝑅) .
Solution:
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
17. Let S be a relation defined on ℝ∗ × ℝ∗ , such that:
(𝑥, 𝑦), (𝑎, 𝑏) ∈ ℝ∗ × ℝ∗ , (𝑥, 𝑦) 𝑆 (𝑎, 𝑏) ⇔ 𝑥𝑦(𝑎2 + 𝑏 2 ) = 𝑎𝑏(𝑥 2 + 𝑦 2 )
𝑥𝑦 𝑎𝑏
⇔ =
𝑥 2 +𝑦 2 𝑎2 +𝑏2

(𝑖) Show that 𝑆 is an equivalence relation.

(𝑖𝑖) Find the equivalence classes [(3,4)] , [(2,1)]
Solution:
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
18. Let T be the relation defined on the integers set ℤ , such that:
𝑥, 𝑦 ∈ ℤ , 𝑥 𝑇 𝑦 ⇔ |𝑥 − 3| = |𝑦 − 3|
(𝑖) Show that 𝑇 is an equivalence relation.
(𝑖𝑖) Find [0] , [3] , [−2]
(𝑖𝑖) Find ℑ(𝑇) .
Solution:
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
19. Let ~ be a relation defined on ℤ × ℤ+, such that:
𝑚 𝑝
(𝑚, 𝑛), (𝑝, 𝑞) ∈ ℤ × ℤ+ (𝑚, 𝑛)~(𝑝, 𝑞) ⇔ 𝑚𝑞 = 𝑝𝑛 ⇔ =𝑞
𝑛

(𝑖) Show that ~ is an equivalence relation.

(𝑖𝑖) Find the equivalence classes [(3,4)] , [(1,2)]
Solution:
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
20. Let T be the relation defined on the Rational set ℝ , such that:
𝑥, 𝑦 ∈ ℚ , 𝑥 𝑆 𝑦 ⇔ 𝑥 − 𝑦 ∈ ℤ , ( 𝑥 − 𝑦 ) 𝑖𝑠 𝑖𝑛𝑡𝑒𝑔𝑒𝑟
(𝑖) Show that 𝑆 is an equivalence relation.
1
(𝑖𝑖) Find [0] and [ ] .
2

Solution:
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
21.Let S be a relation defined on ℝ such that:
𝑥, 𝑦 ∈ ℝ , 𝑥 𝑆 𝑦 ⇔ 𝑥 − 𝑦 ∈ ℚ , (𝑥 − 𝑦 ) 𝑖𝑠 𝑟𝑎𝑡𝑖𝑜𝑛𝑎𝑙 .
(𝑖) Show that 𝑆 is an equivalence relation.
(𝑖𝑖) Find [0]

Solution:
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
22.Let T be a relation defined on ℝ × ℝ , such that:
(𝑎, 𝑏), (𝑐, 𝑑) ∈ ℝ × ℝ , (𝑎, 𝑏) 𝑇 (𝑐, 𝑑) ⇔ 𝑏 − 𝑎2 = 𝑑 − 𝑐 2

(𝑖) Show that T is an equivalence relation.

(𝑖𝑖) Find the equivalence classes [(0,0)] , [(1,2)]
Solution: (𝑖)
1- ∀(𝑎, 𝑏) ∈ ℝ × ℝ , 𝑏 − 𝑎2 = 𝑏 − 𝑎2 ⇒ (𝑎, 𝑏) 𝑇 (𝑎, 𝑏) ⇒ ∴ 𝑇 𝑖𝑠 𝑟𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒

2- (𝑎, 𝑏), (𝑐, 𝑑) ∈ ℝ × ℝ , (𝑎, 𝑏) 𝑇 (𝑐, 𝑑) ⇔ 𝑏 − 𝑎2 = 𝑑 − 𝑐 2

⇒ 𝑑 − 𝑐 2 = 𝑏 − 𝑎2
⇒ (𝑐, 𝑑) 𝑇 (𝑎, 𝑏) ⇒ ∴ 𝑇 𝑖𝑠 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐
3-
(𝑎, 𝑏), (𝑐, 𝑑), (𝑒, 𝑓) ∈ ℝ × ℝ , (𝑎, 𝑏) 𝑇 (𝑐, 𝑑) ⇔ 𝑏 − 𝑎2 = 𝑑 − 𝑐 2
&
(𝑐, 𝑑) 𝑇 (𝑒, 𝑓) ⇔ 𝑑 − 𝑐 2 = 𝑓 − 𝑒 2

𝑏 − 𝑎2 = 𝑑 − 𝑐 2 = 𝑓 − 𝑒 2 ⇒ 𝑏 − 𝑎2 = 𝑓 − 𝑒 2 ⇒ (𝑎, 𝑏) 𝑇 (𝑒, 𝑓) ⇒ ∴ 𝑇 𝑖𝑠 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒

∵ 𝑇 𝑖𝑠 𝑟𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒 , 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐 𝑎𝑛𝑑 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒 ⇒ ∴ 𝑇 𝑖𝑠 𝑎𝑛 𝑒𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑐𝑒 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛 𝑜𝑛 ℝ × ℝ .

(𝑖𝑖)
[(0,0)] = {(𝑥, 𝑦) ∈ ℝ × ℝ ∶ (𝑥, 𝑦) 𝑇 (0,0)}
= {(𝑥, 𝑦) ∈ ℝ × ℝ ∶ 𝑦 − 𝑥 2 = 0 − 02 = 0}
= {(𝑥, 𝑦) ∈ ℝ × ℝ ∶ 𝑦 = 𝑥 2 }

[(1,2)] = {(𝑥, 𝑦) ∈ ℝ × ℝ ∶ (𝑥, 𝑦) 𝑇 (1,2)}

= {(𝑥, 𝑦) ∈ ℝ × ℝ ∶ 𝑦 − 𝑥 2 = 2 − 12 = 1}
= {(𝑥, 𝑦) ∈ ℝ × ℝ ∶ 𝑦 = 𝑥 2 + 1}

#
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
23.Let R be the relation defined on the integers set ℤ , such that:
𝑥, 𝑦 ∈ ℤ , 𝑥𝑅𝑦 ⇔ 4|(3𝑥 + 𝑦) , 4 devides ( 3𝑥 + 𝑦 )
(𝑖) Show that 𝑅 is an equivalence relation.
(𝑖𝑖) Find [0] , [1] .

Solution :
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
24.Let R be the relation defined on the integers set ℤ , such that:
𝑎, 𝑏 ∈ ℤ , 𝑎 𝑅 𝑏 ⇔ 𝑎 ≡ 4𝑏 ( 𝑚𝑜𝑑 3 ) ⇔ 3|(𝑎 − 4𝑏) , 3 devides ( 𝑎 − 4𝑏 )
(𝑖) Show that 𝑅 is an equivalence relation.
(𝑖𝑖) Find the equivalence class [0] .
(𝑖𝑖𝑖) Decide whether 2 ∈ [5] ?
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
25.Let S be a relation defined on 𝐴 × 𝐴 , where 𝐴 = {1,2,3,4,5} such that:
(𝑎, 𝑏), (𝑐, 𝑑) ∈ 𝐴 × 𝐴 , (𝑎, 𝑏) 𝑆 (𝑐, 𝑑) ⇔ 𝑎 + 𝑏 = 𝑐 + 𝑑

(𝑖) Show that S is an equivalence relation.

(𝑖𝑖) Find the equivalence classes [(3,3)] , [(5,5)] , [(2,3)]
Solution: (𝑖)
1- ∀(𝑎, 𝑏) ∈ 𝐴 × 𝐴 , 𝑎 + 𝑏 = 𝑎 + 𝑏 ⇒ (𝑎, 𝑏) 𝑆 (𝑎, 𝑏) ⇒ ∴ 𝑆 𝑖𝑠 𝑟𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒

2- (𝑎, 𝑏), (𝑐, 𝑑) ∈ 𝐴 × 𝐴 , (𝑎, 𝑏) 𝑆 (𝑐, 𝑑) ⇔ 𝑎 + 𝑏 = 𝑐 + 𝑑

⇒ 𝑐 + 𝑑 = 𝑎 + 𝑏 ⇒ (𝑐, 𝑑) 𝑆 (𝑎, 𝑏) ⇒ ∴ 𝑆 𝑖𝑠 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐

3- (𝑎, 𝑏), (𝑐, 𝑑), (𝑒, 𝑓) ∈ 𝐴 × 𝐴 , (𝑎, 𝑏) 𝑆 (𝑐, 𝑑) ⇔ 𝑎 + 𝑏 = 𝑐 + 𝑑

&
(𝑐, 𝑑) 𝑆 (𝑒, 𝑓) ⇔ 𝑐 + 𝑑 = 𝑒 + 𝑓

𝑎 + 𝑏 = 𝑐 + 𝑑 = 𝑒 + 𝑓 ⇒ 𝑎 + 𝑏 = 𝑒 + 𝑓 ⇒ (𝑎, 𝑏) 𝑆 (𝑒, 𝑓) ⇒ ∴ 𝑆 𝑖𝑠 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒

∵ 𝑆 𝑖𝑠 𝑟𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒 , 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐 𝑎𝑛𝑑 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒 ⇒ ∴ 𝑆 𝑖𝑠 𝑎𝑛 𝑒𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑐𝑒 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛 𝑜𝑛 𝐴 × 𝐴.

(𝑖𝑖)

[(3,3)] = {(3,3), (1,5), (2,4), (5,1), (4,2)}

[(5,5)] = {(5,5)}

[(2,3)] = {(1,4), (2,3), (4,1), (3,2)}

#
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
26. Let R be the relation defined on the integers set ℕ = {1,2,3, … } , such that:
𝑎, 𝑏 ∈ ℕ , 𝑎 𝑅 𝑏 ⇔ 𝑎𝑏 = 𝑘 2 ∶ 𝑘 ∈ {1,2,3, … }
(𝑖) Show that 𝑅 is an equivalence relation.
(𝑖𝑖) Find the equivalence class [1] .
Solution: (𝑖)
1- ∀𝑎 ∈ ℕ , 𝑎𝑎 = 𝑎2 ⇒ ∴ 𝑎 𝑅 𝑎 ⇒ ∴ R 𝑖𝑠 𝑟𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒

2- 𝑎, 𝑏 ∈ ℕ , 𝑎 𝑅 𝑏 ⇔ 𝑎𝑏 = 𝑘 2 ∶ 𝑘 ∈ {1,2,3, … }
⇒ 𝑏𝑎 = 𝑘 2 ⇒ 𝑏 𝑅 𝑎 ⇒ ∴ R 𝑖𝑠 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐

3- 𝑎, 𝑏, 𝑐 ∈ ℕ , 𝑎 𝑅 𝑏 ⇔ 𝑎𝑏 = 𝑘1 2 ∶ 𝑘1 ∈ {1,2,3, … } (1)
&
𝑏𝑅𝑐 ⇔ 𝑏𝑐 = 𝑘2 2 ∶ 𝑘2 ∈ {1,2,3, … } (2)
(1) × (2) ⇒ __________________________
𝑎𝑏 2 𝑐 = 𝑘1 2 𝑘2 2
𝑘1 2 𝑘2 2 𝑘1 𝑘2 2
⇒ 𝑎𝑐 =
𝑏2
= (
𝑏
) = 𝑘2
𝑘1 𝑘2
∶ = 𝑘 ∶ (𝑘 𝑖𝑠 𝑎 𝑝𝑜𝑠𝑖𝑡𝑖𝑣𝑒 𝑖𝑛𝑡𝑒𝑔𝑒𝑟, 𝑐𝑎𝑢𝑠𝑒 𝑏 𝑑𝑒𝑣𝑖𝑑𝑒𝑠 𝑏𝑜𝑡ℎ 𝑘1 𝑎𝑛𝑑 𝑘2 )
𝑏
⇒ 𝑎𝑐 = 𝑘 2 ⇒ 𝑎𝑅𝑐 ⇒ ∴ ‫ متعدية‬R

∵ 𝑅 𝑖𝑠 𝑟𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒 , 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐 𝑎𝑛𝑑 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒 ⇒ ∴ 𝑅 𝑖𝑠 𝑎𝑛 𝑒𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑐𝑒 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛 𝑜𝑛

(𝑖𝑖)

[1] = {𝑎 ∈ ℕ ∶ 𝑎 𝑅 1}
= {𝑎 ∈ ℕ ∶ 𝑎(1) = 𝑎 = 𝑘 2 ∶ 𝑘 ∈ ℕ}
= {1,4,9,16,25, … }

#
Math151 Discrete Mathematics (4.2) Equivalence Relations By: Malek Zein AL-Abidin
27. Let T be the equivalence relation defined on the set 𝐴 = {1,2,3,4}, where {1,3}, {2}, {4} are
equivalence classes. Represent T in ordered pairs .

28. Let T be the equivalence relation defined on the set 𝐴 = {1,2,3,4,5,6,7,8}, where
ℑ(T) = {{1}, {2,3}, {4,5,6}, {7,8}} . Represent T in ordered pairs .