Skip to content
Exercise 1.1 · Q16

Q.Let R be the relation in the set N given by R={(a,b):a=b−2,b>6}R = \{(a, b) : a = b - 2, b > 6\}. Choose the correct answer. (A) (2,4)∈R(2, 4) \in R (B) (3,8)∈R(3, 8) \in R (C) (6,8)∈R(6, 8) \in R (D) (8,7)∈R(8, 7) \in R

CBSENCERTSubjective· 1mImportance★★★★★
15% · 16/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 →

Concept understanding — Relation Properties

Properties of a Relation

A relation RR on a set AA pairs elements of AA with one another. Some relations behave in regular, predictable ways, and we name these behaviours properties. Three matter most for CBSE Class 12 — reflexive, symmetric, transitive (together they build an equivalence relation); a fourth, antisymmetric, is worth knowing for order relations.

Reflexive — everything relates to itself

RR is reflexive if a R aa\,R\,a for every a∈Aa\in A. "Has the same age as" is reflexive; "is taller than" is not. If even one element misses its self-pair, reflexivity fails: on {1,2,3}\{1,2,3\}, {(1,1),(2,2)}\{(1,1),(2,2)\} is not reflexive because (3,3)(3,3) is absent.

Symmetric — the relation runs both ways

RR is symmetric if a R b  ⟹  b R aa\,R\,b \implies b\,R\,a. "Is married to" is symmetric; "is taller than" is not. Symmetry does not demand that every pair be related — only that any pair which appears also appears reversed. So {(1,2),(2,1),(3,3)}\{(1,2),(2,1),(3,3)\} is symmetric, but {(1,2),(2,1),(1,3)}\{(1,2),(2,1),(1,3)\} is not, since (3,1)(3,1) is missing.

Transitive — relations chain

RR is transitive if a R ba\,R\,b and b R cb\,R\,c together force a R ca\,R\,c. "Is an ancestor of" is transitive; "is a friend of" is not. A single broken chain breaks the property: {(1,2),(2,3)}\{(1,2),(2,3)\} is not transitive because (1,3)(1,3) is missing.

Antisymmetric — two-way ties force equality

RR is antisymmetric if a R ba\,R\,b and b R ab\,R\,a together force a=ba=b. The order relation ≤\le is antisymmetric: a≤ba\le b and b≤ab\le a give a=ba=b. It does not ban self-pairs like (1,1)(1,1); it only rules out distinct elements related both ways.

Tip

Test the properties in order of ease — reflexivity first, then symmetry, transitivity. A single counterexample is enough to disprove any of them.

PropertyCondition
Reflexive∀a, a R a\forall a,\ a\,R\,a

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.