SOLVER7 Study. Nothing Else.
Exercise 1.1 Q1(iv)

Determine whether each of the following relations are reflexive, symmetric and transitive: Relation R in the set \(Z\) of all integers defined as \(R=\{(x,y): x – y\)is an integer \(\}\)

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine every whole number is a person in a big club. Two people are "connected" if you subtract one from the other and get a whole number. Since all members are already whole numbers, subtracting any two always gives a whole number. So everyone is connected to themselves, connections go both ways, and if person A connects to B and B connects to C, then A connects to C too. A relation with all three of these friendly properties is called an equivalence relation.

Answer: The relation \( R \) is reflexive, symmetric, and transitive. Therefore \( R \) is an equivalence relation on \( Z \).

📖 Reflexive, Symmetric & Transitive: Relation R on Integers

Detailed Explanation

A relation on a set connects certain pairs of elements. To classify it, we test three properties. A relation \( R \) on a set \( A \) is reflexive if \( (x, x) \in R \) for every \( x \in A \). It is symmetric if \( (x, y) \in R \) implies \( (y, x) \in R \). It is transitive if \( (x, y) \in R \) and \( (y, z) \in R \) together imply \( (x, z) \in R \). Here the set is \( Z \), the set of all integers, and \( R = \{(x, y) : x - y \text{ is an integer}\} \). A key fact we use is that the sum, difference, and negative of integers are always integers. Since \( x \) and \( y \) are already integers, \( x - y \) is automatically an integer for every pair, which makes this relation very special.

Formula Used

\( R \) is reflexive if \( (x,x) \in R \); symmetric if \( (x,y) \in R \Rightarrow (y,x) \in R \); transitive if \( (x,y) \in R \) and \( (y,z) \in R \Rightarrow (x,z) \in R \). Rule used: difference of two integers is always an integer.

Solution

  1. Step 1: Understand the condition. For any pair \( (x, y) \) with \( x, y \in Z \), the pair belongs to \( R \) exactly when \( x - y \) is an integer. Because \( x \) and \( y \) are integers, their difference \( x - y \) is always an integer. So actually every pair of integers satisfies the condition.
  2. Step 2 — Check Reflexive: Take any integer \( x \in Z \). Then \[ x - x = 0 \] and \( 0 \) is an integer. So \( (x, x) \in R \) for every \( x \). Hence \( R \) is reflexive.
  3. Step 3 — Check Symmetric: Suppose \( (x, y) \in R \), which means \( x - y \) is an integer. Then its negative \[ y - x = -(x - y) \] is also an integer, because the negative of an integer is an integer. So \( (y, x) \in R \). Hence \( R \) is symmetric.
  4. Step 4 — Check Transitive: Suppose \( (x, y) \in R \) and \( (y, z) \in R \). Then \( x - y \) is an integer and \( y - z \) is an integer. Adding them gives \[ (x - y) + (y - z) = x - z \] which is a sum of two integers, hence an integer. So \( (x, z) \in R \). Hence \( R \) is transitive.
  5. Step 5 — Conclude: Since \( R \) is reflexive, symmetric, and transitive, all three properties hold. Note that this relation actually holds for every pair of integers, so \( R = Z \times Z \).

Final Answer

The relation \( R \) is reflexive, symmetric, and transitive. Therefore \( R \) is an equivalence relation on \( Z \).

Common Mistake

A common mistake is confusing this relation with one like \( x - y \) being divisible by some number, or thinking the condition sometimes fails. Since both \( x \) and \( y \) are integers, \( x - y \) is ALWAYS an integer, so no pair is ever left out — students often overlook this and try to find counterexamples that do not exist.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Understand the Relation: The relation is defined on \( Z \) (the set of all integers) as \( R = \{(x, y) : x - y \text{ is an integer}\} \). Since both \( x \) and \( y \) are already integers, their difference \( x - y \) is always an integer (closure of integers under subtraction). This means every ordered pair \( (x, y) \) with \( x, y \in Z \) satisfies the condition — Reason: Understanding what pairs belong to \( R \) is essential before testing any property.
  2. Step 2: Check Reflexivity: Pick any arbitrary element \( x \in Z \). Compute \( x - x \): \[ x - x = 0 \] Since \( 0 \) is an integer, we have \( (x, x) \in R \) for every \( x \in Z \). Therefore \( R \) is reflexive — Reason: Reflexivity requires every element to be related to itself, and since \( x - x = 0 \in Z \) always holds, this is confirmed.
  3. Step 3: Check Symmetry: Assume \( (x, y) \in R \) for some \( x, y \in Z \). This means \( x - y \) is an integer. Now examine \( y - x \): \[ y - x = -(x - y) \] Since the negative of an integer is also an integer, \( y - x \in Z \), which gives \( (y, x) \in R \) — Reason: Symmetry requires that if \( x \) is related to \( y \), then \( y \) must be related to \( x \). Taking the negative reverses the difference, and integers are closed under negation.
  4. Step 4: Check Transitivity: Assume \( (x, y) \in R \) and \( (y, z) \in R \) for some \( x, y, z \in Z \). This means \( x - y \) is an integer and \( y - z \) is an integer. Now compute \( x - z \) by adding these two differences: \[ x - z = (x - y) + (y - z) \] Since the sum of two integers is an integer, \( x - z \in Z \), so \( (x, z) \in R \) — Reason: Transitivity requires chaining two relationships to produce a third. Adding \( (x - y) \) and \( (y - z) \) cancels \( y \) and gives \( x - z \), which stays in \( Z \).
  5. Step 5: Conclude: All three properties have been verified: \( R \) is reflexive (since \( x - x = 0 \in Z \)), symmetric (since \( x - y \in Z \Rightarrow -(x-y) = y - x \in Z \)), and transitive (since \( x - y \in Z \) and \( y - z \in Z \Rightarrow (x-y)+(y-z) = x-z \in Z \)) — Reason: A relation must satisfy all three conditions to qualify as an equivalence relation, and each has been independently established.

Final Answer

The relation \( R \) is reflexive, symmetric, and transitive. Therefore \( R \) is an equivalence relation on \( Z \).

Common Mistake

One common mistake: Students sometimes assume that because the set is \( Z \) (integers) and the condition involves a difference, the relation might not be symmetric — forgetting that \( -(x - y) = y - x \) is still an integer, so symmetry holds automatically.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Reflexive: For any \( x \in Z \): \[ x - x = 0 \in Z \] so \( (x, x) \in R \). Hence \( R \) is reflexive.
  2. Symmetric: Let \( (x, y) \in R \), so \( x - y \in Z \). Then \( y - x = -(x - y) \in Z \), so \( (y, x) \in R \). Hence \( R \) is symmetric.
  3. Transitive: Let \( (x, y) \in R \) and \( (y, z) \in R \), so \( x - y \in Z \) and \( y - z \in Z \). Then \( x - z = (x - y) + (y - z) \in Z \), so \( (x, z) \in R \). Hence \( R \) is transitive.

Answer: The relation \( R \) is reflexive, symmetric, and transitive. Therefore \( R \) is an equivalence relation on \( Z \).

➕ More Examples

More Examples

Example 1

Question: Determine whether the relation R defined on the set \( \mathbb{Q} \) of all rational numbers as \( R = \{(x, y) : x - y \in \mathbb{Z}\} \) is reflexive, symmetric, and transitive.

Solution: We are given \( R = \{(x, y) : x - y \in \mathbb{Z}\} \) on \( \mathbb{Q} \). Reflexivity: Let \( x \in \mathbb{Q} \). Then \( x - x = 0 \), and \( 0 \in \mathbb{Z} \). So \( (x, x) \in R \) for all \( x \in \mathbb{Q} \). Hence R is reflexive. Symmetry: Let \( (x, y) \in R \). Then \( x - y \in \mathbb{Z} \). Since the negative of an integer is also an integer, \( y - x = -(x - y) \in \mathbb{Z} \). So \( (y, x) \in R \). Hence R is symmetric. Transitivity: Let \( (x, y) \in R \) and \( (y, z) \in R \). Then \( x - y \in \mathbb{Z} \) and \( y - z \in \mathbb{Z} \). The sum of two integers is an integer, so \( x - z = (x - y) + (y - z) \in \mathbb{Z} \). Thus \( (x, z) \in R \). Hence R is transitive.

Answer: R is reflexive, symmetric, and transitive, so R is an equivalence relation on \( \mathbb{Q} \).

Example 2

Question: Let \( R \) be a relation defined on the set \( \mathbb{Z} \) of all integers by \( R = \{(a, b) : 3 \mid (a - b)\} \), meaning \( 3 \) divides \( (a - b) \). Determine whether R is reflexive, symmetric, and transitive.

Solution: We are given \( R = \{(a, b) : 3 \mid (a - b)\} \) on \( \mathbb{Z} \). Reflexivity: Let \( a \in \mathbb{Z} \). Then \( a - a = 0 \), and \( 3 \mid 0 \) since \( 0 = 3 \times 0 \). So \( (a, a) \in R \) for every \( a \in \mathbb{Z} \). Hence R is reflexive. Symmetry: Let \( (a, b) \in R \). Then \( 3 \mid (a - b) \), so \( a - b = 3k \) for some \( k \in \mathbb{Z} \). Then \( b - a = 3(-k) \) where \( -k \in \mathbb{Z} \), so \( 3 \mid (b - a) \). Thus \( (b, a) \in R \). Hence R is symmetric. Transitivity: Let \( (a, b) \in R \) and \( (b, c) \in R \). Then \( a - b = 3k \) and \( b - c = 3m \) for some \( k, m \in \mathbb{Z} \). Adding these: \[ a - c = (a - b) + (b - c) = 3k + 3m = 3(k + m). \] Since \( k + m \in \mathbb{Z} \), we have \( 3 \mid (a - c) \), so \( (a, c) \in R \). Hence R is transitive.

Answer: R is reflexive, symmetric, and transitive, so R is an equivalence relation on \( \mathbb{Z} \).

🎯 Try a Similar Question

Try a Similar Question

Question: Let \( R \) be a relation defined on the set \( \mathbb{Z} \) of all integers as \( R = \{(x, y) : 2 \mid (x - y)\} \), i.e., \( x - y \) is divisible by 2. Determine whether \( R \) is reflexive, symmetric, and transitive. Is \( R \) an equivalence relation?

Solution

  1. Step 1: Check Reflexivity: We need to verify that \( (x, x) \in R \) for all \( x \in \mathbb{Z} \). For any integer \( x \), consider \( x - x = 0 \). Since \( 0 = 2 \times 0 \), we have \( 2 \mid (x - x) \). Therefore \( (x, x) \in R \) for all \( x \in \mathbb{Z} \), so \( R \) is reflexive.
  2. Step 2: Check Symmetry: Suppose \( (x, y) \in R \). Then \( 2 \mid (x - y) \), meaning \( x - y = 2k \) for some integer \( k \). Now consider \( y - x = -(x - y) = -2k = 2(-k) \). Since \( -k \in \mathbb{Z} \), we have \( 2 \mid (y - x) \), so \( (y, x) \in R \). Therefore \( R \) is symmetric.
  3. Step 3: Check Transitivity: Suppose \( (x, y) \in R \) and \( (y, z) \in R \). Then \( x - y = 2k \) for some integer \( k \), and \( y - z = 2m \) for some integer \( m \). Adding these: \( (x - y) + (y - z) = 2k + 2m \), which gives \( x - z = 2(k + m) \). Since \( k + m \in \mathbb{Z} \), we have \( 2 \mid (x - z) \), so \( (x, z) \in R \). Therefore \( R \) is transitive.
  4. Step 4: Identify the Equivalence Classes: Since \( R \) is reflexive, symmetric, and transitive, it is an equivalence relation on \( \mathbb{Z} \). The equivalence classes are the two classes of even integers and odd integers: \[ [0] = \{\ldots, -4, -2, 0, 2, 4, \ldots\} \quad \text{(all even integers)} \] \[ [1] = \{\ldots, -3, -1, 1, 3, 5, \ldots\} \quad \text{(all odd integers)} \] These two classes partition \( \mathbb{Z} \).

Answer: The relation \( R \) is reflexive, symmetric, and transitive, so \( R \) is an equivalence relation on \( \mathbb{Z} \). It partitions \( \mathbb{Z} \) into exactly two equivalence classes: the set of all even integers and the set of all odd integers.

Everything you get with Solver7

More questions in Relations and Functions