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

Determine whether each of the following relations are reflexive, symmetric and transitive: Relation R in the set A \(=\{1, 2, 3, 4, 5, 6\}\) as \(R=\{(x,y):y\) is divisible by \(x\}\)

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine numbers as bosses and workers. A boss always manages themselves, so every number divides itself — that is the reflexive part. Now, if 1 is the boss of 2, does 2 automatically become the boss of 1? No! So the relation breaks the symmetry rule. Finally, if 1 manages 2, and 2 manages 6, then 1 also manages 6 — that chain always works, making the relation transitive. So this divisibility rule passes two tests but fails the middle one.

Answer: The relation \( R \) is reflexive and transitive, but it is not symmetric.

📖 Reflexive, Symmetric and Transitive Check for R (divisibility)

Detailed Explanation

A relation \( R \) on a set \( A \) is a collection of ordered pairs from \( A \times A \). Here \( R = \{(x,y) : y \text{ is divisible by } x\} \), which means \( (x,y) \in R \) exactly when \( x \) divides \( y \) (written \( x \mid y \)), i.e. \( y = k x \) for some positive integer \( k \). To classify the relation we check three properties. Reflexive: every element relates to itself, \( (x,x) \in R \) for all \( x \in A \). Symmetric: whenever \( (x,y) \in R \) we also have \( (y,x) \in R \). Transitive: whenever \( (x,y) \in R \) and \( (y,z) \in R \), then \( (x,z) \in R \).

Formula Used

Reflexive: \( (x,x) \in R \ \forall x \in A \). Symmetric: \( (x,y) \in R \Rightarrow (y,x) \in R \). Transitive: \( (x,y) \in R \text{ and } (y,z) \in R \Rightarrow (x,z) \in R \).

Solution

  1. Step 1: Understand the relation. Here \( A = \{1,2,3,4,5,6\} \) and \( (x,y) \in R \) means \( x \) divides \( y \). For example \( (2,6) \in R \) because \( 6 = 3 \times 2 \), but \( (4,6) \notin R \) because \( 4 \) does not divide \( 6 \).
  2. Step 2: Check reflexivity. For every \( x \in A \), does \( x \) divide \( x \)? Since \( x = 1 \cdot x \), every number divides itself, so \( (x,x) \in R \) for all \( x \). Hence \( R \) is reflexive.
  3. Step 3: Check symmetry. We need: if \( x \) divides \( y \), does \( y \) divide \( x \)? Take \( (1,2) \in R \) since \( 1 \) divides \( 2 \). But \( 2 \) does not divide \( 1 \), so \( (2,1) \notin R \). A single counterexample is enough, so \( R \) is not symmetric.
  4. Step 4: Check transitivity. Suppose \( (x,y) \in R \) and \( (y,z) \in R \). Then \( y = k_1 x \) and \( z = k_2 y \) for positive integers \( k_1, k_2 \). Substituting gives \( z = k_2 k_1 x \), so \( x \) divides \( z \), meaning \( (x,z) \in R \). Therefore \( R \) is transitive.
  5. Step 5: Combine the conclusions. The relation satisfies reflexivity and transitivity but fails symmetry.

Final Answer

The relation \( R \) is reflexive and transitive, but it is not symmetric.

Common Mistake

A common mistake is to think that because \( x \) divides \( y \), \( y \) also divides \( x \), and wrongly declare \( R \) symmetric. Divisibility works only one way, so always test symmetry with a concrete pair like \( (1,2) \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the Set and Relation: The set is \( A = \\{1, 2, 3, 4, 5, 6\\} \) and the relation is defined as \( R = \\{(x, y) : x \text{ divides } y\\} \). This means \( (x, y) \in R \) if and only if \( y = k \cdot x \) for some positive integer \( k \). For example, \( (2, 6) \in R \) because \( 6 = 3 \times 2 \), while \( (4, 6) \notin R \) because 4 does not divide 6 exactly. — Reason: Clearly understanding the rule of membership in \( R \) is essential before testing any property.
  2. Step 2: Test Reflexivity: We check whether \( (x, x) \in R \) for every \( x \in A \). Since \( x = 1 \times x \), every number divides itself, so \( (x, x) \in R \) holds for all \( x \in \\{1, 2, 3, 4, 5, 6\\} \). — Reason: Reflexivity requires each element to be related to itself; because any integer divides itself, this is automatically satisfied.
  3. Step 3: Conclude on Reflexivity: Since \( (x, x) \in R \) for every \( x \in A \), the relation \( R \) is reflexive. — Reason: The condition holds universally with no exceptions, so reflexivity is confirmed.
  4. Step 4: Test Symmetry: We ask: whenever \( x \mid y \), does it follow that \( y \mid x \)? Consider the pair \( (1, 2) \in R \) since 1 divides 2. Now check whether \( (2, 1) \in R \): does 2 divide 1? Since 1 is not a multiple of 2, the answer is no, so \( (2, 1) \notin R \). — Reason: A single counterexample is sufficient to disprove symmetry; here \( (1, 2) \in R \) but \( (2, 1) \notin R \) provides that counterexample.
  5. Step 5: Conclude on Symmetry: Because \( (1, 2) \in R \) yet \( (2, 1) \notin R \), the condition for symmetry is violated. Therefore \( R \) is not symmetric. — Reason: Symmetry demands the reverse pair to also belong to \( R \) for every pair in \( R \); this fails here.
  6. Step 6: Test Transitivity: We check: if \( x \mid y \) and \( y \mid z \), does \( x \mid z \)? Suppose \( y = m \cdot x \) and \( z = n \cdot y \) for positive integers \( m \) and \( n \). Substituting, \( z = n \cdot (m \cdot x) = (mn) \cdot x \), so \( x \mid z \). Since \( mn \) is also a positive integer, this holds in general. — Reason: We use algebra to show that divisibility chains always carry through, confirming transitivity without needing to check every case individually.
  7. Step 7: Conclude on Transitivity: Since \( x \mid y \) and \( y \mid z \) together always imply \( x \mid z \) for any elements of \( A \), the relation \( R \) is transitive. — Reason: The algebraic argument applies universally, so no counterexample can exist and transitivity holds.

Final Answer

The relation \( R \) is reflexive and transitive, but it is not symmetric.

Common Mistake

One common mistake: students sometimes assume that because a relation is reflexive it might also be symmetric; here, the divisibility relation clearly shows that \( (1, 2) \in R \) does not force \( (2, 1) \in R \), so always verify symmetry with a concrete counterexample.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Reflexivity: For all \( x \in A \), \( x \mid x \) since \( x = 1 \cdot x \), so \( (x,x) \in R \). Hence \( R \) is reflexive.
  2. Symmetry: \( (1,2) \in R \) since \( 1 \mid 2 \), but \( 2 \nmid 1 \), so \( (2,1) \notin R \). Hence \( R \) is not symmetric.
  3. Transitivity: If \( x \mid y \) and \( y \mid z \), then \( y = kx \) and \( z = my \) for integers \( k, m \), giving \( z = (km)x \), so \( x \mid z \). Hence \( (x,z) \in R \) and \( R \) is transitive.

Answer: The relation \( R \) is reflexive and transitive, but it is not symmetric.

➕ More Examples

More Examples

Example 1

Question: Determine whether the relation R in the set \( A = \{2, 4, 6, 8, 10\} \) defined by \( R = \{(x, y) : x \text{ divides } y\} \) is reflexive, symmetric, and transitive.

Solution: We have \( A = \{2, 4, 6, 8, 10\} \) and \( R = \{(x, y) : x \text{ divides } y\} \). First, we list all pairs in R. Since we need x to divide y with both in A: \[ R = \{(2,2),(2,4),(2,6),(2,8),(2,10),(4,4),(4,8),(6,6),(8,8),(10,10)\} \] Checking Reflexivity: For every element a in A, we need (a, a) ∈ R, i.e., a divides a. Since every number divides itself, \( (2,2),(4,4),(6,6),(8,8),(10,10) \in R \). Hence R is reflexive. Checking Symmetry: We need to check whether (a, b) ∈ R implies (b, a) ∈ R. Consider \( (2, 4) \in R \) since 2 divides 4. But \( (4, 2) \notin R \) because 4 does not divide 2. Hence R is NOT symmetric. Checking Transitivity: Suppose \( (x, y) \in R \) and \( (y, z) \in R \), meaning x divides y and y divides z. Then x divides z, so \( (x, z) \in R \). This holds in general: if \( x \mid y \) and \( y \mid z \), then \( x \mid z \). We can verify with pairs: \( (2,4) \in R \) and \( (4,8) \in R \) implies \( (2,8) \in R \) ✓. Hence R is transitive.

Answer: R is reflexive and transitive, but NOT symmetric.

Example 2

Question: Let \( A = \{1, 2, 3, 4, 5, 6, 7, 8\} \). Define the relation R on A by \( R = \{(x, y) : 3 \text{ divides } (x - y)\} \). Determine whether R is reflexive, symmetric, and transitive.

Solution: We have \( A = \{1, 2, 3, 4, 5, 6, 7, 8\} \) and \( R = \{(x, y) : 3 \mid (x - y)\} \). To understand the relation, note that \( 3 \mid (x - y) \) means x and y leave the same remainder when divided by 3. The equivalence classes are: \[ C_0 = \{3, 6\}, \quad C_1 = \{1, 4, 7\}, \quad C_2 = \{2, 5, 8\} \] Checking Reflexivity: For any \( a \in A \), we have \( a - a = 0 \) and \( 3 \mid 0 \). So \( (a, a) \in R \) for all a. Hence R is reflexive. Checking Symmetry: Suppose \( (x, y) \in R \), so \( 3 \mid (x - y) \). Then \( x - y = 3k \) for some integer k, which gives \( y - x = 3(-k) \). So \( 3 \mid (y - x) \), meaning \( (y, x) \in R \). Hence R is symmetric. Checking Transitivity: Suppose \( (x, y) \in R \) and \( (y, z) \in R \). Then \( 3 \mid (x - y) \) and \( 3 \mid (y - z) \). Adding these: \[ (x - y) + (y - z) = x - z \] Since 3 divides both \( (x - y) \) and \( (y - z) \), it divides their sum \( (x - z) \). So \( (x, z) \in R \). Hence R is transitive. A quick verification: \( (1, 4) \in R \) since \( 1 - 4 = -3 \), and \( (4, 7) \in R \) since \( 4 - 7 = -3 \). Then \( (1, 7) \in R \) since \( 1 - 7 = -6 = 3 \times (-2) \) ✓.

Answer: R is reflexive, symmetric, and transitive (i.e., R is an equivalence relation).

🎯 Try a Similar Question

Try a Similar Question

Question: Let \( A = \{1, 2, 3, 4, 5, 6, 7, 8\} \). Define a relation R on A by \( R = \{(x, y) : x \text{ and } y \text{ have the same remainder when divided by } 3\} \). Determine whether R is reflexive, symmetric, and transitive.

Solution

  1. Step 1: Understand the Relation: Two elements \( x, y \in A \) are related by R if and only if \( x \) and \( y \) leave the same remainder when divided by 3. The possible remainders are 0, 1, and 2. We can group the elements: Remainder 0: \( \{3, 6\} \), Remainder 1: \( \{1, 4, 7\} \), Remainder 2: \( \{2, 5, 8\} \).
  2. Step 2: Check Reflexivity: For any \( x \in A \), dividing \( x \) by 3 gives some remainder. Since \( x \) and \( x \) trivially have the same remainder, \( (x, x) \in R \) for all \( x \in A \). For example, \( 1 \div 3 \) gives remainder 1, so \( (1,1) \in R \); similarly for all elements. Therefore, R is reflexive.
  3. Step 3: Check Symmetry: Suppose \( (x, y) \in R \). This means \( x \) and \( y \) have the same remainder when divided by 3. Since the condition is symmetric (the same remainder applies to both), \( y \) and \( x \) also have the same remainder, so \( (y, x) \in R \). For example, \( (1, 4) \in R \) because both leave remainder 1, and \( (4, 1) \in R \) as well. Therefore, R is symmetric.
  4. Step 4: Check Transitivity: Suppose \( (x, y) \in R \) and \( (y, z) \in R \). Then \( x \) and \( y \) have the same remainder, and \( y \) and \( z \) have the same remainder. By the transitive property of equality, \( x \) and \( z \) also have the same remainder. For example, \( (1, 4) \in R \) and \( (4, 7) \in R \), so \( (1, 7) \in R \) since all three leave remainder 1. This holds for all such triples. Therefore, R is transitive.
  5. Step 5: Conclusion: Since R is reflexive, symmetric, and transitive, R is an equivalence relation on A. The equivalence classes are \( \{3, 6\} \), \( \{1, 4, 7\} \), and \( \{2, 5, 8\} \).

Answer: The relation R is reflexive, symmetric, and transitive. Hence, R is an equivalence relation on A.

Everything you get with Solver7

More questions in Relations and Functions