Class 12 Maths, Worked in Full Past papersGet updates
CBSE Sample Paper 2023-24 · Section D · 5 marks

Q33: (a,b)R(c,d)⇔ad=bc(a, b)R(c, d) \Leftrightarrow ad = bc on N×N\mathbb{N} \times \mathbb{N}⁠, or f(x)=x1+∣x∣f(x) = \frac{x}{1 + |x|} is one-one and onto

The question

(a) Let N\mathbb{N} be the set of all natural numbers and RR be a relation on N×N\mathbb{N} \times \mathbb{N} defined by (a,b)R(c,d)⇔ad=bc(a, b)R(c, d) \Leftrightarrow ad = bc for all (a,b),(c,d)∈N×N(a, b), (c, d) \in \mathbb{N} \times \mathbb{N}⁠. Show that RR is an equivalence relation on N×N\mathbb{N} \times \mathbb{N}⁠. Also, find the equivalence class of (2,6)(2, 6)⁠, i.e., [(2,6)][(2, 6)]⁠.

OR

(b) Show that the function f:R→{x∈R:−1<x<1}f: \mathbb{R} \to \{x \in \mathbb{R} : -1 < x < 1\} defined by f(x)=x1+∣x∣f(x) = \dfrac{x}{1 + |x|}⁠, x∈Rx \in \mathbb{R} is one-one and onto function.

Exam answer

(a)

Reflexive: Let (a,b)(a, b) be an arbitrary element of N×N\mathbb{N} \times \mathbb{N}⁠. Then a,b∈Na, b \in \mathbb{N} and

ab=baab = ba (multiplication is commutative on N\mathbb{N}⁠)

⇒(a,b)R(a,b)\Rightarrow (a, b)R(a, b) for all (a,b)∈N×N(a, b) \in \mathbb{N} \times \mathbb{N}⁠.

Why?

Reflexive means every element is related to itself. To test (a,b)R(a,b)(a, b)R(a, b)⁠, put c=ac = a and d=bd = b in the rule ad=bcad = bc⁠. It becomes ab=baab = ba⁠, which is always true.

So, RR is a reflexive relation on N×N\mathbb{N} \times \mathbb{N}⁠.

Symmetric: Let (a,b),(c,d)∈N×N(a, b), (c, d) \in \mathbb{N} \times \mathbb{N} with (a,b)R(c,d)(a, b)R(c, d)⁠. Then

ad=bc⇒bc=ad⇒cb=da⇒(c,d)R(a,b)\begin{aligned} &ad = bc \Rightarrow bc = ad \\ &\Rightarrow cb = da \\ &\Rightarrow (c, d)R(a, b) \end{aligned}
Why?

Symmetric means: if (a,b)R(c,d)(a, b)R(c, d)⁠, then (c,d)R(a,b)(c, d)R(a, b)⁠.

Read the rule carefully. (p,q)R(r,s)(p, q)R(r, s) means ps=qrps = qr⁠: first of the first pair times second of the second pair equals second of the first times first of the second. For (c,d)R(a,b)(c, d)R(a, b) this is cb=dacb = da⁠.

We get it from ad=bcad = bc by swapping the two sides and the order in each product.

So, RR is a symmetric relation on N×N\mathbb{N} \times \mathbb{N}⁠.

Transitive: Let (a,b),(c,d),(e,f)∈N×N(a, b), (c, d), (e, f) \in \mathbb{N} \times \mathbb{N} with (a,b)R(c,d)(a, b)R(c, d) and (c,d)R(e,f)(c, d)R(e, f)⁠. Then

ad=bc and cf=dead = bc \text{ and } cf = de
Why?

Transitive means: if (a,b)R(c,d)(a, b)R(c, d) and (c,d)R(e,f)(c, d)R(e, f)⁠, then (a,b)R(e,f)(a, b)R(e, f)⁠. Write the rule for each given pair. The target is af=beaf = be⁠.

⇒(ad)(cf)=(bc)(de)⇒af=be(as cd≠0)⇒(a,b)R(e,f)\begin{aligned} &\Rightarrow (ad)(cf) = (bc)(de) \\ &\Rightarrow af = be \quad (\text{as } cd \ne 0) \\ &\Rightarrow (a, b)R(e, f) \end{aligned}
Why?

Multiply the two equations side by side. Both sides now contain the factor cdcd⁠:

(ad)(cf)=a⋅c⋅d⋅f=(af)(cd)(bc)(de)=b⋅c⋅d⋅e=(be)(cd)\begin{aligned} (ad)(cf) &= a \cdot c \cdot d \cdot f = (af)(cd) \\ (bc)(de) &= b \cdot c \cdot d \cdot e = (be)(cd) \end{aligned} (af)(cd)=(be)(cd)(af)(cd) = (be)(cd)

cc and dd are natural numbers, so cd≠0cd \ne 0⁠, and we may divide by it.

(af)(cd)cd=(be)(cd)cdaf=be\begin{aligned} \frac{(af)(cd)}{cd} &= \frac{(be)(cd)}{cd} \\ af &= be \end{aligned}

Watch out: cancelling is only allowed for a factor that cannot be 0. Say why, as the bracket does.

So, RR is a transitive relation on N×N\mathbb{N} \times \mathbb{N}⁠.

As the relation RR is reflexive, symmetric and transitive, it is an equivalence relation on N×N\mathbb{N} \times \mathbb{N}⁠.

[(2,6)]={(x,y)∈N×N:(x,y)R(2,6)}={(x,y)∈N×N:6x=2y}={(x,y)∈N×N:3x=y}\begin{aligned} &[(2, 6)] \\ &= \{(x, y) \in \mathbb{N} \times \mathbb{N} : (x, y)R(2, 6)\} \\ &= \{(x, y) \in \mathbb{N} \times \mathbb{N} : 6x = 2y\} \\ &= \{(x, y) \in \mathbb{N} \times \mathbb{N} : 3x = y\} \end{aligned}
Why?

The equivalence class of (2,6)(2, 6) is the set of all pairs related to (2,6)(2, 6)⁠.

By the rule, (x,y)R(2,6)(x, y)R(2, 6) means x⋅6=y⋅2x \cdot 6 = y \cdot 2⁠. Dividing by 2 gives y=3xy = 3x⁠. Every natural number xx gives such a pair, so the class is infinite.

x⋅6=y⋅26x=2y6x2=2y23x=y\begin{aligned} x \cdot 6 &= y \cdot 2 \\ 6x &= 2y \\ \frac{6x}{2} &= \frac{2y}{2} \\ 3x &= y \end{aligned}

For example x=1x = 1 gives y=3y = 3⁠, and x=3x = 3 gives y=9y = 9⁠.

[(2,6)]={(x,3x):x∈N}[(2, 6)] = \{(x, 3x) : x \in \mathbb{N}\} ={(1,3),(2,6),(3,9),…}= \{(1, 3), (2, 6), (3, 9), \ldots\}

(b)

f(x)={x1+x,if x≥0x1−x,if x<0f(x) = \begin{cases} \dfrac{x}{1 + x}, & \text{if } x \ge 0 \\[6pt] \dfrac{x}{1 - x}, & \text{if } x < 0 \end{cases}
Why?

Remove the modulus first: ∣x∣=x|x| = x when x≥0x \ge 0⁠, and ∣x∣=−x|x| = -x when x<0x < 0⁠. So 1+∣x∣1 + |x| is 1+x1 + x or 1−x1 - x⁠.

The plan: prove one-one and onto on each piece, then check that the two pieces never share a value.

Case 1: x≥0x \ge 0⁠, f(x)=x1+xf(x) = \dfrac{x}{1 + x}⁠.

Injectivity: let x,y≥0x, y \ge 0 with f(x)=f(y)f(x) = f(y)⁠. Then

x1+x=y1+y\frac{x}{1 + x} = \frac{y}{1 + y} ⇒x+xy=y+xy⇒x=y\Rightarrow x + xy = y + xy \Rightarrow x = y
Why?

One-one means equal outputs come only from equal inputs: f(x)=f(y)⇒x=yf(x) = f(y) \Rightarrow x = y⁠.

Cross-multiply (both denominators are positive): x(1+y)=y(1+x)x(1 + y) = y(1 + x)⁠. Expand, and the xyxy terms cancel.

x(1+y)=y(1+x)x+xy=y+xyx=y(subtract xy)\begin{aligned} x(1 + y) &= y(1 + x) \\ x + xy &= y + xy \\ x &= y \quad (\text{subtract } xy) \end{aligned}

So, ff is injective on [0,∞)[0, \infty)⁠.

Surjectivity: for x≥0x \ge 0⁠,

f(x)=x1+x≥0f(x) = \frac{x}{1 + x} \ge 0 f(x)=1−11+x<1f(x) = 1 - \frac{1}{1 + x} < 1
Why?

These two lines show that the values on this piece lie in [0,1)[0, 1)⁠. The rewrite is

x1+x=(1+x)−11+x\frac{x}{1 + x} = \frac{(1 + x) - 1}{1 + x}

Split it into two fractions:

(1+x)−11+x=1+x1+x−11+x=1−11+x\begin{aligned} \frac{(1 + x) - 1}{1 + x} &= \frac{1 + x}{1 + x} - \frac{1}{1 + x} \\ &= 1 - \frac{1}{1 + x} \end{aligned}

Since 11+x>0\frac{1}{1 + x} > 0⁠, the value is less than 1.

It is ≥0\ge 0 because the top x≥0x \ge 0 and the bottom 1+x>01 + x > 0⁠.

Let y∈[0,1)y \in [0, 1)⁠. Then x=y1−y≥0x = \dfrac{y}{1 - y} \ge 0 and

f(x)=y1−y1+y1−y=yf(x) = \frac{\frac{y}{1 - y}}{1 + \frac{y}{1 - y}} = y
Why?

Onto means every value in the target is reached. To find the input, solve y=x1+xy = \frac{x}{1 + x} for xx⁠:

y=x1+xy(1+x)=x(× (1+x))y+xy=xy=x−xy(subtract xy)y=x(1−y)(take out x)x=y1−y(÷ (1−y))\begin{aligned} y &= \frac{x}{1 + x} \\ y(1 + x) &= x \quad (\times\,(1 + x)) \\ y + xy &= x \\ y &= x - xy \quad (\text{subtract } xy) \\ y &= x(1 - y) \quad (\text{take out } x) \\ x &= \frac{y}{1 - y} \quad (\div\,(1 - y)) \end{aligned}

As 0≤y<10 \le y < 1⁠, the top is ≥0\ge 0 and the bottom is positive, so x≥0x \ge 0⁠, as Case 1 needs.

In the check, the bottom is 1+y1−y=11−y1 + \frac{y}{1 - y} = \frac{1}{1 - y}⁠, so the fraction is yy⁠.

1+y1−y=1−y1−y+y1−y=1−y+y1−y=11−yy1−y÷11−y=y1−y×1−y1=y\begin{aligned} 1 + \frac{y}{1 - y} &= \frac{1 - y}{1 - y} + \frac{y}{1 - y} \\ &= \frac{1 - y + y}{1 - y} = \frac{1}{1 - y} \\[4pt] \frac{y}{1 - y} \div \frac{1}{1 - y} &= \frac{y}{1 - y} \times \frac{1 - y}{1} \\ &= y \end{aligned}

So, ff is onto from [0,∞)[0, \infty) to [0,1)[0, 1)⁠.

Case 2: x<0x < 0⁠, f(x)=x1−xf(x) = \dfrac{x}{1 - x}⁠.

Injectivity: let x,y<0x, y < 0 with f(x)=f(y)f(x) = f(y)⁠. Then

x1−x=y1−y\frac{x}{1 - x} = \frac{y}{1 - y} ⇒x−xy=y−xy⇒x=y\Rightarrow x - xy = y - xy \Rightarrow x = y
Why?

Cross-multiply (both denominators are positive, since x,y<0x, y < 0⁠). Expand, and the xyxy terms cancel:

x(1−y)=y(1−x)x−xy=y−xyx=y(add xy)\begin{aligned} x(1 - y) &= y(1 - x) \\ x - xy &= y - xy \\ x &= y \quad (\text{add } xy) \end{aligned}

So, ff is injective on (−∞,0)(-\infty, 0)⁠.

Surjectivity: for x<0x < 0⁠,

f(x)=x1−x<0f(x) = \frac{x}{1 - x} < 0 f(x)=−1+11−x>−1f(x) = -1 + \frac{1}{1 - x} > -1
Why?

Same steps as Case 1. For x<0x < 0⁠, 1−x>01 - x > 0⁠, so the cross-multiplying is safe, and

x1−x=−(1−x)+11−x\frac{x}{1 - x} = \frac{-(1 - x) + 1}{1 - x}

(The top is −1+x+1=x-1 + x + 1 = x⁠.) Split it into two fractions:

−(1−x)+11−x=−1−x1−x+11−x=−1+11−x\begin{aligned} \frac{-(1 - x) + 1}{1 - x} &= -\frac{1 - x}{1 - x} + \frac{1}{1 - x} \\ &= -1 + \frac{1}{1 - x} \end{aligned}

Since 11−x>0\frac{1}{1 - x} > 0⁠, the value is more than −1-1⁠, and it is negative because the top is negative.

Let y∈(−1,0)y \in (-1, 0)⁠. Then x=y1+y<0x = \dfrac{y}{1 + y} < 0 and

f(x)=y1+y1−y1+y=yf(x) = \frac{\frac{y}{1 + y}}{1 - \frac{y}{1 + y}} = y
Why?

Solve y=x1−xy = \frac{x}{1 - x} for xx⁠: y−xy=xy - xy = x⁠, so x(1+y)=yx(1 + y) = y and x=y1+yx = \frac{y}{1 + y}⁠.

y(1−x)=x(× (1−x))y−xy=xy=x+xy(add xy)y=x(1+y)(take out x)x=y1+y(÷ (1+y))\begin{aligned} y(1 - x) &= x \quad (\times\,(1 - x)) \\ y - xy &= x \\ y &= x + xy \quad (\text{add } xy) \\ y &= x(1 + y) \quad (\text{take out } x) \\ x &= \frac{y}{1 + y} \quad (\div\,(1 + y)) \end{aligned}

In the check, the bottom is

1−y1+y=1+y1+y−y1+y=1+y−y1+y=11+yy1+y÷11+y=y1+y×1+y1=y\begin{aligned} 1 - \frac{y}{1 + y} &= \frac{1 + y}{1 + y} - \frac{y}{1 + y} \\ &= \frac{1 + y - y}{1 + y} = \frac{1}{1 + y} \\[4pt] \frac{y}{1 + y} \div \frac{1}{1 + y} &= \frac{y}{1 + y} \times \frac{1 + y}{1} \\ &= y \end{aligned}

As −1<y<0-1 < y < 0⁠, the top is negative and the bottom is positive, so x<0x < 0⁠, as Case 2 needs.

So, ff is onto from (−∞,0)(-\infty, 0) to (−1,0)(-1, 0)⁠.

Case 3: Injectivity: let x≥0x \ge 0 and y<0y < 0⁠. Then f(x)≥0f(x) \ge 0 and f(y)<0f(y) < 0⁠, so f(x)≠f(y)f(x) \ne f(y) when x≠yx \ne y⁠.

Why?

Cases 1 and 2 only compare inputs from the same piece. A non-negative input and a negative input give outputs of opposite signs, so they can never give the same output. Together the three cases cover every pair of different inputs.

Hence ff is one-one on R\mathbb{R}⁠, and its range is [0,1)∪(−1,0)=(−1,1)[0, 1) \cup (-1, 0) = (-1, 1)⁠, the whole co-domain.

Hence ff is one-one and onto function.

Where this comes from

Chapter 1, Relations and Functions: Equivalence relation and class; one-one and onto.

Question type: (a) Show that a relation is an equivalence relation + Equivalence classes (combined); (b) Prove one-one and onto

How to spot it: click to see

(a) Type 3. Show that a relation is an equivalence relation

Spot it: the words "is an equivalence relation", often with "2 divides a−ba - b" or "∣a−b∣|a - b| is even".

Here: First, the rule is ad=bcad = bc on pairs. For transitive, multiply ad=bcad = bc by cf=decf = de and cancel cd≠0cd \ne 0 to get af=beaf = be⁠.

(a) Type 4. Equivalence classes: everything related to one element

Spot it: "find the set of all elements related to 1", or "show that the elements of {1,3,5}\{1, 3, 5\} are related to each other".

Here: Then [(2,6)][(2, 6)]⁠: put (2,6)(2, 6) in the rule, so 6x=2y6x = 2y⁠, that is y=3xy = 3x⁠.

(b) Type 5. Prove one-one and onto: the bijective function

Spot it: "show that ff is one-one and onto", or "is ff bijective?", with a formula like f(x)=3−4xf(x) = 3 - 4x⁠.

Here: Remove the modulus in x1+∣x∣\frac{x}{1 + |x|} first. Then prove one-one and onto on each piece: x=y1−yx = \frac{y}{1 - y} for x≥0x \ge 0⁠, and x=y1+yx = \frac{y}{1 + y} for negative xx⁠.

Found an error?

Tell us if something on this page is wrong or unclear. Send feedback on this question →