Skip to content
Exercise 1.1 · Q1

Q.Determine whether each of the following relations are reflexive, symmetric and transitive:

(i) Relation R in the set A={1,2,3,…,13,14}A = \{1, 2, 3, \dots, 13, 14\} defined as R={(x,y):3x−y=0}R = \{(x, y) : 3x - y = 0\}
(ii) Relation R in the set N\mathbf{N} of natural numbers defined as R={(x,y):y=x+5 and x<4}R = \{(x, y) : y = x + 5 \text{ and } x < 4\}
(iii) Relation R in the set A={1,2,3,4,5,6}A = \{1, 2, 3, 4, 5, 6\} as R={(x,y):y is divisible by x}R = \{(x, y) : y \text{ is divisible by } x\}
(iv) Relation R in the set Z\mathbf{Z} of all integers defined as R={(x,y):x−y is an integer}R = \{(x, y) : x - y \text{ is an integer}\}
(v) Relation R in the set A of human beings in a town at a particular time given by
(a) R={(x,y):x and y work at the same place}R = \{(x, y) : x \text{ and } y \text{ work at the same place}\}
(b) R={(x,y):x and y live in the same locality}R = \{(x, y) : x \text{ and } y \text{ live in the same locality}\}
(c) R={(x,y):x is exactly 7 cm taller than y}R = \{(x, y) : x \text{ is exactly } 7 \text{ cm taller than } y\}
(d) R={(x,y):x is wife of y}R = \{(x, y) : x \text{ is wife of } y\}
(e) R={(x,y):x is father of y}R = \{(x, y) : x \text{ is father of } y\}
CBSENCERTSubjective· 5mImportance★★★★★
1% · 1/104 Questions
✓ Free question

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
Symmetrica R b  ⟹  b R aa\,R\,b \implies b\,R\,a
Transitivea R b∧b R c  ⟹  a R ca\,R\,b \wedge b\,R\,c \implies a\,R\,c
Antisymmetrica R b∧b R a  ⟹  a=ba\,R\,b \wedge b\,R\,a \implies a=b

The famous combinations are the equivalence relation (reflexive + symmetric + transitive), which sorts a set into disjoint classes of "equivalent" elements, and the partial order (reflexive + antisymmetric + transitive), which arranges elements in a hierarchy.

The reflexive, symmetric, transitive, and antisymmetric properties of a relation are introduced in CBSE Class 11 Relations and Functions and revisited more formally at the start of the CBSE Class 12 Mathematics syllabus. "Reflexive symmetric transitive relation examples" is one of the most searched topics in this unit, since correctly testing all three properties is a near-guaranteed board exam question.

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.