Function:
A function f from a set A to another set B is defined as the rule that associates
each element of A with unique element of B.
It is written as f: A → B.
f
If x ϵ A and y ϵ B, then the functional
relation is written as x y
y = f(x). A B
f
Examples:
1 2
2 4
3 6
4 8
A
B
∴ f(1)= 2
f(2) = 4
f(3) =6 , f(4) = 8
Domain and Codomain of the function:
Let f : A→B be a function from set A to another set B. Then the set A where
the function f is defined is known as domain of the function f . It is denoted by
D(f). Also set B is known as Codomain of the function f.
Range of the function:
Let f : A→ B be a function from set A to another set B. Then the range of the
function f is defined as the set of elements of B which are the images of at least
one element of A. It is denoted by R(f) or f(A).
∴ R(f) = { y : f(x) = y , x ∈ A , y ∈ B}
f
Note that Range of f ⊆ Codomain of f.
R(f)⊆ B. 1 1
2 6
Example: 3
4 8
Domain of f = A 5
= { 1 ,2 , 3 ,4 } A B
Range of f = { 1 ,6 ,8 }
Codomain of f = B
= { 1 ,6 ,8 , 5 }
Types:
a) One to one (injective) function:
A function f : A→ 𝐵 is said to be one to one function if different elements of A
have different images in B. This means f is one to one if 𝑥1 ≠ 𝑥2 in A implies
f(𝑥1 ) ≠ f(𝑥2 ) in B.
Equivalently,
f: A→B is said to be one to one if f(𝑥1 ) = f(𝑥2 ) in B implies 𝑥1 = 𝑥2 in A.
Examples: f f
1 4 1 5
i) 2 5 ii) 2 6
3 6 3 7
4
A B
One to one A B
Not one to one
Many to one
iii) f: R→ R defined by f(x) = 2x+ 3.
iv) f : N→N defined by f(x) = 𝑥 2
v) f: R→R defined by f(x) = 𝑥 2 ( Not one to one)
b) Onto (Surjective) function:
A function f : A→ 𝐵 is said to be onto function if each element of B acts as an
image of at least one element of A. This means f is onto function if all the elements
of B are image elements.
So , f: A→B is onto function if Range of f = Codomain of f.
i.e. R(f) = B.
Examples: f f
i) 1 4 ii) 1 4
2 5
2 5 6
3 6 3 7 8
A B A B
onto
Not onto
iii) f : R→R defined by f(x) = 3x+5 Into
iv) f: R→R defined by f(x) = 𝑥 3
v) f: R→R defined by f(x) =𝑥 2 (Not onto)
vi) f: [-2 , 2]→R defined by f(x) =𝑥 2 (Not onto)
c) Bijective function:
A function f: A→B is said to be bijective if it is both one to one and onto.
Examples:
i) f ii) f : R→R defined by f(x) = 3x+5
1 4
2 6 iii) f: R→R defined by f(x) = 𝑥 3
3 7
A B
Equal functions:
Two functions f and g are said to be equal functions if
i) they have same domain
ii) f(x) = g(x) for all x.
Example:
i) Let A = { 1 ,2 ,3 } and f: A→ R defined by f(x) = 𝑥 2
ii) Suppose function g is defined as follows.
g
1 1
2 4 ∴ f = g.
3 9
A B
