How to Prove a Function Is Injective and Surjective
Some examples on proving/disproving a function is injective/surjective (CSCI 2824, Spring 2015)
This page contains some examples that should help you finish Assignment 6.
(See also Section 4.3 of the textbook)
Proving a function is injective
Recall that a function is injective/one-to-one if
.
Example 1: Disproving a function is injective (i.e., showing that a function is not injective)
Consider the function
.
(This function defines the Euclidean norm of points in .) Recall also that
.
Claim: is not injective.
Proof
Note that are distinct and
. Hence
is not injective. QED.
Example 2: Proving a function is injective
Consider the function
.
Claim: is injective.
Proof
-
Fix any
satisfying
.
-
By definition of
, we have
.
-
The equality of the two points in
means that their coordinates are the same, i.e.,
-
Multiplying equation (2) by 2 and adding to equation (1), we get
.
-
Then
, or equivalently,
.
-
On the other hand, multiplying equation (1) by 2 and adding to equation (2), we get
, or equivalently,
.
-
Therefore
.
-
This proves that
is injective. QED.
Proving a function is surjective
Recall that a function is surjectiveonto if
.
-
To prove that a function
is surjective, we proceed as follows:
-
To prove that a function
is not surjective, simply argue that some element of
cannot possibly be the output of the function
.
Example 3: disproving a function is surjective (i.e., showing that a function is not surjective)
Consider the function
.
Claim: is not surjective.
Example 4: disproving a function is surjective (i.e., showing that a function is not surjective)
Consider the absolute value function
.
Claim: is not surjective.
Proof
-
Note that for any
in the domain
,
must be nonnegative.
-
On the other hand, the codomain
includes negative numbers.
-
Hence
is not surjective.
Example 5: proving a function is surjective
Consider again the function
.
Claim: is injective.
Scrap work
-
Fix any
in the codomain
.
-
We want to find a point
in the domain satisfying
.
-
Note that
if and only if
.
-
This is equivalent to
and
.
-
We are going to express
in terms of
.
-
Note that the first equation implies
.
-
Substituting this into the second equation, we get
.
-
Rearranging to get
in terms of
and
, we get
.
-
Now we work on
. The second equation gives
.
-
Substituting into the first equation we get
.
-
Rearranging to get
in terms of
and
, we get
.
-
Hence the input we want is
.
Proof
-
Fix any
in the codomain
.
-
Consider
.
-
Note that
lies in the domain
and
-
This shows that
is surjective.
Finding the inverse
Once we show that a function is injective and surjective, it is easy to figure out the inverse of that function. The inverse is simply given by the relation you discovered between the output and the input when proving surjectiveness.
Only bijective functions have inverses!
Example 6
Consider the function
.
We claim (without proof) that this function is bijective. So what is the inverse of
?
-
Fix any
.
-
Consider the equation
and we are going to express
in terms of
.
-
Using the definition of
, we get
, which is equivalent to
.
-
Therefore the inverse of
is given by
.
Example 7
The function
that we consider in Examples 2 and 5 is bijective (injective and surjective). The inverse is given by
.
Note that this expression is what we found and used when showing is surjective.
How to Prove a Function Is Injective and Surjective
Source: https://home.cs.colorado.edu/~yuvo9296/courses/csci2824/sect19-functions-examples.html
0 Response to "How to Prove a Function Is Injective and Surjective"
Post a Comment