MAPPING OR FUNCTION (CBSE)

FUNCTION OR MAPPING

Let A and B be two non-empty sets and 𝑓 be a relation which associates each element of
the set A with unique element of the set B, then 𝑓 is called a 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛 𝑓𝑟𝑜𝑚 𝐴 𝑡𝑜 𝐵.

If for each element in a set A, there assigned an unique element of the set B, then we call
such an assignment a 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛, and we write 𝑓: 𝐴 → 𝐵.

1. The set A is called the 𝑫𝒐𝒎𝒂𝒊𝒏 of the function.

2. The set B is called the 𝑪𝒐 − 𝑫𝒐𝒎𝒂𝒊𝒏 of the function.
3. Let 𝑓: 𝐴 → 𝐵 be a mapping and 𝑥 ∈ 𝐴, then the unique element 𝑦 ∈ 𝐵 that corresponds
to x by the mapping f is called the 𝑓 − 𝑖𝑚𝑎𝑔𝑒 of x and is denoted by 𝑓(𝑥). If 𝑦 = 𝑓(𝑥),
we often say that 𝑓 𝑚𝑎𝑝𝑠 𝑥 𝑡𝑜 𝑦.
4. The set of all 𝑓 − 𝑖𝑚𝑎𝑔𝑒𝑠 i.e., {𝑓(𝑥): 𝑥 ∈ 𝐴} is said to be the Range set of 𝑓 and is
denoted by 𝐼𝑚(𝑓).

REMARK: The Range of a function is always a subset of Co-domain.

**NUMBER OF FUNCTION: Let A and B be a set containing 𝑚 𝑎𝑛𝑑 𝑛 elements respectively,

then the total number of function 𝑓𝑟𝑜𝑚 𝐴 𝑡𝑜 𝐵 is

[𝒏(𝑩)]𝒏(𝑨) = 𝒏𝒎 .

1|Page
DIPANJAN SAHA (B.Sc, M.Sc, B.Ed) E-MAIL: dipanjansaha2024@gmail.com (9635535461).
 MAPPING OR FUNCTION (CBSE)

***CONDITIONS:

I. All the elements in the domain have its image in the co domain.
II. Every elements in the co domain may or may not have any pre image in the domain.
III. Any element of the domain is not associates with two distinct elements of co domain.

**DIFERENCE BETWEEN RELATION AND FUNCTION:

Let 𝑆 𝑎𝑛𝑑 𝑇 be two non empty sets. Then a relation 𝑓 from 𝑆 𝑡𝑜 𝑇 with domain S, is
called a function or mapping, if no two different ordered pairs in 𝑓 have the same first co
ordinates.

If 𝑆 = {0,1,4,5} 𝑎𝑛𝑑 𝑇 = {0,3, −3,6}. Now 𝑓 = {(0,0), (1,3), (4,3), (4, −3), (5,6)} then
𝑓 is a relation but not a mapping, since the two different pairs, namely (4,3) 𝑎𝑛𝑑 (4, −3) have
the same first co ordinate.

If 𝑆 = {2,1,5, −7} 𝑎𝑛𝑑 𝑇 = {0,1, −2}. Now 𝑓 = {(2,0), (1,1), (5, −2), (−7,0)}, then 𝑓 is
a mapping.

Therefore we say that Every mapping is a Relation but every relation is not necessarily a
mapping.

DOMAIN OF TWO FUNCTION

Let f and g be two functions with domain 𝑫𝟏 𝒂𝒏𝒅 𝑫𝟐 respectively. Then,

I. The sum function 𝑓 + 𝑔 is defined by (𝑓 + 𝑔)(𝑥) = 𝑓(𝑥) + 𝑔(𝑥), ∀𝑥 ∈ 𝐷1 ∩ 𝐷2 .

II. The Difference function 𝑓 − 𝑔 is defined by (𝑓 − 𝑔)(𝑥) = 𝑓(𝑥) − 𝑔(𝑥), ∀𝑥 ∈ 𝐷1 ∩ 𝐷2

III. The Product function 𝑓 × 𝑔 is defined by (𝑓 × 𝑔)(𝑥) = 𝑓(𝑥) × 𝑔(𝑥), ∀𝑥 ∈ 𝐷1 ∩ 𝐷2

𝑓 𝑓 𝑓(𝑥)
IV. The quotient function 𝑔 is defined by (𝑔) (𝑥) = 𝑔(𝑥) , ∀𝑥 ∈ 𝐷1 ∩ 𝐷2 − {𝑥: 𝑔(𝑥) = 0}.

**REMARK: The domain of sum, difference, product of two functions are 𝐷1 ∩ 𝐷2 . And the

domain of the quotient of two functions is 𝐷1 ∩ 𝐷2 − {𝑥: 𝑔(𝑥) = 0}.

2|Page
DIPANJAN SAHA (B.Sc, M.Sc, B.Ed) E-MAIL: dipanjansaha2024@gmail.com (9635535461).
 MAPPING OR FUNCTION (CBSE)

TYPES OF MAPPING

1. ONE-ONE OR INJECTIVE OR INJECTION: A mapping 𝑓: 𝐴 → 𝐵 is said to be one-

one if every elements in the domain A have distinct image in the co domain B.

***HOW TO CHEAK:

I. First consider 𝑥1 𝑎𝑛𝑑 𝑥2 in the domain. Then 𝑓(𝑥1 ) = 𝑓(𝑥2 ) ⟹ 𝑥1 = 𝑥2 .

This solution 𝑥1 = 𝑥2 is an UNIQUE solution in the DOMAIN.
II. First consider 𝑥1 𝑎𝑛𝑑 𝑥2 in the domain. Then 𝑥1 ≠ 𝑥2 ⟹ 𝑓(𝑥1 ) ≠ 𝑓(𝑥2 ).

EXAMPLES:

i. If function 𝑓: 𝑅 → 𝑅, then 𝑓(𝑥) = 2𝑥 is injective.

ii. If function 𝑓: 𝑅 → 𝑅, then 𝑓(𝑥) = 2𝑥 + 1 is injective.
𝑥
iii. If function 𝑓: 𝑅 → 𝑅 then 𝑓(𝑥) = 2 is injective.

iv. If function 𝑓: 𝑅 → 𝑅 then 𝑓(𝑥) = 𝑥 3 is injective.

v. If function 𝑓: 𝑅 → 𝑅 then 𝑓(𝑥) = 𝑥 2 is not injective.

3|Page
DIPANJAN SAHA (B.Sc, M.Sc, B.Ed) E-MAIL: dipanjansaha2024@gmail.com (9635535461).
 MAPPING OR FUNCTION (CBSE)

**NUMBER OF ONE-ONE MAPPING: Let A and B be two sets having m and n elements
respectively. Then the Total number of Injective Mapping from A to B is

𝐏(𝐧, 𝐦), 𝐢𝐟 𝐧 ≥ 𝐦 𝒏!
{ 𝒘𝒉𝒆𝒓𝒆 𝑷(𝒏, 𝒎) = (𝒏−𝒎)!
𝟎, 𝐢𝐟 𝐧 < 𝐦

2. MANY-ONE FUNCTION: A mapping 𝑓: 𝐴 → 𝐵 is said to be many one mapping if and

only if two or more elements of A have same image in B. In the other words, a function
𝑓 𝑓𝑟𝑜𝑚 𝐴 𝑡𝑜 𝐵 is called many one iff it is not one-one.
3. **ONTO OR SURJECTIVE OR SURJECTION MAPPING: A mapping 𝑓: 𝐴 → 𝐵 is
said to be onto mapping if every elements in the co domain B have one or many preimage
in the domain A. That means if 𝒇(𝑨) = 𝑩, 𝒊. 𝒆, 𝑪𝒐 𝒅𝒐𝒎𝒂𝒊𝒏 = 𝑹𝒂𝒏𝒈𝒆.

𝑪𝑶 𝑫𝑶𝑴𝑨𝑰𝑵 = 𝑹𝑨𝑵𝑮𝑬

4|Page
DIPANJAN SAHA (B.Sc, M.Sc, B.Ed) E-MAIL: dipanjansaha2024@gmail.com (9635535461).
 MAPPING OR FUNCTION (CBSE)

EXAMPLES:

i. If function 𝑓: 𝑅 → 𝑅, then 𝑓(𝑥) = 2𝑥 + 1 is surjective.

ii. If function 𝑓: 𝑅 → 𝑅, then 𝑓(𝑥) = 3 − 4𝑥 is surjective.
iii. If function 𝑓: 𝑅 → 𝑅, then 𝑓(𝑥) = 𝑥 3 is surjective.
iv. If function 𝑓: 𝑁 → 𝑁, then 𝑓(𝑥) = 2𝑥 − 1 is not surjective.

**NUMBER OF ONTO FUNCTION: Let A and B be two sets having m and n elements
respectively. Then the Total number of Surjective Mapping from A to B is

∑𝒏𝒓=𝟏(−𝟏)𝒏−𝒓 𝑪(𝒏, 𝒓). 𝒓𝒎 , 𝒊𝒇 𝒏 ≤ 𝒎 𝒏!

{ 𝒘𝒉𝒆𝒓𝒆 𝑪(𝒏, 𝒓) = 𝒓!(𝒏−𝒓)!.
𝟎, 𝒊𝒇 𝒏 > 𝒎

**LIST OF SURJECTIVE MAPPINGS:

𝒏(𝑨) 𝒏(𝑩) NUMBER OF SURJECTIVE FUNCTIONS

3 2 23 − 2 = 6
4 2 24 − 2 =14
4 3 36
5 2 30
5 3 150
5 4 230

4. INTO FUNCTION: A mapping 𝑓: 𝐴 → 𝐵 is said to be into mapping if and only if there

exists at least one element in B which is not the image of any element of A. in the other
words a function 𝑓 𝑓𝑟𝑜𝑚 𝐴 𝑡𝑜 𝐵 is called into iff it is not onto.

5|Page
DIPANJAN SAHA (B.Sc, M.Sc, B.Ed) E-MAIL: dipanjansaha2024@gmail.com (9635535461).
 MAPPING OR FUNCTION (CBSE)

5. BIJECTIVE OR ONE-ONE CORRESPONDENCE: A mapping 𝑓: 𝐴 → 𝐵 is said to

be bijective mapping if and only if 𝑓 𝑖𝑠 𝑏𝑜𝑡ℎ injective and surjective.

EXAMPLES:

i. If function 𝑓: 𝑅 → 𝑅, then 𝑓(𝑥) = 2𝑥 + 1 is bijective.

ii. If function 𝑓: 𝑅 → 𝑅, then 𝑓(𝑥) = 3 − 4𝑥 is bijective.
iii. If function 𝑓: 𝑅 → 𝑅, then 𝑓(𝑥) = 𝑥 3 is bijective.

**NUMBER OF BIJECTIVE FUNCTION: A mapping 𝑓: 𝐴 → 𝐵 forms a bijective mapping if

𝑛(𝐴) = 𝑛(𝐵). So the number of bijective mapping having n elements in the sets A and B is

𝒏! , 𝒊𝒇 𝒏(𝑨) = 𝒏(𝑩) = 𝒏
{
𝟎, 𝒊𝒇 𝒏(𝑨) ≠ 𝒏(𝑩)

EXERCISE

1. The following mappings are Neither Injective(One-One) nor surjective(Onto):

I. 𝑓: 𝑅 → 𝑅 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑏𝑦 𝑓(𝑥) = 𝑠𝑖𝑛𝑥 ; 𝑥 ∈ 𝑅.
II. 𝑓: 𝑅 → 𝑅 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑏𝑦 𝑓(𝑥) = |𝑥| ; 𝑥 ∈ 𝑅.
III. 𝑓: 𝑅 → 𝑅 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑏𝑦 𝑓(𝑥) = 𝑥 2 + 𝑥 ; 𝑥 ∈ 𝑅.
𝑥
IV. 𝑓: 𝑅 → 𝑅 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑏𝑦 𝑓(𝑥) = 𝑥 2 +𝑥 ; 𝑥 ∈ 𝑅.

6|Page
DIPANJAN SAHA (B.Sc, M.Sc, B.Ed) E-MAIL: dipanjansaha2024@gmail.com (9635535461).
 MAPPING OR FUNCTION (CBSE)

𝑒 |𝑥| −𝑒 −𝑥
V. 𝑓: 𝑅 → 𝑅 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑏𝑦 𝑓(𝑥) = ;𝑥 ∈ 𝑅
𝑒 𝑥 +𝑒 −𝑥

2. The following mappings are Injective(One-One) But not surjective(Onto):

I. 𝑓: 𝑍 → 𝑍 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑏𝑦 𝑓(𝑥) = 3𝑥 ; 𝑥 ∈ 𝑍
II. 𝑓: 𝑁 → 𝑁 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑏𝑦 𝑓(𝑥) = 𝑥 + 1 ; 𝑥 ∈ 𝑁
III. 𝑓: 𝑍 → 𝑄 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑏𝑦 𝑓(𝑥) = 2𝑥 ; 𝑥 ∈ 𝑍

3. The following mappings are surjective(Onto) But not Injective(One-One):

𝑥+1
I. 𝑓: 𝑁 → 𝑁 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑏𝑦 𝑓(𝑥) = [ ] ;𝑥 ∈ 𝑁
2

II. 𝑓: 𝑅 → 𝑍 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑏𝑦 𝑓(𝑥) = [𝑥] ; 𝑥 ∈ 𝑅

III. 𝑓: 𝑅 → 𝑅 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑏𝑦 𝑓(𝑥) = 𝑥 3 − 𝑥 ; 𝑥 ∈ 𝑅
4. The following mappings are Bijective (One-One correspondence):
I. 𝑓: 𝑅 → 𝑅 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑏𝑦 𝑓(𝑥) = 𝑥 3 ; 𝑥 ∈ 𝑅.
𝑥
II. 𝑓: 𝑆 → 𝑅 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑏𝑦 𝑓(𝑥) = 1−|𝑥| ; 𝑥 ∈ 𝑆 = {𝑥 ∈ 𝑅 ∶ −1 < 𝑥 < 1}.
𝑥
III. 𝑓: 𝑆 → 𝑅 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑏𝑦 𝑓(𝑥) = 1+|𝑥| ; 𝑥 ∈ 𝑆 = {𝑥 ∈ 𝑅 ∶ −1 < 𝑥 < 1}.

7|Page
DIPANJAN SAHA (B.Sc, M.Sc, B.Ed) E-MAIL: dipanjansaha2024@gmail.com (9635535461).