The relation is:
- A
reflexive and transitive but not symmetric
- B
reflexive and symmetric but not transitive
- C
symmetric and transitive but not reflexive
- D
an equivalence relation
The relation is:
reflexive and transitive but not symmetric
reflexive and symmetric but not transitive
symmetric and transitive but not reflexive
an equivalence relation
Correct answer:D
Standard Method
Given: The relation is
Find: Whether is reflexive, symmetric, and transitive.
To determine whether the relation is an equivalence relation, we check if it is reflexive, symmetric, and transitive.
Reflexive: For every integer ,
which is even. Hence, for all . So the relation is reflexive.
Symmetric: If , then is even. Since
is also even. Therefore, . So the relation is symmetric.
Transitive: If and , then and are even. Let
where . Subtracting,
so is even. Hence and have the same parity, therefore is even. Thus , so the relation is transitive.
Since the relation is reflexive, symmetric, and transitive, is an equivalence relation. Therefore, the correct option is D.
Property Check Method
Given:
Find: The correct classification of the relation.
Step 1: Check reflexivity by seeing whether is even for all integers .
Step 2: Check symmetry by seeing whether from even, it follows that is even.
Step 3: Check transitivity by verifying that if and are even, then is even.
All three properties hold, so the relation is an equivalence relation. Hence, the correct option is D.
Assuming transitivity fails because the relation is defined using the sum . This is wrong because parity arguments must be used, not superficial pattern matching. Check whether the parity condition is preserved from and to .
Confusing symmetry with reflexivity. Showing that proves symmetry, but reflexivity must be checked separately by testing whether for every .
Using only examples such as even-even or odd-odd pairs and concluding the result. Examples may suggest the pattern, but they do not prove the relation properties for all integers. Always write the general argument.
Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.