Examples of Injective Functions
Translated by
ScribdTranslationsExamples of Injective Functions
Translated by
ScribdTranslationsInjective, surjective, and bijective functions - solved exercises
Another classification of functions is injective functions,
surjective and bijective, which provide us with information about the
behavior of the same.
Remember that in a function, we always have a set of departure.
(domain), a codomain (contradomain), and a range:
Injective function
A function is injective if every element of the target set
corresponds at most to one element of the starting set.
Another definition is as follows: a function f: A -> B is injective or one-to-one.
to one, if there do not exist 2 elements of A (target set) with a
same image. Let's look at some examples:
To determine if a function is injective, we need to analyze the
next condition:
Surjective function
A function is surjective if every element of the set of
arrival (contradominion) corresponds to at least one element of
starting set.
Another simpler definition is the following: a function is
The subjectivization of the range is equal to the set of arrival.
co-ownership. Let’s look at some examples:
To determine if a function is surjective, we need to
determine the range. Generally, the target set is given by
problem. If the range we have found is equal to the set of
arrival, then it is a surjective function.
Bijective function
A function 'f' is bijective if it is injective and surjective.
Another definition is as follows: a function is bijective if each
an element of the target set has exactly one element of the
starting set to which it corresponds.