Q.Show that the function defined by , is one one and onto function.
The function is a bijection from to . It is strictly increasing (hence one-one) and its range is exactly (hence onto). The key insight: the absolute value in the denominator splits the function into two simple rational pieces, each mapping its half of the real line onto half of the interval.
Why a Bijection Proof Works
To show a function is both one-one (injective) and onto (surjective), we need to prove two things:
-
One-one: Different inputs give different outputs. For a real function, showing it is strictly increasing (or strictly decreasing) is often the cleanest route — because if implies , then can only happen when .
-
Onto: Every element in the codomain is actually hit by some input. This means we need to show the range of is exactly .
The function is cleverly designed: the in the denominator "clamps" the output between and without ever reaching them. For positive , it becomes ; for negative , it becomes (since when ). Both are simple rational functions that are easy to analyze.
The split at is natural: changes behaviour there. Always handle absolute value functions by considering cases and separately.
Step-by-Step Proof
1. Write the function piecewise.
For , , so
For , , so
Notice that for , the denominator , so is negative (since numerator is negative, denominator positive).
2. Show is one-one (injective).
We'll prove is strictly increasing on all of .
Case 1: .
Consider . For , we have
So is strictly increasing on .
Case 2: .
For , write , with (since means ). Then
Since , and is strictly increasing for (shown in Case 1), we have , so , meaning . So is also strictly increasing on .
At the junction :
For any , . For any , . So the function is strictly increasing across as well.
Thus is strictly increasing on all of , which implies it is one-one.
A common mistake: assuming a piecewise function is automatically increasing if each piece is increasing. You must also check the behaviour at the boundary ( here) to ensure no "jump down" occurs. Here sits between the negative outputs (left) and positive outputs (right), so the function is indeed strictly increasing overall.
3. Show is onto (surjective).
We need to prove that for any , there exists an such that .
Case 1: .
We look for such that . Solve:
Since , , so is valid. Check: . So every is hit.
Case 2: .
We look for such that (since for ). Solve:
Since , , so is negative (numerator negative, denominator positive). Check: . So every is hit.
Together, every is attained: for we use , and for we use .
Notice the symmetry: the inverse function is also piecewise. For , ; for , . This is a neat check that the function is indeed bijective.
4. Conclude.
Since is both one-one and onto, it is a bijection from to .
The function is a bijection from onto ; it is both one-one (strictly increasing) and onto (every has a preimage).
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.