SOLVER7 Study. Nothing Else.
2026 Board Paper Q36(iii)b

Two friends Ramesh and Divya have started playing Ludo at their house. While rolling the die, they observed each time, that the possible outcomes are \(\{1, 2, 3, 4, 5, 6\}.\) Let \(A\) be the set of players and \(B\) be the set of all possible outcomes, so \(A=\{Ramesh, Divya\}\) and \(B=\{1, 2, 3, 4, 5, 6\}.\)Based on the above information, answer the following questions : Let relation \(R : B\rightarrow B\) be defined as \(R=\{(x,y):y\) is divisible by \(x\}.\)
Let \(R_1:B\rightarrow B\) is defined as
\(R_1=\{(x,y):x = 2y, x, y\in B\}.\) Check whether \(R_1\) is reflexive, symmetric or transitive.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine a group of numbers from 1 to 6. We pick pairs where one number is exactly double the other. So we get the pairs (2,1), (4,2), and (6,3). Now, "reflexive" means every number is paired with itself — but none are here. "Symmetric" means if (2,1) is included, (1,2) must also be included — but it is not. "Transitive" means if (a,b) and (b,c) are both in the group, then (a,c) must also appear — but no such chain exists here, so this rule passes automatically.

Answer: The relation \( R_1 = \{(2,1),(4,2),(6,3)\} \) is NOT reflexive and NOT symmetric, but it IS transitive (transitive vacuously, since no two pairs form a linking chain).

📖 Checking Properties of Relation R₁ on Set B

Detailed Explanation

A relation is just a set of ordered pairs coming from a set. To describe its nature we test three properties. A relation \( R_1 \) on set \( B \) is reflexive if every element is related to itself, that is \( (a,a) \in R_1 \) for all \( a \in B \). It is symmetric if whenever \( (a,b) \in R_1 \) then \( (b,a) \in R_1 \) too. It is transitive if whenever \( (a,b) \in R_1 \) and \( (b,c) \in R_1 \), then \( (a,c) \in R_1 \). To check these, first we list out all the ordered pairs in the relation and then examine them against each definition.

Formula Used

Reflexive: \( (a,a) \in R_1 \ \forall a \in B \). Symmetric: \( (a,b) \in R_1 \Rightarrow (b,a) \in R_1 \). Transitive: \( (a,b),(b,c) \in R_1 \Rightarrow (a,c) \in R_1 \).

Solution

  1. Step 1: List all pairs of \( R_1 \). Here \( R_1 = \{(x,y) : x = 2y,\ x,y \in B\} \). We need \( x \) to be twice \( y \), with both in \( B = \{1,2,3,4,5,6\} \). For \( y=1 \), \( x=2 \); for \( y=2 \), \( x=4 \); for \( y=3 \), \( x=6 \); for \( y=4 \), \( x=8 \notin B \), and so on. So \[ R_1 = \{(2,1),\ (4,2),\ (6,3)\}. \]
  2. Step 2: Check reflexivity. For \( R_1 \) to be reflexive, every element must relate to itself, i.e. \( (1,1),(2,2),\dots,(6,6) \) must all be present. But none of these appear in \( R_1 \). For example \( (1,1) \notin R_1 \) since \( 1 \ne 2\cdot 1 \). Hence \( R_1 \) is not reflexive.
  3. Step 3: Check symmetry. We must see if \( (x,y) \in R_1 \Rightarrow (y,x) \in R_1 \). Take \( (2,1) \in R_1 \). For symmetry we would need \( (1,2) \in R_1 \), which requires \( 1 = 2 \cdot 2 = 4 \), a false statement. So \( (1,2) \notin R_1 \). Hence \( R_1 \) is not symmetric.
  4. Step 4: Check transitivity. We must see if \( (x,y) \in R_1 \) and \( (y,z) \in R_1 \) force \( (x,z) \in R_1 \). Look at the pairs \( (2,1),(4,2),(6,3) \). The second element of one pair never equals the first element of another pair (the first elements are \( 2,4,6 \) and the second elements are \( 1,2,3 \); the only overlap is \( 2 \), but there is no pair starting with \( 1 \)). So there is no chain \( (x,y),(y,z) \) to break the rule. Since the condition \( (x,y),(y,z) \in R_1 \) is never satisfied, transitivity holds vacuously. Hence \( R_1 \) is transitive.

Final Answer

The relation \( R_1 = \{(2,1),(4,2),(6,3)\} \) is NOT reflexive and NOT symmetric, but it IS transitive (transitive vacuously, since no two pairs form a linking chain).

Common Mistake

Students often conclude \( R_1 \) is not transitive just because there are 'no useful pairs to check.' In fact, when the hypothesis \( (x,y),(y,z) \in R_1 \) is never met, the relation is transitive vacuously (by default). Absence of a counterexample means the property holds.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the base set and the rule defining the relation. The set is \( B = \\{1,2,3,4,5,6\\} \) and the relation is \( R_1 = \\{(x,y) : x = 2y,\\ x,y \in B\\} \). — Reason: Reading the rule carefully tells us exactly which pairs to include; we need \( x \) to equal twice \( y \), and both values must stay inside \( B \).
  2. Step 2: Enumerate all valid pairs by substituting each possible value of \( y \). For \( y = 1 \): \( x = 2 \in B \), giving pair \( (2,1) \). For \( y = 2 \): \( x = 4 \in B \), giving pair \( (4,2) \). For \( y = 3 \): \( x = 6 \in B \), giving pair \( (6,3) \). For \( y = 4 \): \( x = 8 \notin B \), so excluded. Similarly \( y = 5 \) and \( y = 6 \) give values outside \( B \). Therefore \[ R_1 = \\{(2,1),\\ (4,2),\\ (6,3)\\}. \] — Reason: Listing all pairs systematically ensures nothing is missed and no invalid pair is included.
  3. Step 3: Test reflexivity: check whether \( (a,a) \in R_1 \) for every \( a \in B \). The pairs that would be needed are \( (1,1),(2,2),(3,3),(4,4),(5,5),(6,6) \). None of these appear in \( R_1 \), because \( a = 2a \) implies \( a = 0 \), which is not in \( B \). For a concrete witness: \( (1,1) \notin R_1 \). Hence \( R_1 \) is NOT reflexive. — Reason: Reflexivity fails as soon as even one element lacks a self-pair; here every element fails.
  4. Step 4: Test symmetry: for every \( (a,b) \in R_1 \), check whether \( (b,a) \in R_1 \) as well. Take the pair \( (2,1) \in R_1 \). Symmetry would require \( (1,2) \in R_1 \), meaning \( 1 = 2 \times 2 = 4 \), which is false. So \( (1,2) \notin R_1 \). Hence \( R_1 \) is NOT symmetric. — Reason: One counterexample is enough to disprove symmetry; the pair \( (2,1) \) serves as that counterexample.
  5. Step 5: Test transitivity: for every pair of pairs \( (a,b) \in R_1 \) and \( (b,c) \in R_1 \), check whether \( (a,c) \in R_1 \). This requires finding two pairs in \( R_1 \) that share a middle element — the second coordinate of one pair must equal the first coordinate of another. Scanning the pairs: the second coordinates are \( 1, 2, 3 \) and the first coordinates are \( 2, 4, 6 \). There is no overlap, so no such linking chain exists at all. Because the condition is never triggered, transitivity holds vacuously. Hence \( R_1 \) IS transitive. — Reason: Transitivity is a conditional statement; if its hypothesis is never satisfied, the statement is automatically true.

Final Answer

The relation \( R_1 = \{(2,1),(4,2),(6,3)\} \) is NOT reflexive and NOT symmetric, but it IS transitive (transitive vacuously, since no two pairs form a linking chain).

Common Mistake

One common mistake: students assume that a small or simple relation must also be transitive in a meaningful (non-vacuous) sense, and then try to verify it by picking arbitrary elements rather than checking whether any two pairs actually share a middle element — missing that vacuous transitivity applies when no linking chain exists at all.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Build the relation: Given \( B = \{1,2,3,4,5,6\} \) and \( R_1 = \{(x,y) : x = 2y,\ x,y \in B\} \): \[R_1 = \{(2,1),(4,2),(6,3)\}\]
  2. Step 2: Reflexive and Symmetric checks: Reflexive — \( (1,1),(2,2),\ldots,(6,6) \notin R_1 \), so NOT reflexive. Symmetric — \( (2,1) \in R_1 \) but \( (1,2) \notin R_1 \), so NOT symmetric.
  3. Step 3: Transitive check: Transitivity requires: \( (a,b) \in R_1 \) and \( (b,c) \in R_1 \Rightarrow (a,c) \in R_1 \). No pair \( (b,c) \) exists sharing a second-element \( b \) with any first-element, so the condition is vacuously satisfied. Hence IS transitive.

Answer: The relation \( R_1 = \{(2,1),(4,2),(6,3)\} \) is NOT reflexive and NOT symmetric, but it IS transitive (transitive vacuously, since no two pairs form a linking chain).

➕ More Examples

More Examples

Example 1

Question: A group of students is playing a board game using a die. The set of all possible outcomes is \( B = \{1, 2, 3, 4, 5, 6\} \). A relation \( R_2 : B \to B \) is defined as \( R_2 = \{(x, y) : y = 3x,\; x, y \in B\} \). Check whether \( R_2 \) is reflexive, symmetric, or transitive.

Solution: First, list all pairs \( (x, y) \) in \( B \times B \) satisfying \( y = 3x \). When \( x = 1 \): \( y = 3 \in B \), so \( (1,3) \in R_2 \). When \( x = 2 \): \( y = 6 \in B \), so \( (2,6) \in R_2 \). When \( x = 3 \): \( y = 9 \notin B \). When \( x = 4,5,6 \): \( y \notin B \). So \( R_2 = \{(1,3),(2,6)\} \). Checking Reflexivity: For \( R_2 \) to be reflexive, \( (x,x) \in R_2 \) for every \( x \in B \). This requires \( x = 3x \), i.e., \( 2x = 0 \), which is impossible for \( x \in B \). For example, \( (1,1) \notin R_2 \). Therefore \( R_2 \) is NOT reflexive. Checking Symmetry: For symmetry, if \( (x,y) \in R_2 \) then \( (y,x) \in R_2 \). We have \( (1,3) \in R_2 \). Check if \( (3,1) \in R_2 \): this requires \( 1 = 3 \times 3 = 9 \), which is false. So \( (3,1) \notin R_2 \). Therefore \( R_2 \) is NOT symmetric. Checking Transitivity: For transitivity, if \( (x,y) \in R_2 \) and \( (y,z) \in R_2 \) then \( (x,z) \in R_2 \). The pairs are \( (1,3) \) and \( (2,6) \). There is no pair of the form \( (x,y) \) and \( (y,z) \) both in \( R_2 \) (since \( 3 \) and \( 6 \) do not appear as first elements). Hence the transitivity condition is vacuously satisfied. Therefore \( R_2 \) IS transitive.

Answer: \( R_2 \) is neither reflexive nor symmetric, but it is transitive.

Example 2

Question: In a classroom activity, a teacher uses a spinner with outcomes \( C = \{1, 2, 3, 4, 5, 6, 7, 8\} \). A relation \( R_3 : C \to C \) is defined as \( R_3 = \{(x,y) : x + y = 8,\; x, y \in C\} \). Check whether \( R_3 \) is reflexive, symmetric, or transitive.

Solution: First, list all pairs \( (x,y) \in C \times C \) such that \( x + y = 8 \). \( (1,7),\,(2,6),\,(3,5),\,(4,4),\,(5,3),\,(6,2),\,(7,1) \). Note: \( x=8 \) gives \( y=0 \notin C \), so \( (8,y) \notin R_3 \). So \( R_3 = \{(1,7),(2,6),(3,5),(4,4),(5,3),(6,2),(7,1)\} \). Checking Reflexivity: We need \( (x,x) \in R_3 \) for all \( x \in C \), i.e., \( x + x = 8 \Rightarrow x = 4 \). So only \( (4,4) \in R_3 \). But \( (1,1) \notin R_3 \), \( (2,2) \notin R_3 \), etc. Therefore \( R_3 \) is NOT reflexive. Checking Symmetry: If \( (x,y) \in R_3 \) then \( x + y = 8 \), which also means \( y + x = 8 \), so \( (y,x) \in R_3 \). This holds for every pair. For instance, \( (1,7) \in R_3 \) and \( (7,1) \in R_3 \). Therefore \( R_3 \) IS symmetric. Checking Transitivity: Suppose \( (x,y) \in R_3 \) and \( (y,z) \in R_3 \). Then \( x + y = 8 \) and \( y + z = 8 \). Subtracting: \( x - z = 0 \Rightarrow x = z \). So we need \( (x,x) \in R_3 \), i.e., \( 2x = 8 \Rightarrow x = 4 \). Consider \( (1,7) \in R_3 \) and \( (7,1) \in R_3 \). For transitivity we need \( (1,1) \in R_3 \), but \( 1+1 = 2 \ne 8 \). So \( (1,1) \notin R_3 \). Therefore \( R_3 \) is NOT transitive.

Answer: \( R_3 \) is symmetric only. It is neither reflexive nor transitive.

🎯 Try a Similar Question

Try a Similar Question

Question: Two students, Aanya and Bharat, are playing a board game that uses a spinner with outcomes \( B = \{1, 2, 3, 4, 5, 6\} \). A relation \( R_2 : B \to B \) is defined as \( R_2 = \{(x, y) : y = 3x,\; x, y \in B\} \). List all the ordered pairs in \( R_2 \) and check whether \( R_2 \) is reflexive, symmetric, or transitive.

Solution

  1. Step 1: List all ordered pairs in R₂: We need pairs \( (x, y) \) such that \( y = 3x \) and both \( x, y \in \{1, 2, 3, 4, 5, 6\} \). For \( x = 1 \): \( y = 3 \in B \), so \( (1, 3) \in R_2 \). For \( x = 2 \): \( y = 6 \in B \), so \( (2, 6) \in R_2 \). For \( x = 3 \): \( y = 9 \notin B \), so no pair. For \( x = 4, 5, 6 \): \( y = 12, 15, 18 \notin B \), so no pairs. Therefore \( R_2 = \{(1, 3),\; (2, 6)\} \).
  2. Step 2: Check Reflexivity: A relation is reflexive if \( (a, a) \in R_2 \) for every \( a \in B \). For \( (a, a) \) to satisfy \( y = 3x \), we would need \( a = 3a \), which gives \( a = 0 \). But \( 0 \notin B \). None of the pairs \( (1,1), (2,2), (3,3), (4,4), (5,5), (6,6) \) belong to \( R_2 \). Therefore, \( R_2 \) is NOT reflexive.
  3. Step 3: Check Symmetry: A relation is symmetric if whenever \( (a, b) \in R_2 \), then \( (b, a) \in R_2 \). We have \( (1, 3) \in R_2 \). For symmetry, we need \( (3, 1) \in R_2 \). But \( 1 \ne 3 \times 3 \), so \( (3, 1) \notin R_2 \). Similarly, \( (2, 6) \in R_2 \) but \( (6, 2) \notin R_2 \) since \( 2 \ne 3 \times 6 \). Therefore, \( R_2 \) is NOT symmetric.
  4. Step 4: Check Transitivity: A relation is transitive if whenever \( (a, b) \in R_2 \) and \( (b, c) \in R_2 \), then \( (a, c) \in R_2 \). The pairs in \( R_2 \) are \( (1, 3) \) and \( (2, 6) \). For transitivity, we look for a chain: is there any pair \( (a, b) \in R_2 \) and \( (b, c) \in R_2 \)? The second elements (3 and 6) are never equal to any first element (1 and 2), so no such chain exists. Since there is no pair of elements that violates transitivity, \( R_2 \) is transitively vacuously true. Therefore, \( R_2 \) IS transitive.

Answer: The relation \( R_2 = \{(1, 3),\; (2, 6)\} \) is NOT reflexive (no element is related to itself), NOT symmetric (e.g., \( (1,3) \in R_2 \) but \( (3,1) \notin R_2 \)), and IS transitive (vacuously, since no two pairs form a linking chain).

Everything you get with Solver7

More questions in Relations and Functions