Let A = {0 ,1,2,...,9}. Let R be a relation on A defined by (x,y) R if and only if is a multiple of 3.
Given below are two statements:
Statement I:
Statement II: R is an equivalence relation.
In the light of the above statements, choose the correct answer from the options given below
Let . The relation on is defined by if and only if is a multiple of 3. We verify Statement I () and Statement II (R is an equivalence relation).
Since two elements are related precisely when , they have the same remainder upon division by 3. Hence the equivalence class for remainder 0 is , which has 4 elements; the class for remainder 1 is with 3 elements; and the class for remainder 2 is with 3 elements.
Now, to show that is an equivalence relation, observe that is a multiple of 3, so is reflexive. Moreover, if is a multiple of 3 then is also a multiple of 3, giving symmetry. Furthermore, if and , then , which establishes transitivity. Therefore, is an equivalence relation.
Next, the total number of ordered pairs in is the sum of over the sizes of the equivalence classes, giving Since , Statement I is incorrect.
The correct answer is Option (2): Statement I is incorrect but Statement II is correct.
Tagged Reflexive, symmetric and transitive relations. Machine-assigned, so read it as a strong shortlist rather than a verdict.