Suppose we have two sets
and
We can define a function acting on the elements of
which sends those elements of
onto unique – needed so that f is a function, since a function cannot be one to many - elements of
If it is the case that for every element
of
there exists some
in
such that
then
is said to be a function from
onto
In this case
is said to be a surjective function or surjection.


Note that
does not need to be one to one to be surjective. We could take
and
for all
then
is onto![]()
The above functions are discrete, but we can define function that act on intervals.
![]()
is not onto
because there is no
for which![]()
If instead we define
as
![]()
then
is onto. We can always make a function onto some subset of
in this way because by definition, a function is onto it's image.