SOLVER7 Study. Nothing Else.
Chapter 1 Examples Q21

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

Solution

👶 Simple Explanation

Simple Explanation

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 \).

📖 Checking if R is an Equivalence Relation

Detailed Explanation

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.

Formula Used

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 \).

Solution

  1. Step 1: Recall the definition of R. We are told \( R = \{(a,b) : f(a) = f(b)\} \). So a pair \( (a,b) \) lies in \( R \) precisely when the images of \( a \) and \( b \) under \( f \) are equal.
  2. Step 2: Check reflexivity. Take any element \( a \in X \). Since \( f(a) = f(a) \) is always true (equality is reflexive), the pair \( (a,a) \) satisfies the defining condition. Therefore \( (a,a) \in R \) for every \( a \in X \), so \( R \) is reflexive.
  3. Step 3: Check symmetry. Suppose \( (a,b) \in R \). Then by definition \( f(a) = f(b) \). Since equality is symmetric, this gives \( f(b) = f(a) \), which means \( (b,a) \in R \). Hence whenever \( (a,b) \in R \), we also have \( (b,a) \in R \), so \( R \) is symmetric.
  4. Step 4: Check transitivity. Suppose \( (a,b) \in R \) and \( (b,c) \in R \). Then \( f(a) = f(b) \) and \( f(b) = f(c) \). Combining these by the transitivity of equality gives \( f(a) = f(c) \), which means \( (a,c) \in R \). So \( R \) is transitive.
  5. Step 5: Conclude. Since \( R \) satisfies all three properties, reflexive, symmetric, and transitive, it is an equivalence relation on \( X \).

Final Answer

R is reflexive, symmetric, and transitive, therefore \( R = \{(a,b) : f(a) = f(b)\} \) is an equivalence relation on \( X \).

Common Mistake

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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Understand the relation: We are given a function \( f : X \to Y \) and the relation \( R = \{(a,b) : f(a) = f(b)\} \) defined on \( X \). A pair \( (a,b) \) belongs to \( R \) exactly when \( a \) and \( b \) map to the same value under \( f \). — Reason: Understanding what membership in \( R \) means lets us systematically test each required property.
  2. Step 2: Test Reflexivity: Take any arbitrary element \( a \in X \). We ask: does \( (a,a) \in R \)? By definition this requires \( f(a) = f(a) \), which is always true since any quantity equals itself. Therefore \( (a,a) \in R \) for every \( a \in X \), so \( R \) is reflexive. — Reason: Reflexivity demands every element is related to itself, and equality is inherently reflexive.
  3. Step 3: Test Symmetry: Suppose \( (a,b) \in R \) for some \( a, b \in X \). By the definition of \( R \), this means \( f(a) = f(b) \). Since equality is symmetric, we can write \( f(b) = f(a) \), which means \( (b,a) \in R \). Therefore \( (a,b) \in R \Rightarrow (b,a) \in R \), so \( R \) is symmetric. — Reason: Symmetry requires that if \( a \) is related to \( b \), then \( b \) must also be related to \( a \).
  4. Step 4: Test Transitivity: Suppose \( (a,b) \in R \) and \( (b,c) \in R \) for some \( a, b, c \in X \). By definition, \( f(a) = f(b) \) and \( f(b) = f(c) \). Using the transitive property of equality, we combine these to get \( f(a) = f(c) \), which means \( (a,c) \in R \). Therefore \( R \) is transitive. — Reason: Transitivity requires that a relation carries through a chain of two steps, and equality does exactly that.
  5. Step 5: State the Conclusion: Since \( R \) has been shown to be reflexive, symmetric, and transitive, all three conditions for an equivalence relation are satisfied. — Reason: All three properties must hold simultaneously for a relation to qualify as an equivalence relation.

Final Answer

R is reflexive, symmetric, and transitive, therefore \( R = \{(a,b) : f(a) = f(b)\} \) is an equivalence relation on \( X \).

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Reflexivity: For any \( a \in X \): \( f(a) = f(a) \), so \( (a,a) \in R \). Thus \( R \) is reflexive.
  2. Symmetry: Let \( (a,b) \in R \). Then \( f(a) = f(b) \Rightarrow f(b) = f(a) \Rightarrow (b,a) \in R \). Thus \( R \) is symmetric.
  3. Transitivity: Let \( (a,b) \in R \) and \( (b,c) \in R \). Then \( f(a) = f(b) \) and \( f(b) = f(c) \Rightarrow f(a) = f(c) \Rightarrow (a,c) \in R \). Thus \( R \) is transitive.

Answer: R is reflexive, symmetric, and transitive, therefore \( R = \{(a,b) : f(a) = f(b)\} \) is an equivalence relation on \( X \).

➕ More Examples

More Examples

Example 1

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} \).

Example 2

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} \).

🎯 Try a Similar Question

Try a Similar Question

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.

Solution

  1. Step 1: State the relation clearly: We have \( g : A \to B \) and the relation S on A defined as \( S = \{(x, y) : g(x) \ne g(y)\} \). We check reflexivity, symmetry, and transitivity.
  2. Step 2: Check Reflexivity: For S to be reflexive, we need \( (x, x) \in S \) for every \( x \in A \), i.e., \( g(x) \ne g(x) \). But \( g(x) = g(x) \) is always true, so \( g(x) \ne g(x) \) is false. Therefore \( (x, x) \notin S \) for any \( x \in A \). Hence S is NOT reflexive.
  3. Step 3: Check Symmetry: Suppose \( (x, y) \in S \). Then \( g(x) \ne g(y) \). Since inequality is symmetric, \( g(y) \ne g(x) \), which means \( (y, x) \in S \). Hence S is symmetric.
  4. Step 4: Check Transitivity: Suppose \( (x, y) \in S \) and \( (y, z) \in S \). Then \( g(x) \ne g(y) \) and \( g(y) \ne g(z) \). It is possible that \( g(x) = g(z) \), in which case \( (x, z) \notin S \). For a concrete example: let \( A = \{1, 2, 3\} \), \( B = \{p, q\} \), with \( g(1) = p \), \( g(2) = q \), \( g(3) = p \). Then \( g(1) \ne g(2) \) so \( (1,2) \in S \), and \( g(2) \ne g(3) \) so \( (2,3) \in S \), but \( g(1) = g(3) = p \) so \( (1,3) \notin S \). Hence S is NOT transitive.
  5. Step 5: Conclusion: Since S fails reflexivity and transitivity, S is not an equivalence relation.

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.

Everything you get with Solver7

More questions in Relations and Functions