Determine whether each of the following relations are reflexive, symmetric and transitive: Relation \(R\) in the set \(A=\{1, 2, 3, ..., 13, 14\}\)defined as \(R=\{(x,y):3x – y = 0\}.\)
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Imagine a rule where every person must bring exactly triple their own number to a party. So person 1 brings 3, person 2 brings 6, and so on. Now, can person 1 bring themselves? No, because 1 is not triple 1. Can person 3 bring person 1 back? No, because 1 is not triple 3. Can a chain of tripling land back where it started? Never! The relation \( R = \\{(1,3), (2,6), (3,9), (4,12)\\} \) fails all three friendship tests: reflexive, symmetric, and transitive.
Answer: The relation \( R = \{(1,3), (2,6), (3,9), (4,12)\} \) is neither reflexive, nor symmetric, nor transitive.
A relation \( R \) on a set \( A \) is a collection of ordered pairs from \( A \times A \). Here \( A = \{1, 2, 3, \ldots, 14\} \) and \( R = \{(x,y): 3x - y = 0\} \), which means \( y = 3x \). So a pair \( (x,y) \) belongs to \( R \) only if the second element is exactly three times the first, and both elements lie in \( A \). To classify the relation we check three properties. Reflexive: every element must relate to itself, i.e. \( (a,a) \in R \) for all \( a \in A \). Symmetric: whenever \( (a,b) \in R \), we also need \( (b,a) \in R \). Transitive: whenever \( (a,b) \in R \) and \( (b,c) \in R \), we also need \( (a,c) \in R \).
R = \{(x,y): y = 3x, \ x,y \in A\}. Reflexive: \( (a,a) \in R \ \forall a \). Symmetric: \( (a,b) \in R \Rightarrow (b,a) \in R \). Transitive: \( (a,b),(b,c) \in R \Rightarrow (a,c) \in R \).
The relation \( R = \{(1,3), (2,6), (3,9), (4,12)\} \) is neither reflexive, nor symmetric, nor transitive.
A common mistake is to think \( R \) is reflexive just because it contains many pairs, or to forget that reflexivity must hold for EVERY element of \( A \) (all of \( 1 \) to \( 14 \)), not just those appearing in the listed pairs. Checking a single failing case like \( (1,1) \notin R \) is enough to reject reflexivity.
The relation \( R = \{(1,3), (2,6), (3,9), (4,12)\} \) is neither reflexive, nor symmetric, nor transitive.
One common mistake: students sometimes check only whether a property holds for one or two pairs and declare the relation reflexive or transitive without verifying it for all required elements — remember, a property must hold universally, but a single counterexample is enough to disprove it.
Answer: The relation \( R = \{(1,3), (2,6), (3,9), (4,12)\} \) is neither reflexive, nor symmetric, nor transitive.
Question: Let A = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}. Determine whether the relation R defined on A as R = {(x, y) : 2x − y = 0} is reflexive, symmetric, and transitive.
Solution: We first list all pairs (x, y) in A × A satisfying 2x − y = 0, i.e., y = 2x. For x = 1: y = 2, so (1, 2) ∈ R. For x = 2: y = 4, so (2, 4) ∈ R. For x = 3: y = 6, so (3, 6) ∈ R. For x = 4: y = 8, so (4, 8) ∈ R. For x = 5: y = 10, so (5, 10) ∈ R. For x ≥ 6: y = 2x ≥ 12, which is not in A. So R = {(1, 2), (2, 4), (3, 6), (4, 8), (5, 10)}. Checking Reflexivity: For (a, a) ∈ R we need 2a − a = 0, i.e., a = 0. Since 0 ∉ A, no element is related to itself. For example, (1, 1) ∉ R. Hence R is NOT reflexive. Checking Symmetry: Consider (1, 2) ∈ R. For symmetry we need (2, 1) ∈ R, which requires 2(2) − 1 = 3 ≠ 0. So (2, 1) ∉ R. Hence R is NOT symmetric. Checking Transitivity: Take (1, 2) ∈ R and (2, 4) ∈ R. For transitivity we need (1, 4) ∈ R, which requires 2(1) − 4 = −2 ≠ 0. So (1, 4) ∉ R. Hence R is NOT transitive.
Answer: R is neither reflexive, nor symmetric, nor transitive.
Question: Let A = {1, 2, 3, ..., 12}. Determine whether the relation R defined on A as R = {(x, y) : y − 4x = 0} is reflexive, symmetric, and transitive.
Solution: We list all pairs (x, y) in A × A satisfying y − 4x = 0, i.e., y = 4x. For x = 1: y = 4, so (1, 4) ∈ R. For x = 2: y = 8, so (2, 8) ∈ R. For x = 3: y = 12, so (3, 12) ∈ R. For x ≥ 4: y = 4x ≥ 16, which is not in A. So R = {(1, 4), (2, 8), (3, 12)}. Checking Reflexivity: For (a, a) ∈ R we need a − 4a = 0, i.e., −3a = 0, so a = 0. Since 0 ∉ A, no element is related to itself. In particular, (1, 1) ∉ R. Hence R is NOT reflexive. Checking Symmetry: Consider (1, 4) ∈ R. For symmetry we need (4, 1) ∈ R, which requires 1 − 4(4) = 1 − 16 = −15 ≠ 0. So (4, 1) ∉ R. Hence R is NOT symmetric. Checking Transitivity: We check all possible chains. The pairs in R are (1, 4), (2, 8), and (3, 12). We need a pair (a, b) ∈ R and (b, c) ∈ R for the same b. The second elements (right-hand sides) are 4, 8, 12. The first elements (left-hand sides) are 1, 2, 3. Since 4, 8, 12 do not appear as first elements in any pair of R, no chain (a, b) ∈ R and (b, c) ∈ R exists. Hence transitivity holds vacuously — there is no counterexample. Hence R IS transitive.
Answer: R is neither reflexive nor symmetric, but R is transitive.
Question: Let \( A = \{1, 2, 3, \ldots, 15\} \). Define a relation \( R \) on \( A \) by \( R = \{(x, y) : 2x - y = 0\} \). Determine whether \( R \) is reflexive, symmetric, and/or transitive.
Answer: The relation \( R = \{(1,2),\ (2,4),\ (3,6),\ (4,8),\ (5,10),\ (6,12),\ (7,14)\} \) is neither reflexive, nor symmetric, nor transitive.