Let be a relation on , given by
Then is:
- A
Reflexive but neither symmetric nor transitive
- B
Reflexive and transitive but not symmetric
- C
Reflexive and symmetric but not transitive
- D
An equivalence relation
Let be a relation on , given by
Then is:
Reflexive but neither symmetric nor transitive
Reflexive and transitive but not symmetric
Reflexive and symmetric but not transitive
An equivalence relation
Correct answer:C
Standard Method
Given: on .
Find: Whether the relation is reflexive, symmetric, transitive, or an equivalence relation.
Reflexivity: For any ,
which is irrational. Hence for every , so the relation is reflexive.
Symmetry: Take
Then
which is irrational, so . But for ,
which is rational. Therefore , so the relation is not symmetric.
Transitivity: Take
Then
which is irrational, so . Also,
which is irrational, so . Now,
which is rational. Hence . So the relation is not transitive.
Therefore, is reflexive but neither symmetric nor transitive. The correct option by the working is A.
The solution labels option C, but that conflicts with the extracted working and the listed options.
Property-wise check
Given: must be irrational.
Find: Which standard properties of relations are satisfied.
A number of the form
need not always remain irrational when and are interchanged or chained through a third element.
This gives:
Hence the correct option is A.
Assuming that if is irrational, then replacing by will also keep it irrational. This is wrong because the sign change can cancel the term for a suitable choice of and . Always test symmetry with a concrete counterexample.
Thinking reflexive means substituting arbitrary unequal values of and . This is wrong because reflexivity only checks whether for every . Put first, then evaluate the expression.
Assuming irrational plus irrational must be irrational while checking transitivity. This is wrong because expressions involving can cancel and produce a rational number. For transitivity, verify directly instead of relying on pattern intuition.
Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.