Let $T$ be the set of all triangles in the Euclidean plane, and let a relation $R$ on $T$ be defined as $aRb$ if $a$ is congruent to $b$, $\forall\, a, b \in T$. Then $R$ is (A) reflexive but not transitive (B) transitive but not symmetric (C) equivalence (D) none of these

> [!TLDR] > Congruence of triangles is reflexive, symmetric, and transitive — it is an equivalence relation. The correct option is **(C)**. The key to this problem is understanding what an equivalence relation is: a relation that is reflexive, symmetric, and transitive. Congruence of triangles is a classic example of an equivalence relation in geometry. Two triangles are congruent if one can be transformed into the other by a combination of rotations, reflections, and translations — essentially, they have the same shape and size. Let’s check each property systematically. 1. **Reflexive**: Is every triangle congruent to itself? Yes — any triangle $a$ can be mapped onto itself by the identity transformation (no movement at all). So $aRa$ holds for all $a \in T$. Reflexive is satisfied. 2. **Symmetric**: If triangle $a$ is congruent to triangle $b$, does it follow that $b$ is congruent to $a$? Yes — congruence is a two-way relationship. If $a$ can be transformed into $b$ by an isometry (distance-preserving map), then the inverse transformation maps $b$ back to $a$. So $aRb \implies bRa$. Symmetric is satisfied. 3. **Transitive**: If $a$ is congruent to $b$, and $b$ is congruent to $c$, is $a$ necessarily congruent to $c$? Yes — composing the two isometries (first the one that takes $a$ to $b$, then the one that takes $b$ to $c$) gives an isometry from $a$ to $c$. So $aRb$ and $bRc$ imply $aRc$. Transitive is satisfied. …

Let T be the set of all triangles in the Euclidean plane, and let a relation R on T be defined as aRb if a is

NCERT Exemplar · Q18

T

CBSEMCQ· 1mImportance★★★★★

76% · 79/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 $R$ on a set $A$ pairs elements of $A$ 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

$R$ is reflexive if $a\,R\,a$ for every $a\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,1),(2,2)\}$ is not reflexive because $(3,3)$ is absent.

Symmetric — the relation runs both ways

$R$ is symmetric if $a\,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)\}$ is symmetric, but $\{(1,2),(2,1),(1,3)\}$ is not, since $(3,1)$ is missing.

Transitive — relations chain

$R$ is transitive if $a\,R\,b$ and $b\,R\,c$ together force $a\,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)\}$ is not transitive because $(1,3)$ is missing.

Antisymmetric — two-way ties force equality

$R$ is antisymmetric if $a\,R\,b$ and $b\,R\,a$ together force $a=b$ . The order relation $\le$ is antisymmetric: $a\le b$ and $b\le a$ give $a=b$ . It does not ban self-pairs like $(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.

Property	Condition
Reflexive	$\forall a,\ a\,R\,a$

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

Congruence of triangles is reflexive, symmetric, and transitive — it is an equivalence relation. The correct option is (C).

The key to this problem is understanding what an equivalence relation is: a relation that is reflexive, symmetric, and transitive. Congruence of triangles is a classic example of an equivalence relation in geometry. Two triangles are congruent if one can be transformed into the other by a combination of rotations, reflections, and translations — essentially, they have the same shape and size.

Let’s check each property systematically.

Reflexive: Is every triangle congruent to itself? Yes — any triangle $a$ can be mapped onto itself by the identity transformation (no movement at all). So $aRa$ holds for all $a \in T$ . Reflexive is satisfied.
Symmetric: If triangle $a$ is congruent to triangle $b$ , does it follow that $b$ is congruent to $a$ ? Yes — congruence is a two-way relationship. If $a$ can be transformed into $b$ by an isometry (distance-preserving map), then the inverse transformation maps $b$ back to $a$ . So $aRb \implies bRa$ . Symmetric is satisfied.
Transitive: If $a$ is congruent to $b$ , and $b$ is congruent to $c$ , is $a$ necessarily congruent to $c$ ? Yes — composing the two isometries (first the one that takes $a$ to $b$ , then the one that takes $b$ to $c$ ) gives an isometry from $a$ to $c$ . So $aRb$ and $bRc$ imply $aRc$ . Transitive is satisfied. …

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

Same / Similar Concept — real previous-year questions on the same or a closely similar concept, not this exact question.

Showing the 12 most recent of 41 on this concept.

CBSE 2026Set V11 markMCQ
$R$
(a) symmetric but not transitive
(b) transitive but not symmetric
(c) symmetric and transitive
(d) neither symmetric nor transitive
›Reveal solutionSolution

$R=\{(1,1),(2,2)\}$ is both symmetric and transitive, so the answer is (c).

Symmetry: whenever $(a,b)\in R$ we need $(b,a)\in R$ . Here the only pairs are $(1,1)$ and $(2,2)$ , and each is its own reverse, so symmetry holds. …
Start your 14-day free trial to see the full solution →
CBSE 2026Set A1 markMCQ
$Q. What type of a relation is "less than" in the set of real numbers?$
(a) Only symmetric
(b) Only transitive
(c) Only reflexive
(d) Equivalence
›Reveal solutionSolution
" $<$ " on $\mathbb{R}$ is transitive only.

Consider the relation " $a < b$ " on $\mathbb{R}$ :

Reflexive? $a < a$ is false for every $a$ , so NOT reflexive.

Symmetric? $a < b$ does not imply $b < a$ , so NOT symmetric. …
Start your 14-day free trial to see the full solution →
CBSE 2026Set ANNUAL1 markMCQ
$R$
(a) Reflexive but not symmetric
(b) Reflexive but not transitive
(c) Symmetric and transitive
(d) Neither symmetric nor transitive
›Reveal solutionSolution

$R$ is reflexive (it contains every $(x,x)$ ) but not symmetric, since $(1,2)\in R$ while $(2,1)\notin R$ .

Given: $R=\{(1,1),(2,2),(3,3),(1,2),(2,3),(1,3)\}$ on $A=\{1,2,3\}$ .

Reflexivity: $R$ is reflexive if $(x,x)\in R$ for every $x\in A$ . Here $(1,1),(2,2),(3,3)$ are all present, so $R$ is reflexive.

Symmetry: $R$ is symmetric if $(x,y)\in R\Rightarrow(y,x)\in R$ . Here $(1,2)\in R$ but $(2,1)\notin R$ . So $R$ is not symmetric.

…

Start your 14-day free trial to see the full solution →
CBSE 2026Set ANNUAL1 markMCQ
$R$
(a) $(2, 4) \in R$
(b) $(3, 8) \in R$
(c) $(6, 8) \in R$
(d) $(8, 6) \in R$
›Reveal solutionSolution
Check each pair against both conditions $a=b-2$ and $b>6$ .

$R=\{(a,b): a=b-2,\ b>6\}$

$(2,4)$ : $a=b-2 \Rightarrow 2=2$ ✓, but $b>6 \Rightarrow 4>6$ ✗. Not in $R$ .

$(3,8)$ : $a=b-2 \Rightarrow 3=6$ ✗. Not in $R$ . …
Start your 14-day free trial to see the full solution →
CBSE 2026Set ANNUAL1 markMCQ
$R$
(a) $R$ is reflexive and symmetric but not transitive
(b) $R$ is reflexive and transitive but not symmetric
(c) $R$ is symmetric and transitive but not reflexive
(d) $R$ is an equivalence relation
›Reveal solutionSolution
Test $R$ against the three defining properties (reflexive, symmetric, transitive) one at a time, directly from its listed ordered pairs.

$R=\{(1,2),(2,2),(1,1),(4,4),(1,3),(3,3),(3,2)\}$ on $\{1,2,3,4\}$ .

Reflexive? Need $(a,a)\in R$ for every $a\in\{1,2,3,4\}$ : $(1,1)$ ✓, $(2,2)$ ✓, $(3,3)$ ✓, $(4,4)$ ✓. All present — $R$ is reflexive.

Symmetric? Need: whenever $(a,b)\in R$ , also $(b,a)\in R$ . Take $(1,2)\in R$ : is $(2,1)\in R$ ? It is not in the list. So $R$ is not symmetric.

Transitive? Need: whenever $(a,b)\in R$ and $(b,c)\in R$ , also $(a,c)\in R$ . Checking every chain:

$(1,1),(1,2)\Rightarrow(1,2)$ ✓

$(1,1),(1,3)\Rightarrow(1,3)$ ✓

$(1,2),(2,2)\Rightarrow(1,2)$ ✓

$(1,3),(3,3)\Rightarrow(1,3)$ ✓

$(1,3),(3,2)\Rightarrow(1,2)$ ✓ …
Start your 14-day free trial to see the full solution →
CBSE 2026Set ANNUAL1 markMCQ
$R$
(a) $(2, 4) \in R$
(b) $(3, 8) \in R$
(c) $(6, 8) \in R$
(d) $(8, 7) \in R$
›Reveal solutionSolution

Only $(6,8)$ satisfies $a=b-2$ with $b>6$ .

…

Start your 14-day free trial to see the full solution →
CBSE 2025Set X11 markMCQ
$R$
(a) $(a, a) \in R$ for all $a \in A$
(b) $(a, a) \in R$ for atleast one $a \in A$
(c) $(a, b) \in R$ implies $(b, a) \in R$
(d) $(a, b) \in R$ and $(b, c) \in R$ implies $(a, c) \in R$
›Reveal solutionSolution

Tests the definition of a reflexive relation — correct option is (a).

A relation $R$ on a set $A$ is reflexive when every element is related to itself. Formally, $(a,a)\in R$ must hold for all $a\in A$ — not just for at least one element. Option (c) states symmetry ( $(a,b)\in R\Rightarrow(b,a)\in R$ ) and option (d) states transitivit …
Start your 14-day free trial to see the full solution →
CBSE 2025Set IX1 markMCQ
$R = \{(a, b) : a = b - 1,\ b \geq 3\}$
(a) $(2, 4) \in R$
(b) $(4, 5) \in R$
(c) $(4, 6) \in R$
(d) $(1, 3) \in R$
›Reveal solutionSolution
Only $(4,5)$ satisfies $a=b-1$ with $b\ge 3$ ; option (b).

Concept. A pair $(a,b)$ belongs to $R$ only if it satisfies both conditions: $a=b-1$ and $b\ge 3$ .

$(2,4)$ : $b-1=3\ne 2$ . ✗ …
Start your 14-day free trial to see the full solution →
CBSE 2025Set ANNUAL1 markMCQ
$A=\{1,2,3,4\}$
(i) Reflexive
(ii) Symmetric
(iii) Transitive
(iv) Equivalent
›Reveal solutionSolution

Check each property directly: $R$ turns out to be symmetric only.

$A=\{1,2,3,4\}$ , $R=\{(a,b): a+b \text{ is odd}\}$ .

Reflexive? $(a,a)$ needs $a+a=2a$ to be odd — but $2a$ is always even. So $R$ is not reflexive.

Symmetric? If $a+b$ is odd, then $b+a=a+b$ is the same sum, also odd. So $(a,b)\in R \Rightarrow (b,a)\in R$ . $R$ is symmetric.

…

Start your 14-day free trial to see the full solution →
CBSE 2025Set ANNUAL1 markMCQ
$A = \{a, b, c\}$
(a) reflexive and symmetric but not transitive
(b) reflexive and transitive but not symmetric
(c) symmetric and transitive but not reflexive
(d) an equivalence relation
›Reveal solutionSolution

R is symmetric (the only cross-pair (a,b)/(b,a) both appear) and not transitive ((b,a) & (a,b) would force (b,b), which is missing) — matching option (a) once we note a reflexivity caveat below.

Step 1 — Reflexive? Full reflexivity on A = {a, b, c} needs (a,a), (b,b), (c,c) all in R. Only (a,a) is present; (b,b) and (c,c) are not. So strictly, R is not fully reflexive on {a,b,c}.

Step 2 — Symmetric? The only pair with a 'partner' is (a,b), and its reverse (b,a) is also in R. There is no pair in R whose reverse is missing. So R is symmetric.

Step 3 — Transitive? Take (b,a) ∈ R and (a,b) ∈ R: transitivity would require (b,b) ∈ R. It is not. So R is not transitive.

…

Start your 14-day free trial to see the full solution →
CBSE 2025Set ANNUAL1 markMCQ
$Q. Relation R = {(x, y) : x < y² where x, y \in R} is:$
(a) Reflexive but not symmetric.
(b) Symmetric and transitive but not Reflexive.
(c) Reflexive and Symmetric.
(d) Neither reflexive nor symmetric nor transitive.
›Reveal solutionSolution

Test each property of $R=\{(x,y): x<y^2\}$ with concrete counterexamples — all three fail.

Reflexive? Need $x<x^2$ for every $x\in\mathbb R$ . Take $x=\dfrac12$ : is $\dfrac12 < \dfrac14$ ? No. So $R$ is not reflexive.

Symmetric? Need $x<y^2 \Rightarrow y<x^2$ . Take $x=0,\,y=1$ : $0<1^2$ is true, so $(0,1)\in R$ . But is $1<0^2=0$ ? No. So $(1,0)\notin R$ , and $R$ is not symmetric.

…

Start your 14-day free trial to see the full solution →
CBSE 2025Set ANNUAL1 markMCQ
$Q. The relation R = {(a, a), (b, b), (c, c)} on the set A = {a, b, c} is ...........$
(a) Identity
(b) Reflexive only
(c) Symmetric only
(d) Equivalence
›Reveal solutionSolution

R = {(a,a), (b,b), (c,c)} is reflexive, symmetric, and transitive on A = {a, b, c}, so by definition it is an equivalence relation (it is in fact the identity relation, which is always the smallest possible equivalence relation on a set).

Check reflexive: For every element $x \in A$ , $(x,x) \in R$ . Indeed $(a,a), (b,b), (c,c)$ are all present. So R is reflexive.

Check symmetric: If $(x,y) \in R$ then $(y,x) \in R$ . Since every pair here has $x = y$ , this holds trivially.

Check transitive: If $(x,y) \in R$ and $(y,z) \in R$ then $(x,z) \in R$ . Again since all pairs are of the form $(x,x)$ , this holds trivially.

…

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

←Previous questionQ17 — Let A = \1, 2, 3, …, 9\ and R be the relation in A × A defined by (a, …→Next questionQ19 — Consider the non-empty set consisting of children in a family and a re…

Q.Let $T$ be the set of all triangles in the Euclidean plane, and let a relation $R$ on $T$ be defined as $aRb$ if $a$ is congruent to $b$ , $\forall\, a, b \in T$ . Then $R$ is
(A) reflexive but not transitive
(B) transitive but not symmetric
(C) equivalence
(D) none of these

Concept understanding — Relation Properties

Properties of a Relation

Reflexive — everything relates to itself

Symmetric — the relation runs both ways

Transitive — relations chain

Antisymmetric — two-way ties force equality

Method: Recognising when a relation is an equivalence relation

Steps

Common Mistakes

Q.Let TTT be the set of all triangles in the Euclidean plane, and let a relation RRR on TTT be defined as aRbaRbaRb if aaa is congruent to bbb, ∀ a,b∈T\forall\, a, b \in T∀a,b∈T. Then RRR is (A) reflexive but not transitive (B) transitive but not symmetric (C) equivalence (D) none of these

🎓Unlock everything free for 14 days

Q.Let $T$ be the set of all triangles in the Euclidean plane, and let a relation $R$ on $T$ be defined as $aRb$ if $a$ is congruent to $b$ , $\forall\, a, b \in T$ . Then $R$ is
(A) reflexive but not transitive
(B) transitive but not symmetric
(C) equivalence
(D) none of these

Unlock everything free for 14 days