Function
Function
FUNCTIONS
General :
The concept of function is of fundamental importance in almost all branches of
Mathematics. In fact they are the major toos to describe the real world in mathematical
motions. As a matter of fact functions are some special type of relations. A relation R
from a set A to a set B is said to be a function if every element of A has a unique relation
in B. Thus under a function from A to B, each element of A is associated to one and
only one element in B. Now we give a rigorous definition of function as follows.
1. GENERAL DEFINITION :
Definition-1 : Let A and B be two sets and let there exist a rule or manner or
correspondence f which associates to each element of A, a unique element in B.
Then f is called a function or mapping from A to B. It is denoted by the symbol
f
f : A B or A B
which reads f is a function from A to B or f maps A to B,
If an element a A is associated with an element b B then b is called the f image of
a or image of a under f or the value of the function f at a. Also a is called the
pre-image of b or argument of b under the function f. We write it as
b = f (a) hr f : a b or f : (a, b)
1
cos x 1 5
(viii) f(x) = 2 ; 6 , 3 3 , 6 = S (say) [T/S]
6 35x 6x 2
1 5
cos x
(ix) f(x) = 2 ; S 2K + < x < 2K +
3 3
6 35x 6x 2
K +1, +2, +3 ...........
x
dt
(x) f(x) =
0 x2 t2 x
[Ans. Domain is R {0} ; Range is ln ( 2 1), ln ( 2 1) ; ln t x 2 t 2
0
0
]
dt 1
Note : f (0) = | t | , as is not defined at x = 0 hence f (0) is not defined.
0 |t|
ln( 2 1)if x 0
x 2| x|
= ln = not defined at x 0
| x|
ln ( 2 1)if x 0
(x) f(x) = cot1 log 4 (5x2 8x + 4) = , fig. (x)
5
4
3
or cot1 log 5 (5x2 8x + 4) = 0,
4
4
(xi) f(x) = log 2 (2 log 2 (16 sin 2 x 1)) ; (, 1] (Asking)
1 1
Note that f is even and decreasing. Also < sin x < .
4 4
x2 x 1 2(x 2 1) 1
(xii) f(x) = 2 ; f (x)= 2 2 = f(1) = ; f(1) = 3
x x 1 (x x 1) 3
1
D : x R, Range 3 , 3 fig (xii)
ax b
[Note: Graph of f (x) = is always monotonic. ]
cx d
x
(xiii) f(x) = [Range : (, 0) U [e, )] fig (xiii)
nx
F 7 I
[Ans. range : GH , JK ; Domain is (1,1) {0} ]
4 8
[Hint: Domain of function is (1, 1) {0}. because x [x] = 0 for integral value of x, hence
middle term will not be defined.
Also [{f}] = 0, whenever f is meaningful.
1 1 1
value of f (x) = sin1 x2 + tan1 (1 + 2 x2). cot x tan
x
Function is continuous and is even. when x 0
Least value of the function will occur when x 0 and is
4
3 7
maximum value = Lim f ( x) = sin1 1 + tan1 (1 + 2 ) = + =
x1
2 8 8
7
Range of f (x) is 4 , 8 ]
2x
(xv) f(x) = tan1 ; range = 4 , 4
1 x2
Examples on Domain & Range
1
(i) f(x) = ln x ; Domain : (0, 1) U (1, ) ; Range : R {0}
(ii) f(x) = sin1 (ex) D : x < 0; R : 0, 2
1
(iii) f(x) = D : x R; R : [1, 2]
sin x cos 4 x
4
sin x cos x 3 2
(iv) f(x) = log2 D: x R ; R : [1, 2]
2
5
(v) f(x) = logcosec x 1(2 [sin x][sin x]2) D : x , ; 0 < x < ; R = ()
6 6
( x 2)(x 1) 2 (2 x 1)
(vi) f(x) = x ( x 1) ; f(x) = [ x( x 1)]2
x 2 5x 4 ( x 4) ( x 1)
(vii) f(x) = 2 = ( x 3) ( x 1)
x 2x 3
3 7
[Ans: (vii) D = R {1, 3}; Range = R ,1 ; f (x) = ]
4 (x 3) 2
1
= logex ; g(x) = log e (N.I.)
x
OR
Note :
(i) A continuous function which is always increasing or decreasing in whole domain, then
f(x) is oneone.
(ii) If any line parallel to xaxis cuts the graph of the function atmost at one point, then the
function is oneone.
OR
Note :
(i) Any continuous function which has atleast one local maximum or local minimum, then
f(x) is manyone . In other words, if a line parallel to xaxis cuts the graph of the
function atleast at two points, then f is manyone .
(ii) If a function is oneone, it cannot be manyone and vice versa.
One One + Many One = Total number of mappings.
Onto function (Surjective mapping) :
If the function f : A B is such that each element in B (codomain) is the f image of
atleast one element in A, then we say that f is a function of A 'onto' B. Thus
f : A B is surjective iff b B, some a A such that f (a) = b.
Diagramatically surjective mapping can be shown as
OR
OR
Note that : If a function is onto, it cannot be into and vice versa . A polynomial of
degree even define from R R will always be into & a polynomial of degree odd
defined from R R will always be onto.
Thus a function can be one of these four types :
Note :
(i) If f is both injective & surjective, then it is called a Bijective mapping. The bijective
functions are also named as invertible, non singular or biuniform functions.
(ii) If a set A contains n distinct elements then the number of different functions defined
from A A is nn & out of it n ! are one one.
6. GENERAL DEFINTION :
(a) Identity function :
The function f : A A defined by f(x) = x x A is called the identity of A and is
denoted by IA . It is easy to observe that identity function defined on R is a bijection.
(b) Constant function :
A function f : A B is said to be a constant function if every element of A has the
same f image in B . Thus f : A B ; f(x) = c , x A , c B is a constant
function. Note that the range of a constant function is a singleton and a constant
function may be oneone or manyone, onto or into .
Examples on classification
1.(a) f (x) = x3 2x2 + 5x + 3 is one-one-onto (as f ' (x) > 0)
(b) f : R R f(x) = 2x3 6x2 18x + 17
many one onto function
2. f : R R f(x) = 2x + |sin x| f is continuous
note that f (x) > 0 V x R
x ; y and x ; y
& f(0) = 0 oneone onto bijective
0 if x 0
3.(a) f : R R f(x) = 2|x| 2x is / e|x| ex = x x
e e if x 0
h:Q R h(x) = ex
(hog)of = ho(gof) = e2x
(iii) The composite of two bijections is a bijection i.e. if f and g are two bijections such
that gof is defined, then gof is also a bijection.
Proof: Let f : A B and g : B C be two bijections. Then gof exists such that
gof : A C
We have to prove that gof is one-one and onto.
One-one : Let a1, a2 A such that (gof)(a1) = (gof)(a2), then
(gof) (a1) = (gof) (a2) g [f (a1)] = g [ f (a2)]
f (a1) = f (a2) [ g is one-one]
a 1 = a2 [ f is one-one]
gof is also one-one function.
Onto : Let c C, then
c C b B s.t. g (b) = c [ g is onto]
and b B a A s.t. f (a) = b [ f is onto]
Therefore, we see that
c C a A s.t. (gof) (a) = g[f(a)] = g(b) = c
i.e. every element of C is the gof image of some element of A. As such gof is
onto function. Hence gof befing one-one and onto, is a bijection.
Examples on composite function
1. If f(x) = x2 and g(x) = x 7 find gof and fog (x2 7; (x 7)2)
2. If f(x) = x2 + 2x + 1 and g[f(x)] = |x + 1| find g(x) ; g(|x + 1|2) = |x + 1|
g(y) = y g(x) = x
3. If g (f(x)) = |sin x| and f (g(x)) = (sin x )2 then f(x) = sin2x ; g(x) = x
Examples on Composite of nonuniformly defined function
1 x if 0 x 2
5.(a) f(x) =
3 x if 2 x 3
find fof
x if 0 x 1
1 x if 0 x 1 2x
if 1 x 2
(b) f(x) = x 2 if 1 x 2 find (fof) (x) [Ans: (fof) (x) = 6 x if 2 x 3 ]
4 x if 2 x 4 x 3 if 3 x 4
2 if x 2
1 x if x 0 x if x 1
(c) f (x) = 2 and g (x) = find (fog)(x) and (gof)(x)
x if x 0 1 x if x 1
x if x 0
(d) f(x) = x 0 x 1 find (fof) (x)
2 x x 1
f (x) 1 x 2 , 0 x 4
(e) find gof and fog
g(x) 2 x , 1 x 3
1 x 0 x 1
[Ans: gof(x) =
3 x 1 x 2
;
L 1
( fog) ( x) M (1 x)
x0
1 x 0 ]
x 1 2 x 3 MN x 1 0 x2
5x 3 x 4
1 x3 x 0 (x 1)1/ 3 x 0
(f) f(x) = and g(x) = find g (f(x))
x2 1 x 0 (x 1)1/ 2 x 0
8. INVERSE OF A FUNCTION :
Let f : A B be a oneone & onto function, then their exists a unique function
g : B A such that f(x) = y g(y) = x, x A & y B. Then g is said to be
inverse of f. Thus g = f1 : B A = {(f(x), x) (x, f(x)) f}.
Example: Compute the inverse of the following bijective. [Q.260 Q. Bank. F/L/C/D]
(a) f(x) = 10 x + 1 ; (b) f(x) = 1 + ln (x + 2)
2x x 1
(c) f(x) = (d) f(x) = 1 + 2 sin
1 2x x 1
x 1
x 1 sin 1
2
[ Ans : (a) y = log10 x 1; (b) y = 2 + ex 1; (c) y = log2 1 x ; (d) y = 1 x 1
]
1 sin
2
PROPERTIES OF INVERSE FUNCTION :
(i) The inverse of a bijection is unique.
Proof: Let f : A B be a bijection. If possible let g : B A and h : B A be two inverse
function of f. Also let a1, a2 A and b B such that g (b) = a1 and h (b) = a2 then
g(b) = a1 f (a1) = b
h(b) = a2 f (a2) = b.
But since f is one-one, so f (a1) = f (a2) a1 = a2 g(b) = h(b), b B
(ii) If f : A B is a bijection & g : B A is the inverse of f, then fog = IB and
gof = IA, where IA & IB are identity functions on the sets A & B respectively.
Note that the graphs of f & g are the mirror images of each other in the line y = x. As
shown in the figure given below a point (x ', y' ) corresponding to
y = x2(x>0) changes to (y', x') corresponding to y x , the changed form of x = y .
(iii) The inverse of a bijection is also a bijection.
Proof : Let f : A B be a bijection and g : B A be its inverse. We have to show that g is
one-one and onto.
One-one : Let g(b1) = a2 and g(b2) = a2 : a1, a2 A ^ b1, b2 B
Then g(b1) = g(b2) a 1 = a2
f(a1) = f(a2) [ f is a bijection]
b1 = b 2 [ g(b1) = a1 b1 = f(a1)
g(b2) = a2 b2 = f(a2)]
which proves that g is one-one
Onto : Again, if a A, then
a A b B s.t. f (a) = b (by defintion of f)
b B s.t. a = g(b) [ f(a) = b a = g(b)]
which proves that g is onto.
Hence g is also a bijection.
(iv) If f & g are two bijections f : A B, g : B C then the inverse of gof exists and
(gof)1 = f1og1.
Proof : Since f : A B and g : B C are two bijections,
gof : A C is also a bijection.
[by theorem the composite of two bijection is a bijection]
As such gof has an inverse function (gof)1 : C A. We have to show that
(gof)1 = f1og1.
Now let a A, b B, c C such that
f (a) = b and g(b) = c
so (gof) (a) = g[f(a)] = g(b) = c,
now f(a) = b a = f1(b) ....(i)
g(b) = c 1
b = g (c) ....(ii)
(gof)(a) = c 1
a = (gof) (c) ....(iii)
1 1 1
Also (f og )(c) = f [g (c)] 1 [by defintion]
1
= f (b) [by (ii)]
=a [by (i)]
1
= (gof) (c) [by (iii)]
1 1 1
(gof) = f og , which proves the theorem.
EXAMPLE ON INVERSE
1. f : RR f(x) = ex and g : R R g(x) = 3x 2 find fog and gof. Also find domains of
(fog)1 and (gof)1 (fog) (x) = e3x 2; (gof)(x) = 3ex 2
domain of (fog)1 = R+ ; domain of (gof)1 = (2, )
2. If f : R R f (x) = x3 + (a + 2)x2 + 3ax + 5 is an invertible mapping finda
f (x) > 0 (note that f (x) > 0 as leading coefficient f is > 0) [ Ans: a[1, 4] ]
ex ex
3.(a) f : [0, ) [1, ) f (x) = find f1(x)
2
e x/2 e x/ 2
(b) f(x) =
2
;
f1(x) = 2ln x 1 x 2
x if x 1
4. f(x) = x2 1 x 4 find f1(x)
8 x x4
x if x 1
y if y 1
y if 1 y 16 x if 1 x 16
f1(y)=x= y 2 f (x)=
1 x2
if x 16
if y 16
64 64
5. A function
3 7
f : , , defined as
2 4
f(x) = x2 3x + 4. Solve the equation f(x) = f1(x)
[Ans: x = 2]
2x 5
6. For the function f : R {4} R {2} ; f (x) = . Find
4x
(a) zero's of f (x), (b) range of f (x), (c) intervals of monotonocity
(d) 1
f (x), (e) local maxima and minima if any,
(f) interval when f (x) is concave upward and concave downward
2
(g) asymptotes, (h) f ( x ) dx ,
1
(i) nature of function whether one-one or onto (j) garph
[Ans. (a) 5/6, (b) (, 2) (2, ), (c) in its domain i.e. (, 4) (4, ),
4x 5
(d) f1(x) = , (e) no, (f) (, 4) upwards and (4, ) downwards, (g) y = 2,
x2
2
(h) 2 3ln 3
9. HOMOGENEOUS FUNCTIONS :
A function is said to be homogeneous with respect to any set of variables when each
of its terms is of the same degree with respect to those variables.
For example 5x2 + 3y2 xy is homogeneous in x & y. Symbolically if,
f (tx, ty) = tn . f (x , y) then f (x , y) is homogeneous function of degree n.
Example on Homogeneous function
x y cos x
f (x, y) = y sin x x is not a homogeneous function and
x y y x y
f (x, y) = y ln x x ln y ; x 2 y 2 + x; x + y cos are homogeneous functions of
x
degree one.
10. BOUNDED FUNCTION :
A function is said to be bounded if f(x) M , where M is a finite quantity.
Example:
1.329/FLCD Which of the following function(s) is(are) bounded on the intervals as indicated
1
x 1 1
(A*) f(x) = 2 on (0, 1) (B) g(x) = x cos on ()
x
1
f ( x ) 0, bounded
2
x
(C) Limit
h 0
x e x = Limit h e h = 0 ; Limit x ex = Limit
h 0 x x x
0
e
x e x xe x x (1 x) 1
h(x) 0 , ]
Also y y = e
ex e2x e
11. IMPLICIT & EXPLICIT FUNCTION :
A function defined by an equation not solved for the dependent variable is called an
IMPLICIT FUNCTION . For eg. the equation x3 + y3 = 1 defines y as an implicit function.
If y has been expressed in terms of x alone then it is called an EXPLICIT FUNCTION .
Examples on Implicit and explicit function f (x , y) = 0
x
1. x 1 y + y 1 x = 0; explicit y = or y = x (rejected)
1 x
y= x
2. y2 = x represents two separate branches.
y= x
3. x3 y3
+ 3xy = 0
folium of descartes
4. x = 2y y2
5. Find the domain of the explicit form of the function is represented implictly by the
equation (1 + x) cos y = x2
12. ODD & EVEN FUNCTIONS : A function f (x) defined on the symmetric interval (a, a)
If f (x) = f (x) for all x in the domain of f then f is said to be an even function.
e.g. f (x) = cos x ; g (x) = x + 3.
If f (x) = f (x) for all x in the domain of f then f is said to be an odd function.
e.g. f (x) = sin x ; g (x) = x3 + x .
NOTE :
(a) f (x) f (x) = 0 => f (x) is even & f (x) + f (x) = 0 => f (x) is odd .
(b) A function may neither be odd nor even .
(c) Inverse of an even function is not defined and an even function can not be strictly
monotonic
(d) Every even function is symmetric about the yaxis & every odd function is symmetric
about the origin.
(e) Every function can be expressed as the sum of an even & an odd function.
f ( x ) f ( x ) f ( x) f ( x) 2x 2x 2x 2x
e.g. f (x) 2x = +
2 2 2 2
14. GENERAL :
If x, y are independent variables, then :
(i) f(xy) = f(x) + f(y) f(x) = k ln x or f(x) = 0.
(ii) f(xy) = f(x) f(y) f(x) = xn , n R
(iii) f(x + y) = f(x) f(y) f(x) = akx.
(iv) f(x + y) = f(x) + f(y) f(x) = kx, where k is a constant.