Consider the relations and defined as for all and for all . Then
Determine which of and is an equivalence relation.
An equivalence relation must be reflexive, symmetric, and transitive.
Checking : for .
Reflexive? We need , i.e., . This fails for other values of (e.g., ). Not reflexive.
Since is not reflexive, it is NOT an equivalence relation.
Checking : for .
Reflexive? . True always. Reflexive.
Symmetric? If , then , which means , so . Symmetric.
Transitive? If and , then and . Adding: , which simplifies to , so . Transitive.
is reflexive, symmetric, and transitive, so it IS an equivalence relation.
The correct answer is Option B: Only is an equivalence relation.
Tagged Reflexive, symmetric and transitive relations. Machine-assigned, so read it as a strong shortlist rather than a verdict.