Section 7.2 One-to-One, Onto, Inverse Functions
In this section we will look at specific properties of functions. We will learn how to prove a function is one-to-one and/or onto its codomain. These properies are important as they are the exact properties we need in order for a function to have an inverse function.
Although it is easier to prove a function is one-to-one using the definition, the contrapositive can be helpful for deciding if a function is one-to-one.
Proving a Function is One-to-One.
Example 7.2.2. Arrow Diagram: Not One-to-One.
Example 7.2.4. Proving One-to-One.
Let be given by Prove is one-to-one.
Proof.
Assume Then
which is what we wanted to show.
Example 7.2.5. Disproving One-to-One.
Let be given by Disprove is one-to-one.
We need a counterexample with and Let
Then and So but
Definition 7.2.6.
Although we need the definition for onto to be able to write a proof, the concept of onto is easier to understand without the definition. Basically, we need every to get mapped to by some We can also think about onto in terms of sets. A function is onto if is the range of
Proving a Function is Onto.
- Let
be a general element of You should not be using any information about the function at this point. - Find
such that Finding may involve scratchwork. - In your proof, state
show and show
Example 7.2.7. Arrow Diagram: Not Onto.
Example 7.2.9. Proving Onto.
Let be given by Prove is onto
Proof.
Let
[Scratchwork: we want to find so that So we want or ]
Let Then since Furthermore,
which is what we wanted to show.
Example 7.2.10. Disproving Onto.
Let be given by Prove is not onto
Let
We saw in the previous example But is not necessarily in So for our counterexample, let Then we would need
Hence no element in will map to Therefore, is not onto
Example 7.2.11. Prove or Disprove Onto.
Let be given by Prove or disprove is onto
Let Then if is onto we could find with
But if then or We know there are no real solutions to this equation. Hence no element in will map to Therefore, is not onto
Activity 7.2.1.
(a)
Prove or disprove is one-to-one.
(b)
Activity 7.2.2.
(a)
Prove or disprove is one-to-one.
(b)
Activity 7.2.3.
(a)
Prove or disprove is one-to-one.
(b)
Activity 7.2.4.
(a)
Prove or disprove is one-to-one.
(b)
Activity 7.2.5.
(a)
Prove or disprove is one-to-one.
(b)
Definition 7.2.12.
We showed in the above examples that given by is one-to-one and onto Thus, it is an example of a one-to-one correspondence.
Theorem 7.2.13.
Example 7.2.14. Inverse Function.
Since given by is one-to-one and onto, it has an inverse. We can find the inverse as we did in calculus.
Let solve for
We get Thus
Theorem 7.2.15.
Proof.
Show is one-to-one: assume Then for some Thus, and Since is a function,
Show is onto Let Then there exists such that since is a function from Now, Therefore, there exists such that
Activity 7.2.6.
Which of the functions from the activities, Activity 7.2.1, Activity 7.2.2, Activity 7.2.3, Activity 7.2.4 and Activity 7.2.5 are bijections? If a function is a bijection, find its inverse function. Is the inverse one-to-one and onto?
Reading Questions Check Your Understanding
1.
True.
False.
True or false: is one-to-one.
2.
True.
False.
3.
True.
False.
True or false: is one-to-one.
4.
True.
False.
5.
True.
False.
True or false: is one-to-one.
6.
True.
False.
7.
True.
False.
True or false: is one-to-one.
8.
True.
False.
9.
True.
False.
True or false: is one-to-one.
10.
True.
False.
11.
True.
False.
True or false: is one-to-one.
12.
True.
False.
Exercises Exercises
1.
All but two of the following are correct ways to express the fact that a function is onto. Find the two that are incorrect.
is onto if and only if every element in its codomain is the image of some element in its domain. is onto if and only if every element in its domain has a corresponding image in its codomain. is onto if and only if such that is onto if and only if such that is onto if and only if the range of is the same as the codomain of
2.
-
Define
by specifying thatIs one-to-one? Is onto? Explain your answers. -
Define
by specifying thatIs one-to-one? Is onto? Explain your answers.
3.
- Define a function
that is one-to-one but not onto. - Define a function
that is onto but not one-to-one. - Define a function
that is neither one-to-one nor onto. - Define a function
that is one-to-one and onto, but is not the identity function.
4.
- Prove or disprove
is one-to-one. - Prove or disprove
is onto
5.
- Prove or disprove
is one-to-one. - Prove or disprove
is onto
6.
Define by
- Prove or disprove
is one-to-one. - Prove or disprove
is onto
7.
Define by
- Prove or disprove
is one-to-one. - Prove or disprove
is onto
8.
Define by
- Prove or disprove
is one-to-one. - Prove or disprove
is onto
You have attempted 1 of 13 activities on this page.