Scribd
Upload
41 views

Lecture#2 Concept of Functions

This lecture introduces the concepts of functions including: - Functions are defined as relations between sets where each element of the domain maps to exactly one element of the range. - The main types of functions are: injective (one-to-one), surjective (onto), and bijective (both one-to-one and onto). - The inverse of a function is obtained by swapping the elements of each ordered pair that defines the function. - Examples are provided to illustrate the different types of functions and how to determine the inverse of a function.

Uploaded by

Anaya Malik
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
41 views

Lecture#2 Concept of Functions

This lecture introduces the concepts of functions including: - Functions are defined as relations between sets where each element of the domain maps to exactly one element of the range. - The main types of functions are: injective (one-to-one), surjective (onto), and bijective (both one-to-one and onto). - The inverse of a function is obtained by swapping the elements of each ordered pair that defines the function. - Examples are provided to illustrate the different types of functions and how to determine the inverse of a function.

Uploaded by

Anaya Malik
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 19

LECTURE # 2

CONCEPT OF FUNCTIONS

COURSE TITLE: MULTIVARIABLE CALCULUS


COURSE CODE: MTH-325
CLASS: BS COMPUTER SCIENCE 3 MB
Outline

• Introduction to function
• Types of functions
• Inverse of a function
• Exercise
Introduction to Functions

Set

Ordered Pair

Relation

Function
Set

Definition:
Any collection of well-defined numbers, objects or things.
Example:
• A={1,2 4,6,9} is called set of numbers where 1,2,4,6 and 9 are elements of set A
• B={Punjab, Sindh , KPK, Baluchistan }, here B is set of Provinces of Pakistan
Ordered Pairs

Definition:
If we have two sets of numbers and take their cartesian product then each member of cartesian
product is said to be ordered pair.
Example:
A={1,2,3} and B={a,b,c}
Cartesian Product of A and B= A×B= {(1,a) , (1,b) , (1,c) , (2,a) , (2,b) , (2,c) , (3,a), (3,b) , (3,c)}
Hence, each member of the above mentioned cartesian product is an ordered pair.
Relation

Definition:
•  
Any subset of cartesian product A×B is called relation from A to B.
Example:
={(1,a) , (2,b) , (3,c)} is relation from A to B
Here the set of the first elements of the ordered pairs forming a relation is called its Domain, and
the set of the second elements of the ordered pairs forming a relation is called its Rang.
Function

•  
Definition:
Let R be a relation between A and B, then R will be a function if
• domain of
• First element of no two pairs of are equal
The function is also written as
Example:
X={2,3,4} and Y={4,6,8}
Then ={(2,4) , (3,6) ,(4,8)}
Continue…

•  
Genereal form of above stated function is,

X Y

2 4
3 6
4 8
Determining Whether Relations are Functions

Example 1:
Whether each relation defines a function.
L = { (2, 3), (–5, 8), (4, 10) }
M = { (–3, 0), (–1, 4), (1, 7), (3, 7) }
N = { (6, 2), (–4, 4), (6, 5) }
it is clear that both L and M are satisfying the conditions of a relation to become function but
domain of N is repeating which shows that N is not a Function
Every Function is Relation but Converse may not
be True

•   and are relations but is function and is not


Both
Types of Functions

•  
1-Into function:
If a function is such that Ran i.e., Ran .
Example:
Types of Functions

•  
2-Onto Function:
If a function is such that Ran i.e., every element of is the image of some element of , then is
called an Onto Function.
Example:
Types of Functions

•  
1-Injective (1-1 and into) function:
If a function is such that second element of no two of its ordered pairs are equal then it is called
Injective Function.
Example:
Types of Functions

•  
1-Bijective (1-1 and Onto) function:
If a function is such that second element of no two of its ordered pairs are same that is every image
has a distinct pre-image , then it is called Bijective Function.
Example:
Inverse of a Functions

•  
Definition:
If a relation or a function is given in a tabular form i.E., As a set of ordered pairs, its inverse is obtained
by interchanging the components of each ordered pair. The inverse of a function is denoted by .
Example:

Note:
The inverse  is different from 
Conclusion
Exercise
Q#1

Q#2
Exercise

Q#3
Thank You

You might also like