Example 9: on : bijective
Prove that the function , given by , is one-one and onto.
One-one: Let with . Then
Thus is one-one.
Onto: Let . Then and
So every has a pre-image. Thus is onto.
Hence is one-one and onto.
Want the reason behind every step, the basics and the checks?
Doubling can always be undone by halving, and on the real numbers halving is always possible. Undoing in one direction gives one-one (equal doubles come from equal numbers). Undoing in the other direction gives onto: to hit any target , start from , which is a real number for every real . This is the same formula as Example 8; the only change is that the domain is now , so is always an allowed input.
- Given
- The rule , with domain and codomain .
- To show
- (a) is one-one. (b) is onto. (Together: is bijective.)
- Plan
- (1) Prove one-one for arbitrary reals . (2) For an arbitrary , find the candidate preimage by solving , then check it lies in the domain and really works. (3) Read the result off the graph, and conclude.
Basics you need
is one-one if for all , . Basics: one-one and onto
is onto if for every there exists with . To prove it, take an arbitrary and produce an that works, then check that belongs to .
A function that is both one-one and onto is called bijective (Definition 7). Basics: what a function is
For every real number , the number is again a real number. (This is false in : . That is the whole difference from Example 8.)
Use a letter that could stand for any element and argue only with facts true of all of them. Basics: proving and disproving
Solution
One-one: equal outputs force equal inputs
Take arbitrary with . Then
(The second implication divides both sides by 2.)
So no two different real numbers have the same double, and is one-one.
We start from the hypothesis of Definition 5, , and derive its conclusion, . Because were arbitrary, the argument covers every pair of real numbers at once. Dividing by 2 is legitimate because .Cancellation law: if and , then . The step is word for word the same as in Example 8: one-one does not care whether the inputs are natural or real.Onto: find the candidate preimage by solving
Take an arbitrary . We want some with , that is . Solving for :
This is only a candidate: we found what must be if it exists. Next we check it.
Working backwards from the target is the natural way to discover a preimage. But the definition of onto asks us to exhibit an in the domain with , so discovery must be followed by verification. The textbook writes only the verification: "there exists in such that ". This step shows where comes from.To solve , divide both sides by 2 (allowed since ).Onto: check the candidate is in the domain and works
(i) In the domain? is real, so is real: . (ii) Does it work?
So every in the codomain is the image of the element of the domain. Hence is onto. For example, comes from , and comes from .
The graph of (the book's Fig 1.3). Every horizontal line meets it in exactly one point, at : "at least one" gives onto, "at most one" gives one-one. Two such lines are shown, and . Part (i) is exactly where Example 8 failed: there the domain was and . Over , halving never leaves the set, so the candidate is always admissible. Part (ii) confirms that the formula really produces , so we are not relying on algebra we have not checked.On a graph, is in the range exactly when the horizontal line meets the graph. Onto means every horizontal line meets it; one-one means no horizontal line meets it twice. Basics: one-one and ontoConclude
is one-one (Step 1) and onto (Step 3), so is one-one and onto, that is, bijective.
The preimage found in Step 3 is unique (by Step 1), so the rule undoes . This is the inverse function of , studied in Section 1.4: .
Definition 7 calls a function bijective exactly when it is both one-one and onto, so the two proved properties finish the question. The remark about the inverse previews why bijections matter: they are exactly the functions that can be reversed.Bijective every in the codomain has exactly one preimage: onto supplies at least one, one-one allows at most one.
from to is one-one () and onto (every equals with ). So is a bijection, with inverse .
Pick . The recipe gives , a real number, and . ✓ Pick : and . ✓ And , the value that had no preimage in Example 8, now has the preimage , because is a real number.
- Solving and stopping. Solving only tells you what must be. You must still say that lies in the domain and that .
- Using a specific . Showing that 3 and are hit does not prove onto. The argument must work for an arbitrary .
- Thinking the formula decides everything. The same rule is onto on but not on (Example 8). Always look at the domain and codomain.
- For onto: solve for , then verify that the solution is in the domain and maps to .
- Any linear function with is a bijection , by the same two steps with preimage .
- A graph test: one-one and onto together mean every horizontal line crosses the graph exactly once.
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| Definition of one-one | Step 1 | Definition 5, Section 1.3 (Lesson: types of functions) |
| Definition of onto | Steps 2, 3 | Definition 6, Section 1.3 |
| Definition of bijective | Step 4 | Definition 7, Section 1.3 |
| Cancelling a non-zero factor | Steps 1, 2 | Arithmetic |
| Step 3 | is closed under division by a non-zero number | |
| Graph of | Step 3 figure | Fig 1.3, Section 1.3 |
| Inverse of a bijection | Step 4 remark | Definition 9, Section 1.4 (Lesson: invertible functions) |
Tell us if something on this page is wrong or unclear, or if you would like a fuller explanation, another method or a new feature. Send feedback on this problem →