Skip to content
Question of 104

Q.Let SS be the set of all real numbers and let RR be a relation defined on SS such that R={(a,b):a≤b}R=\{(a,b): a\le b\}. Show that the relation RR is reflexive but not symmetric.

Tripura TbseHigher Secondary (+2 Stage) Examination 2025Subjective· 2mImportance★★★★★
0% · 0/104 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

Test reflexivity directly from the definition of ≤\le, then disprove symmetry with a single counterexample — one counterexample is enough to break a general property.

Reflexive: R={(a,b):a≤b}R=\{(a,b): a\le b\} on S=RS=\mathbb R. For any real number aa, it is always true that a≤aa\le a (every number is ≤\le itself). So (a,a)∈R(a,a)\in R for all a∈Sa\in S, meaning RR is reflexive.

…

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.