Exercise 1.2 · Q1: on the non-zero reals
Show that the function defined by is one-one and onto, where is the set of all non-zero real numbers. Is the result true, if the domain is replaced by with co-domain being same as ?
One-one: Let with . Then , so . Thus is one-one.
Onto: Let . Then and . Thus is onto.
So is one-one and onto.
With domain : let , . As above, , so is one-one.
But , and . So 2 has no preimage, and is not onto.
No. With domain the function is one-one but not onto.
Want the reason behind every step, the basics and the checks?
Taking the reciprocal undoes itself: . So for any non-zero , the number is sent to , and no other number is. That gives one-one and onto on at once. The second part changes only the domain, to , and keeps the codomain . The formula is the same, but now the inputs are only , so the outputs are only . One-one survives, but most of (for example ) is never reached. Whether a function is one-one or onto depends on its domain and codomain, not on the formula alone.
- Given
- , first as a function , where ; then as a function with the same rule .
- To show
- is one-one and onto.
- To find
- Whether is still one-one and onto.
- Plan
- (1) Check that really maps into . (2) One-one: assume and derive . (3) Onto: for an arbitrary , produce with . (4) Repeat both tests for on : one-one carries over, onto fails, and we exhibit a specific value that is never reached.
Basics you need
A function consists of a domain , a codomain and a rule that gives each exactly one image in . Changing or gives a different function, even if the formula is unchanged. Basics: what a function is
is one-one if for every in the domain, implies (Definition 5). To prove it, start from with arbitrary and reach . Basics: one-one and onto
is onto if for every there is an with (Definition 6). To disprove it, name one and show that no gives it.
Every real has a reciprocal , which is again non-zero (since ). Multiplying both sides of an equation by a non-zero number gives an equivalent equation. Zero has no reciprocal, which is why is removed from .
. A number such as is not in . If , then , so . Basics: integers, even and odd
Solution
Check that maps into
Take any , so . Then is defined, and it is a single real number. It is not zero, because
and if were , the product on the left would be . So for every : is a genuine function from to .
The question states , and both halves of the proof depend on it. One-one needs to be defined for every input (that is why is excluded from the domain), and onto only makes sense if all outputs lie in the stated codomain (that is why is excluded from the codomain too: is never ).A product of real numbers is zero only if one of the factors is zero. Since , neither factor can be zero (Basic 4).One-one: equal reciprocals force equal numbers
Let be arbitrary and suppose , that is,
Multiply both sides by , which is non-zero because and :
So implies , and is one-one.
One-one is a statement about every pair of inputs, so we work with arbitrary , not with chosen numbers. Clearing the fractions turns the equation into directly. Multiplying by is allowed only because it is not zero; multiplying by zero would turn any equation into and prove nothing.Onto: every non-zero is a reciprocal
Take an arbitrary . We want with . Solving for (multiply both sides by , then divide by ) suggests . Now check this candidate:
- is defined because , and it is non-zero by Step 1, so ;
- .
Every is the image of , so is onto. Together with Step 2, is one-one and onto (bijective).
Onto is again a "for every " claim, so we take a general and build an input. Solving tells us where to look; the two checks then prove that the candidate is a legal input (it lies in the domain ) and that it really works. Here the inverse of is itself: applying the reciprocal twice gives back the number you started with.Definition 6: is onto if every equals for some (Basic 3). Dividing 1 by a fraction flips it: .The second question: same rule, new domain
Now consider , . It is a function into : every is non-zero, so is defined and, by Step 1, non-zero.
The formula has not changed, but the set of inputs has shrunk from all non-zero reals to , while the codomain is still all of . So both properties have to be tested again.
One-one and onto are properties of the triple (domain, codomain, rule). Shrinking the domain can only remove inputs, so it can never create two inputs with the same output (one-one is safe), but it can leave outputs unreached (onto is at risk). The next two steps confirm exactly this.A function is its domain, codomain and rule together (Basic 1). Basics: what a function isis still one-one
Let with , that is, . Both are non-zero, so multiplying by exactly as in Step 2 gives . Hence is one-one.
The algebra of Step 2 used only that and are non-zero real numbers. Natural numbers are non-zero real numbers, so the same argument applies word for word. (In general, restricting a one-one function to a smaller domain keeps it one-one.)is not onto: the value is never reached
The number belongs to the codomain . Suppose some had . Then
But is not a natural number, so no has . Therefore is not onto.
In fact far more is missed. For we have , so : every output of lies in . Every negative number (such as ) and every number greater than is missed, and so is a value like inside , since would need .
The graph of on (horizontal and vertical scales differ). Every horizontal line with meets the curve exactly once, at : that is one-one and onto for . When only natural-number inputs are allowed (green dots), all heights lie in . The line still meets the curve, but at , which is not a green dot, so does not reach 2. To disprove onto we need one concrete value of the codomain and a proof that nothing in the domain maps to it. Solving finds the only real candidate, (Step 2 showed the reciprocal is one-one, so there cannot be another). Since that single candidate is not in the domain , the value 2 is unreached. Compare Step 3: on the same candidate was allowed, which is exactly why was onto.To disprove "for every there is an ", produce one for which there is no (Basic 3). Basics: how to prove and disproveAnswer the question
The "result" was that the function is one-one and onto. With domain and codomain , the function is one-one but not onto. So the result is not true.
The question asks whether "the result" (both properties together) still holds. One property failing is enough for the answer "No", but a complete answer says which property survives and which fails, with a reason for each.
(a) , , is one-one () and onto (every equals ), so it is bijective.
(b) No. With domain and codomain , the function is still one-one, but it is not onto: for example is not an image, because forces . (Textbook answer: "No".)
On : should come from , and indeed . ✓ On : the first outputs are , , , , all different (one-one ✓) and all in . Since is decreasing, the outputs never climb back above , so is never produced. A computer search over finds no with , as expected.
- Forgetting to check that the preimage is in the domain. In part (a), must be non-zero; in part (b), fails precisely this check.
- Multiplying by without saying why it is allowed. The step is valid only because .
- Answering "No, because it is not one-one". It is one-one on . The failure is onto.
- Thinking the answer depends only on the formula . The same formula is bijective on and not onto from . The domain and codomain decide.
- To prove onto, solve for an arbitrary , then check the solution lies in the domain and really works.
- Shrinking the domain keeps one-one but can destroy onto. Enlarging the codomain has the same effect on onto.
- A "not onto" proof needs one specific codomain value and an argument that nothing maps to it.
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| A non-zero real has a non-zero reciprocal; | Steps 1, 3 | Arithmetic of real numbers |
| Multiplying an equation by a non-zero number keeps it equivalent | Steps 2, 5, 6 | Algebra of equations |
| Definition of one-one (injective) | Steps 2, 5 | Definition 5, Section 1.3 (Lesson: types of functions) |
| Definition of onto (surjective) | Steps 3, 6 | Definition 6, Section 1.3 |
| Bijective means one-one and onto | Steps 3, 7 | Definition 7, Section 1.3 |
| ; | Step 6 | |
| All numerical values and graph coordinates | Check, figure | Recomputed exactly 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 →