Scribd
Upload
2 views

class notes

Uploaded by

paranjaysinghal07
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

class notes

Uploaded by

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

CHAPTER 1: RELATIONS AND FUNCTIONS

SUBTOPIC: FUNCTIONS
9AM 24 MAY ,24
WE WILL STUDY
➢ MEANING OF FUNCTION
➢ IDENTIFYING A FUNCTION
➢ DOMAIN, CO-DOMAIN AND RANGE OF A FUNCTION
➢ TYPE OF FUNCTIONS
✓ ONE – ONE / INJECTION
✓ ONTO/ SURJECTION
✓ BIJECTIVE/INVERTIBLE
✓ EQUAL FUNCTIONS

FUNCTION
Let A and B be two non - empty sets.
Then a function f from A to B is a rule that maps each element of set A to exactly one
element in set B .
DENOTED BY 𝑓: 𝐴 → 𝐵
IDENTIFYING A FUNCTION

1
(i) And (ii) are functions
NUMBER OF FUNCTIONS
𝑓: 𝐴 → 𝐵
n(A)= 3 n(B)=4. THEN 1 st element 4 choices,2 nd element 4 choices ….ANSWER: 4 3
n(A)= 3 n(B)=3. THEN 1 st element 3 choices,2 nd element 3 choices ….ANSWER: 3 3
n(A)= p n(B)=q.ANSWER :qp
DOMAIN, CO DOAMIN AND RANGE

Let 𝑓: 𝐴 → 𝐵 be a function, then


Set A is domain, Set B is co domain and set of all images of elements in set A
under f is called range.

Domain Co-domain Range


f1
f2

{1,2,3,4}, {1,2,3}
Observation : Range is subset of co domain

2
ONE -ONE FUNCTION
𝐴 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛 𝑓: 𝐴 → 𝐵 is stb one – one if no two elements of A have same images.i.e. if
no two elements of A are mapped to same element of B .

(i) and (ii) are 1-1 (iii) many to one ( not 1-1)
A function 𝒇: 𝑨 → 𝑩 is stb one- one if

𝒂 ≠ 𝒃 ⇒ 𝒇(𝒂) ≠ 𝒇(𝒃) ∀𝒂, 𝒃 ∈ 𝑨 or 𝒇(𝒂) = 𝒇(𝒃) ⇒ 𝒂 = 𝒃 ∀ 𝒂, 𝒃 ∈ 𝑨

n(A) n(B) NUMBER OF 1-1


FUNCTIONS
3 3 1 st element 3 choices
2nd element 2 choices
3 rd element 1 choice
Answer :3x2x1
3 6 1 st element 6 choices
2nd element 5 choices
…
6!
Answer :6x5x4=
3!
3 10 1 st element 10 choices
2nd element 9 choices
…
10!
Answer :10x9x8=
7!

3 2 0

𝒇: 𝑨 → 𝑩 is one – one , then 𝑛(𝐴) ≤ 𝑛(𝐵)

3
Onto functions
𝑓: 𝐴 → 𝐵 is onto if range f = co domain i.e.if every element of B has a pre image in A

(i) is onto ii and iii are into (not onto )


A function 𝒇: 𝑨 → 𝑩 is stb onto if
∀𝒃 ∈ 𝑩 ∃𝒂 ∈ 𝑨 𝒔𝒕 𝒇(𝒂) = 𝒃 OR range = co domain
n(A) n(B) NUMBER OF onto
FUNCTIONS
3 3 6
3 2 6
3 1 1
4 3 36
3 4 0

𝒇: 𝑨 → 𝑩 is onto, then 𝑛(𝐴) ≥ 𝑛(𝐵)


Bijection
𝑓: 𝐴 → 𝐵 is bijective if it is both one – one and onto.

4
(i) is bijective
n(A) n(B) NUMBER OF BIJECTIVE
FUNCTIONS
3 3 3!
4 4 4!
3 4 0
4 3 0

𝒇: 𝑨 → 𝑩 is bijective, then 𝑛(𝐴) = 𝑛(𝐵)


𝒇: 𝑨 → 𝑩 is bijective then 𝑓 −1 : 𝐵 → 𝐴 is also bijective
Equal functions
Two functions f and g are called equal if
1. Domain of f = domain of g
2. f(x)=g(x) for all x in domain of f (or g)

Q1 Let A = {-1,0,1,2} ,B = {-4,-2,0,2} and f,g : 𝐴 → 𝐵 be functions defined by


1
f(x) = 𝑥 2 − 𝑥, x 𝜖𝐴 and g(x) = 2 |𝑥 − | − 1, 𝑥 ∈ 𝐴. Are f and g equal? Justify your answer.
2

thus f = g

5
Q2 Classify the following functions as 1-1, onto, bijection
1. 𝒇: 𝑵 → 𝑵 , 𝒇(𝒙) = 𝟐𝒙
2. 𝒇: 𝑹 → 𝑹 , 𝒇(𝒙) = 𝟐𝒙
3. 𝒇: 𝒁 → 𝒁 , 𝒇(𝒙) = 𝟐𝒙

ONE - ONE ONTO BIJECTIVE


1. Y N N
2. Y Y Y
3. Y N N

Q3 Classify the following functions as 1-1, onto, bijection


1. 𝒇: 𝑵 → 𝑵 , 𝒇(𝒙) = 𝒙𝟐
2. 𝒇: 𝑹 → 𝑹 , 𝒇(𝒙) = 𝒙𝟐
3. 𝒇: 𝒁 → 𝒁 , 𝒇(𝒙) = 𝒙𝟐

6
ONE - ONE ONTO BIJECTIVE
1. Y N N
2. N Y N
3. N N N

HOMEWORK
Q1 Classify the following functions as 1-1, onto, bijection
A. 𝒇: 𝑵 → 𝑵 , 𝒇(𝒙) = 𝒙𝟐 + 𝟏
B. 𝒇: 𝑹 → 𝑹 , 𝒇(𝒙) = 𝒙𝟐 + 𝟏
C. 𝒇: 𝒁 → 𝒁 , 𝒇(𝒙) = 𝒙𝟐 + 𝟏
Q2 Classify the following functions as 1-1, onto, bijection
A. 𝒇: 𝑵 → 𝑵 , 𝒇(𝒙) = 𝒙𝟒
B. 𝒇: 𝑹 → 𝑹 , 𝒇(𝒙) = 𝒙𝟒
C. 𝒇: 𝒁 → 𝒁 , 𝒇(𝒙) = 𝒙𝟒
Q3 Classify the following functions as 1-1, onto, bijection
A. 𝒇: 𝑵 → 𝑵 , 𝒇(𝒙) = 𝒙𝟑
B. 𝒇: 𝑹 → 𝑹 , 𝒇(𝒙) = 𝒙𝟑
C. 𝒇: 𝒁 → 𝒁 , 𝒇(𝒙) = 𝒙𝟑
Q4 Classify the following functions as 1-1, onto, bijection
A. 𝒇: 𝑵 → 𝑵 , 𝒇(𝒙) = |𝒙|
B. 𝒇: 𝑹 → 𝑹 , 𝒇(𝒙) = |𝒙|
C. 𝒇: 𝒁 → 𝒁 , 𝒇(𝒙) = |𝒙|

7
8
9
10
11
12
13
14
15
16
17
18
19
20

You might also like