100% found this document useful (1 vote)
103 views

3 Relations - Functions - Functions - Types of Functions

Uploaded by

Dinesj
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
100% found this document useful (1 vote)
103 views

3 Relations - Functions - Functions - Types of Functions

Uploaded by

Dinesj
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 62

FUNCTIONS

FUNCTIONS
FUNCTIONS

TYPES OF FUNCTIONS
FUNCTIONS
TYPES OF FUNCTIONS
 A function f:AB is called an injection or one-one
function if distinct elements in A have distinct
images in B.
Thus, f:A  B is injection if a1, a2  A and a1  a2

 f (a1)  f (a2)

Applying contra positive to above


gives
a , a  A and f (a ) = f
1 2 1
(a2)
 a1 =
a2
FUNCTIONS
Working rule
f: A  B is one-one iff
 a1, a2  A and f (a1) = f
(a
 2a)1 = a2

Note
A function which is not one-one is called
many-one function.
FUNCTIONS
Example 1
If A={1, 2, 3, 4}, B={p, q, r, s} and if f: A  B is given
as f={(1, p), (2, r), (3, s), (4, q)} then f is one-one
function
f
A B
1 p

2 q

3 r

4 s
DOMAIN CO DOMAIN
FUNCTIONS
Example 2 f Clearly
It
Is is
Isnot
f
this
WHY?
A B this
one-oneis a
functio
DOMAIN function
CO DOMAIN
function
nor
one-
Here ‘3 & 4’ not?
one
1 p
have the
function
same images
2 q or not?

3 r

4 s
FUNCTIONS
Example 3
R is the set of real numbers and f:RR is defined as
f(x)=x3 for all xR,
R -2
1
2 =1
=8
33
=-8
R
f
1 1

2 8
Here, different
elements have
-2 different -8
images
f is an injection
FUNCTIONS
Example 4
f:RR is defined as f(x)=x2, now f is not an
injection as
f(5)=25, f(- (where 5,-5 are in domain
5)=25 R).
But f:NN given by f(x)=x2 is one-one
function

(Reason is f(-5)=25 is not possible as -5 is not in


domain N).
FUNCTIONS
Note

f:RR is defined as
f(x)=xn.
 f is one-one function if n is
 odd
f is not a one-one function if n is even
FUNCTIONS
Important
Ruleof injections from set of m elements to set of
Number
n elements are n
pm if (nm)
= we have npm =
0 if (n < m)

Example 1 3! 6
= =6
3 P2 =
(3−2)! 1
Example 2

If n(A)=3, n(B)=5 then number of injections from A to


B are 5P3 and B to A are 0
FUNCTIONS

Note
 Number of many-one functions
(=number of (number of one-one
functions) functions)
 A monotonic function (either strictly increasing or
strictly decreasing) is always an injection.
 Thus, a function f(x) satisfies f'(x)>0 (or) f'(x)<0 on
its entire domain then f is one-one
FUNCTIONS
GRAPHICALLY
Lines
: drawn parallel to the x – axis from each
corresponding image point should intersect the
graph of y = f(x) at one (and only one) point if f(x)
is one – one and there will be at least one line
parallel to the x – axis that will cut the graph at
least at two different points if f (x) is many one and
Y
vice versa
f (x) =
Ex : 1 3x+5
X
O

f (x) = 3x+5 is one – one function


FUNCTIONS
Y
Ex – 1: y = x2 + 1

Graph of f(x) = x2 + 1 is many – one function note that


a many – one function can be made one – one by
restricting the domain of the original function.
FUNCTIONS
 Any continuous function f (x) that has at least
one local maxima or minima is many – one

 All even functions are many – one

 All polynomials of even degree defined in R have


at lest one local maxima or minima, and hence,
are many – one in the domain R. The polynomials
of odd degree can be one – one or many – one
FUNCTIONS

MCQS
1. f:RR is defined as f(x)=x2 xR then f
is
1) Injection

2) Many one function

3) Not an Injection

4) One-One
function
FUNCTIONS
 Which one of the following is one – one
function Y
Y

1) X 2) X

Y Y

3) X 4) X

KEY 3
FUNCTIONS
2. n(A)=3, n(B)=4 then the number of injections from
A to B
1) 3P4 2) 4P3 3) 4) 0
12
3. f:RR is defined as f(x)=xn, n is odd, then f
is
1) one-one function
2) Many to one function
3) Not one-one function
4) None
FUNCTIONS

SURJECTION OR
ON-TO FUNCTION
FUNCTIONS

SURJECTION OR ON-TO When is


FUNCTION it
 A function f:AB is such that every element in
possible?
co-domain B at least one pre-image in
has
then f is domain A,
an on-to
function.
 Also every element of co-domain B has at least
one pre-image in domain A

If the range of f= co-domain of f.


FUNCTIONS
Working rule

1) f:AB is a function, then f is on-to iff


(range of =(co-domain of
f) f)
2) A function f:AB is on-to if yB  an element
xA  f(x) = y

Important Note:
A function which is not on-to is called as in-to
function
FUNCTIONS
Example Do you know
Let 1 A={1,2,3,4}, the range of
B={p,q,r} f?
f:AB is givenf={(1,p), (2,r), (3,q),
as
Rang = set formed(4,p)}
by second coordinates in ordered
e pairs
= {p, q,
r}
But co- = = {p, q,
domain B r}
Thus = co-
range domain
So, ‘f’ is on-to
function
FUNCTIONS
Example Now, what
2 is the
Let f:RR be defined by range of
f(x)=x2+3 f(x)?
Now co-domain = R
Also x2+33 f(x)
x20 [3,)
Here, range and
Range = co-domain are
[3,) equal or not?
Rang  co-
e domain
f(x) is not an on-to
function
FUNCTIONS
Example
3
f:RR is defined as
f(x)=2x+3
Let f (x) =  2 x It 3 = yx =
+ means
y ‘R’
Now f (x) = f
y  Pre-image of y is  domain.

Thus for any y  co-domain,


 pre-image exists in domain.

Given f(x) is onto-


function
FUNCTIONS
Example 4 It means
‘N’
f : N  N is defined as f (x) = 2 x
+3
Just as in example 3 we can say f , but domain.

Thus for y  co-domain, pre image does not exist in


domain.

f (x) is not an on-to


function
FUNCTIONS

Important Note

 If we observe above two examples we have f (x)= 2


x + 3.
 But f(x) is on-to in f:RR and it is not on-to in
f:NN due to the different domains.
FUNCTIONS
Rule
 Number of surjections from set of m elements to set
of n elements
nm – nc1(n-1)m + nc2(n-2)m - nc3(n-3)m+...if (n ≤
S(m,n)= m)
0 if (n > m)
From
above,
of = 2 -
m
If n=2 we get number
2
surjections
number of = 3 – 3 (2 -
m m
If n=3 then the
1)
surjections
FUNCTIONS
Example
1
Number of on-to functions from A={x, y, z} to B={a, b,
as c,n(B)
d} >
is n(A) Why
?
Example
2
A = {1, 2, 3, 4, 5}, B = {a, b}
Number of surjections from A = 25 -
to B Here 2
= 30
m=5
FUNCTIONS
Example
3
A = {p,q,r,s}, B =
{a,b,c}
Number of surjections from A to= 34 – 3 (24 - 1)
B
= 36
Note

 Number of in-to functions


=Total number of– number of on-to functions
functions
 The function f is onto iff its graph intersects any
horizontal line at least once
FUNCTIONS

1. f:AB is said to be on-to function if


MCQS
1) Range of f = codomain of
f
2) Range of f  codomain of
f
3) Domain of f = codomain of f

4) Domain of f  codomain of f
FUNCTIONS
2. n(A)=3, n(B)=2 then the number of surjections

1) 22-3

2) 23-2

3) 32-2

4) 23-3
FUNCTIONS
3. A={1,2,3}, B={a,b,c,d} then the number of on-to
functions from A to B is

1) 23-4

2) 24-3

3) 23-2

4) 0
FUNCTIONS

BIJECTION FUNCTION
FUNCTIONS
BIJECTION

 A function f : A  B is said to be bijection f is


iff
both one-one and on-to (i.e.) injection as well as
surjection
Example: f:RR is defined as
f ( x ) = x 2– 2 x + Here, -1 & 3
2
i.e., f ( x ) = ( x – 1 ) 2 have the same
image ‘5’
Solution + 1
Observe that f (-1) =f (3) =
5, 5
 f is not one-one
function.
FUNCTIONS
Also (x - 1) 2 
0 (x We

find
- 1)2 + 1 
This is the
range of range for Co-domain
1
 f(x)  [1,) of f is R
f(x)? f(x)
(i.e.,)  Co-
Range
So, we candomainsay that f is neither one-one nor on-to
function.
Important
note
If f : A  B is a bijection, then n ( A ) = n ( B )
 Number of bijections from a set of n elements to a
set of n elements are n!
 The function f is bijection iff its graph intersects
any horizontal line exactly once
FUNCTIONS
Constant
function
f : A  B is a function suchevery element in domain
that A
is mapped to only one particular element then f is
in B, constant function,
called or a function whose range
is a singleton set.
Thus f : A  B is such that f ( x ) where
= c is
c(xA)
some then f is a constant function.
fixed element in B,
FUNCTIONS
Example A={p,q,r,s},B={a Is, ‘g’
b , is
c } and we
define constant
g = { ( p , b ) , ( q , b ) , ( r , b ) , ( s function
,b)} or
not? is
then g is a constant function whose range
g
{Ab }p
. B Let us observe
a
this
q diagrammatically
b
r
c
s
DOMAIN CO DOMAIN
FUNCTIONS
Important
Note
 Number of constant functions from set of m
elements to set of n elements are n.
Example

If A={p,q,r,s}, B={a,b,c,d} the number of constant


functions from A to B are 4
FUNCTIONS
IDENTITY FUNCTION

 Let A be a non empty set. The function f : A  A


defined by f ( x ) = x (  x i.e.,
A ) input and output are
same, is called identity function on A
 It is denoted by IA

Example

If A = {  ,  , the
}, n
IA = { (  ,  ) , (  ,  ) , (  ,
)}
FUNCTIONS
EVEN OR ODD f : AB is a function such
 f ( - FUNCTION that,
x ) = f ( x then
) f ( x ) is an even
 ,f ( - x ) = - f ( xfunction.
)
then f ( x ) is an odd
,In above definitionsfunction.
x , - x must be in domain
A.
Exampl
e
We know sin ( - x ) = - sinx so , sinx is an odd function.

Also we know cos ( - x ) so


= cosx is an even function.
cosx,
FUNCTIONS
 The graph of an even function y = f(x) is
symmetrical about the y - axis
(i.e) if point (x,y) lies on the graph , then (-x,y) also
lies on the graph

Y
Y = x2 Y

Y=
x o x
o
FUNCTIONS
 The graph of an odd function y = f(x) is
symmetrical in opposite quadrants
(i.e) if point (x,y) lies on the graph, then (-x,-y)
also
lies onY the graph Y
Y =x

Y =x3
x x
FUNCTIONS
Example:
What is the
If f ( x ) = x 3 – 2 sin x + k is an odd definition of
function, then find
Solution: odd function?
k?
Given f ( x ) is
odd
 f ( - x ) = - f
(x) 3
(-x) - 2sin (-x) += - (x3-
k 2sinx+k)
 - x3 + 2 sin x + k= - x3 + 2 sin x -
k
2k=0,
 k =
0
FUNCTIONS
PERIODIC FUNCTION
f : A  B is a function such that f(x+T)=f (x) , where
x,
xf +(x)
TA is& said
T is the
to positive real number then
be periodic
function.
If T is the least positive value satisfying f ( x + T ) = f
( x ), then T is calledperiod or fundamental period of f

A (constant
x). function is periodic but does not have a
well defined period.
FUNCTIONS
Example
 f : R  R is defined as f ( x )=sin x
.
Now sin ( 2  + x ) = sin x (i.e.,) f ( x + 2  ) = f
(x).
So f(x) is periodic function and 2 is its period

 Similarly, period of cos x, cosec x, sec x2


is

 For Tan x and cot x period


is
FUNCTIONS
Example

f :  [ - 1 , 1 ] is defined as f ( x ) = sin x .

Usually sin ( 2 + x ) = sin x (i.e.,) f ( x + 2  ) = f ( x ) .

So, we can say that f(x) is periodic with period 2


which is false in this example as x + 2 .
FUNCTIONS
Important remarks

 If f(x) has period T , then 2T , 3T . . . , nT , … (nN)


are also periods of f(x) i.e., f (x+nT )=f(x) .

 If f(x) has period T, then f(ax+b) has period


FUNCTIONS

MCQS
1. A function f:AB is said to be bijection
iff
1) f is on-to

2) f is one-one

3) Both 1 & 2

4) none
FUNCTIONS
2. A function f:AB is said to be constant function if
1) f(x)=c

2) f(x)=c(xA and cB)

3) f(x)=c (xA)

4) f(x)=c (xB)
FUNCTIONS
3. A function f(x) is said to be even function if
1) f(-x)=-f(x)

2) f(-x)=f(x)

3) f(-x)=x

4) f(x)=x
FUNCTIONS

INVERSE FUNCTION
FUNCTIONS
INVERSE FUNCTION
 If f:AB is a bijection,

then f –1
:BA exists as a function such that
f(a)=b
 a=f –1
(b) (where aA, bB)

Thus (a,b)f (b,a)f -1

Inverse of ‘f’ is denoted


f -1
by
FUNCTIONS
Important
remarks
 f exists iff is both one-one and on-
-1

to.
 domain of f - = Range of
1
f
 If f: AB is a bijection, then
f – 1 :BA is also a bijection

then f –1
(x)=
 If f:RR or f:QQ is
f(x)=ax+b,
FUNCTIONS
Graphs of y = f(x), y = f-1(x) are symmetrical about y
= x and intersect on line y = x or f(x) = f-1(x) = x
whenever graphs intersect
Y Y
Y = f-1(x)
Y=x
Y = f(x)

Y = f(x)
x x
o o
(-1,0)
(0,-1)

Y = f-1(x)
FUNCTIONS
Example Is f-1 bijection -1
Then what is f ?
or not?
If A={p,q,r}, B={a,b,c} then
f = {(p,c), (q,b), (r,a)} is a bijection from
A to B
f – 1 = {(c,p),(b,q),
(a,r)}
 f - 1 is also
bijection
FUNCTIONS
COMPOSITE
FUNCTION
Let f:AB, g:BC are two functions and aA. As f:AB
is a function. So for aA there exists bB such that
f(a)=b.
there exists cC,
Again as g:BC is a function so, for bB

Such that g(b)=c

Now
c=g(b)
=g(
f(a)
)
FUNCTIONS
Let us observe
 g(f(a)) =
this
c
We write g(f(a)) as diagrammaticall
(gof)(a) y
gof is called composite function which maps elements
in A to elements in C.
FUNCTIONS
f g
We know
A B C that
g:BC
f:AB
aA
gof(a)
g(f(a))=c
f(a)=b
g(b)=c
bB
cC=c

a b c

f(a) g(b)

gof
FUNCTIONS
Important
 To remarks
get gof, perform first f and then perform g

 gof is possible when co-domain of f  domain of


g also we have the range of gof  range of g

 Even if gof is possible, fog may not be possible

 Even if gof and fog are possible, fog may or may


not be equal to gof
FUNCTIONS

MCQS
1. Domain of f-1=______
1) Range of f-1

2) Range of f

3) Domain of f-1

4) none
FUNCTIONS
2. If f:RR or f:QQ is a function with f(x)=ax+b then f-
1
=___
1) f-1(x)=

2) f-1(x)=

3) f-1(x)=

4) f-1(x)=
FUNCTIONS
3. f={(a,1), (b,2), (c,3)} is a bijection from A to B then f-1
is
1) {(a,1), (2,b),
(c,3)}
2) {(1,a), (b,2),
(c,3)}
3) {(1,a), (2,b),
(3,c)}
4) {(a,1), (b,2),
(c,3)}
FUNCTIONS

Thank
you…

You might also like