Understanding Injective, Surjective, and Bijective Functions
Translated by
ScribdTranslationsUnderstanding Injective, Surjective, and Bijective Functions
Translated by
ScribdTranslationsInjective function
A function f with domain D = Dom(f) is injective when distinct elements of D map to different elements.
correspond to different images:
If x1, x2∈ D : x1not equal to x2⇒ f(x1) ≠ f(x2)
Two distinct elements of the domain D cannot have the same image.
Example of an injective function
a) Let's see if the function f(x) = 4x - 1 is injective:
If the images are the same:
f(x1) = f(x2) ⇒ 4x1-1 = 4x21 ⇒ 4x1= 4x2⇒ x1= x2
the originals are the same.
Therefore, the function f is injective.
Criterion of the horizontal line
a function is injective if no horizontal line intersects its graph at more than one point
point.
b) Let's see if g(x) = x2is injective:
If we draw horizontal lines on the graph,
you cut it in more than one point.
For example: if we draw the line y = 4:
it cuts the function at the points: x = 2, x = -2
g(2) = 4 , g(-2) = 4
Therefore, two distinct elements, 2 and -2, have the same image.
The function g is not injective.
c) Let's see if h(x) = sin x is injective:
If we draw horizontal lines on the graph,
This shortens it in more than one point.
For example: if we draw the line y = 1:
this cuts the function at the points: x = π/2, -3π/2
h(π/2) = 1 , h(-3π/2) = 1
Therefore, two distinct elements, π/2 and -3π/2,
they have the same image.
The function h is not injective.
Surjective function
A function f:X→Y is a surjective function if:
Im(f) = Y
This means that every element and∈ Yes, the image of at least one element x.∈ A .
That is, the image of f coincides with the final set.
Example of a surjective function
a) Let's see if the function f:R→R, where f(x) = x2+ 1, it is
subjective
In this case:
The initial set of f is R.
The final set of f is: R
The image of f is [1, ∞), that is: Im(f) = [1, ∞)
The image of f and the final set of f do not match:
See the striped part of the OY axis. It does not match everything.
Then the function f is not surjective.
b) Let's see if the function g:R→R, where g(x) = x3+ 3, is
subjective
In this case:
The initial set of g is R.
The final set of g is: R
The image of g is also R, that is: Im(g) = R
The image of g and the final set of g coincide in R:
See the striped part of the OY axis. It matches everything.
Then the function g is indeed surjective.
Bijective function
A function f is bijective if it is both injective and surjective.
Example of a bijective function
a) Let's see if the function f:R→R, where f(x) = 3x - 2, is bijective.
Let's first see if it is injective,
If the images are the same:
f(x1) = f(x2) ⇒ 3x1-2 = 3x2- 2⇒ 3x1= 3x2⇒ x1= x2
, the originals are the same.
Therefore, the function f is injective.
Let's see now if it is surjective:
The initial set of f is R.
The final set of f is: R
The image of f is also R, that is: Im(f) = R
The image of f and the final set of f coincide: R:
See the striped part of the OY axis. It matches everything.
Then the function f is surjective.
Therefore, the function f is bijective.
b) Let's see if the function g:R→R, where g(x) = x2, it is bijective.
The function f is an even function, that is: f(x) = f(-x).
Therefore, it is not injective, since two distinct values, x and -x, have the same images.
Then f cannot be bijective.
c) Given the following function h, we will see if it is bijective.
Let's first see if it is injective,
If the images are the same:
, the originals are the same.
Therefore, the function h is injective.
Let's see now if it is surjective:
The initial set is: R
The final set is: R
We calculate the route:
Im(f) = [0 , ∞)
[0, ∞) ≠ R:
See the striped part of the Y axis. It does not match everything.