Let \(f : X → Y\) be a function. Define a relation R in X given by \( R =\{(a,b):f(a)=f(b)\}.\) Examine whether R is an equivalence relation or not.
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Imagine a machine called \( f \) that takes in people and gives each one a coloured sticker. Two people are "related" if they get the same colour sticker. Every person clearly matches with themselves — same sticker! If person \( a \) matches person \( b \), then \( b \) matches \( a \) too. And if \( a \) matches \( b \) and \( b \) matches \( c \), all three share one colour, so \( a \) matches \( c \). Because the rule works in all three ways, it is called an equivalence relation.
Answer: R is reflexive, symmetric, and transitive, therefore \( R = \{(a,b) : f(a) = f(b)\} \) is an equivalence relation on \( X \).
A relation \( R \) on a set \( X \) is called an equivalence relation if it satisfies three properties: reflexive, symmetric, and transitive. Here we are given a function \( f : X \to Y \) and a relation \( R = \{(a,b) : f(a) = f(b)\} \). This means two elements \( a \) and \( b \) of \( X \) are related exactly when they are sent to the same image under \( f \). To decide whether \( R \) is an equivalence relation, we test all three properties using the basic properties of equality of images. Since equality of function values behaves just like ordinary equality (it is reflexive, symmetric, and transitive), we expect \( R \) to be an equivalence relation.
R is an equivalence relation if and only if R is reflexive: \( (a,a) \in R \); symmetric: \( (a,b) \in R \Rightarrow (b,a) \in R \); transitive: \( (a,b) \in R \) and \( (b,c) \in R \Rightarrow (a,c) \in R \).
R is reflexive, symmetric, and transitive, therefore \( R = \{(a,b) : f(a) = f(b)\} \) is an equivalence relation on \( X \).
A common mistake is to assume that because \( f \) is not one-one, the relation cannot be an equivalence relation. In fact, R being an equivalence relation does not depend on f being one-one or onto; it depends only on the properties of equality of images, which always hold.
R is reflexive, symmetric, and transitive, therefore \( R = \{(a,b) : f(a) = f(b)\} \) is an equivalence relation on \( X \).
One common mistake: Students sometimes assume that proving only one or two of the three properties (often just reflexivity and symmetry) is enough to conclude equivalence — but all three properties must be verified independently.
Answer: R is reflexive, symmetric, and transitive, therefore \( R = \{(a,b) : f(a) = f(b)\} \) is an equivalence relation on \( X \).
Question: Let \( g : \mathbb{Z} \to \mathbb{Z} \) be defined by \( g(n) = n^2 \). Define a relation S on \( \mathbb{Z} \) by \( S = \{(a, b) : g(a) = g(b)\} \). Examine whether S is an equivalence relation.
Solution: We have \( g : \mathbb{Z} \to \mathbb{Z} \) defined by \( g(n) = n^2 \), and \( S = \{(a, b) : a^2 = b^2\}\). Step 1 — Reflexivity: For any \( a \in \mathbb{Z} \), we have \( g(a) = a^2 = a^2 = g(a) \). Hence \( (a, a) \in S \) for all \( a \in \mathbb{Z} \). So S is reflexive. Step 2 — Symmetry: Let \( (a, b) \in S \). Then \( g(a) = g(b) \), i.e., \( a^2 = b^2 \). This immediately gives \( b^2 = a^2 \), so \( g(b) = g(a) \), which means \( (b, a) \in S \). Hence S is symmetric. Step 3 — Transitivity: Let \( (a, b) \in S \) and \( (b, c) \in S \). Then \( g(a) = g(b) \) and \( g(b) = g(c) \). Therefore \( g(a) = g(c) \), i.e., \( a^2 = c^2 \), so \( (a, c) \in S \). Hence S is transitive. Since S is reflexive, symmetric, and transitive, S is an equivalence relation on \( \mathbb{Z} \). Note: The equivalence class of any \( a \ne 0 \) is \( \{a, -a\} \), and the equivalence class of \( 0 \) is \( \{0\} \).
Answer: S is an equivalence relation on \( \mathbb{Z} \).
Question: Let \( h : \mathbb{R} \to \mathbb{R} \) be defined by \( h(x) = \sin x \). Define a relation T on \( \mathbb{R} \) by \( T = \{(a, b) : h(a) = h(b)\} \), i.e., \( T = \{(a, b) : \sin a = \sin b\} \). Examine whether T is an equivalence relation.
Solution: We have \( T = \{(a, b) \in \mathbb{R} \times \mathbb{R} : \sin a = \sin b\} \). Step 1 — Reflexivity: For any \( a \in \mathbb{R} \), \( \sin a = \sin a \), so \( (a, a) \in T \). Hence T is reflexive. Step 2 — Symmetry: Let \( (a, b) \in T \). Then \( \sin a = \sin b \). This gives \( \sin b = \sin a \), so \( (b, a) \in T \). Hence T is symmetric. Step 3 — Transitivity: Let \( (a, b) \in T \) and \( (b, c) \in T \). Then \( \sin a = \sin b \) and \( \sin b = \sin c \). Therefore \( \sin a = \sin c \), so \( (a, c) \in T \). Hence T is transitive. Since T is reflexive, symmetric, and transitive, T is an equivalence relation on \( \mathbb{R} \). Note on equivalence classes: \( \sin a = \sin b \) implies either \( b = a + 2k\pi \) or \( b = (2k+1)\pi - a \) for some integer \( k \). So the equivalence class of any \( a \) consists of all real numbers that have the same sine value as \( a \).
Answer: T is an equivalence relation on \( \mathbb{R} \).
Question: Let \( g : A \to B \) be any function. Define a relation S on A by \[ S = \{(x, y) : g(x) \ne g(y)\}. \] Examine whether S is an equivalence relation or not. Justify your answer.
Answer: S is symmetric but neither reflexive nor transitive. Therefore \( S = \{(x,y) : g(x) \ne g(y)\} \) is NOT an equivalence relation on A.