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

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

Solution

👶 Simple Explanation

Simple Explanation

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.

📖 Checking Reflexive, Symmetric, Transitive for R = {(x,y): 3x - y = 0}

Detailed Explanation

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

Formula Used

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

Solution

  1. Step 1: First list the actual pairs in \( R \). Since \( y = 3x \) and both \( x, y \in A = \{1,\ldots,14\} \), we need \( 3x \le 14 \), so \( x \) can be \( 1, 2, 3, 4 \). This gives \[R = \{(1,3), (2,6), (3,9), (4,12)\}.\]
  2. Step 2: Check reflexive. For reflexivity we need \( (a,a) \in R \) for every \( a \in A \). Take \( a = 1 \); then we would need \( (1,1) \in R \), which requires \( 3(1) - 1 = 0 \). But \( 3 - 1 = 2 \ne 0 \). So \( (1,1) \notin R \). Hence \( R \) is NOT reflexive.
  3. Step 3: Check symmetric. For symmetry, whenever \( (a,b) \in R \) we need \( (b,a) \in R \). We have \( (1,3) \in R \) since \( 3(1) - 3 = 0 \). For symmetry we would need \( (3,1) \in R \), which requires \( 3(3) - 1 = 0 \), i.e. \( 9 - 1 = 8 \ne 0 \). So \( (3,1) \notin R \). Hence \( R \) is NOT symmetric.
  4. Step 4: Check transitive. For transitivity, whenever \( (a,b) \in R \) and \( (b,c) \in R \) we need \( (a,c) \in R \). Look at the pairs \( (1,3) \in R \). For transitivity to be tested we would need some pair starting with \( 3 \), such as \( (3,9) \in R \). Then we would need \( (1,9) \in R \), which requires \( 3(1) - 9 = 0 \), i.e. \( 3 - 9 = -6 \ne 0 \). So \( (1,9) \notin R \). Hence \( R \) is NOT transitive.
  5. Step 5: Combine the conclusions. Since \( R \) fails all three tests, it is neither reflexive, nor symmetric, nor transitive.

Final Answer

The relation \( R = \{(1,3), (2,6), (3,9), (4,12)\} \) is neither reflexive, nor symmetric, nor transitive.

Common Mistake

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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Rewrite the defining rule: The condition \( 3x - y = 0 \) rewrites as \( y = 3x \), meaning the second element of every pair must be exactly three times the first. — Reason: Expressing the rule as \( y = 3x \) makes it easier to find all valid pairs systematically.
  2. Step 2: List all pairs in R: Both \( x \) and \( y \) must belong to \( A = \\{1, 2, \ldots, 14\\} \), so we need \( 3x \le 14 \), giving \( x \in \\{1, 2, 3, 4\\} \). Substituting each value: \( x = 1 \Rightarrow y = 3 \), \( x = 2 \Rightarrow y = 6 \), \( x = 3 \Rightarrow y = 9 \), \( x = 4 \Rightarrow y = 12 \). Therefore \[R = \\{(1,3),\\ (2,6),\\ (3,9),\\ (4,12)\\}.\] — Reason: Writing out every element of \( R \) explicitly lets us directly verify each property without guesswork.
  3. Step 3: Test for Reflexivity: Reflexivity requires \( (a, a) \in R \) for every \( a \in A \). Check \( a = 1 \): we would need \( (1, 1) \in R \), which demands \( y = 3(1) = 3 \), but \( y \) would have to equal \( 1 \), and \( 1 \ne 3 \). So \( (1, 1) \notin R \). — Reason: Since even one element of \( A \) fails to pair with itself, the reflexive property is disproved and \( R \) is NOT reflexive.
  4. Step 4: Test for Symmetry: Symmetry requires that whenever \( (a, b) \in R \), the reversed pair \( (b, a) \in R \) as well. Consider \( (1, 3) \in R \). For symmetry we would need \( (3, 1) \in R \), which requires \( y = 3(3) = 9 \), but the second element is \( 1 \ne 9 \). So \( (3, 1) \notin R \). — Reason: This single counterexample is sufficient to conclude that \( R \) is NOT symmetric.
  5. Step 5: Test for Transitivity: Transitivity requires: if \( (a, b) \in R \) and \( (b, c) \in R \), then \( (a, c) \in R \). Consider \( (1, 3) \in R \) and \( (3, 9) \in R \). Transitivity would then demand \( (1, 9) \in R \), i.e., \( y = 3(1) = 3 \), but \( 9 \ne 3 \). So \( (1, 9) \notin R \). — Reason: Because this valid chain \( (1,3) \) and \( (3,9) \) does not lead to \( (1,9) \in R \), the transitive property fails and \( R \) is NOT transitive.
  6. Step 6: Summarise all three conclusions: We found: (i) \( (1,1) \notin R \), so \( R \) is not reflexive. (ii) \( (1,3) \in R \) but \( (3,1) \notin R \), so \( R \) is not symmetric. (iii) \( (1,3) \in R \) and \( (3,9) \in R \) but \( (1,9) \notin R \), so \( R \) is not transitive. — Reason: Collecting all three verdicts together gives the complete classification of the relation.

Final Answer

The relation \( R = \{(1,3), (2,6), (3,9), (4,12)\} \) is neither reflexive, nor symmetric, nor transitive.

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: List elements of R: Since \( y = 3x \) and \( y \le 14 \), we get \( x \in \{1,2,3,4\} \), so \[R = \{(1,3),\ (2,6),\ (3,9),\ (4,12)\}.\]
  2. Step 2: Check Reflexivity: \( (1,1) \notin R \) since \( 3(1) - 1 = 2 \ne 0 \). Hence R is NOT reflexive.
  3. Step 3: Check Symmetry: \( (1,3) \in R \) but \( (3,1) \notin R \) since \( 3(3) - 1 = 8 \ne 0 \). Hence R is NOT symmetric.
  4. Step 4: Check Transitivity: \( (1,3) \in R \) and \( (3,9) \in R \), but \( (1,9) \notin R \) since \( 3(1) - 9 = -6 \ne 0 \). Hence R is NOT transitive.

Answer: The relation \( R = \{(1,3), (2,6), (3,9), (4,12)\} \) is neither reflexive, nor symmetric, nor transitive.

➕ More Examples

More Examples

Example 1

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.

Example 2

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.

🎯 Try a Similar Question

Try a Similar Question

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.

Solution

  1. Step 1: List all elements of R: We need \( 2x - y = 0 \), i.e., \( y = 2x \), with both \( x, y \in A = \{1, 2, 3, \ldots, 15\} \). For \( x = 1 \): \( y = 2 \) — valid, giving \( (1, 2) \). For \( x = 2 \): \( y = 4 \) — valid, giving \( (2, 4) \). For \( x = 3 \): \( y = 6 \) — valid, giving \( (3, 6) \). For \( x = 4 \): \( y = 8 \) — valid, giving \( (4, 8) \). For \( x = 5 \): \( y = 10 \) — valid, giving \( (5, 10) \). For \( x = 6 \): \( y = 12 \) — valid, giving \( (6, 12) \). For \( x = 7 \): \( y = 14 \) — valid, giving \( (7, 14) \). For \( x = 8 \): \( y = 16 \) — NOT in \( A \), so we stop. Thus \( R = \{(1,2),\ (2,4),\ (3,6),\ (4,8),\ (5,10),\ (6,12),\ (7,14)\} \).
  2. Step 2: Check Reflexivity: For \( R \) to be reflexive, we need \( (a, a) \in R \) for every \( a \in A \), i.e., \( y = 2x \) must give \( x = 2x \), which means \( x = 0 \). But \( 0 \notin A \). In particular, \( (1, 1) \notin R \), so \( R \) is NOT reflexive.
  3. Step 3: Check Symmetry: For \( R \) to be symmetric, whenever \( (x, y) \in R \) we need \( (y, x) \in R \). Consider \( (1, 2) \in R \). For symmetry we need \( (2, 1) \in R \), which requires \( 2(2) - 1 = 3 \ne 0 \). So \( (2, 1) \notin R \). Therefore \( R \) is NOT symmetric.
  4. Step 4: Check Transitivity: For transitivity, whenever \( (x, y) \in R \) and \( (y, z) \in R \), we need \( (x, z) \in R \). Consider \( (1, 2) \in R \) and \( (2, 4) \in R \). For transitivity we need \( (1, 4) \in R \). But \( 2(1) - 4 = -2 \ne 0 \), so \( (1, 4) \notin R \). Therefore \( R \) is NOT transitive.
  5. Step 5: Conclusion: Since \( R \) fails all three properties, \( R \) is neither reflexive, nor symmetric, nor 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.

Everything you get with Solver7

More questions in Relations and Functions