SOLVER7 Study. Nothing Else.
Exercise 1.2 Q12

Let \(f : R → R\) be defined as \(f(x) = 3x.\) Choose the correct answer. (A)\(f\) is one-one onto (B)\(f\) is many-one onto (C) \(f\) is one-one but not onto (D) \(f\) is neither one-one nor onto.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine a magic machine where you put in a number and it triples it. If two different numbers go in, two different numbers always come out — no two people ever get the same result. Also, any number you want can come out of the machine, because you can always work backwards. Want 15 out? Put in 5. Want -6 out? Put in -2. The function \( f(x) = 3x \) works exactly like this — every input gives a unique output, and every possible output is reachable.

Answer: Option (A): \( f \) is one-one and onto.

📖 Checking if f(x) = 3x is One-One and Onto

Detailed Explanation

A function \( f : R \to R \) is called one-one (injective) if different inputs always give different outputs. Formally, whenever \( f(x_1) = f(x_2) \), it must follow that \( x_1 = x_2 \). A function is called onto (surjective) if every element of the codomain \( R \) is the image of at least one element from the domain. That is, for every real number \( y \), there exists some real \( x \) with \( f(x) = y \). If a function is both one-one and onto, it is called a bijection. Here we test \( f(x) = 3x \) against both definitions.

Formula Used

One-one: \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). Onto: for every \( y \in R \), there exists \( x \in R \) such that \( f(x) = y \).

Solution

  1. Step 1: Test for one-one. Assume two inputs give the same output: \( f(x_1) = f(x_2) \). Substituting the rule gives \[ 3x_1 = 3x_2. \]
  2. Step 2: Divide both sides by 3: \[ x_1 = x_2. \] Since equal outputs force equal inputs, \( f \) is one-one (injective).
  3. Step 3: Test for onto. Take any element \( y \) in the codomain \( R \). We need an \( x \in R \) such that \( f(x) = y \), that is \( 3x = y \).
  4. Step 4: Solve for \( x \): \[ x = \frac{y}{3}. \] For every real \( y \), this \( x \) is a real number, and it satisfies \[ f\left(\frac{y}{3}\right) = 3 \cdot \frac{y}{3} = y. \] So every element of the codomain is achieved, meaning \( f \) is onto (surjective).
  5. Step 5: Since \( f \) is both one-one and onto, it is a bijection. This matches option (A).

Final Answer

Option (A): \( f \) is one-one and onto.

Common Mistake

A common mistake is thinking that a linear function like \( f(x) = 3x \) might not be onto because the outputs 'grow faster' than the inputs. In fact, for any target value \( y \), we can always find \( x = \frac{y}{3} \) in \( R \), so the whole codomain \( R \) is covered and \( f \) is indeed onto.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Write the given function clearly. We are given \( f : \mathbb{R} \to \mathbb{R} \) defined by \( f(x) = 3x \). — Reason: Identifying the function rule precisely ensures we apply the right substitutions in the checks that follow.
  2. Step 2: Begin the one-one test by assuming two inputs produce the same output, i.e., assume \( f(x_1) = f(x_2) \). Substituting the rule gives \[ 3x_1 = 3x_2. \] — Reason: The standard method to prove injectivity is to start with the hypothesis that two outputs are equal and then deduce what that forces about the inputs.
  3. Step 3: Divide both sides of \( 3x_1 = 3x_2 \) by 3 to obtain \[ x_1 = x_2. \] Since equal outputs necessarily imply equal inputs, \( f \) is one-one (injective). — Reason: Dividing by the non-zero constant 3 isolates the inputs and confirms that no two different inputs can ever share the same output.
  4. Step 4: Begin the onto test. Pick any arbitrary element \( y \in \mathbb{R} \) in the codomain and ask: does a real \( x \) exist with \( f(x) = y \)? Setting \( f(x) = y \) means \[ 3x = y. \] — Reason: To prove surjectivity we must show every real number \( y \) is reachable, so we treat \( y \) as a fixed but arbitrary real number and try to find a pre-image \( x \).
  5. Step 5: Solve \( 3x = y \) for \( x \): \[ x = \frac{y}{3}. \] Since \( y \) is real, \( \frac{y}{3} \) is also real, so such an \( x \) always exists in \( \mathbb{R} \). — Reason: Dividing \( y \) by the non-zero constant 3 always yields a real number, guaranteeing the pre-image exists for every possible output.
  6. Step 6: Verify the pre-image works by substituting back: \[ f\!\left(\frac{y}{3}\right) = 3 \cdot \frac{y}{3} = y. \] This confirms every \( y \in \mathbb{R} \) is achieved, so \( f \) is onto (surjective). — Reason: A direct verification removes any doubt and rigorously completes the surjectivity argument.
  7. Step 7: Combine the two results: \( f \) is one-one (from Steps 2–3) and onto (from Steps 4–6), so \( f \) is a bijection. This matches Option (A). — Reason: Both properties together define a bijection; confirming each separately is sufficient to select the correct option.

Final Answer

Option (A): \( f \) is one-one and onto.

Common Mistake

One common mistake: students sometimes check only one property (usually one-one) and forget to verify the onto condition, incorrectly concluding the answer from an incomplete test.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: One-one check: Assume \( f(x_1) = f(x_2) \), so \[ 3x_1 = 3x_2 \implies x_1 = x_2. \] Hence \( f \) is one-one.
  2. Step 2: Onto check: For any \( y \in R \), set \( x = \dfrac{y}{3} \in R \). Then \[ f\!\left(\frac{y}{3}\right) = 3 \cdot \frac{y}{3} = y. \] Hence \( f \) is onto.
  3. Step 3: Conclusion: \( f \) is both one-one and onto, i.e., a bijection. Option (A).

Answer: Option (A): \( f \) is one-one and onto.

➕ More Examples

More Examples

Example 1

Question: Let \( f : \mathbb{R} \to \mathbb{R} \) be defined as \( f(x) = -5x \). Choose the correct answer. (A) \( f \) is one-one onto (B) \( f \) is many-one onto (C) \( f \) is one-one but not onto (D) \( f \) is neither one-one nor onto

Solution: Step 1: Check one-one (injective). Assume \( f(a) = f(b) \) for some \( a, b \in \mathbb{R} \). Then: \[ -5a = -5b \] Dividing both sides by \( -5 \): \[ a = b \] Since \( f(a) = f(b) \) implies \( a = b \), the function is one-one. Step 2: Check onto (surjective). Let \( y \in \mathbb{R} \) be any element of the codomain. We need to find \( x \in \mathbb{R} \) such that \( f(x) = y \). \[ -5x = y \implies x = \frac{y}{-5} = -\frac{y}{5} \] Since \( y \in \mathbb{R} \), we have \( x = -\dfrac{y}{5} \in \mathbb{R} \). So for every \( y \) in the codomain, a pre-image exists in the domain. Therefore \( f \) is onto. Conclusion: \( f \) is both one-one and onto.

Answer: (A) f is one-one onto

Example 2

Question: Let \( g : \mathbb{R} \to \mathbb{R} \) be defined as \( g(x) = 7x - 7 \). Determine whether \( g \) is one-one, onto, both, or neither.

Solution: Step 1: Check one-one (injective). Assume \( g(a) = g(b) \) for some \( a, b \in \mathbb{R} \). Then: \[ 7a - 7 = 7b - 7 \] Adding 7 to both sides: \[ 7a = 7b \] Dividing by 7: \[ a = b \] Since \( g(a) = g(b) \) implies \( a = b \), the function \( g \) is one-one. Step 2: Check onto (surjective). Let \( y \in \mathbb{R} \) be any element of the codomain. We need \( x \in \mathbb{R} \) such that \( g(x) = y \). \[ 7x - 7 = y \implies 7x = y + 7 \implies x = \frac{y + 7}{7} \] Since \( y \in \mathbb{R} \), we get \( x = \dfrac{y+7}{7} \in \mathbb{R} \). A valid pre-image exists for every \( y \). Therefore \( g \) is onto. Conclusion: \( g \) is both one-one and onto.

Answer: g is one-one onto

🎯 Try a Similar Question

Try a Similar Question

Question: Let \( f : \mathbb{R} \to \mathbb{R} \) be defined as \( f(x) = x^2 - 4 \). Choose the correct answer. (A) \( f \) is one-one and onto. (B) \( f \) is many-one and onto. (C) \( f \) is one-one but not onto. (D) \( f \) is neither one-one nor onto.

Solution

  1. Step 1: Check whether f is one-one: Suppose \( f(a) = f(b) \) for some \( a, b \in \mathbb{R} \). Then \( a^2 - 4 = b^2 - 4 \), which gives \( a^2 = b^2 \), so \( a = \pm b \). Since \( a \ne b \) is possible (for example, \( a = 2 \) and \( b = -2 \) both give \( f(a) = f(b) = 0 \)), distinct inputs can produce the same output. Therefore, \( f \) is NOT one-one (it is many-one).
  2. Step 2: Check whether f is onto: For \( f \) to be onto, every \( y \in \mathbb{R} \) must have a pre-image. Suppose \( y = f(x) = x^2 - 4 \). Then \( x^2 = y + 4 \). For \( x \) to be real, we need \( y + 4 \ge 0 \), i.e., \( y \ge -4 \). This means values like \( y = -5 \) have no real pre-image. The range of \( f \) is \( [-4, \infty) \), which is a proper subset of \( \mathbb{R} \). Therefore, \( f \) is NOT onto.
  3. Step 3: Conclusion: Since \( f \) is neither one-one nor onto, the correct answer is option (D).

Answer: Option (D): \( f \) is neither one-one nor onto.

Everything you get with Solver7

More questions in Relations and Functions