A relation defined on a set A is called equivalence relation, if it is reflexive, symmetric and transitive. In mathematics, we have many relations that are reflexive, symmetric and transitive. This is the most important relation in math.
A relation R is said to be an equivalence relation if it is reflexive, symmetric and transitive. So, we can say if,

  1. (a, b) $\in$ R, $\forall$ a, b ∈ A.
  2. (a, b) $\in$ R $\Rightarrow$ (b, a) $\in$ R, for all a, b ∈ A.
  3. (a, b) $\in$ R and (b, c) $\in$ R $\Rightarrow$ (a, c) $\in$ R, $\forall$ a, b, c $\in$ A.

An equivalence relation divides a set into disjoint subsets. These disjoint subsets are called equivalence classes. All elements of these classes are equal to themselves, not with any element from the different classes.

Equivalence Relation

If we have a set A and an equivalence relation on A, then for any element a $\in$ A, the equivalence classes is the subset of all element in A which are equivalent to a. To prove equivalence relation, we have to prove that the given relation is reflexive, symmetric and transitive. Then, automatically that relation becomes an equivalence relation.

Solved Example

Question: If A be the set of all lines in a plane and R be the relation in A defined
as R = {(A1, A2) : A1 is parallel to A2}. Prove that R is an equivalence relation.
Equivalence Relation Proof
Reflexive: Let we have line A1 and we know that a line is parallel to itself, hence A1 II A1 $\in$ R.
Symmetric: If A1II A2, then A2 II A1 i.e. if A1 is parallel to A2, then A2 is
parallel to A1. So, the relation R is symmetric.
Transitive: Let A1, A2 and A3 be three lines in such a way that
A1 II A2 $\in$ R, A2 II A3 $\in$ R
$\Rightarrow$ A1 II A3$\in$ R
Hence, relation R is the equivalence relation.