Let T be the set of all triangles in a plane with R a relation in T given by \(R=\{(T_1,T_2):T_1\) is congruent to \(T_2\}.\) Show that R is an equivalence relation.
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Imagine two triangles that are perfect copies of each other — same shape, same size. A triangle is always a copy of itself. If triangle A matches triangle B, then triangle B also matches triangle A. And if triangle A matches triangle B, and triangle B matches triangle C, then triangle A must also match triangle C. Because congruence works this way — always true for itself, always works both ways, and always passes along — the relation is called an equivalence relation.
Answer: Since congruence of triangles is reflexive, symmetric and transitive, the relation \( R = \{(T_1, T_2) : T_1 \text{ is congruent to } T_2\} \) is an equivalence relation on \( T \).
A relation \( R \) on a set is called an equivalence relation if it satisfies three properties: reflexive, symmetric and transitive. Here the set is \( T \), the set of all triangles in a plane, and the relation is \( R = \{(T_1, T_2) : T_1 \text{ is congruent to } T_2\} \). Two triangles are congruent if they have exactly the same size and shape, so one can be superimposed on the other. To show \( R \) is an equivalence relation, we must verify all three properties using the basic facts of congruence of triangles.
For a relation \( R \) on a set \( T \) to be an equivalence relation, it must be: \[ \text{Reflexive: } (a,a) \in R \text{ for all } a \in T \] \[ \text{Symmetric: } (a,b) \in R \Rightarrow (b,a) \in R \] \[ \text{Transitive: } (a,b) \in R \text{ and } (b,c) \in R \Rightarrow (a,c) \in R \]
Since congruence of triangles is reflexive, symmetric and transitive, the relation \( R = \{(T_1, T_2) : T_1 \text{ is congruent to } T_2\} \) is an equivalence relation on \( T \).
A common mistake is to only state that congruence is 'obvious' without clearly verifying each of the three properties (reflexive, symmetric, transitive) separately. In CBSE answers you must explicitly justify all three using the definition of congruence to earn full marks.
Since congruence of triangles is reflexive, symmetric and transitive, the relation \( R = \{(T_1, T_2) : T_1 \text{ is congruent to } T_2\} \) is an equivalence relation on \( T \).
One common mistake: Students often verify only one or two of the three properties (usually reflexivity and symmetry) and then conclude the relation is an equivalence relation, forgetting that all three — reflexivity, symmetry, AND transitivity — must be verified individually and explicitly.
Answer: Since congruence of triangles is reflexive, symmetric and transitive, the relation \( R = \{(T_1, T_2) : T_1 \text{ is congruent to } T_2\} \) is an equivalence relation on \( T \).
Question: Let L be the set of all lines in a plane. Define a relation R on L by \( R = \{(l_1, l_2) : l_1 \text{ is parallel to } l_2\} \). Show that R is an equivalence relation.
Solution: We need to verify that R is reflexive, symmetric, and transitive. Step 1 — Reflexivity: Let \( l \in L \) be any line. Every line is parallel to itself (a line never intersects itself). Therefore \( (l, l) \in R \) for all \( l \in L \). Hence R is reflexive. Step 2 — Symmetry: Let \( (l_1, l_2) \in R \). This means \( l_1 \) is parallel to \( l_2 \), i.e. \( l_1 \parallel l_2 \). Since parallelism is a symmetric property, \( l_2 \parallel l_1 \), so \( (l_2, l_1) \in R \). Hence R is symmetric. Step 3 — Transitivity: Let \( (l_1, l_2) \in R \) and \( (l_2, l_3) \in R \). This means \( l_1 \parallel l_2 \) and \( l_2 \parallel l_3 \). Two lines each parallel to the same line are parallel to each other, so \( l_1 \parallel l_3 \), giving \( (l_1, l_3) \in R \). Hence R is transitive. Since R is reflexive, symmetric, and transitive, R is an equivalence relation on L.
Answer: R is an equivalence relation on L because it is reflexive (every line is parallel to itself), symmetric (if \( l_1 \parallel l_2 \) then \( l_2 \parallel l_1 \)), and transitive (if \( l_1 \parallel l_2 \) and \( l_2 \parallel l_3 \) then \( l_1 \parallel l_3 \)).
Question: Let \( \mathbb{Z} \) be the set of all integers. Define a relation R on \( \mathbb{Z} \) by \( R = \{(a, b) : a - b \text{ is divisible by } 5\} \). Show that R is an equivalence relation.
Solution: We need to verify that R is reflexive, symmetric, and transitive. Step 1 — Reflexivity: Let \( a \in \mathbb{Z} \). Then \( a - a = 0 \), and 0 is divisible by 5. Therefore \( (a, a) \in R \) for all \( a \in \mathbb{Z} \). Hence R is reflexive. Step 2 — Symmetry: Let \( (a, b) \in R \). Then \( 5 \mid (a - b) \), so there exists an integer \( k \) such that \( a - b = 5k \). Then \( b - a = 5(-k) \), and since \( -k \in \mathbb{Z} \), we have \( 5 \mid (b - a) \), so \( (b, a) \in R \). Hence R is symmetric. Step 3 — Transitivity: Let \( (a, b) \in R \) and \( (b, c) \in R \). Then there exist integers \( k_1, k_2 \) such that \[ a - b = 5k_1 \quad \text{and} \quad b - c = 5k_2. \] Adding these: \[ a - c = (a - b) + (b - c) = 5k_1 + 5k_2 = 5(k_1 + k_2). \] Since \( k_1 + k_2 \in \mathbb{Z} \), we have \( 5 \mid (a - c) \), so \( (a, c) \in R \). Hence R is transitive. Since R is reflexive, symmetric, and transitive, R is an equivalence relation on \( \mathbb{Z} \).
Answer: R is an equivalence relation on \( \mathbb{Z} \) because it is reflexive (\( a - a = 0 \) is divisible by 5), symmetric (if \( 5 \mid a - b \) then \( 5 \mid b - a \)), and transitive (if \( 5 \mid a - b \) and \( 5 \mid b - c \) then \( 5 \mid a - c \)).
Question: Let \( P \) be the set of all triangles in a plane. A relation \( R \) is defined on \( P \) by \( R = \{(T_1, T_2) : T_1 \text{ is similar to } T_2\} \). Show that \( R \) is an equivalence relation on \( P \).
Answer: Since similarity of triangles is reflexive, symmetric, and transitive, the relation \( R = \{(T_1, T_2) : T_1 \text{ is similar to } T_2\} \) is an equivalence relation on the set \( P \) of all triangles in a plane.