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
CBSE Class 12 Maths · Relations and Functions
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.
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.
\( (x, y) R (u, v) \iff xv = yu \)
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.
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.
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.
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 \).
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.
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\)).
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\)).
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.
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.