In mathematics, an **equivalence relation** is a kind of binary relation that should be reflexive, symmetric and transitive. The well-known example of an equivalence relation is the “equal to (=)” relation. In other words, two elements of the given set are equivalent to each other if they belong to the same equivalence class. In this article, we will discuss the definition of equivalence relation, proof, properties with many solved examples.

**Table of Contents:**

## Equivalence Relation Definition

A relation R on a set A is said to be an **equivalence relation** if and only if the relation R is reflexive, symmetric and transitive. The equivalence relation is a relationship on the set which is generally represented by the symbol “âˆ¼”.

**Reflexive**: A relation is said to be reflexive, if (a, a) âˆˆ R, for every a âˆˆ A.

**Symmetric**: A relation is said to be symmetric, if (a, b) âˆˆ R, then (b, a) âˆˆ R.

**Transitive**: A relation is said to be transitive if (a, b) âˆˆ R and (b, c) âˆˆ R, then (a, c) âˆˆ R.

In terms of equivalence relation notation, it is defined as follows:

A binary relationÂ âˆ¼ on a set A is said to be an equivalence relation, if and only if it is reflexive, symmetric and transitive.

(i.e) For all x, y, z in set A,

- xÂ âˆ¼ x (Reflexivity)
- xÂ âˆ¼ y if and only if yÂ âˆ¼ x (Symmetry)
- If xâˆ¼y and yâˆ¼z, then xâˆ¼z (Transitivity)

Equivalence relations can be explained in terms of the following examples:

- The sign of ‘is equal to (=)’ on a set of numbers; for example, 1/3 = 3/9.
- For a given set of triangles, the relation of ‘is similar to (~)’ and ‘is congruent to (â‰…)’ shows equivalence.
- For a given set of integers, the relation of ‘congruence modulo n (â‰¡)’ shows equivalence.
- The image and domain are the same under a function, which shows the relation of equivalence.
- For a set of all angles, ‘has the same cosine’.
- For a set of all real numbers,’ has the same absolute value’.

## Equivalence Relation Proof

Here is an equivalence relation example to prove the properties.

Let us assume that R be a relation on the set of ordered pairs of positive integers such that ((a, b), (c, d))âˆˆ R if and only if ad=bc. Is R an equivalence relation?

In order to prove that R is an equivalence relation, we must show that R is reflexive, symmetric and transitive.

The Proof for the given condition is given below:

### Reflexive Property

According to the reflexive property, if (a, a) âˆˆ R, for every aâˆˆA

For all pairs of positive integers,

((a, b),(a, b))âˆˆ R.

Clearly, we can say

ab = ab for all positive integers.

Hence, the reflexive property is proved.

### Symmetric Property

From the symmetric property,

if (a, b) âˆˆ R, then we can say (b, a) âˆˆ R

For the given condition,

if ((a, b),(c, d)) âˆˆ R, then ((c, d),(a, b)) âˆˆ R.

If ((a, b),(c, d))âˆˆ R, then ad = bc and cb = da

since multiplication is commutative.

Therefore ((c, d),(a, b)) âˆˆ R

Hence symmetric property is proved.

### Transitive Property

From the transitive property,

if (a, b) âˆˆ R and (b, c) âˆˆ R, then (a, c) also belongs to R

For the given set of ordered pairs of positive integers,

((a, b), (c, d))âˆˆ R and ((c, d), (e, f))âˆˆ R,

then ((a, b),(e, f) âˆˆ R.

Now, assume that ((a, b), (c, d))âˆˆ R and ((c, d), (e, f)) âˆˆ R.

Then we get, ad = cb and cf = de.

The above relation implies that a/b = c/d and that c/d = e/f,

so a/b = e/f we get af = be.

Therefore ((a, b),(e, f))âˆˆ R.

Hence transitive property is proved.

## Equivalence Relation Examples

Go through the equivalence relation examples and solutions provided here

**Question 1:**

Let us assume that F is a relation on the set **R** real numbers defined by xFy if and only if x-y is an integer. Prove that F is an equivalence relation on **R.**

**Solution:**

Reflexive: Consider x belongs to **R**,then x – x = 0 which is an integer. Therefore xFx.

Symmetric: Consider x and y belongs to **R** and xFy. Then x – y is an integer. Thus, y – x = – ( x – y), y – x is also an integer. Therefore yFx.

Transitive: Consider x and y belongs to **R**, xFy and yFz. Therefore x-y and y-z are integers. According to the transitive property, ( x – y ) + ( y – z ) = x – z is also an integer. So that xFz.

Thus, R is an equivalence relation on **R**.

**Question 2:**

Show that the relation R is an equivalence relation in the set A = { 1, 2, 3, 4, 5 } given by the relation R = { (a, b):|a-b| is even }.

**Solution:**

R = { (a, b):|a-b| is even }. Where a, b belongs to A

**Reflexive Property :**

From the given relation,

|a – a| = | 0 |=0

And 0 is always even.

Thus, |a-a| is even

Therefore, (a, a) belongs to R

Hence R is Reflexive

**Symmetric Property :**

From the given relation,

|a – b| = |b – a|

We know that |a – b| = |-(b – a)|= |b – a|

Hence |a – b| is even,

Then |b – a| is also even.

Therefore, if (a, b) âˆˆ R, then (b, a) belongs to R

Hence R is symmetric.

**Transitive Property :**

If |a-b| is even, then (a-b) is even.

Similarly, if |b-c| is even, then (b-c) is also even.

Sum of even number is also even

So, we can write it as a-b+ b-c is even

Then, a – c is also even

So,

|a – b| and |b – c| is even , then |a-c| is even.

Therefore, if (a, b) âˆˆ R and (b, c) âˆˆ R, then (a, c) also belongs to R

### Equivalence Relation Practice Questions

Solve the practise problems on the equivalence relation given below:

- Prove that the relation R is an equivalence relation, given that the set of complex numbers is defined by z
_{1}R z_{2}â‡”[(z_{1}-z_{2})/(z_{1}+z_{2})] is real. - Show that the given relation R is an equivalence relation, which is defined by (p, q) R (r, s) â‡’ (p+s)=(q+r)
- Check the reflexive, symmetric and transitive property of the relation x R y, if and only if y is divisible by x, where x, y âˆˆ N.

## Frequently Asked Questions on Equivalence Relation

### What is meant by equivalence relation?

In mathematics, the relation R on set A is said to be an equivalence relation, if the relation satisfies the properties, such as reflexive property, transitive property, and symmetric property.

### What are the three different properties of the equivalence relation?

The three different properties of equivalence relation are:

Reflexive Property

Symmetric Property

Transitive Property

### Explain reflexive, transitive and symmetric properties.

A relation R is said to be reflective, if (x,x) âˆˆ R, for every x âˆˆ set A

A relation R is said to be symmetric, if (x,y) âˆˆ R, then (y, x) âˆˆ R

A relation R is said to be transitive, if (x, y) âˆˆ R and (y,z)âˆˆ R, then (x, z) âˆˆ R

### Can we say the empty relation is an equivalence relation?

We can say that the empty relation on the empty set is considered an equivalence relation. But, the empty relation on the non-empty set is not considered as an equivalence relation.

### Can we say every relation is a function?

No, every relation is not considered as a function, but every function is considered as a relation.

To learn equivalence relation easily and engagingly, register with BYJU’S – The Learning App and also watch interactive videos to get information for other Maths-related concepts.