SOLVER7 Study. Nothing Else.
Chapter 1 Examples Q19

Let R be a relation on the set A of ordered pairs of positive integers defined by \((x, y) R (u, v)\) if and only if \( xv = yu.\) Show that R is an equivalence relation.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine every fraction like 1/2, 2/4, and 3/6 all secretly being the same number. A relation groups pairs together when they represent equal fractions. Every pair is always equal to itself, so the first rule is satisfied. If pair A matches pair B, then pair B also matches pair A, so the second rule holds. And if pair A matches pair B, and pair B matches pair C, then A and C must also match — like a family of identical fractions always staying together.

Answer: R satisfies reflexivity \( (xy = yx) \), symmetry \( (xv = yu \Rightarrow uy = vx) \), and transitivity \( (xv = yu, uq = vp \Rightarrow xq = yp) \). Hence R is an equivalence relation.

📖 Proving R is an Equivalence Relation

Detailed Explanation

A relation \( R \) on a set \( A \) is called an equivalence relation if it satisfies three properties: it must be reflexive (every element is related to itself), symmetric (if \( a \) is related to \( b \), then \( b \) is related to \( a \)), and transitive (if \( a \) is related to \( b \) and \( b \) is related to \( c \), then \( a \) is related to \( c \)). Here the set \( A \) consists of ordered pairs of positive integers, and two pairs \( (x, y) \) and \( (u, v) \) are related when \( xv = yu \). Notice this condition is essentially saying that the fractions \( \frac{x}{y} \) and \( \frac{u}{v} \) are equal, which naturally behaves like an equivalence relation. We verify all three properties one by one.

Formula Used

\( (x, y) R (u, v) \iff xv = yu \)

Solution

  1. Step 1: Check Reflexivity: We must show \( (x, y) R (x, y) \) for every pair \( (x, y) \in A \). Using the definition with \( (u, v) = (x, y) \), the condition becomes \( xy = yx \). Since multiplication of positive integers is commutative, \[ xy = yx \] is always true. Therefore \( (x, y) R (x, y) \) holds for all pairs, so R is reflexive.
  2. Step 2: Check Symmetry: Assume \( (x, y) R (u, v) \). By definition this means \[ xv = yu. \] We must show that \( (u, v) R (x, y) \), which requires \( uy = vx \). Rewriting the given equation, \( xv = yu \) is the same as \( yu = xv \), and by commutativity \( uy = vx \). Hence \( (u, v) R (x, y) \), so R is symmetric.
  3. Step 3: Check Transitivity (set up): Assume \( (x, y) R (u, v) \) and \( (u, v) R (p, q) \). By the definition we have the two equations \[ xv = yu \] and \[ uq = vp. \] We must prove that \( (x, y) R (p, q) \), that is, we must show \( xq = yp \).
  4. Step 4: Check Transitivity (proof): Multiply the first equation \( xv = yu \) by \( q \) to get \[ xvq = yuq. \] From the second equation \( uq = vp \), substitute \( uq \) so that \( yuq = y(uq) = y(vp) = yvp \). Therefore \[ xvq = yvp. \] Since \( u, v, p, q \) are positive integers, \( v \ne 0 \), so we can divide both sides by \( v \) to obtain \[ xq = yp. \] This is exactly the condition for \( (x, y) R (p, q) \), so R is transitive.
  5. Step 5: Conclusion: Since R is reflexive, symmetric, and transitive, it satisfies all three requirements. Therefore R is an equivalence relation on the set A of ordered pairs of positive integers.

Final Answer

R satisfies reflexivity \( (xy = yx) \), symmetry \( (xv = yu \Rightarrow uy = vx) \), and transitivity \( (xv = yu, uq = vp \Rightarrow xq = yp) \). Hence R is an equivalence relation.

Common Mistake

A common mistake is to forget that the entries are positive integers and cancel \( v \) without justification. Dividing by \( v \) is valid only because \( v \ne 0 \); this reasoning must be stated explicitly in the transitivity step.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Understand the Setup: Let \( A \) be the set of all ordered pairs of positive integers. Two pairs \( (x, y) \) and \( (u, v) \) satisfy \( (x, y) \, R \, (u, v) \) when \( xv = yu \). — Reason: Before verifying the three properties, it helps to recognise that the condition \( xv = yu \) is just cross-multiplication of the fractions \( \frac{x}{y} \) and \( \frac{u}{v} \), so the relation essentially groups pairs that represent the same rational number.
  2. Step 2: Verify Reflexivity: Take any pair \( (x, y) \in A \). We need \( (x, y) \, R \, (x, y) \), which by the definition requires checking whether \( x \cdot y = y \cdot x \). Since multiplication of positive integers is commutative, we have \[ x \cdot y = y \cdot x \] which is always true. — Reason: Reflexivity demands every element relate to itself; the commutativity of multiplication guarantees the condition holds without any restriction on \( x \) or \( y \). Hence R is reflexive.
  3. Step 3: Verify Symmetry — Assume the Hypothesis: Suppose \( (x, y) \, R \, (u, v) \) holds. By definition this means \[ xv = yu. \] We now need to prove \( (u, v) \, R \, (x, y) \), i.e., that \( u \cdot y = v \cdot x \). — Reason: Symmetry requires us to show the relation is reversible; we start by writing down exactly what the assumption gives us.
  4. Step 4: Complete the Symmetry Proof: From the equation \( xv = yu \), rewriting both sides gives \( yu = xv \). By commutativity of multiplication, \( uy = vx \), which is precisely the condition \( (u, v) \, R \, (x, y) \). — Reason: We simply used the fact that \( ab = ba \) for all positive integers to rearrange the existing equation into the required form. Hence R is symmetric.
  5. Step 5: Set Up the Transitivity Proof: Assume \( (x, y) \, R \, (u, v) \) and \( (u, v) \, R \, (p, q) \). By definition these give us two equations: \[ xv = yu \] and \[ uq = vp. \] We must prove \( (x, y) \, R \, (p, q) \), i.e., \( xq = yp \). — Reason: Transitivity chains two related pairs through a common middle pair; we write both given conditions explicitly before combining them.
  6. Step 6: Complete the Transitivity Proof: Multiply the first equation \( xv = yu \) by \( q \) and the second equation \( uq = vp \) by \( y \): \[ xvq = yuq \] and \[ yuq = yvp. \] Combining, \( xvq = yvp \). Since \( v \) is a positive integer (hence \( v \ne 0 \)), we can cancel \( v \) from both sides to obtain \[ xq = yp, \] which is exactly \( (x, y) \, R \, (p, q) \). — Reason: Multiplying and then cancelling \( v \) is valid because all entries are positive integers; this algebraic chain links the two assumptions into the required conclusion. Hence R is transitive.
  7. Step 7: State the Conclusion: Since R is reflexive, symmetric, and transitive, all three defining properties of an equivalence relation are satisfied. — Reason: An equivalence relation requires all three properties together; having verified each one individually, we can now conclude the result.

Final Answer

R satisfies reflexivity \( (xy = yx) \), symmetry \( (xv = yu \Rightarrow uy = vx) \), and transitivity \( (xv = yu, uq = vp \Rightarrow xq = yp) \). Hence R is an equivalence relation.

Common Mistake

One common mistake: In the transitivity step, students forget to cancel the common positive-integer factor \( v \) after multiplying the two equations together, leaving the proof incomplete and not reaching the required conclusion \( xq = yp \).

✍️ Exam-ready Answer

Exam-ready Answer

  1. Reflexivity: For all \( (x, y) \in A \): condition gives \( xy = yx \), which holds by commutativity. So \( R \) is reflexive.
  2. Symmetry: Assume \( (x, y) \, R \, (u, v) \), i.e., \( xv = yu \). Then \( uy = vx \), so \( (u, v) \, R \, (x, y) \). Hence \( R \) is symmetric.
  3. Transitivity: Assume \( (x, y) \, R \, (u, v) \) and \( (u, v) \, R \, (p, q) \), i.e., \( xv = yu \) and \( uq = vp \). Multiply: \( xv \cdot uq = yu \cdot vp \), giving \( xq \cdot uv = yp \cdot uv \). Since \( uv \ne 0 \), we get \( xq = yp \), so \( (x, y) \, R \, (p, q) \). Hence \( R \) is transitive.

Answer: R satisfies reflexivity \( (xy = yx) \), symmetry \( (xv = yu \Rightarrow uy = vx) \), and transitivity \( (xv = yu, uq = vp \Rightarrow xq = yp) \). Hence R is an equivalence relation.

➕ More Examples

More Examples

Example 1

Question: Let R be a relation on the set A of all ordered pairs of positive integers defined by \((a, b)\, R\, (c, d)\) if and only if \(ad = bc\). Show that R is an equivalence relation.

Solution: We need to verify that R is reflexive, symmetric, and transitive. Step 1: Reflexivity Let \((a, b) \in A\). We check whether \((a, b)\, R\, (a, b)\). The condition requires \(a \cdot b = b \cdot a\), which is clearly true by the commutativity of multiplication. Hence R is reflexive. Step 2: Symmetry Let \((a, b), (c, d) \in A\) such that \((a, b)\, R\, (c, d)\). Then \(ad = bc\). We need to show \((c, d)\, R\, (a, b)\), i.e., \(cb = da\). Since \(ad = bc\), we have \(bc = ad\), i.e., \(cb = da\). This is exactly the condition for \((c, d)\, R\, (a, b)\). Hence R is symmetric. Step 3: Transitivity Let \((a, b), (c, d), (e, f) \in A\) such that \((a, b)\, R\, (c, d)\) and \((c, d)\, R\, (e, f)\). From \((a, b)\, R\, (c, d)\): \(ad = bc\). From \((c, d)\, R\, (e, f)\): \(cf = de\). Multiplying these two equations: \[ad \cdot cf = bc \cdot de\] This simplifies to: \[a \cdot d \cdot c \cdot f = b \cdot c \cdot d \cdot e\] Since \(c, d\) are positive integers, \(cd \ne 0\). Dividing both sides by \(cd\): \[af = be\] This is precisely the condition for \((a, b)\, R\, (e, f)\). Hence R is transitive. Conclusion: Since R is reflexive, symmetric, and transitive, R is an equivalence relation.

Answer: R is an equivalence relation — it is reflexive (since \(ab = ba\)), symmetric (since \(ad = bc \Rightarrow cb = da\)), and transitive (since \(ad = bc\) and \(cf = de\) together imply \(af = be\)).

Example 2

Question: Let B be the set of all ordered pairs of non-zero integers. Define a relation S on B by \((p, q)\, S\, (r, s)\) if and only if \(ps = qr\). Show that S is an equivalence relation on B.

Solution: We verify the three properties of an equivalence relation. Step 1: Reflexivity For any \((p, q) \in B\), we check \((p, q)\, S\, (p, q)\). The required condition is \(p \cdot q = q \cdot p\), which holds by commutativity of multiplication. Hence S is reflexive. Step 2: Symmetry Suppose \((p, q), (r, s) \in B\) and \((p, q)\, S\, (r, s)\). Then \(ps = qr\). We need to verify \((r, s)\, S\, (p, q)\), i.e., \(rq = sp\). From \(ps = qr\), we immediately get \(qr = ps\), i.e., \(rq = sp\). Hence S is symmetric. Step 3: Transitivity Suppose \((p, q), (r, s), (t, u) \in B\) with \((p, q)\, S\, (r, s)\) and \((r, s)\, S\, (t, u)\). From \((p, q)\, S\, (r, s)\): \(ps = qr\). From \((r, s)\, S\, (t, u)\): \(ru = st\). Multiplying the two equations: \[ps \cdot ru = qr \cdot st\] Simplifying: \[p \cdot s \cdot r \cdot u = q \cdot r \cdot s \cdot t\] Since \(r, s\) are non-zero integers, \(rs \ne 0\). Dividing both sides by \(rs\): \[pu = qt\] This is the condition for \((p, q)\, S\, (t, u)\). Hence S is transitive. Conclusion: Since S is reflexive, symmetric, and transitive, S is an equivalence relation on B.

Answer: S is an equivalence relation — it is reflexive (since \(pq = qp\)), symmetric (since \(ps = qr \Rightarrow rq = sp\)), and transitive (since \(ps = qr\) and \(ru = st\) imply \(pu = qt\)).

🎯 Try a Similar Question

Try a Similar Question

Question: Let R be a relation on the set \( A = \mathbb{Z} \times (\mathbb{Z} \setminus \{0\}) \) (ordered pairs of integers with non-zero second component) defined by \( (a, b) \, R \, (c, d) \) if and only if \( ad = bc \). Show that R is an equivalence relation.

Solution

  1. Step 1: Understanding the Relation: We have the set \( A = \mathbb{Z} \times (\mathbb{Z} \setminus \{0\}) \), i.e., all ordered pairs \( (a, b) \) where \( a \in \mathbb{Z} \) and \( b \in \mathbb{Z}, b \ne 0 \). The relation is defined as: \( (a, b) \, R \, (c, d) \) if and only if \( ad = bc \). Note that this relation captures the idea of equal fractions: \( \frac{a}{b} = \frac{c}{d} \). We must verify reflexivity, symmetry, and transitivity.
  2. Step 2: Reflexivity: We need to show that \( (a, b) \, R \, (a, b) \) for every \( (a, b) \in A \). By the definition of R, we check whether \( ab = ba \). Since multiplication of integers is commutative, we have \( ab = ba \) for all \( a \in \mathbb{Z} \) and \( b \in \mathbb{Z} \setminus \{0\} \). Hence \( (a, b) \, R \, (a, b) \) for all \( (a, b) \in A \), and R is reflexive.
  3. Step 3: Symmetry: Suppose \( (a, b) \, R \, (c, d) \). Then by definition, \( ad = bc \). We need to show that \( (c, d) \, R \, (a, b) \), i.e., \( cb = da \). From \( ad = bc \), we can write \( bc = ad \), which gives \( cb = da \). Thus \( (c, d) \, R \, (a, b) \) holds, and R is symmetric.
  4. Step 4: Transitivity: Suppose \( (a, b) \, R \, (c, d) \) and \( (c, d) \, R \, (e, f) \). Then by definition: \( ad = bc \) and \( cf = de \). We need to show \( (a, b) \, R \, (e, f) \), i.e., \( af = be \). From \( ad = bc \), multiply both sides by \( f \): \( adf = bcf \). From \( cf = de \), multiply both sides by \( b \): \( bcf = bde \). Combining these two results: \( adf = bde \). Since \( d \ne 0 \), we can cancel \( d \) from both sides to get \( af = be \). Hence \( (a, b) \, R \, (e, f) \), and R is transitive.
  5. Step 5: Conclusion: Since R is reflexive, symmetric, and transitive, R is an equivalence relation on \( A = \mathbb{Z} \times (\mathbb{Z} \setminus \{0\}) \).

Answer: R is an equivalence relation on \( A = \mathbb{Z} \times (\mathbb{Z} \setminus \{0\}) \). Reflexivity holds because \( ab = ba \) for all \( (a,b) \in A \). Symmetry holds because \( ad = bc \Rightarrow cb = da \). Transitivity holds because \( ad = bc \) and \( cf = de \) together imply \( af = be \) (after cancelling the non-zero integer \( d \)). Hence R is an equivalence relation.

Everything you get with Solver7

More questions in Relations and Functions