Scribd
Upload
13 views

Types of Functions

The document discusses different types of functions including injective, surjective, and bijective functions. It provides definitions and examples of each type of function and exercises for readers to determine if functions are one-to-one, onto, or bijective.

Uploaded by

MUHAMMAD MUSTAFA AWAN
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
13 views

Types of Functions

The document discusses different types of functions including injective, surjective, and bijective functions. It provides definitions and examples of each type of function and exercises for readers to determine if functions are one-to-one, onto, or bijective.

Uploaded by

MUHAMMAD MUSTAFA AWAN
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 18

TYPES OF FUNCTIONS

Muhammad Adeel Ashraf


INJECTIVE or ONE-TO-ONE FUNCTION
 Let f: X →Y be a function. f is injective or one-to-one if, and
only if, ∀ x1, x2 ∈X, if x1 ≠ x2 then f(x1) ≠ f(x2) That is, f is
one-to-one if it maps distinct points of the domain into the
distinct points of the co-domain.

 A one-to-one function separates points.


FUNCTION NOT ONE-TO-ONE
A function f: X →Y is not one-to-one iff there exist elements x1
and x2 in such that x1 ≠ x2 but f(x1) = f(x2).That is, if distinct
elements x1 and x2 can found in domain of f that have the
same function value.

A function that is not one-to-one collapses points together.


EXERCISE
Which of the arrow diagrams define one-to-one
functions?
SOLUTION:

a. f is clearly one-to-one function, because no two


different elements of X are mapped onto the same
element of Y.
b. g is not one-to-one because the elements a and c
are mapped onto the same element 2 of Y.
ALTERNATIVE DEFINITION FOR ONE-TO-ONE
FUNCTION
A function f: X →Y is one-to-one (1-1) iff ∀ x 1, x2 ∈X, if x1
≠ x2 then f(x1) ≠ f(x2 ) (i.e distinct elements of 1st set have
their distinct images in 2nd set) The equivalent contra-positive
statement for this implication is∀ x1, x2 ∈X, if f(x1 ) = f(x2),
then x1 = x2

REMARK:

f: X →Y is not one-to-one iff ∃ x1, x2 ∈X with f(x1) = f(x2)


but x1 ≠ x2
EXERCISE

Define f: R →R by the rule f(x) = 4x - 1 for all x ∈R


Is f one-to-one? Prove or give a counter example.
SOLUTION
Let x1, x2 ∈R such that f(x1) = f(x2)
⇒ 4x1 - 1 = 4x2 – 1 (by definition of f)
⇒ 4 x1 = 4 x2 (adding 1 to both sides)
⇒ x1 = x2 (dividing both sides by 4)

Thus we have shown that if f(x1) = f(x2) then x1=x2


Therefore, f is one-to-one
EXERCISE

Define g : Z → Z by the rule g(n)=n^2 for all n ∈Z


Is g one-to-one? Prove or give a counter example.
SOLUTION
Let n1, n2 ∈Z and suppose g(n1) = g(n2)
⇒ n1^2 = n2^2 (by definition of g)
⇒ either n1 = + n2 or n1 = - n2
Thus g(n1) = g(n2) does not imply n1 = n2 always.
As a counter example, let n1 = 2 and n2 = -2.
Then
g(n1) = g(2) = 2^2 = 4 and also g(n2) = g(-2) = (-2)^2 = 4
Hence g(2) = g(-2) where as 2 ≠-2 and so g is not one-to-one.
SURJECTIVE FUNCTION or ONTO FUNCTION

Let f: X→Y be a function. f is surjective or onto if, and only if,


"∀ y∈Y, ∃ x∈X such thatf(x) = y.

That is, f is onto if every element of its co-domain is the image of


some element(s) of its domain i.e., co-domain of f = range of f.

Each element y in Y equals f(x) for at least one x in X


FUNCTION NOT ONTO

A function f:X→Y is not onto iff there exists yε Y such


that ∀x εX, f(x) ≠y. That is, there is some element in Y
that is not the image of any element in X.
EXERCISE

Define f: R →R by the rule f(x) = 4x-1 for all x ∈R


Is f onto? Prove or give a counter example.
SOLUTION
BIJECTIVE FUNCTION
This also called ONE-TO-ONE CORRESPONDENCE.

A function f: X→Y that is both one-to-one (injective) and onto


(surjective) is called a bijective function or a one-to-one
correspondence.
EXAMPLE
The function f: X→Y defined by the arrow diagram is both one-
to-one and onto; hence a bijective function.
Assignment No. 03
Q1: How many one-to-one functions are there from a set with three elements

to a set with four elements.

Q2: Define f: P({a,b,c})→Z as follows: for all A∈P ({a,b,c}), f(A)= the

number of elements in A. a. Is f one-to-one? Justify. b. Is f onto? Justify

Q3: Let X = {1,5,9} and Y = {3,4,7}.Define g: X →Y by specifying that g(1)

= 7, g(5) = 3, g(9) = 4 Is g one-to-one? Is g onto?

Q4: Let f: R →R be defined by the rule f(x) = x3.Show that f is a bijective?

You might also like