Let R be the relation in the set A = {a, b, c, d} given by R = {(a, a), (b, b), (c, c), (a, b), (b, a), (c, d), (d, d), (d, c)}
Answer & explanation
Correct answer: option 4
The correct answer is Option (4) → R is an equivalence relation
R is checked for the three properties one by one.
Reflexive: (a, a), (b, b), (c, c) and (d, d) are all in R, so \((p, p) \in R\) for every p in A.
Symmetric: the pairs with different entries come in reversed couples, (a, b) with (b, a) and (c, d) with (d, c). So whenever \((p, q) \in R\), also \((q, p) \in R\).
Transitive: the only chains (p, q), (q, s) with p ≠ q are
\((a, b), (b, a)\) giving \((a, a) \in R\)
\((b, a), (a, b)\) giving \((b, b) \in R\)
\((c, d), (d, c)\) giving \((c, c) \in R\)
\((d, c), (c, d)\) giving \((d, d) \in R\)
Chains that use a pair like (a, a) just give back the other pair. So R is transitive.
Being reflexive, symmetric and transitive, R is an equivalence relation. (It splits A into the classes {a, b} and {c, d}.)