The relation between two sets under a rule has two perspectives. We can look at the relation in the direction from domain set “A” to co-domain set “B”. This is the function view. But, we can also look this relation in opposite direction from “B” to “A”.
When we see function relation from domain “A” to co-domain “B”, then we find following possibilities :
When we see relation from co-domain “B” to domain “A”, then we find following possibilities :
Thus, we see that there are many ways in which a function - as a relation - can be unique and hence different. This gives rise to function types, which – as we shall see – are reflection of different possibilities that we have enumerated above.
As is evident, this function describes relation in which something can be related distinctly to something. The countries have unique and distinct capital. It is evident that a function, based on this relation, would be an injection.
In plain words, every “x” in “A” associates with a distinct “y” in “B”. We can yet put it like this : Every argument (x) is related to distinct value (y).
In order to represent the condition of injectivity symbolically, we can think of two different elements “x” and “y” in set “A”. Then, two images f(x) and f(y) in “B”, corresponding to these elements in “A” are not equal. We capture this intent in constructing condition for an injection as :
We can also interpret injection by asserting that if two images are equal, then it means that they are images of the same pre-image. The map diagram, corresponding to an injection, is shown in the figure. Note that elements in “A” are mapped to different elements in “B”.
| one-one function (injection) |
|---|
![]() |
Problem 1: Consider a function defined as :
Determine whether the function is an injection?
Solution : We consider two arbitrary elements of the domain set such that :
We have deliberately considered a contradictory supposition with respect to the requirement of injectivity. If this supposition yields x = y, then the given function is an injection; otherwise not. Here,
This is not an unique solution. Here, “x” is not uniquely equal to “y”. We conclude that given function is not an injection. As a matter of fact, we can infer a check on our conclusion as,
Thus, we see that two pre-images relate to one image, which is contradictory to the requirement of an injection.
The fact that function value is different for different arguments has an important bearing on the nature of injection plot. Consider two plots shown in the figure. In the plot shown on the left, a straight line parallel to x-axis intersects the plot only once. In the second plot, a line parallel to x-axis intersects the plot at two points for
| one-one function (injection) |
|---|
![]() |
It means that intersection plot intersects a line parallel to x-axis only once. This is possible only if the function is either (i) continuously increasing or (ii) continuously decreasing. Note the use of word “continuously”. An increasing plot, for example, if drops, then we can always find a line parallel ot x-axis, which intersects it at two points.
Hence, an injection graph is either an increasing or decreasing type. We can associate these characteristics with differential calculus. We can say that :
Either
or,
As a matter of fact the derivative can be equal to zero for certain values of "x" - not for an interval of "x". Thus, we can write the condition of increasing function : iif function is continuous and
Similarly, we can write the condition of decreasing function : iif function is continuous and
More than one pre-images of a function are related to same image.
The test of condition for many-one function is easy : if a function is not one-one, then it is many-one. Alternatively, we can check literally going by the definition – whether there exist such many-one relation. A map diagram showing the relation will reveal such instances of many-one relation.
| Many-one function |
|---|
![]() |
Modulus function is one such many-one function. The function yields same value for positive and negative arguments of same magnitude.
We should understand that a reverse function of the type “one to many” is barred from the very definition of function. The element of domain can be related to exactly one element in co-domain.
The definition of function puts the restriction on domain that every element in it is related. If we extend this restriction to co-domain also, then we get a function called “onto” or “surjection”.
| Onto function (surjection) |
|---|
![]() |
One of the implications of surjection is that all elements of co-domain is related. It reduces the co-domain to range set. In other words, co-domain is also the range of the function.
This equality of sets form one of the condition for testing a function to be surjection. Alternatively, we can check surjectivity by evaluating the rule of the function for the argument “x”. If the expression of “x” is valid for elements in co-domain, then the function is a surjection.
Problem 2 : Consider a function defined as :
Determine whether the function is a surjection?
Solution : We solve the rule for argument “x” as :
We see that expression on the right hand side is a valid real expression for all values of “y” in "R" i.e co-domain. Hence, given function is an onto function or surjection.
We have discussed in the beigining of this module that there is possibility that some of the elements of co-domains are not related. In that case, function is said to be into function.
One of the implications is that all elements of co-domain are not related to elements in domain set. In other words, range of the function is subset of the co-domain :
| Into function |
|---|
![]() |
We can check whether a given function is an into function or not by checking whether the function is an onto set or not. If the function is not an onto function, then it an into function. Alternatively, we can check the equality of co-domain and range set. If they are not equal, then the function is into function.
Problem 3 : Consider a function defined as :
Determine whether the function is an into function?
Solution : The rule of the function is :
The square of a real number is a positive number for all real number. Hence,
It means that images are only the right half of the real number i.e. from zero to infinity. But, the co-domain of the function is “R”. It means that left half of the co-domain i.e. from negative infinity to less than zero has no image in “A”. Therefore, the given function is an into function.
The bijection presents the most stringent condition for a function. Every element of both domain and co-domain is related to distinct element. This requirement is fulfilled when a function is both an injection and surjection.
| One – one onto function (Bijection) |
|---|
![]() |
The injection means that every element of domain is related to a distinct element in co-domain. On the other hand, surjection means that every element of co-domain is related, both distinctly and commonly. When conditions of injection and surjection are taken together, then it is also ensured that elements of co-domains are also related to distinct elements only.
Problem 4 : Consider a function defined as :
Determine domain (A) and co-domain(B) of the function so that it is a bijection.
Solution : For determining domain of the function, we inspect the given rule,
We observe that the given rational function is defined for all values of “x” except for x = 3. Hence, its domain is :
In order that the given function is a bijection, it should be both an injection and a surjection. For infectivity, we put :
Hence, function is an injection for the domain as determined above. Now, for surjection we solve the rule of the function for the argument (x),
This equation is valid for all real values of “y” except “1”. Hence, function is surjection for all real values of “y” except for “1”. Hence, co-domain for the function to be a surjection is :
Thus, we conclude that the given function is bijection for the domain and co-domain as determined above.