Show that the relation R in the set A of all the books in a library of a college, given by \(R=\{(x, y) : x \) and \(y\) have same number of pages \(\}\) is an equivalence relation.
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Imagine every book in a library has a number written on it — the number of pages it has. Two books are 'related' if they have the exact same page count. Every book matches itself, so that works. If book A matches book B, then book B also matches book A. And if book A matches book B, and book B matches book C, then A and C must also have the same page count. A relation that always works this way — with itself, both ways, and in chains — is called an equivalence relation.
Answer: Since \( R \) is reflexive, symmetric, and transitive, the relation \( R \) on the set \( A \) of all books in the library is an equivalence relation.
A relation \( R \) on a set \( A \) is called an equivalence relation if it satisfies three properties: (1) Reflexive — every element is related to itself, i.e. \( (x, x) \in R \) for all \( x \in A \); (2) Symmetric — if \( (x, y) \in R \) then \( (y, x) \in R \); (3) Transitive — if \( (x, y) \in R \) and \( (y, z) \in R \) then \( (x, z) \in R \). Here \( A \) is the set of all books in a college library, and \( R = \{(x, y) : x \text{ and } y \text{ have the same number of pages}\} \). To prove \( R \) is an equivalence relation, we must verify all three properties using the idea that 'having the same number of pages' behaves like equality of a numeric quantity.
R is an equivalence relation if and only if R is Reflexive: \( (x,x) \in R \); Symmetric: \( (x,y) \in R \Rightarrow (y,x) \in R \); and Transitive: \( (x,y) \in R \text{ and } (y,z) \in R \Rightarrow (x,z) \in R \).
Since \( R \) is reflexive, symmetric, and transitive, the relation \( R \) on the set \( A \) of all books in the library is an equivalence relation.
A common mistake is to simply state that R is reflexive, symmetric, and transitive without justifying each property using the specific condition 'same number of pages'. You must explicitly show, for each property, why the condition holds — for example, in transitivity, connecting the equal page counts of \( x, y \) and \( y, z \) to conclude about \( x, z \).
Since \( R \) is reflexive, symmetric, and transitive, the relation \( R \) on the set \( A \) of all books in the library is an equivalence relation.
One common mistake: Students often verify only one or two of the three properties (most commonly skipping transitivity) and still conclude that \( R \) is an equivalence relation — all three properties must be checked and confirmed.
Answer: Since \( R \) is reflexive, symmetric, and transitive, the relation \( R \) on the set \( A \) of all books in the library is an equivalence relation.
Question: Let A be the set of all students in a school. Define a relation R on A by R = {(x, y) : x and y were born in the same month}. Show that R is an equivalence relation.
Solution: We need to verify that R is reflexive, symmetric, and transitive. Reflexivity: Let x be any student in A. Since x is born in the same month as x (every person shares their birth month with themselves), we have \[(x, x) \in R\] for all x in A. Hence R is reflexive. Symmetry: Let (x, y) \(\in\) R. This means x and y were born in the same month. Since the relation "born in the same month" is mutual, y and x are also born in the same month. Therefore \[(y, x) \in R\] Hence R is symmetric. Transitivity: Let (x, y) \(\in\) R and (y, z) \(\in\) R. Then x and y were born in the same month, and y and z were born in the same month. Since they all share the same birth month as y, we conclude x and z were also born in the same month. Therefore \[(x, z) \in R\] Hence R is transitive. Since R is reflexive, symmetric, and transitive, R is an equivalence relation.
Answer: R is an equivalence relation on the set of all students (verified by reflexivity, symmetry, and transitivity).
Question: Let A be the set of all triangles in a plane. Define a relation R on A by R = {(T1, T2) : T1 and T2 have the same area}. Show that R is an equivalence relation.
Solution: We need to show R is reflexive, symmetric, and transitive. Reflexivity: Let \(T_1\) be any triangle in A. The area of \(T_1\) equals the area of \(T_1\) itself. Therefore \[(T_1, T_1) \in R\] for all \(T_1 \in A\). Hence R is reflexive. Symmetry: Let \((T_1, T_2) \in R\). This means the area of \(T_1\) equals the area of \(T_2\), i.e., \[\text{Area}(T_1) = \text{Area}(T_2)\] This immediately gives \[\text{Area}(T_2) = \text{Area}(T_1)\] so \((T_2, T_1) \in R\). Hence R is symmetric. Transitivity: Let \((T_1, T_2) \in R\) and \((T_2, T_3) \in R\). Then \[\text{Area}(T_1) = \text{Area}(T_2)\] and \[\text{Area}(T_2) = \text{Area}(T_3)\] By the transitive property of equality, \[\text{Area}(T_1) = \text{Area}(T_3)\] so \((T_1, T_3) \in R\). Hence R is transitive. Since R is reflexive, symmetric, and transitive, R is an equivalence relation.
Answer: R is an equivalence relation on the set of all triangles in a plane (verified by reflexivity, symmetry, and transitivity).
Question: Let T be the set of all triangles in a plane. Define a relation R on T by R = {(P, Q) : P and Q are congruent triangles}. Show that R is an equivalence relation on T.
Answer: Since R is reflexive (every triangle is congruent to itself), symmetric (if P is congruent to Q then Q is congruent to P), and transitive (if P is congruent to Q and Q is congruent to S, then P is congruent to S), the relation R defined on the set T of all triangles in a plane by congruence is an equivalence relation on T.