JEEMAIN.

GURU

Vidyamandir Classes Function - C

Functions [C]

INTRODUCTION Section - 1

1.1 Definition :
Function can be defined as :
To every element in domain, there exists unique image in co-domain.
Generally, we write f : A  B and is read as f maps from A to B and this correspondence is denoted by
y  f ( x ) such that A and B are two non-empty sets, i.e. to every element of A, there exists one and only
one elements in B.
Note : From definition, it follows that there may exist some elements in B which may not have any corresponding
elements in set A. But there should not be any x left (elements of A) for which there is no elements in set B.

i.e. Functions can’t be multi - valued ( A mappying that is multi -valued is called relation from A to B)

1.2 How to test whether relation is a function or Not ?

Graphically :
A relation f : A  B is a function or not can be checked by a graph of the relation. If it is possible to
draw a vertical line in domain which cuts the given curve at more than one point, then the given relation is
not a function and when this vertical line (i.e. parallel to Y- axis) cuts the curve at one and only one point,
then it is a function.

Self Study Course for IITJEE with Online Support Section 1 1

JEEMAIN.GURU

Function - C Vidyamandir Classes

Illustration - 1 Check whether the following relations are function or not ?

(i) y  x2 : R  R (ii) y  nx : R  R (iii) y  nx : [0,  )  R

(iv) y   nx : (0, )  R (v) y  nx : [1,  )  (0,  ) (vi) y  tan x : [0, ]  R

   
(vii) y = tanx : 0,    ,   R
 2 2 
SOLUTION :
2
(i) y  x ; R  R (ii) y  nx : R  R (iii) y  nx ; [0,  )  R

Illustration - 1

2 Section 1 Self Study Course for IITJEE with Online Support

JEEMAIN.GURU

Vidyamandir Classes Function - C

(iv) y   nx ; (0, )  R (v) y  nx : [1,  )  (0,  ) (vi) y  tan x ; [0, ]  R

    
(vii) y  tan x : 0,    ,   R
 2 2 

1.3 Important terms : Domain, Range, Co-Domain

If a function f is defined from a set A to set B, then for f : A  B , set A is called the Domain of function
f and set B is called the co-domain of function f. The set of all f - images of the elements of A is called
the range of function f .
Domain  All possible value of x for which f ( x ) exists.
Range  For all values of all possible values of f ( x).

Self Study Course for IITJEE with Online Support Section 1 3

JEEMAIN.GURU

Function - C Vidyamandir Classes

Note : Basically, Range is a sub-set of Codomain.

1.4 Number of function :

Let X and Y be two finite sets having ‘m’ and ‘n’ elements respectively. Then each elements of set X can be
associated to any one of n elements of set Y. So, total number of functions from set X to set Y is nm .

TYPE OF FUNCTIONS : Section - 2

2.1 One - One mapping (Injection) :

2.1.1 Definition
A function f : A  B is said to be one - one mappying or injection, if different element of set A having
different images in B. Thus, no two elements of set A can have same f image.

a  b  f (a)  f (b) for all a, b  A or f ( a)  f (b)  a  b for all a, b  A

4 Section 2 Self Study Course for IITJEE with Online Support

JEEMAIN.GURU

Vidyamandir Classes Function - C

2.1.2 Home to decide whether mapping is one – one (or Injective) or many – one ?
1. Theoretically / Analytically :
 Take two arbitrary elements x1 and x2 in the domain of f (i.e. in set A)
 Operate f ( x1 )  f ( x2 ).
 Solve f ( x1 )  f ( x2 ). If f ( x1 )  f ( x2 ) gives x1  x2 only, then f : A  B is a one – one function
otherwise many – one.
2. Graphically
 Draw the graph of function in Domain and Co – Domain.
 Draw horizontal lines. If horizontal line cuts the graph at atmost one points, then function is one -
one else many - one.
3. By calculus Approach
dy
 Find (First derivative of y.w.r.t. x)
dx
dy dy
 If  0 (Function is strictly increasing curve) or  0 (Function is strictly decreasing curve),
dx dx
then mapping is one - one (injective) else many – one.

Note : dy
 0 may also occur. But is should not exist in a interval.
dx

Self Study Course for IITJEE with Online Support Section 2 5

JEEMAIN.GURU

Function - C Vidyamandir Classes

Illustration - 2 Check whether the following function are one – one or many one ?
(i) y  n n n x : (e,  )  R (ii) y  5 x3  sin x : R  R
x
x3  3 x  2 4 e  e x
(iii) ye : (, 1)  (0, e ) (vi) y :R R
e x  e x

SOLUTION :
(i) y  n n n x : (e,  )  R
Draw graph of y  n n n x
As x  e  ne 1  n n e  0
n (n ne)  n ( 0)  y  
x  e is the vertical asymptote

y  0 occurs when n n x  1  x  ee

Method 2 : By Calculus approach

dy 1 1 1

dx n n x n x x
As x  (e, )  n x  (1, ) and n (n x)  (0, )

dy
Hence  0  Function is increasing (strictly)
dx
Hence mapping is injective.
(ii) y  5 x3  sin x : R  R
dy
 15 x 2  cos x
dx
dy
Lets check !  0 occurs for what value of x.
dx
15x2  cos x  0  15x2   cos x
From graph ; 15 x 2   cos x occurs  x R.
Hence mapping is injective.

6 Section 2 Self Study Course for IITJEE with Online Support

JEEMAIN.GURU

Vidyamandir Classes Function - C

3
(iii) y  e x 3 x  2 ;(, 1)  (0, e 4 )

dy 3 3
 (3 x 2  3) e x 3 x  2  3( x  1) ( x  1) e x 3 x  2  0 x  (, 1)
dx
Hence mapping is injective

x
e  e x
(iv) y ; RR
e x  e x

 e x  e  x 
 x ; x0  2 
 e  ex   2 x
; x  0
y   y  1  e 
 e x  e x   1 ; x  0 
 x x ; x  0  
e  e 

From graph, for all x  0, f ( x)  1

Hence many inputs give same output.
Hence mapping is many – one (not injective).

2.1.3 Number of one – one functions :

If A and B are two finite sets having m and n elements respectively, then number of one - one
functions from A to B is :

 n Cm  m ! ; n  m 
 
 0 ; n  m 

2.2 Onto mapping (surjection) :

2.2.1 Definition
If the function f : A  B is such that each
element of B is the f image of atleast one
elements in A i.e. every element of B is paired.
It is expressed as f (A) = B i.e. range of
f = co-domain of f.

Self Study Course for IITJEE with Online Support Section 2 7

JEEMAIN.GURU

Function - C Vidyamandir Classes

2.2.2 How to decide whether mapping is surjective (Onto) or Into ?

1. Theoretically / Analytically :
 Find range of the function (Not Easy !)
 If range = Co - domain, then mapping is surjective (onto) else Into.
2. Graphically
 Draw the graph of y  f ( x).
 If the vertical span of the graph is same as the co-domain, then mapping is onto else into.
3. Special Approach [Valid only for continuous functions with Co-domain  Real]
 If the function f : A  B is f : A(a, b)  R

such that lim f ( x )  C1 and lim f ( x)  C2

x a x b 
If {C1  ,and C2  } or {C1  , and C2  },

then range of function f is R.

Hence mapping is Onto else Into

Illustration - 3 Check whether the following functions are onto or into ?

(i) y  n n n x : (e, )  R (ii) y  5x3  sin x : R  R
3
(iii) y  e x 3 x  2 : (, 1)  (0, e4 )
SOLUTION :
(i) y  n n n x : (e, )  R
Graphically :
Range  R (from graph)
Codomain  R
Range = Codomain
 The given mapping is surjective
Special Approach :
 C1  C1   and  C2  C2    Range = R

 Range = Codomain
Hence mapping is surjective.

8 Section 2 Self Study Course for IITJEE with Online Support

JEEMAIN.GURU

Vidyamandir Classes Function - C

(ii) y  5 x3  sin x

lim (5x3  sin x)  ( )  [1,1]     and

x  oscillating

lim (5 x3  sin x)  ( )  [1,1]   

x  oscillating
 Range = CoDomain = R
Hence mapping is surjective.

3
(iii) y  e x 3 x  3 : (, 1)  (0, e 4 )
As we know that function is strictly increasing in (,  1) and is continuous, hence mapping will have range
for end values of domain. [Refer Illustration 2 (iii)]
3 x3  3 x  2
lim e x  3x  2  e( )  0 and lim e  e4
x  x 1

Hence, Range  (0, e4 )

 Range = CoDomain
Hence mapping is surjective.
2.2.3 Number of Onto functions :
If A and B are two sets, having m and n elements respectively such that 1  n  m, then number
of onto functions from A and B is :
n m  n C1 ( n  1) m  n C2 ( n  2) m  n C3 ( n  3) m ....

2.3 Bijective Mapping

2.3.1 Definiting
A function f : A  B is a bijection if it is one - one as well as onto, i.e.
f : A  B is a bijection if
(i) it is one – one mapping i.e. f ( x)  f ( y )  x  y  x, y  A
(ii) it is onto mapping i.e.  y  B, there exists atleast one x  A
such that f ( x)  y.
Clearly, f is a bijection since it is both injective as well as surjective.

Self Study Course for IITJEE with Online Support Section 2 7

JEEMAIN.GURU

Function - C Vidyamandir Classes

Illustration - 4 Check whether the following functions are bijective or not ?

(i) y   n  n  n x : ( e,  )  R (ii) y  5 x3  sin x : R  R
3
(iii) y  e x 3x  2 ; (, 1)  (0, e 4 )
SOLUTION :
1. y  n n n x : (e, )  R
f is a bijection since it is both one - one and onto. (Refer Illustration 2 (i) and Illustration 3 (i))
2. y  5 x3  sin x : R  R
f is a bijection since it is both one - one and onto. (Refer Illustration 2 (ii) and Illustration 3(ii))
3
3. y  e x 3 x  2 ; (,  1)  (0, e 4 )
f is a bijection since it is both one - one and onto. (Refer Illustration 2 (iii) and Illustration 3(iii))
2.3.2 Number of Bijective function :
If A and B are two finite sets and f : A  B is a bijection, then A and B have the same number of
elements. If A has n elements, then the number of bijection from A to B is the total number of
arrangements of n items taken all at a time i.e. n!

INVERSE OF A FUNCTION : Section - 3

3.1 Definition
Let f : A  B be a one - one and onto function (i.e. Bijective Mapping), then there exists a unique
function g : B  A such that f ( x )  y  g ( y )  x ; x  A and y  B.
Then g is said to be inverse of f
Thus, g  f 1 : B  A
3.2 Type of mapping and existence of inverse
Case I : Many - One and Into
Points to Note :
(i) f : A  B is a function [all domain elements
have exactly one image]
(ii) f : A  B is a many - one function as for the
image elements {1} there are two pre - images
in A (domain)
(iii) f : A  B is an into mapping as all the ele-
ments in co-domain do not have pre-images.

10 Section 3 Self Study Course for IITJEE with Online Support

JEEMAIN.GURU

Vidyamandir Classes Function - C

But g : A  B is itself not a function as {1} [as an input] has two outputs a and b which is not possible.
Also {2} and {4} do not have any image in A.
So. no inverse exists in this case.
Case II : Many – One and Onto

Points to Note :
(i) f : A  B is an function [all domain elements have exactly one image]
(ii) f : A  B is a many - one function as for the image elements {1}
there are two pre-images {a, b} in A [domain]
(iii) f : A  B is an Onto mapping as all the elements in codomain are
paired [i.e. Range = Codomain]

But g : B  A is itself not a function as {1} [as an input] has two outputs a and b which is not possible.
Hence, no inverse exists in this case.
Case III : One - One and Into
Points to Note :
(i) f : A  B is a function [all domain elements have exactly one image]
(ii) f : A  B is a one - one function as for each image elements there is
exactly one pre-image in A [Domain]
(iii) f : A  B is an Into mapping as all the elements in Codomain do not
have pre-images.
But g : B  A is itself not a function as {5} does not have any image in A.
so, no inverse exists in this case.
Case IV : One - One and Onto
Points to Note :
(i) f : A  B is a function [all domain elements have exactly image]
(ii) f : A  B is one - one function as for each image elements therefore is
exactly one pre-image in A [Domain]
(iii) f : A  B is an onto mapping as all the elements in Co-domain are
paired [i.e. Range = Codomain]

Self Study Course for IITJEE with Online Support Section 3 11

JEEMAIN.GURU

Function - C Vidyamandir Classes

Now g : B  A is a function [as all domain elements in B have exactly one image in A]

Also, g is one - one mapping as all elements in A have exactly one pre - image in B. Also g is onto mapp-
ing as all the elements of set A have pre - images in B [i.e. Range = Codomain]
Hence, g is one - one and onto such that we say g is inverse of f and f is inverse of g.

To conclude, we have :

3.3 Steps to find the inverse of a function :

Let y  f ( x) : A  B . . . . . . (i)

y  f 1 ( x ) : B  A . . . . . . (ii)
1. Replace x by y and y by x. Also interchange the role of domain and Co-domain.
2. If (ii) i.e. y  f 1 ( x) : B  A is a function, then inverse exists else inverse does not exist.
3. If possible, express y as a function of x.

1
Note : (i) If you want only the graph of f ( x), do not check existence; simply x  y and y  x.
(ii) If y  f ( x) : A  B is injective (one - one) and surjective (Onto) i.e. bijective, then inverse will
exist. [see section 3, 2 for reference]

Illustration - 5 Find the inverse of the following functions (if exist)

(i) y  2x 1 : R  R (ii) y  n n n x : (e, )  R

3
(iii) y  5 x3  sin x : R  R (iv) y  ex 3x 2 : (, 1)  (0, e4 )

SOLUTION :
(i) y  2 x  1: R  R

x  2 y 1

12 Section 3 Self Study Course for IITJEE with Online Support

JEEMAIN.GURU

Vidyamandir Classes Function - C

x 1 x 1
y is a function. Hence y  represents the inverse of y  2 x  1.
2 2
Another Approach :
As the function y  2 x  1 is bijective (Check yourself) ;
hence inverse exists and it is obtained by
replacing x  y and y  x i.e. x  2 y  1
x 1
 y :RR
2
(ii) y  n n nx : (e, )  R
As y  n n nx : (e,  )  R is a bijection (Refer Illustration 4 (i)) ; hence inverse exists.
Replace x by y and y by x
ex
x  n n ny  y  ee : R  ( e,  )

(iii) y  5 x3  sin x : R  R
As mapping is a bijection (Refer Illustration 4 (ii)) ; hence inverse exists.
Replace x by y and y by x.
x  5 y 3  sin y : R  R
But we cannot express above as y in terms of x
3
(iv) y  e x 3 y  2 : ( , 1)  (0, e4 )
As mapping is a bijection (Refer Illustraction 4 (iii)) ; hence inverse exists.
Replace x by y and y by x.
3
x  e y 3 y  2 : (0, e4 )  ( , 1)  y 3  3 y  2  nx : (0, e4 )  ( , 1)

x 1
Note : As y  2 x  1 and y  are inverse of each other, lets plots their graph.
2
x 1
See carefully, y  2 x  1and y  graph intersect on
2
y  x line. This should be so as y  f ( x ) and y  f 1 ( x)
occur when we replace x  y and y  x.

If both graphs, have to intersects, they will have same x values and same y values of points intersection.

Self Study Course for IITJEE with Online Support Section 3 13

JEEMAIN.GURU

Function - C Vidyamandir Classes

Illustration - 6 Find the area enclosed by y  x  sin x and the inverse of y  x  sin x  x  [0, 2]
SOLUTION :
Draw the graph of y  x  sin x first.
Graph of y  x  sin x is same as that of y  sin x except
the loops will be on y  x line (now not on X-axis)
For all x = 0, , 2 ..., sin x  0, but y  x  sin x will be
, 2 ... Inv. of y  x  sin x is the reflection in y  x line.
 
Area  4 {[ x  sin x ]  x}dx  4  sin xdx  8sq.units
0 0

ADD TO KNOWLEDGE : Section - 4

xodd  xnew cos   ynew sin

yodd  xnew sin   ynew cos

Note : You can also get this result by the use of vectors.

 xold   cos   sin    xnew 

    
 yold  sin  cos    ynew 

 xnew   cos  sin    xold 

or    
 ynew    sin  cos    yold 

 cos  sin  
R  matrix rotates the system anti clockwise if   0 and clockwise if   0.
  sin  cos  

Reflection matrix :

 xnew  1 0   xold  1 0
X  axis :         reflects any system in X – axis
 ynew  0  1  yold   0  1

14 Section 3 Self Study Course for IITJEE with Online Support

JEEMAIN.GURU

Vidyamandir Classes Function - C

 xnew   1 0  xold   1 0
Y- axis :      

 ynew   0 1   yold   0 1  reflects any system in Y - axis

 xnew  1 0   xold  1 0 
x  y line:         reflects any system in y = x line.
 ynew   0 1  yold   0 1

NOW ATTEMPT OBJECTIVE WORKSHEET BEFORE PROCEEDING AHEAD IN THIS EBOOK

THINGS TO REMEMBER

1. Introduction :
1.1 Function
Function can be defined as :
To every element in domain, there exists unique image in co-domain.
Generally, we write f : A  B and is read as f maps from A to B and this correspondence is
denoted by y  f ( x ) such that A and B are two non - empty sets. i.e. to every element of A, there
exists one and only one elements in B.
1.2 How to test whether relation is a function or Not ?
A relation f : A  B is a function or not can be checked by a graph of the relation. If it is possible to
draw a vertical line in domain which cuts the given curve at more than one point, then the given
relation is not a function and when this vertical line (i.e. parallel to Y-axis) cuts the curve at one and
only one point, then it is a function.
1.3 Important terms : Domain, Range, Co-Domain
If a function f is defined from a set A to set B, then for f : A  B set A is called the Doman of
function f and set B is called the co-domain of function f. The set of all f- images of the elements of
A is called the range of function f.
Domain  All possible value of x for which f (x) exists.
Range  For all values of x, all possible values of f (x).

1.4 Number of function :

Let X and Y be two finite sets having ‘m’ and ‘n’ elements respectively. Then each element of set X
can be associated to any one of n elements of set Y. So, total number of functions from X to set Y is
nm .

Self Study Course for IITJEE with Online Support Things to Remember 15
JEEMAIN.GURU

Function - C Vidyamandir Classes

2. Type of functions

2.1 One - One mapping (injection) :

2.1.1 Definition
A function f : A  B is said to be one - one mapping or injection, if different elements of set A
having different images in B. Thus, no two elements of set A can have same f image.

a  b  f ( a )  f (b) for all a, b  A or f ( a )  f ( b)  a  b for all a, b  A

2.1.2 How to decide whether mapping is one - one (or Injective) or many - one ?
1. Theoretically / Analytically :
 Take two arbitrary elements, x1 and x2 in the domain of f (i.e. in set A)
 Operate f ( x1 )  f ( x2 ).
 Solve f ( x1 )  f ( x2 ). If f ( x1 )  f ( x2 ) gives x1  x2 only, then f : A  B is a one - one
function otherwise many - one.
2. Graphically

 Draw the graph of function in Domain and Co - Domain.

 Draw horizontal lines. If horizontal line cuts the graph at atmost one point, then function is one - one
else many - one.
3. By calculus Approach

dy
 Find (First derivative of y.w.r.t. x)
dx
dy dy
 If  0 (Function is strictly increasing curve) or  0 (Function is strictly decreasing curve),
dx dx
then mapping is one - one (injective) else many - one.

2.1.3. Number of one - one functions :

If A and B are two finite sets having m and n elements respectively. then number of one - one
functions from A to B is :

 n Cm  m ! ; n  m 
 
 0 ; n  m 

16 Things to Remember Self Study Course for IITJEE with Online Support
JEEMAIN.GURU

Vidyamandir Classes Function - C

2.2 Onto mapping (surjection) :

2.2.1 Definition

If the function f : A  B is such that each element of B is the f image of atleast one element in
A i.e. every element of B is paired. It is expressed as f ( A)  B i.e. range of f = co-domain of f.

2.2.2 How to decide whether mapping is surjective (Onto) or Into ?

1. Theoretically / Analytically :

 Find range of the function (Not Easy !)

 If range = Co - domain, then mapping is surjective (onto) else Into.
2. Graphically
 Draw the graph of y  f ( x )
 If the vertical spam of the graph is same as the co-domain, then mapping is Onto else Into.
3. Special Approach [Valid only for continuous functions with Co-domain  Real]
 If the function f : A  B is f : A (a, b)  R

such that lim f ( x)  C1 and lim f ( x )  C2

xa x b
If {C1   and C2  } or {C1   and C2   },
then range of function f is R.
Hence mapping is onto else Into

2.2.3 Number of Onto function :

If A and B are two sets, having m and n elements respectively such that 1  n  m, then
number of onto functions from A to B is :
n n
n m  C1 ( n  1) m  C2 ( n  2)m  nC3 ( n  3) m . . . .
2.3 Bijective Mapping
2.3.1 Definition
A function f : A  B is a bijection if it is one - one as well as onto. i.e.
f : A  B is a bijection if
(i) it is one - one mapping i.e. f ( x )  f ( y )  x  y  x, y  A
(ii) it is onto mapping i.e.  y  B, there exists atleast one x  A such that f ( x)  y.

Self Study Course for IITJEE with Online Support Things to Remember 17
JEEMAIN.GURU

Function - C Vidyamandir Classes

3. Inverse of a function
3.1 Definition
Let f : A  B be a one - one and onto function (i.e. Bijective Mapping), then there exists a unique
function g : B  A such that f ( x)  y  g ( y )  x ;  x  A and y  B.
Then g is said to be inverse of f
Thus, g  f 1 : B  A
3.2 Type of mapping and existence of inverse

3.3 Steps to find the inverse of a function :

Let y  f ( x ) : A  B . . . . . (i)

y  f 1 ( x ) : B  A . . . . . (ii)
1. Replace x by y and y by x. Also interchange the role of domain and Co-domin.
2. If (ii) i.e. y  f 1 ( x) : B  A is a function, then inverse exists else inverse does not exist.
3. If possible, express y as a function of x.

18 Things to Remember Self Study Course for IITJEE with Online Support
JEEMAIN.GURU

Vidyamandir Classes

My Chapter Notes

Self Study Course for IITJEE with Online Support

JEEMAIN.GURU

Vidyamandir Classes

Illustration - 1

Self Study Course for IITJEE with Online Support

JEEMAIN.GURU

Vidyamandir Classes

Self Study Course for IITJEE with Online Support

JEEMAIN.GURU

Vidyamandir Classes

Self Study Course for IITJEE with Online Support