Q.Let be a relation on the set of ordered pairs of positive integers defined by if and only if . Show that is an equivalence relation.
The relation defined by is an equivalence relation because it satisfies reflexivity, symmetry, and transitivity — essentially, it captures equality of the rational numbers and .
The key insight here is that the condition is exactly the cross-multiplication test for equality of two fractions: . So is really saying "these two ordered pairs represent the same rational number." Once you see that, proving it's an equivalence relation becomes natural — you're just checking that equality of fractions behaves properly.
Let's work through the three properties systematically.
-
Reflexivity: We need to show for any positive integers .
The condition becomes , which is . Since multiplication of integers is commutative, this is always true. So every pair is related to itself.
-
Symmetry: If , then . We need to show .
The condition for the reverse is . But and , so is exactly the same equation as , just written differently. Since equality is symmetric, if holds, then holds automatically. So symmetry follows.
-
Transitivity: This is the trickiest one. Suppose and . That means:
We need to show , i.e., .
Multiply the first equation by :
Multiply the second equation by :
So .
Now, is a positive integer, so we can cancel it from both sides (since we're working with integers and ). This gives , which is exactly what we needed.
A common mistake in the transitivity step is forgetting that could be zero — but the problem says positive integers, so and cancellation is safe. If the domain included zero, this proof would fail.
The cancellation step is cleaner if you think in terms of fractions: and implies by transitivity of equality. The algebraic manipulation above is just making that rigorous without using fractions.
Since all three properties — reflexivity, symmetry, and transitivity — hold, is an equivalence relation on .
The relation is an equivalence relation on the set of ordered pairs of positive integers.
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.