Exercise 1.2 · Q7: and on
In each of the following cases, state whether the function is one-one, onto or bijective. Justify your answer.
(i) defined by
(ii) defined by
(i) Let . Then . So is one-one.
Let . Take . Then
So is onto.
Hence is one-one and onto, that is, bijective.
(ii) , but . So is not one-one.
for all , so has no preimage. So is not onto.
Hence is neither one-one nor onto.
Want the reason behind every step, the basics and the checks?
For each function, ask two separate questions. One-one: if two inputs give the same output, must they be the same input? Onto: can every real number be produced, that is, can we always solve for a real ? For the equation always has exactly one solution, so both answers are yes. For , squaring forgets the sign of (so and collide), and means the output is never below 1, so both answers are no.
- Given
- (i) and (ii) , each with domain and codomain .
- To find
- For each function: is it one-one? onto? bijective? with a justification.
- Plan
- Part (i): prove one-one by assuming and deducing ; prove onto by solving for an arbitrary and checking the answer. Part (ii): disprove one-one with a counterexample; disprove onto by showing for all , so a value such as 0 is never reached.
Basics you need
is one-one if implies , for every in the domain (Definition 5). To prove it, start from with arbitrary . To disprove it, give one pair with equal images. Basics: one-one and onto
is onto if for every there is an with (Definition 6). To prove it, take an arbitrary and construct . To disprove it, name one that no reaches.
Bijective means one-one and onto (Definition 7). Basics: proving and disproving
Adding the same number to both sides, or multiplying or dividing both sides by the same non-zero number, gives an equivalent equation. So can be divided by .
For every real , , with only when . Also : a square cannot tell and apart. Basics: what a function is
Part (i):
One-one: equal outputs force equal inputs
Let be any real numbers with . Then
So always forces : is one-one.
One-one is a "for all" claim, so we must work with arbitrary , not chosen numbers. The method is to undo the formula one operation at a time. Each step is reversible: subtracting 3 is always allowed, and dividing by is allowed because . That non-zero coefficient is the whole reason the function is one-one: a linear function is one-one exactly when .Dividing both sides of an equation by a non-zero number keeps it equivalent (Basic 4). One-one: (Definition 5).Onto: solve for any real
Take an arbitrary . We look for a real with :
This is a real number for every real (the only division is by 4), so it lies in the domain . Check that it works:
So every real is the image of : is onto.
Onto says every element of the codomain is hit, so again we start from an arbitrary . Solving the equation tells us which to try; the check then proves that this really maps to . We must also make sure the we found belongs to the domain. Here the domain is all of and is always real, so there is nothing to exclude.Onto: for an arbitrary in the codomain, find in the domain with , then check (Definition 6). Basics: one-one and ontoConclude for part (i), and picture it
is one-one (Step 1) and onto (Step 2), so is bijective.
The graph of is a straight line that falls steadily and extends without bound in both directions. Every horizontal line meets it exactly once: for example meets it only at . "At most once" is one-one; "at least once" is onto. The graph gives a picture of both properties at once. A horizontal line at height collects all inputs with output . If no horizontal line meets the graph twice, no two inputs share an output (one-one); if every horizontal line meets the graph, every is an output (onto).Bijective = one-one and onto (Definition 7). Lesson: types of functions
Part (ii):
Not one-one: and give the same output
Compute
So although . Two different inputs share an output, so is not one-one.
Squaring forgets the sign: , so for every . Any non-zero and its negative collide. One such pair is enough, because one-one is a "for all" claim and a single counterexample disproves it. Compare part (i): there, dividing by undid the formula; here, the step cannot be undone to , only to .(Basic 5). To disprove a "for all" statement, one counterexample is enough. Basics: proving and disprovingNot onto: the output is never less than 1
For every real , (Basic 5), so
Now take the codomain element . If some real had , then , so , which is impossible for a real number because . So no maps to 0, and is not onto.
The same holds for every , for example or . The range of is exactly : every is reached, by , since .
The graph of is a U-shaped parabola with lowest point (horizontal and vertical scales differ). The horizontal line meets it twice, at (not one-one). The line lies wholly below the graph and meets it nowhere (not onto). To show a value is never reached we need a reason that covers every at once; trying several inputs proves nothing. The inequality supplies that reason. We chose 0 as the missing value because it is the simplest number below 1, but any would do. Finding the full range shows precisely which part of the codomain is missed.Onto fails if some in the codomain has no preimage; equivalently, the range is smaller than the codomain (Remark after Definition 6). Basics: one-one and ontoConclude for part (ii)
is not one-one (Step 1) and not onto (Step 2), so is neither one-one nor onto, and in particular not bijective.
Both failures have a structural cause: squaring loses the sign (destroying one-one) and squaring never produces a negative number (destroying onto). Changing the domain to would repair one-one, and changing the codomain to would repair onto; with both changes would be a bijection. The question fixes both as , so neither repair applies.
(i) is one-one and onto, hence bijective: gives , and every real is the image of .
(ii) is neither one-one nor onto: , and for all , so 0 has no preimage.
(Textbook answer: (i) one-one and onto; (ii) neither one-one nor onto.)
(i) Take . The formula gives , and indeed ✓. Take : , and ✓.
(ii) , another collision. The smallest value over the inputs is , and no input gives anything below 1.
- Proving one-one with numbers. Checking that for proves nothing in general; the argument must use arbitrary .
- Forgetting to check the preimage. After solving , substitute back to confirm .
- " so ". This step is false: is also possible. That is exactly why part (ii) is not one-one.
- Choosing a value in the range as the onto counterexample. For , the values 1, 2 or 5 are reached; pick a value below 1, such as 0.
- A linear function with is a bijection from to ; its inverse is found by solving .
- Even powers such as lose the sign, so they are not one-one on . They are also bounded below (, so ), so they miss every value below the bound and are not onto .
- Horizontal lines on the graph test both properties: at most one meeting point (one-one), at least one (onto).
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| Definitions of one-one, onto, bijective | Both parts | Definitions 5, 6, 7, Section 1.3 (Lesson: types of functions) |
| Onto ⇔ range = codomain | Part (ii), Step 2 | Remark after Definition 6, Section 1.3 |
| Dividing by a non-zero number keeps an equation equivalent | Part (i), Steps 1, 2 | Algebra of equations |
| and for real | Part (ii), Steps 1, 2 | Properties of real numbers |
| Same method for and for on | Both parts | Example 9 and Example 11, Section 1.3 |
| All numerical values | Check | Recomputed in the site's verification script |
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 →