TIP: – One – One Function: – A function is said to be a one – one functions or an injection if different elements of A have different images in B.
So, is One – One function
⇒ f(a)≠f(b) for all
⇔ f(a) = f(b)
⇒ a = b for all
Onto Function: – A function is said to be a onto function or surjection if every element of A i.e, if f(A) = B or range of f is the co – domain of f.
So, is Surjection iff for each , there exists such that f(a) = b
Bijection Function: – A function is said to be a bijection function if it is one – one as well as onto function.
Now, f : R → R given by f(x) = 3 – 4x
Check for Injectivity:
Let x,y be elements belongs to R i.e such that
⇒ f(x) = f(y)
⇒ 3 – 4x = 3 – 4y
⇒ x = y
Hence, f is One – One function
Check for Surjectivity:
Let y be element belongs to R i.e be arbitrary, then
⇒ f(x) = y
⇒ 3 – 4x = y
Above value of x belongs to R
Therefore for each element in R (co – domain), there exists an element in domain R.
Hence, f is onto function
Thus, Bijective function
Rate this question :