SOLVER7 Study. Nothing Else.
Miscellaneous Exercise Chapter 1 Q1

Show that the function \(f:R →\) \(\{x\in R: -1<\) \(x<1\}\) defined by \(f(x)=\dfrac{x}{1+|x|},\) \(x\in R\) is one- one and onto function.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine a machine that takes any number and squishes it into a value strictly between -1 and 1. The function \( f(x) = \dfrac{x}{1+|x|} \) is exactly that machine. No two different numbers ever come out the same — the machine never repeats an output. Every value between -1 and 1 is hit by some input number. Because every output is unique and every target value is reached, the function is a perfect two-way match between all real numbers and the open interval from -1 to 1.

Answer: The function \( f(x) = \dfrac{x}{1+|x|} \) is one-one (equal outputs force equal, same-sign inputs) and onto (every \( y \in (-1,1) \) has a preimage, given by \( x = \dfrac{y}{1-y} \) for \( y \ge 0 \) and \( x = \dfrac{y}{1+y} \) for \( y < 0 \)). Hence \( f \) is a bijection from \( R \) onto \( \{ x \in R : -1 < x < 1 \} \).

📖 Proving f(x) = x/(1+|x|) is One-One and Onto

Detailed Explanation

A function \( f \) is one-one (injective) if different inputs always give different outputs, i.e. \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). It is onto (surjective) if every element of the codomain is achieved by some input. Here the codomain is the open interval \( \{ x \in R : -1 < x < 1 \} \). Because the definition contains \( |x| \), we split the analysis into two cases: \( x \ge 0 \) and \( x < 0 \). Notice that when \( x \ge 0 \) the output is non-negative, and when \( x < 0 \) the output is negative, so the two cases never overlap. To prove onto, the cleanest method is to take any \( y \) in the codomain and actually construct an \( x \) with \( f(x) = y \); this constructed value is exactly the inverse function.

Formula Used

\[ f(x) = \dfrac{x}{1+|x|} = \begin{cases} \dfrac{x}{1+x} & x \ge 0 \\ \dfrac{x}{1-x} & x < 0 \end{cases} \]

Solution

  1. Step 1: Remove the modulus by splitting into cases. For \( x \ge 0 \), \( |x| = x \), so \( f(x) = \dfrac{x}{1+x} \). For \( x < 0 \), \( |x| = -x \), so \( f(x) = \dfrac{x}{1-x} \).
  2. Step 2: Observe the sign of the outputs. For \( x \ge 0 \), the numerator and denominator are both non-negative, so \( f(x) \ge 0 \). For \( x < 0 \), the numerator is negative and \( 1-x > 0 \), so \( f(x) < 0 \). Thus a positive input can never give the same value as a negative input, which lets us treat the cases separately when checking one-one.
  3. Step 3: Check one-one for \( x_1, x_2 \ge 0 \). Suppose \( f(x_1) = f(x_2) \). \[ \frac{x_1}{1+x_1} = \frac{x_2}{1+x_2} \] Cross-multiplying: \[ x_1(1+x_2) = x_2(1+x_1) \] \[ x_1 + x_1 x_2 = x_2 + x_1 x_2 \] So \( x_1 = x_2 \).
  4. Step 4: Check one-one for \( x_1, x_2 < 0 \). Suppose \( f(x_1) = f(x_2) \). \[ \frac{x_1}{1-x_1} = \frac{x_2}{1-x_2} \] Cross-multiplying: \[ x_1(1-x_2) = x_2(1-x_1) \] \[ x_1 - x_1 x_2 = x_2 - x_1 x_2 \] So \( x_1 = x_2 \). Since equal outputs also force the same sign (from Step 2), \( f \) is one-one on all of \( R \).
  5. Step 5: Prove onto by constructing an inverse. Take any \( y \) with \( -1 < y < 1 \). Case \( 0 \le y < 1 \): solve \( y = \dfrac{x}{1+x} \) with \( x \ge 0 \). \[ y(1+x) = x \] \[ y + yx = x \] \[ y = x(1 - y) \] \[ x = \frac{y}{1-y} \] Since \( 0 \le y < 1 \), this \( x \ge 0 \) is valid.
  6. Step 6: Case \( -1 < y < 0 \): solve \( y = \dfrac{x}{1-x} \) with \( x < 0 \). \[ y(1-x) = x \] \[ y - yx = x \] \[ y = x(1 + y) \] \[ x = \frac{y}{1+y} \] Since \( -1 < y < 0 \), this \( x < 0 \) is valid. So for every \( y \) in the codomain there exists a real \( x \) with \( f(x) = y \); hence \( f \) is onto.
  7. Step 7: Combine the conclusions. Since \( f \) is both one-one and onto, \( f \) is a bijection from \( R \) onto \( \{ x \in R : -1 < x < 1 \} \).

Final Answer

The function \( f(x) = \dfrac{x}{1+|x|} \) is one-one (equal outputs force equal, same-sign inputs) and onto (every \( y \in (-1,1) \) has a preimage, given by \( x = \dfrac{y}{1-y} \) for \( y \ge 0 \) and \( x = \dfrac{y}{1+y} \) for \( y < 0 \)). Hence \( f \) is a bijection from \( R \) onto \( \{ x \in R : -1 < x < 1 \} \).

Common Mistake

A common mistake is ignoring the modulus and treating \( f(x) = \dfrac{x}{1+x} \) for all \( x \). This is wrong for negative \( x \) and can even make the denominator zero at \( x = -1 \). Always split \( |x| \) into the cases \( x \ge 0 \) and \( x < 0 \) before working.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Remove the absolute value by splitting into two cases: For \( x \ge 0 \), we have \( |x| = x \), so \( f(x) = \dfrac{x}{1+x} \). For \( x < 0 \), we have \( |x| = -x \), so \( f(x) = \dfrac{x}{1-x} \). — Reason: The definition of absolute value forces us to treat non-negative and negative inputs separately before we can analyse injectivity or surjectivity.
  2. Step 2: Note the sign of outputs in each case: When \( x \ge 0 \): both numerator \( x \) and denominator \( 1+x \) are non-negative, so \( f(x) \ge 0 \). When \( x < 0 \): the numerator \( x \) is negative and \( 1-x > 0 \), so \( f(x) < 0 \). — Reason: Because the two cases produce outputs of opposite sign, a value from one case can never equal a value from the other, so we may check injectivity within each case independently.
  3. Step 3: Prove one-one for non-negative inputs: Suppose \( x_1 \ge 0 \) and \( x_2 \ge 0 \) with \( f(x_1) = f(x_2) \). Then \[\frac{x_1}{1+x_1} = \frac{x_2}{1+x_2}\] Cross-multiplying gives \( x_1(1+x_2) = x_2(1+x_1) \), which simplifies to \( x_1 + x_1 x_2 = x_2 + x_1 x_2 \), and therefore \( x_1 = x_2 \). — Reason: Showing that equal outputs force equal inputs is exactly the definition of injectivity.
  4. Step 4: Prove one-one for negative inputs: Suppose \( x_1 < 0 \) and \( x_2 < 0 \) with \( f(x_1) = f(x_2) \). Then \[\frac{x_1}{1-x_1} = \frac{x_2}{1-x_2}\] Cross-multiplying gives \( x_1(1-x_2) = x_2(1-x_1) \), which simplifies to \( x_1 - x_1 x_2 = x_2 - x_1 x_2 \), and therefore \( x_1 = x_2 \). Combined with Step 2, \( f \) is one-one on all of \( \mathbb{R} \). — Reason: The same cross-multiplication argument applies symmetrically to the negative branch.
  5. Step 5: Determine the actual range and prove onto: Take any \( y \) in the claimed codomain \( \{x \in \mathbb{R} : -1 < x < 1\} \) and construct a real preimage. For \( y \ge 0 \): set \( x = \dfrac{y}{1-y} \). Since \( 0 \le y < 1 \), we have \( x \ge 0 \) and \[f(x) = \frac{\dfrac{y}{1-y}}{1 + \dfrac{y}{1-y}} = \frac{\dfrac{y}{1-y}}{\dfrac{1}{1-y}} = y.\] For \( y < 0 \): set \( x = \dfrac{y}{1+y} \). Since \( -1 < y < 0 \), we have \( x < 0 \) and \[f(x) = \frac{\dfrac{y}{1+y}}{1 - \dfrac{y}{1+y}} = \frac{\dfrac{y}{1+y}}{\dfrac{1}{1+y}} = y.\] In each case a real \( x \) exists with \( f(x) = y \), so \( f \) is onto. — Reason: Explicitly constructing the preimage (i.e., the inverse formula) is the most direct way to establish surjectivity.
  6. Step 6: Combine both results: Since \( f \) is both one-one (Steps 3–4) and onto (Step 5), it is a bijection from \( \mathbb{R} \) to \( \{x \in \mathbb{R} : -1 < x < 1\} \). — Reason: A function is a bijection if and only if it is simultaneously injective and surjective, so both properties must be verified.

Final Answer

The function \( f(x) = \dfrac{x}{1+|x|} \) is one-one (equal outputs force equal, same-sign inputs) and onto (every \( y \in (-1,1) \) has a preimage, given by \( x = \dfrac{y}{1-y} \) for \( y \ge 0 \) and \( x = \dfrac{y}{1+y} \) for \( y < 0 \)). Hence \( f \) is a bijection from \( R \) onto \( \{ x \in R : -1 < x < 1 \} \).

Common Mistake

One common mistake: Students often try to check injectivity by treating the formula as a single algebraic expression and ignoring the sign of the inputs; this misses the fact that a positive and a negative input can never produce the same output (since outputs from different branches carry opposite signs), and the two branches must be verified separately.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: One-one (case \\ x_1, x_2 \ge 0): Suppose \\ f(x_1) = f(x_2) \\ with \\ x_1, x_2 \ge 0 \\. Then \[\frac{x_1}{1+x_1} = \frac{x_2}{1+x_2}\] so \\ x_1(1+x_2) = x_2(1+x_1) \\, giving \\ x_1 = x_2 \\. Similarly for \\ x_1, x_2 < 0 \\: \[\frac{x_1}{1-x_1} = \frac{x_2}{1-x_2} \Rightarrow x_1 = x_2\] Since positive inputs yield non-negative outputs and negative inputs yield negative outputs, the cases never mix, so \\ f \\ is one-one.
  2. Step 2: Onto — construct preimage for any \\ y \in (-1,1): For \\ y \ge 0 \\, set \\ x = \dfrac{y}{1-y} \ge 0 \\. Verify: \\ f(x) = \dfrac{\frac{y}{1-y}}{1+\frac{y}{1-y}} = \dfrac{\frac{y}{1-y}}{\frac{1}{1-y}} = y \\. For \\ y < 0 \\, set \\ x = \dfrac{y}{1+y} < 0 \\. Verify: \\ f(x) = \dfrac{\frac{y}{1+y}}{1-\frac{y}{1+y}} = \dfrac{\frac{y}{1+y}}{\frac{1}{1+y}} = y \\. Every \\ y \in (-1,1) \\ has a preimage, so \\ f \\ is onto.

Answer: The function \( f(x) = \dfrac{x}{1+|x|} \) is one-one (equal outputs force equal, same-sign inputs) and onto (every \( y \in (-1,1) \) has a preimage, given by \( x = \dfrac{y}{1-y} \) for \( y \ge 0 \) and \( x = \dfrac{y}{1+y} \) for \( y < 0 \)). Hence \( f \) is a bijection from \( R \) onto \( \{ x \in R : -1 < x < 1 \} \).

➕ More Examples

More Examples

Example 1

Question: Show that the function \( f : \mathbb{R} \to \{x \in \mathbb{R} : -2 < x < 2\} \) defined by \( f(x) = \dfrac{2x}{1 + |x|} \) is one-one and onto.

Solution: We need to prove f is both one-one (injective) and onto (surjective). Step 1: Prove f is one-one. Let \( a, b \in \mathbb{R} \) such that \( f(a) = f(b) \), i.e., \[ \frac{2a}{1 + |a|} = \frac{2b}{1 + |b|} \] Case (i): Both \( a \ge 0 \) and \( b \ge 0 \). Then \( |a| = a \) and \( |b| = b \), so: \[ \frac{2a}{1 + a} = \frac{2b}{1 + b} \] Cross-multiplying: \( 2a(1 + b) = 2b(1 + a) \), which gives \( 2a + 2ab = 2b + 2ab \), so \( a = b \). Case (ii): Both \( a < 0 \) and \( b < 0 \). Then \( |a| = -a \) and \( |b| = -b \), so: \[ \frac{2a}{1 - a} = \frac{2b}{1 - b} \] Cross-multiplying: \( 2a(1 - b) = 2b(1 - a) \), which gives \( 2a - 2ab = 2b - 2ab \), so \( a = b \). Case (iii): \( a \ge 0 \) and \( b < 0 \) (or vice versa). If \( a \ge 0 \), then \( f(a) = \dfrac{2a}{1+a} \ge 0 \). If \( b < 0 \), then \( f(b) = \dfrac{2b}{1-b} < 0 \). These cannot be equal, so this case gives no solution. In all cases, \( f(a) = f(b) \Rightarrow a = b \). Hence f is one-one. Step 2: Prove f is onto. Let \( y \in (-2, 2) \) be arbitrary. We need to find \( x \in \mathbb{R} \) such that \( f(x) = y \). Case (i): \( y \ge 0 \) (so \( 0 \le y < 2 \)). Assume \( x \ge 0 \), so \( |x| = x \): \[ \frac{2x}{1 + x} = y \implies 2x = y(1 + x) \implies 2x - xy = y \implies x(2 - y) = y \implies x = \frac{y}{2 - y} \] Since \( 0 \le y < 2 \), we get \( 2 - y > 0 \) and \( x = \dfrac{y}{2 - y} \ge 0 \). This is valid. Case (ii): \( y < 0 \) (so \( -2 < y < 0 \)). Assume \( x < 0 \), so \( |x| = -x \): \[ \frac{2x}{1 - x} = y \implies 2x = y(1 - x) \implies 2x + xy = y \implies x(2 + y) = y \implies x = \frac{y}{2 + y} \] Since \( -2 < y < 0 \), we have \( 2 + y > 0 \) and \( y < 0 \), so \( x = \dfrac{y}{2+y} < 0 \). This is valid. In both cases, a pre-image \( x \in \mathbb{R} \) exists for every \( y \in (-2, 2) \). Hence f is onto. Since f is both one-one and onto, f is a bijective function.

Answer: f is one-one and onto (bijective).

Example 2

Question: Show that the function \( g : \mathbb{R} \to \{x \in \mathbb{R} : -3 < x < 3\} \) defined by \( g(x) = \dfrac{3x}{1 + |x|} \) is one-one and onto.

Solution: We need to prove g is both one-one (injective) and onto (surjective). Step 1: Prove g is one-one. Let \( a, b \in \mathbb{R} \) such that \( g(a) = g(b) \), i.e., \[ \frac{3a}{1 + |a|} = \frac{3b}{1 + |b|} \] Case (i): Both \( a \ge 0 \) and \( b \ge 0 \). Then \( |a| = a \) and \( |b| = b \), so: \[ \frac{3a}{1 + a} = \frac{3b}{1 + b} \] Cross-multiplying: \( 3a(1 + b) = 3b(1 + a) \), giving \( 3a + 3ab = 3b + 3ab \), so \( a = b \). Case (ii): Both \( a < 0 \) and \( b < 0 \). Then \( |a| = -a \) and \( |b| = -b \), so: \[ \frac{3a}{1 - a} = \frac{3b}{1 - b} \] Cross-multiplying: \( 3a(1 - b) = 3b(1 - a) \), giving \( 3a - 3ab = 3b - 3ab \), so \( a = b \). Case (iii): \( a \ge 0 \) and \( b < 0 \) (or vice versa). If \( a \ge 0 \), then \( g(a) = \dfrac{3a}{1+a} \ge 0 \). If \( b < 0 \), then \( g(b) = \dfrac{3b}{1-b} < 0 \). These cannot be equal. In all valid cases, \( g(a) = g(b) \Rightarrow a = b \). Hence g is one-one. Step 2: Prove g is onto. Let \( y \in (-3, 3) \) be arbitrary. We need \( x \in \mathbb{R} \) such that \( g(x) = y \). Case (i): \( y \ge 0 \) (so \( 0 \le y < 3 \)). Assume \( x \ge 0 \), so \( |x| = x \): \[ \frac{3x}{1 + x} = y \implies 3x = y + xy \implies x(3 - y) = y \implies x = \frac{y}{3 - y} \] Since \( 0 \le y < 3 \), we get \( 3 - y > 0 \) and \( x = \dfrac{y}{3 - y} \ge 0 \). This is valid. Case (ii): \( y < 0 \) (so \( -3 < y < 0 \)). Assume \( x < 0 \), so \( |x| = -x \): \[ \frac{3x}{1 - x} = y \implies 3x = y - xy \implies x(3 + y) = y \implies x = \frac{y}{3 + y} \] Since \( -3 < y < 0 \), we have \( 3 + y > 0 \) and \( y < 0 \), so \( x = \dfrac{y}{3 + y} < 0 \). This is valid. In both cases, a pre-image \( x \in \mathbb{R} \) exists for every \( y \in (-3, 3) \). Hence g is onto. Since g is both one-one and onto, g is a bijective function.

Answer: g is one-one and onto (bijective).

🎯 Try a Similar Question

Try a Similar Question

Question: Show that the function \( f: \mathbb{R} \to \{ x \in \mathbb{R} : -2 < x < 2 \} \) defined by \( f(x) = \dfrac{2x}{1 + |x|} \), \( x \in \mathbb{R} \), is one-one and onto. Hence conclude that \( f \) is a bijection.

Solution

  1. Step 1: Understand the function: The function is \( f(x) = \dfrac{2x}{1 + |x|} \) with domain \( \mathbb{R} \) and codomain \( (-2, 2) \). We write it in piecewise form: \[ f(x) = \begin{cases} \dfrac{2x}{1 + x} & \text{if } x \ge 0 \\ \dfrac{2x}{1 - x} & \text{if } x < 0 \end{cases} \]
  2. Step 2: Prove one-one (injectivity): Suppose \( f(x_1) = f(x_2) \) for \( x_1, x_2 \in \mathbb{R} \). Then \( \dfrac{2x_1}{1 + |x_1|} = \dfrac{2x_2}{1 + |x_2|} \), which gives \( x_1(1 + |x_2|) = x_2(1 + |x_1|) \). Case 1: Both \( x_1 \ge 0 \) and \( x_2 \ge 0 \). Then \( x_1(1 + x_2) = x_2(1 + x_1) \), so \( x_1 + x_1 x_2 = x_2 + x_1 x_2 \), giving \( x_1 = x_2 \). Case 2: Both \( x_1 < 0 \) and \( x_2 < 0 \). Then \( x_1(1 - x_2) = x_2(1 - x_1) \), so \( x_1 - x_1 x_2 = x_2 - x_1 x_2 \), giving \( x_1 = x_2 \). Case 3: \( x_1 \ge 0 \) and \( x_2 < 0 \) (or vice versa). Then \( f(x_1) \ge 0 \) while \( f(x_2) < 0 \), so \( f(x_1) \ne f(x_2) \). This case cannot produce equal outputs. In all cases, \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). Hence \( f \) is one-one.
  3. Step 3: Prove onto (surjectivity): Let \( y \in (-2, 2) \) be arbitrary. We need to find \( x \in \mathbb{R} \) such that \( f(x) = y \). Case A: \( y \ge 0 \). Set \( x = \dfrac{y}{2 - y} \). Since \( 0 \le y < 2 \), we have \( 2 - y > 0 \), so \( x \ge 0 \). Check: \[ f(x) = \frac{2x}{1 + x} = \frac{\dfrac{2y}{2-y}}{1 + \dfrac{y}{2-y}} = \frac{\dfrac{2y}{2-y}}{\dfrac{2-y+y}{2-y}} = \frac{2y}{2} = y. \] Case B: \( y < 0 \). Set \( x = \dfrac{y}{2 + y} \). Since \( -2 < y < 0 \), we have \( 2 + y > 0 \), so \( x < 0 \). Check: \[ f(x) = \frac{2x}{1 - x} = \frac{\dfrac{2y}{2+y}}{1 - \dfrac{y}{2+y}} = \frac{\dfrac{2y}{2+y}}{\dfrac{2+y-y}{2+y}} = \frac{2y}{2} = y. \] In both cases a valid preimage exists, so \( f \) is onto.
  4. Step 4: Conclusion: Since \( f \) is both one-one and onto, it is a bijection from \( \mathbb{R} \) to \( \{ x \in \mathbb{R} : -2 < x < 2 \} \).

Answer: The function \( f(x) = \dfrac{2x}{1 + |x|} \) is one-one (equal outputs force equal, same-sign inputs) and onto (every \( y \in (-2, 2) \) has a preimage: \( x = \dfrac{y}{2-y} \) for \( y \ge 0 \) and \( x = \dfrac{y}{2+y} \) for \( y < 0 \)). Hence \( f \) is a bijection from \( \mathbb{R} \) onto \( \{ x \in \mathbb{R} : -2 < x < 2 \} \).

Everything you get with Solver7

More questions in Relations and Functions