Exercise 1.2 · Q12 (MCQ): on
Let be defined as . Choose the correct answer.
(A) is one-one onto
(B) is many-one onto
(C) is one-one but not onto
(D) is neither one-one nor onto.
, so is one-one. For , , so is onto.
Answer: (A) is one-one onto
Want the reason behind every step, the basics and the checks?
Multiplying by 3 can be undone by dividing by 3, and dividing by 3 is always possible in . Undoing in one direction means equal outputs come from equal inputs (one-one); undoing in the other means every real comes from the real number (onto). The domain matters: on the number is always available, which would not be true on or .
- Given
- , with domain and codomain .
- To find
- Which of (A)–(D) correctly describes .
- Plan
- (1) Prove one-one for arbitrary inputs. (2) Prove onto by solving for an arbitrary real and checking. (3) Compare with each option and say why each wrong option fails.
Basics you need
is one-one if for all ; otherwise it is called many-one (Definition 5). To prove one-one, start from arbitrary . Basics: one-one and onto
is onto if for every there is with (Definition 6). To prove it, take an arbitrary , construct , and check is in the domain.
If , dividing both sides by gives . And for any real , is again a real number.
Each option makes two claims, one about one-one and one about onto. An option is correct only if both claims are true. Basics: proving and disproving
Solution
One-one: divide by 3
Let be any real numbers with . Then
So equal outputs always come from equal inputs: is one-one.
Because one-one is a claim about every pair of inputs, we use arbitrary rather than examples. Dividing by 3 is valid because . (If the function were , this step would fail, and indeed that function sends every input to 0.)One-one: (Definition 5). Division by a non-zero number (Basic 3).Onto: every real is
Take an arbitrary . Solving gives the candidate . This is a real number, so it lies in the domain , and
So every element of the codomain is an image: is onto.
The graph of (horizontal and vertical scales differ) is a straight line through the origin that extends without bound in both directions. Every horizontal line meets it exactly once: meets it only at . Exactly once means one-one and onto. For onto we must reach every real , so we start from an arbitrary one, solve for the candidate input, and then check both that it is in the domain and that it maps to . The domain check is where matters: if the domain were , as in Example 8 with , the candidate would often not be a natural number, and onto would fail.Onto: for an arbitrary in the codomain, find in the domain with (Definition 6). Basics: one-one and ontoExamine every option
We have shown: is one-one (Step 1) and onto (Step 2). Now test each option's two claims.
Option Claims Verdict (A) one-one, onto Correct. Both claims are exactly what Steps 1 and 2 proved. (B) many-one, onto Wrong. "Onto" is true, but "many-one" (not one-one) is false: Step 1 shows no two different inputs share an output. (C) one-one, not onto Wrong. "One-one" is true, but "not onto" is false: every is the image of . (D) not one-one, not onto Wrong. Both claims are false, by Steps 1 and 2. An option is correct only if both of its claims hold. (B) and (C) each contain one true claim, so they must be rejected by pointing to the false one. Only (A) agrees with both findings.Bijective = one-one and onto (Definition 7). Lesson: types of functions
The correct answer is (A): is one-one and onto, that is, bijective. One-one because gives ; onto because every real equals . (Textbook answer: A.)
Preimages: comes from , since ✓; comes from , since ✓. The inputs give the five different outputs , with no repeats ✓.
- Choosing (C) by thinking of or , where misses numbers like 1 and 2. Here the domain and codomain are , where is always available.
- Proving one-one with examples. Seeing that is not a proof; the argument must use arbitrary .
- Forgetting to check the preimage lies in the domain. On it does, but this is exactly the check that fails on .
- (and more generally ) with is a bijection from to .
- Whether a function is onto depends on the domain and codomain: is onto but not onto .
- Compare with Q11: fails both properties, passes both.
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| Dividing by ; for | Steps 1, 2 | Properties of real numbers |
| Definitions of one-one (many-one), onto, bijective | Steps 1–3 | Definitions 5, 6, 7, Section 1.3 (Lesson: types of functions) |
| Same method for on , and its failure on | Steps 1, 2 | Example 9 and Example 8, Section 1.3 |
| All numerical values | Check | Recomputed exactly (fractions) 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 →