Q.Let and . Consider the function defined by . Is one-one and onto? Justify your answer.
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 →The function is both one-one and onto. It is a bijection from to , with the inverse .
Why a Bijection Proof Works
When a function is defined by a rational expression like , the natural instinct is to check one-one by setting and solving, and check onto by solving for in terms of . Both steps are algebraic, but the real insight is this: if you can solve uniquely for every in the codomain, you have simultaneously proven one-one and onto. That single equation gives you the inverse function, and an invertible function is exactly a bijection.
The domain excludes (division by zero), and the codomain excludes because the horizontal asymptote of is — the function never actually reaches that value. So the mapping is perfectly tailored: sends every real number except to every real number except , exactly once each.
Step-by-Step Solution
1. Check one-one (injectivity).
Assume for . Then:
Cross-multiply (valid since denominators are non-zero in ):
Expand both sides:
Cancel and from both sides:
Bring terms together:
So . Hence is one-one.
Instead of expanding fully, notice that . Then gives , so , implying immediately. This shortcut saves time in exams.
2. Check onto (surjectivity).
We need to show: for every , there exists some such that .
Set and solve for :
Bring terms together:
…
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.