Exercise 1.2 · Q5: The signum function
Show that the Signum Function , given by is neither one-one nor onto.
(In many PDF viewers the last line shows as "1, if ", with a blank space in front of the 1. The minus sign is in the file, but it uses a font that is not embedded, so some viewers do not draw it. The rule is for negative , as the signum function requires.)
and , but . So is not one-one.
The range of is , so is not the image of any . So is not onto.
Hence is neither one-one nor onto.
Want the reason behind every step, the basics and the checks?
The signum function only ever reports the sign of : positive, zero or negative. So it squeezes the whole real line into just three outputs, , and . Squeezing infinitely many inputs into three outputs forces many inputs to share an output, so is not one-one. And three outputs cannot cover a codomain as large as , so is not onto.
- Given
- The rule for , , for , with domain and codomain .
- To show
- (a) is not one-one; (b) is not onto.
- Plan
- (1) Confirm the three pieces cover every real number exactly once, so is a genuine function. (2) Not one-one: find two different inputs with the same output. (3) Find the range of by checking all three cases. (4) Not onto: name one real number outside the range and prove nothing maps to it. (5) Conclude.
Basics you need
The signum rule has three pieces. To evaluate , first decide which piece belongs to (is it positive, zero or negative?), then use only that piece. Basics: what a function is
Every real number satisfies exactly one of , , . So the three pieces never overlap and never leave a gap.
is one-one if always forces (Definition 5). This is a "for all" claim, so one pair with is enough to disprove it. Basics: one-one and onto
is onto if every equals for some (Definition 6). Equivalently, the range of is all of . To disprove it, name one and show that no gives . Basics: proving and disproving
Solution
Check that is a genuine function on
By trichotomy (Basic 2), each real is positive, zero or negative, and only one of these. So exactly one of the three formulas applies to each , and it gives exactly one value. A few sample values:
A piecewise rule is a function only if every input falls in exactly one piece. If the pieces overlapped (say "" and ""), the input 0 would get two different values; if there were a gap, some input would get none. Trichotomy rules out both problems. Notice also that the size of never matters, only its sign: and are both 1.Not one-one: two different inputs, one output
Both 1 and 2 are positive, so the first piece applies to both:
So although . Two different inputs share an output, so is not one-one. (It is many-one, in the textbook's word from Definition 5.)
"One-one" says: for every pair of inputs, equal outputs force equal inputs. A single pair that breaks this destroys the claim, so the pair 1, 2 is a complete proof. Any two positive numbers would do just as well, and so would any two negative numbers, such as . In fact every output except 0 is shared by infinitely many inputs.To disprove a "for all" statement, one counterexample is enough. Basics: proving and disprovingFind the range by checking every case
Take any . By trichotomy there are exactly three cases:
- If , then .
- If , then .
- If , then .
So every output is one of , and each of the three really occurs (for example , , ). Hence
The graph of the signum function. The left ray sits at height and the right ray at height ; the open dots at show that those rays do not include , whose value is the filled dot . The two green points show (not one-one). The dashed line meets no point of the graph (not onto). To show that misses some value, we need to know exactly which values it does take. Because the cases cover all real numbers, this list of three values is complete: no input can produce anything else. Without the case check we would only have examples, and examples cannot prove that a value is never reached.Proof by cases: if every possibility falls into one of the listed cases, a conclusion checked in each case holds for all . Basics: proving and disprovingNot onto: the value 2 is never reached
The codomain is , and . Is there an with ? By Step 3, is always , or , and none of these equals 2. So no real satisfies : the element 2 of the codomain is not the image of any element of the domain. Hence is not onto.
The same argument works for every real number other than , for example , or . The range is a tiny part of the codomain .
"Onto" says every element of the codomain is hit. To disprove it we pick one element and show it is never hit. Showing "never" needs a general reason, not trial and error, and Step 3 supplies it: the full list of possible outputs does not contain 2. This is also the textbook's Remark after Definition 6 in action: is onto exactly when its range equals the codomain, and here .Onto means range = codomain (Remark after Definition 6). To disprove onto, exhibit one codomain element with no preimage. Basics: one-one and ontoConclude
is not one-one (Step 2) and not onto (Step 4). So the signum function is neither one-one nor onto.
The two failures are independent and each needs its own reason: one is about inputs colliding, the other about outputs being missed. Note that changing the codomain to would make onto, but it would still not be one-one, because 1 and 2 would still collide.
The signum function is not one-one, because with . It is not onto, because its range is only , so a codomain element such as 2 is the image of no real number. Hence it is neither one-one nor onto, as required.
Evaluate at the 17 inputs (steps of 0.5). The 8 negative inputs all give , the input 0 gives , and the 8 positive inputs all give . Seventeen inputs produce just three distinct outputs, , so collisions are unavoidable, and the value 2 never appears.
- Reading the printed rule as "1 if ". The minus sign does not show in some PDF viewers; the signum function gives for negative inputs. (With "1" there the conclusion would be the same, but the function would not be the signum function.)
- Picking a counterexample for onto that is in the range. , and are all reached; choose something else, such as 2.
- Showing only examples for "not onto". Saying "I tried several and never got 2" is not a proof. The case check in Step 3 is what proves 2 is never reached.
- Putting the endpoint in the wrong piece on the graph. At the value is 0, so the rays at heights and must end in open dots.
- If a function on an infinite set takes only finitely many values, it cannot be one-one.
- To prove "not onto", first find the exact range by checking every case, then pick a codomain element outside it.
- One-one and onto are separate questions with separate reasons; answer both.
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| Each real number is positive, zero or negative, and only one of these (trichotomy) | Steps 1, 3 | Order properties of the real numbers |
| The signum function and its graph | Question, Step 3 | Class XI; recalled at the start of Section 1.3 |
| , , | Steps 2, 3 | Direct substitution into the signum rule |
| Definition of one-one (and of many-one) | Step 2 | Definition 5, Section 1.3 (Lesson: types of functions) |
| Definition of onto; onto ⇔ range = codomain | Step 4 | Definition 6 and the Remark after it, Section 1.3 |
| One counterexample disproves a "for all" statement | Steps 2, 4 | Logic of quantifiers |
| 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 →