Purpose: To verify if a relation defined on a set is an equivalence relation.
Conceptual Analysis: A relation R in a set A is said to be an equivalence relation if R is
Reflexive, Symmetric and Transitive. Reflexive property:If for a relation R on A, ∀ 𝒙Є𝑨, (𝒂, 𝒂)Є𝑹 ,then R is said to possess reflexive property. And, the relation r is called as a reflexive relation. Example: let A= { 1,2,3,4,5} and R={{(x,y)/ x, 𝒚Є A ,and x=y } Clearly, here R= { (1,1), (2,2), (3,3), (4,4), (5,5) } Another example is that T= { x/ x is a set of triangles} and R is defined on T as R= { (x.y)/ ∀𝒙, 𝒚 Є A, xis similar to y} Symmetric property: If (a,b) ЄR implies that (b,a) Є R,∀ a,b ЄA, the n the relation defined on A is called a symmetric relation. Example; Let N= the set of natural numbers, a relation defined on it is: R= { (x, y)/ x, y Є N and (x+y)=15} ,obviously here, R is a symmetric relation.. Transitive relation: If for a relation defined on A, (a,b)ЄR, and (b,c) ЄR implies that (a,c) ЄR , for all a,b,cЄ A, then the relation is said to be transitive. Example: Let A= {1 ,2,3,4,5,6,7,8,9,10} , and R = { (x,y)/ ∀ x,yЄ A, X≥ Y } This satisfies the transitive property .so, it is a transitive relation. So, to verify that a relation is equivalence, we need to establish these three conditions .
Problem: Z is the set integers. A relation R defined on Z is :R= { (a,b)/
(a,b)Є ZxZ and a≡ 𝑏 (mod 2) }. Prove that R is an equivalence relation. Solution: We know, ∀ aЄ Z ,we get a-a=0, so a≡ a(mod2) .This shows That (a,a)Є R .Hence the relation R is reflexive. Now, for any (a,b) Є R implies that a≡ b(mod2) .That means a-b is divisible 2. so, let (a-b) /2 = t, tЄ z . (a-b)/2 = t implies ( b-a) /2 = -(a-b)/2 = -t And -t Єz , this shows that b≡ a(mod2),So ,(b,a) ЄR. Hence, R is Symmetric . Again, ∃ a,b,c Є Z, given that (a,b)Є R and (b,c) Є R implies a≡ 𝑏(𝑚𝑜𝑑2)𝑎𝑛𝑑 b≡ 𝑐(𝑚𝑜𝑑2) . So, let us take (a-b)/2= t1 and (b-c)/2 = t2 , then now we get (a-c) /2= {(a-b) + (b-c)} /2 = (a-b)/2 + (b-c) /2 = t1 + t 2 , where (t1 + t 2 ) Є Z .This shows that a ≡ 𝑐 (𝑚𝑜𝑑 2) ,So, (a,c) Є R. Hence, R is transitive. Conclusion: It is concluded that R is an equivalence relation Since, it is Reflexive, Symmetric as well as Transitive. Application: validity of Equivalence relation in a set is useful for extension of Mathematical analysis or deduction.