For any function whatsoever, a relation can be defined on the domain by
so two inputs are related exactly when cannot tell them apart.
Now take , and . Which of the following is completely correct?
Confirming your payment
Competency-Based Questions (CBQ) · Question 48 of 80
For any function whatsoever, a relation can be defined on the domain by
so two inputs are related exactly when cannot tell them apart.
Now take , and . Which of the following is completely correct?
(A) is not an equivalence relation here, because is not one-one
(B) is an equivalence relation; ; every class holds exactly one integer
(C) is an equivalence relation; ; exactly one class holds a single integer
(D) is an equivalence relation; ; no class holds a single integer
Option (C) is correct.
Explanation: Settle the general question first, then compute the classes for this particular .
Step 1 — is an equivalence relation for every . Nothing about is needed beyond the fact that it is a function, so each input has one output.
All three come straight from the fact that equality is reflexive, symmetric and transitive.
Step 2 — the classes for on . Here means , that is , that is . So or , and
For example , because and no other integer squares to . Do not write : an equivalence class is a set of elements of the domain , never a set of output values.
Step 3 — which classes are singletons? holds two different integers whenever , i.e. whenever . Only at do the two coincide, giving . So exactly one class holds a single integer, and every other class holds exactly two.

A neat way to say it: this glues each integer to its own negative, and is the one integer that is its own negative, so it sits alone.
Why the other options tempt:
| Option | The mistake |
|---|---|
| (A) | This has the logic backwards. being many-one is what makes interesting — it is why classes larger than one element appear. If were one-one, would simply be the identity relation, which is still an equivalence relation. |
| (B) | Two errors. has been given as the set of output values instead of the set of related inputs, and treating as the identity relation ignores . |
| (D) | The formula is right, but it was never tested at . There , a class with one element. |