RankRizz
JEE MAIN 2010TRANSCRIBED

JEE Main 2010 Mathematics question — Equivalence relations and equivalence classes

Consider the following relations: R={(x,y)∣x,y are real numbers and x=wy for some rational number w}R = \{(x, y) \mid x, y \text{ are real numbers and } x = wy \text{ for some rational number } w\}; S={(mn,pq)∣m,n,p and q are integers such that n,q≠0 and qm=pn}S = \left\{\left(\frac{m}{n}, \frac{p}{q}\right) \mid m, n, p \text{ and } q \text{ are integers such that } n, q \ne 0 \text{ and } qm = pn\right\}. Then

SOLUTION

1. Analyze Relation R

The relation RR states that two real numbers xx and yy are related if xx is a rational multiple of yy (x=wyx = wy where w∈Qw \in \mathbb{Q}).

Check Reflexivity:

For any real number xx, we can write x=1⋅xx = 1 \cdot x. Since 11 is a rational number (1∈Q1 \in \mathbb{Q}), the pair (x,x)∈R(x, x) \in R for all real numbers. Thus, RR is reflexive.

Check Symmetry:

For a relation to be symmetric, if (x,y)∈R(x, y) \in R, then (y,x)(y, x) must also belong to RR.

Consider a specific counterexample with x=0x = 0 and y=1y = 1.

The pair (0,1)∈R(0, 1) \in R because 0=0⋅10 = 0 \cdot 1, and 00 is a rational number (0∈Q0 \in \mathbb{Q}).

However, for the reverse pair (1,0)(1, 0), we would need to find a rational number ww such that 1=w⋅01 = w \cdot 0. No such number exists because w⋅0=0≠1w \cdot 0 = 0 \neq 1.

Since (0,1)∈R(0, 1) \in R but (1,0)∉R(1, 0) \notin R, the relation RR is not symmetric. Because it lacks symmetry, RR is not an equivalence relation.

2. Analyze Relation S

The relation SS acts on rational pairs of numbers defined as (mn,pq)∈S  ⟺  qm=pn\left(\frac{m}{n}, \frac{p}{q}\right) \in S \iff qm = pn.

Dividing both sides of the condition by nqnq gives the alternative equivalent condition:

mn=pq\frac{m}{n} = \frac{p}{q}

This means relation SS is simply a statement of numerical equality between two rational fractions.

Check Reflexivity:

For any rational number mn\frac{m}{n}, it is always true that mn=mn\frac{m}{n} = \frac{m}{n} because nm=mnnm = mn. Thus, SS is reflexive.

Check Symmetry:

If (mn,pq)∈S\left(\frac{m}{n}, \frac{p}{q}\right) \in S, then mn=pq\frac{m}{n} = \frac{p}{q}. This directly implies that pq=mn\frac{p}{q} = \frac{m}{n}, which means (pq,mn)∈S\left(\frac{p}{q}, \frac{m}{n}\right) \in S. Thus, SS is symmetric.

Check Transitivity:

If (mn,pq)∈S\left(\frac{m}{n}, \frac{p}{q}\right) \in S and (pq,rs)∈S\left(\frac{p}{q}, \frac{r}{s}\right) \in S, then we have the equalities:

mn=pq\frac{m}{n} = \frac{p}{q}

and

pq=rs\frac{p}{q} = \frac{r}{s}

By the transitive property of numerical equality, it follows that:

mn=rs  ⟹  sm=rn  ⟹  (mn,rs)∈S\frac{m}{n} = \frac{r}{s} \implies sm = rn \implies \left(\frac{m}{n}, \frac{r}{s}\right) \in S

Thus, SS is transitive.

Since relation SS satisfies reflexivity, symmetry, and transitivity, it is a valid equivalence relation.

Final Answer

The relation SS is an equivalence relation, but RR is not an equivalence relation.

Tagged Equivalence relations and equivalence classes. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicEquivalence relations and equivalence classes
TypeMultiple choice