Scribd
Upload
4 views19 pages

Understanding Bijective Functions

The document discusses bijective functions, defining them as functions that are both injective and surjective. It explains the conditions under which a function can be redefined to achieve bijectivity by analyzing its injectivity and surjectivity based on its domain and codomain. Examples are provided to illustrate how to determine and redefine functions to meet bijective criteria.

Translated by

ScribdTranslations
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views19 pages

Understanding Bijective Functions

The document discusses bijective functions, defining them as functions that are both injective and surjective. It explains the conditions under which a function can be redefined to achieve bijectivity by analyzing its injectivity and surjectivity based on its domain and codomain. Examples are provided to illustrate how to determine and redefine functions to meet bijective criteria.

Translated by

ScribdTranslations
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

UNIVERSITY OF COSTA RICA

MA0125
In 2013
PROF. JASONUREÑA

Bijective Functions
Bijection Function

That is to say, if each element of the codomain


(scope=codomain) has a unique
preimage
A bijective function is one that
It is injective and surjective at the same time.

When in a function it happens that the scope is


equal to the codomain, it is said that the function is
subjective.

Then if in a function each image has a


unique preimage, the function is said to be injective
(this only happens when a function is increasing or
decreasing).
FORMAL DEFINITIONS
EXAMPLES:
REDEFINE THE FUNCTIONS TO BE
BIJECTIVES.
We know that the quadratic function is increasing and
decreciente en todo su dominio, con lo que NO es
injective and must be redefined.

On the other hand, we are unaware of the scope and codomain.


of the function, in this way these should be defined
aspects also to perform the function
subjective.
ANALYSIS

Since the function is not injective,


just determine an interval
where the function only grows or
decrease.
These intervals can be
and the other
In this way, the function f with
any of these domains is
injective.

Regarding surjectivity, it is sufficient to determine the domain for any


selected domain, in the case of the first domain the scope
corresponding is in the case of the second domain the scope is

From the above, two bijective functions can be formed:


We know that through the graph of the radical function,
the function is monotonic, therefore it is injective.

On the other hand, it only remains to determine the scope.


corresponding to the domain where the function is
monotonous.
ANALYSIS

The domain of the function is

Now we just need to determine the scope.


corresponding to that domain.
The scope in this case is

Based on the previous data, we can define a function.


bijective
EXAMPLES:
DETERMINE IF THE SERVICES PROVIDED
INJECTIVES, OVER-SUBJECTIVE OR BIJECTIVE.
ANALYZE THE CHARACTERISTICS TO MAKE THEM
Injectives or surjectives.
In the domain of the function, it grows and decreases,
with what is not injective. (However, it can be
choose an interval where it only increases or decreases.
The codomain is also not the same as the range.
Therefore, f is neither injective nor surjective.
Injectivity

For example:
We could say that an interval where the function increases is
With what is injective the function

Also
We could say that an interval where the function decreases is
What makes the function injective
SUBJECTIVITY

It is appreciated that for all the


given domain, the
codomain
it's not the same as the field
What is it?

With what the function whose codomain is equal to


the scope is surjective
BIJECTIVITY

For a function to be Bijective,


this must be injecting
subjective at the same time, with which the
function should be redefined to a
domain where the function is
injective and consequently a
codomain (which is equal to its scope)
for the new domain.

For example: For the domains of the previous injectivity.


We know that the function is injective in the
in this domain,
scope is Thus a bijective function is

We know that the function is injective


in this in
domain, the
scope is Thus another bijective function is
In the domain of the function, it is monotonic (it is a
logarithm), which is injective.

Now, on the other hand, it is necessary to analyze whether the scope


(with respect to the given domain) is equal to
codomain to determine if the function is surjective.
SUBJECTIVITY

It is appreciated that for everything the

given domain , the


scope is , with the
that is not the same as the
codomain, in this way
the function is not
subjective.
Para que la función sea
subjective just change
the codomain by the range
according to the given domain.

Thus the function


it is surjective.
Furthermore, from the beginning, the function in the given domain is injective and
redefinition to be surjective as well, therefore it is obtained
thus a bijective function.
From the beginning, we know that the value function
absolute is not monotonic in the domain R, but there are
To analyze it in the given domain to know if it is or
not injective.

Then, we must analyze what the scope is of the


function in the given domain, to know if it is or
not surjective.
ANALYSIS

We were able to appreciate that


indeed the function is not
injective in the given domain,
because it is monotonous.

On the other hand, the scope of the


function in the given domain is
and is equal to the codomain, so
both the function yes is
subjective.

Now, knowing that the function is surjective, if we want to make it


injective preserving the codomain (in this case the same as the range),
just restrict the domain to an interval, where the scope does not
modify the function to be monotonic.
An interval like this is

Thus the function it is also


injective, also concluding with a bijective function.

You might also like