1

FUNCTIONS [MAPPINGS]

Let A and B be two non-empty sets. A relation from A to B is said to be function

(mapping) from A to B, if every element of A is mapped on to the unique element of the
set B.
А function is a relation from a non-empty Set A in to a non-empty set B such that
i) all elements of a Set A are associated with the elements of Set B.
ii) an element of set A is associated with one and only one element of the set B
A function from A to B is denoted by f and it in written an f:A → B or A f B.
Domain and co-domain
The set A in called the Co-domain of function f and set B is called the co-domain of the
function f.
Image and preimage
If x ∈ A compressed to y ∈ B under the function f, then we say that y is the image of x
under f and x is a pre image of y and write f(x) = y.
Range: The subset of co-demon B contains the images of elements of A is called the
range of the function.
Note:
 Function c Relations c Cartesian product
 Every function is a relation but every relation is not a function.
Example: Let A = {a, b, c, d, e}, B = {1, 2, 3, 4}

A B A B
1 2

a 1 a 1

b 2 b
2
c c 3

d 3 d

e 4 e 4

Function Not a function

A B B
3 A
4

a 1 a 1

b 2 b
2
c 3 c 3

d 4 d

e 4
e

Not a function Function

 2
FUNCTIONS [MAPPINGS]

Types of functions
01. Identity function
A function f : A → B is known as the identity function if f(x) = x, ∀ x ∈ A.
Here domain of f(x) = Range of f(x).
02. One-one function (Injective function)
A function f: A → B is called a one-one function if distinct elements of A have
distinct images in B.
i.e. ∀ x1, x2, ∈ A then f(x1) = f(x2)  x1 = x2
(or) f(x1) ≠ f(x)  x1 ≠ x2

A B A B

a a 1
1

b 2 b 2

c 3 c 3

One-one function
Note:
 The necessary condition for a function f A → B is said be one-one function if
n(A) ≤ n(B)
 If n(A) = m and n(B) = n then total numbers of one-one functions from A to B is
ncm x m !
03. Many-one function [Not one-one]
A function f:A → B is called a many –one function if two or more elements of set A
have the same image in B.

A B

a 1

b 2

c 3

Many one function

04. On-to function [surjective function]
A function f: A → B is said to be on-to if every element of B is the image of some
element of A under f i.e. for every y ∈ B an element x ∈ A ∋ f(x) = y.
 3
FUNCTIONS [MAPPINGS]

A B A B

a 1 a 1

b 2 b 2

c 3 c 3

d d 4

Note: f:A → B is said to on-to function if n(A) ≥ n(B)

05. In-to function [Not onto]
f : A → B is called an into function if there exists an element in B having no pre
image in A.
f

A B

a 1

b 2 No pre image

c
3

06. Bijective function [one-one and on to]

A function f: A → B said to be bijective function if it is both one-one and on to.
Example
A B

a 1

b 2

c 3

d 4

One-one and on-to

Note: f:A → B is said to be bijective function if n(A) = n(B)