Show that the relation in the set given by
is an equivalence relation.
Confirming your payment
Previous Year Questions · Question 32 of 37
Show that the relation in the set given by
is an equivalence relation.
First write out the set. The condition includes , so
which has 13 elements. The relation is .
Reflexive. Let . Then
which is divisible by 3, so . This holds for every , so is reflexive.
Symmetric. Let . Then is divisible by 3. Since
the number is divisible by 3 too, so . Hence is symmetric.
Transitive. Let and — these two are the only assumptions we are allowed, because is exactly what must be proved.
From the assumptions, and are multiples of 3; a number is a multiple of 3 precisely when its absolute value is, so and are themselves multiples of 3. Write
Adding these,
so is a multiple of 3, and therefore is divisible by 3. Hence , and is transitive.
Since is reflexive, symmetric and transitive, is an equivalence relation on .
(Worth seeing: divisible by 3 means and leave the same remainder on division by 3. So splits into exactly three classes — , and — and accounts for every element of , which is the check that the has not been dropped.)