- Areflexive but not symmetric.
- Ban equivalence relation.
- Creflexive and symmetric but not transitive.
- Dtransitive but not symmetric.
View written solutionFree
Correct answer: C
- Given relation
We have a relation on the set , where
For ,
We must determine whether is reflexive, symmetric, transitive, etc.
- Simplify the condition using parity
Since we only care whether is even, work modulo .
Now, So But modulo , subtraction and addition are the same, so Thus, Equivalently,
So the relation depends only on the parity of .
- Parity structure of elements of and
From :
- even elements:
- odd elements:
From :
- even elements:
- odd elements:
For any pair , there are four parity types:
Now compute for these types.
Let us note:
- product is even if at least one factor is even,
- product is odd only if both factors are odd.
- Check reflexivity
For reflexivity, every must satisfy
This means which is always even.
Hence is reflexive.
- Check symmetry
Assume . Then We need to test whether holds, i.e. whether is even.
Again modulo , and But since multiplication is commutative, So both expressions have the same parity.
Therefore, Thus is symmetric.
- Check transitivity
We must see whether
We will find a counterexample.
Take: These are all in since
- , .
Now check each relation:
(i)
which is odd. So this does not work.
Let us choose a better example using parity.
We want:
- first pair related,
- second pair related,
- first and third not related.
Since the condition is , classify by parity type:
- behaves like both products always even with many types,
- and are often related,
- behaves differently.
Let us explicitly test using parity types.
For a pair , define:
- parity from ,
- parity from .
The relation condition between and is
Now take
- of type , say ,
- of type , say ,
- of type , say .
Check:
(i)
which is even. So is true.
(ii)
which is even. So is true.
(iii)
which is odd. So is false.
Thus,
Hence is not transitive.
- Conclusion
We have shown:
- is reflexive,
- is symmetric,
- is not transitive.
Therefore, the correct option is
- Comparison with stored correct answer
Stored correct answer: .
This matches our derived answer.
More from Sets and Relations
- Let and . Let be a relation defined on by if and only if . Then the number of elements in is .2024 · Numerical
- Let . Suppose is the set of all the subsets of , then the relation is :2024 · MCQ
- Let and be two finite sets with and elements respectively. The total number of subsets of the set is 56 more than the total number of subsets of . Then the distance of the point from the point is…2024 · MCQ
- Let be a relation on defined by if and only if is divisible by 5. Then is2024 · MCQ
- If R is the smallest equivalence relation on the set such that , then the number of elements in is .2024 · MCQ
- The number of symmetric relations defined on the set which are not reflexive is .2024 · Numerical
- Let and be a relation on . Let be the equivalence relation on such that and the number of elements in is . Then, the…2024 · Numerical
- Let . Let be a relation on defined by if and only if . Let be a symmetric relation on such that and the number of elements in…2024 · Numerical