Topic: Functions

Introductio
n:-
Real life Examples:-
Example:-1 Suppose I have to travel from Cuttack
to Bhubaneswar . It has been seen if I travel by a
bus then I have to spend Rs 30 , If I travel by
scooter I have to spend Rs 100 , If I travel by car I
have to spend Rs 500. It leads to a relationship
between two sets as the mode of transport and
expenditure for it .
BUS
Rs 30
Scooter
Rs 100
Car
Rs 500
Example:-2
 Let we have to make the relationship
between set of capitals of states and set of
states in India. i.e the capital-state
relationship.
Bhubaneswar Telangana

Maharastra
Hyderabad
Andhrapradesh
Kolkota
Punjab
Chandigard
Westbengle
Mumbai
Haryana

Odisha
Example 3:-
 Let a relationship between a set of some
districts of Odisha and a set of number of
corona patients in different districts till
today. 52

Khorda 37

3
Bhadrakh
10
Balasore
41

Keonjhar 2
Observations:-
The relation explained in example 1 is a function as every
element of 1st set has a unique image in the second set. This
is called a one-one mapping. but the relation given in
example 2 is not a function as the capital “Hyderabad” is
related to two states as “Telangana” and “Andhra Pradesh”.
i.e it has no unique image in the second set. So it is a one-
many relation but not a function. Also the relation explained
in example – 3 is not a function, as the district “Keonjhar”
has no corona patient till today, i.e it has no image, i. e it is
not related to any member of the second set.

Note:- Every function is a relation but every relation

may not be a function. Only one-one and many-one
relations are functions.
Function as a relation
A relation R from A to B is a function if it is not one-
many as well as many-many . Also domain of the
relation R is A itself .
Ex: Let A={1,2,3} B={a,b,c,d} and R ⊆ A X B
R={(1,a),(2,c)} is not a function as domain of R is not
the set A . (fig-1)
R={(1,a),(2,d),(3,b),(1,c)}is not a function as it is an
one-many relation. (fig-2)
R={(1,b),(2,c),(3,b),(2,d),(1,a)} is not a function as it is
a many-many relation. (fig-3)
R={(1,c),(2,a),(3,b)} is a function as it is not one-many
and domain of the relation R is A itself. (fig-4)
Pictorial Representation

1 1
a a
2 b 2 b
c c
3 d 3 d

Fig-1 Fig-2

1 1
a a
2 b 2 b
c c
3 d 3 d

Fig-3 Fig-4
Definition and Recapitulation of Function.

A rule ‘f’ which associates each element of a set A

to a unique element of a set B is called a function.
We write it as f : A⟶B .
From definition it is clear that
 All the elements of A must be associated with

elements of B .
 No element of A is associated with two or more

elements of B .
 Here A=domain of the function

B=Co-domain of the function

Rf ={f(x): ⩝ x ∊ A}=range of the function
 FUNCTION
 Types of functions (Identity
Function,Equal Function ,Injection and
surjection).
 Methods to check injectivity and

surjectivity of a function.
 Composition of a function.
 Theorems related to composition of a

function.
 Invertible function and related theorems.
 Methods to find the inverse of a function.
Identity Function Equality of

 IX
Functions

is said to be If f : A→B , g : C
→D are said to be
an identity


equal if
function defined (i) A=C
on the set X if IX (ii) Range of f =
(x) =x for all range of g
x∊ X . (iii) f(x)=g(x) for all
x in the domain .
We write f=g
Types of functions
One-One Function ( Injective Function)
Let f : A→ B
If distinct elements of A are associated
with distinct elements of B then the
function is one-one or Injective.
Methods to check:
 For x,y ⋲ A , f(x)=f(y)⟹x=y .
 For x,y ⋲ A , x≠y ⟹ f(x) ≠ f(y).
Examples:
1. A Polynomial Function.
2. A Piecewise defined function .

No. of Injective Functions

If n(A)=m , n(B)=n , then no. of one-one
functions from A to B are
=0 if m>n
=m! Or n! if m=n
=P(n,m) if m<n
n(A)>n(B) ex: n(A)=4 ,n(B)=2

b 1

c
2
d

A B
Here two elements c and d of A can’t be
associated with any element of B . It can’t be
a function. So no.of one-one function is zero.
n(A)<n(B) Ex: n(A)=2
n(B)=3
a a a
1 1 1
b b b
2 2 2
c c c

a a a
1 1 1
b b b
2 2 2
c c c
n(A)=n(B) ex: n(A)=n(B)=3

a 1 a 1 a 1

b 2 b 2 b 2

c 3 c 3 c 3

a 1 a 1 a 1
b 2 b 2 b 2
c 3 c 3 c 3
Onto Function (Surjective
Function)
Let f : A→ B
If range of the function is same as the co-
domain of the function , then function is
onto .
In other words , every element of B is the
image of some element of A under f .
Methods to check:
(i)Range of ‘f’ = Co-domain of ‘f’
(ii)For every y∊ B , there exists x ∊ A
such that f(x)=y .
Examples:
 Example -01
 Example-02

No. of onto functions

functions from A to B is 2ⁿ-2 .

If n(A)=n and n(B)=2 ,then no. of onto

N.B.:A function which is both one-one and

onto is a bijection .
 In the following cases a function can’t be an onto
function

Total no. Of functions from A to B is 2⁴=16 .

n(A)=4 , n(B)=2 .

1 1

2 a 2 a

3 3
b b
4 4
Composition of functions
Let f :A→B and g: C →D be two functions .
Then the composition of f and g denoted by
gof is possible only when B ⊆ C and is defined
as gof : A → C given by gof(x)=g(f(x)) for all
x∊A.
f g
B

A C D
gof
Example :
Let f : {1,2,3} →{3,4,5} and g : {3,4,5,6}
→{a,b,c,d} defined by f(1)=4 ,
f(2)=3 ,f(3)=5 , g(3)=a ,g(4)=c , g(5)=b,
g(6)=d . Find gof .
Ans :
Now gof: {1,2,3} → {a,b,c,d}
gof(1)=g(f(1))=g(4)=c
gof(2)=g(f(2))=g(3)=a
gof(3)=g(f(3))=g(5)=b
Theorems related to Composition of
functions
 Composition of functions is not Commutative.

 Composition of functions is Associative .

If f :A→B and g: B →C are one-one functio

ns , then


gof : A →C is also one-one .

If f :A→B and g: B →C are onto functions ,

then


gof : A →C is also onto .

Invertible Functions
Let f : A⟶ B be a function . f is said to be
invertible if there exists a function g: B
⟶A such that
gof= IA and fog =IB .

The function g is called the inverse function

of f .
We write it as

N.B.:If f is invertible then f must be one-

one and onto i.e. f must be a bijection .
 f:R⟶R , given by f(x)= sinx is not invertible
Examples:

as it is neither one-one nor onto .



f: R→[-1,1], given by f(x)= sinx is also not

invertible as it is not one-one.


f : [0,𝜋] →[-1,1] , given by f(x)= sinx is not

invertible as it is neither one-one nor onto .


f: [- 𝜋/2 , 𝜋/2] →[-1,1] given by f(x)= sinx is

invertible as it is both one-one and onto .

Theorems Related to inverse of a
function
 Inverse of a function is unique .
 Inverse of a bijection is also a bijection
 Inverse of a invertible function is the

function itself.
 If f and g be two invertible functions , then

gof is also invertible and

Proofs:
Method to find the inverse of a
function
 Check the given function is a bijection

 Consider y=f(x) and express x as a function

of y i.e. x=g(y)

 Then

Examples:
Points to Remember:
A function f :A⟶B is one-one if for x,y⋲ A ,
f(x)=f(y)⟹x=y .


A function f :A⟶B is onto if for every y∊B there

exists x∊ A such that f(x)=y .


A function f :A⟶B is invertible if there exists

g:B ⟶A such that gof=IA and fog=IB


A function f : A⟶B is invertible if and only if it

is a bijection .


Mind map
Assignments (BASIC)


Assignments (STANDARD)


Assignments (HOTS)


Learning Outcomes
Students will be able to
 understand a function.
 know about one-one and onto function .
 learn about composition of functions
 find composition of two functions .
 know about the inverse of a function.
 find the inverse of a function.
THANK
YOU