Q.Let be defined as . Choose the correct answer. (A) is one-one onto (B) is many-one onto (C) is one-one but not onto (D) is neither one-one nor onto.
You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
Start your 14-day free trial to unlock the full solution →A function is one-one (injective) if different inputs give different outputs, and onto (surjective) if every real number is an output. Since gives the same output for and , it is not one-one; and since , negative numbers are never outputs, so it is not onto. The correct answer is (D).
The question asks us to classify from to according to two properties: being one-one (injective) and being onto (surjective). Let’s understand what each means.
A function is one-one if forces . Equivalently, different inputs must map to different outputs. A function is onto if every element in the codomain ( here) is actually hit by some input — that is, the range equals the codomain.
For , the first thing to notice is that squaring (or raising to an even power) destroys sign information: and . So two different inputs give the same output. That immediately kills injectivity.
For surjectivity: is always non-negative. The codomain is all real numbers, which includes negatives like . Since can never be negative, those numbers are never reached. So the function is not onto either.
Let’s walk through the reasoning step by step.
-
Check one-one (injectivity).
Take and . Then and . So but . This is a direct counterexample to the one-one property.
More generally, for any , with , so the function is many-one.
-
Check onto (surjectivity). …
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.