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
CBSE Class 12 Maths · Relations and Functions
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.
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 \).
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 \).
The relation \( R \) is reflexive and transitive, but it is not symmetric.
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) \).
The relation \( R \) is reflexive and transitive, but it is not symmetric.
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.
Answer: The relation \( R \) is reflexive and transitive, but it is not symmetric.
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.
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).
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.
Answer: The relation R is reflexive, symmetric, and transitive. Hence, R is an equivalence relation on A.