UNIT NO :3.

2
Functions

Definition: A relation from set X to set Y is a

function from set X to set Y
if for every element x in the domain, there
corresponds exactly one element y in the range.

Deepali Phalak 1
Note : The definition of a function requires that
a relation must be satisfying two conditions in
order to qualify as a function:
The first condition is that every 𝑥 ∈ 𝑋 must be
related to 𝑦 ∈ 𝑌 that is the domain of f must be
X and not merely a subset of X (X is covered)
The second requirement of uniqueness can be
expressed as: (Not one Many)
x, y ∈ f and x, z ∈ f ⟹ y = z
Remark: Functions are sometimes also called
mappings or transformations

Deepali Phalak 2
Example Determine which of the relations
are function.

Deepali Phalak 3
Example Determine which of the relations
are function.

Deepali Phalak 4
Types of Functions
1. One-to-One or Injective: A function 𝑓: 𝐴 → 𝐵 is called
one to-one or injective if each element of B is the image
of at most one element of A
∀x, x ′ ∈ A, f x = f x ′ ⟹ x = x ′

Deepali Phalak 5
Types of Functions
2. Onto or Surjective : A function f : A → B is called
onto or surjective if every element of B has
preimage in A

Deepali Phalak 6
Example Using two-element sets or three-element
sets as domains and ranges, find an example of an
onto function that is not one-to-one.

Notice that the function given by

f(1) = a, f(2) = b, f(3) = a
is an example of a function from {1, 2, 3} to {a, b}
that is onto but not one to one.

1
a
2
b
3

Deepali Phalak 7
 Examples

Check None of them are surjective (onto) !!!

Also for 1st example if domain is R it will be onto
Deepali Phalak 8
Types of Functions
3. One-To-One Correspondence or Bijective: A
function f: A → B is said to be a one-to-one
correspondence, or bijective, or a bijection, if it is
one-to-one and onto

Deepali Phalak 9
Definition Inverse Function
If f: A → B is a bijective function, its inverse is the
function f −1 : B → A such that f −1 y = x if and only if
f x =y
Example : let f be the function from {1, 2, 3} to {a, b, c}
such that f (1) = c, f (2) = a, and f (3) = b. Is f invertible,
and if it is, what is its inverse?
Ans The function f is invertible because as shown in
figure image set is covered and it is a one-to-one
correspondence. 1
−1
f reverses the direction by f a

so f −1 a = 2, 2
b
f −1 b = 3 and f −1 c = 1 3
c

Deepali Phalak 10
Example Prove that a function f:R→R defined by
f(x)=2x–3 is a bijective function find its inverse
If f(a) = f(b)
2a – 3 = 2b – 3
 a = b.
Thus f(a) = f(b)  a = b
Hence f is injective.
Let f(x)=y
 2x–3=y
x=(y+3)/2 & x=(y+3)/2  R
Thus for y  R(codomain)  x= (y+3)/2  R(domain) such
that f(x)=y
Hence, f is surjective.
Hence, f is bijective. Inverse of f is (y+3)/2 or (x+3)/2
Deepali Phalak 11
Example: Is a function f: Z → Z defined by f(x) = 2x–3 a
bijective function?
If f(a) = f(b)
2a – 3 = 2b – 3
 a = b.
Thus f(a) = f(b)  a = b
Hence f is injective.
Let f(x)=y
 2x–3=y
x = (y+3)/2 But x = (y+3)/2 ∉ Z
Thus for y  Z(codomain) There is no x  Z(domain)
such that f(x)=y
Hence, f is Not surjective.
Hence, f is Not bijective.
Deepali Phalak 12
Example let f ∶ 𝐙 → 𝐙 be such that f (x) = x + 1. Is f
invertible, and if it is, what is its inverse?
Ans: consider If f(a) = f(b)
a + 1 = b + 1
 a = b.
Thus f(a) = f(b)  a = b Hence f is injective.
Let f(x)=y
 x+1 = y
x = y-1 But x = y-1 Z
Thus for y  Z(codomain) There is x = y-1  Z(domain)
such that f(x)=y Hence, f is surjective.
Hence, f is bijective.
Now x = y-1
Consequently f −1 y = y − 1
Deepali Phalak 13
Example (a) f: 𝐑 → R , f x = 𝑥 2 − 4x
2𝑥−3
(b) g: 𝐑 − {𝟏} → R - {2} , 𝑔 x =
𝑥−1
Is f and g invertible, and if it is, what is its inverse?

Example (a) f: 𝐑 → R , f x = 𝑥 2 + x + 1 check if f is

bijective, if it is, find its inverse.

4𝑥+3
(b) g: 𝐑 − {𝟐/𝟓} → R - {4/5} , 𝑔 x =
5𝑥−2
Is g invertible, and if it is, what is its inverse?

Deepali Phalak 14
Definition : Function Composition
Given two functions f: A → B and g: B → C
the composite function of f and g is the function
g o f: A → C defined by
g o f x = g(f x ) for every x in A

Deepali Phalak 15
Example: Let g be the function from the set {a, b, c} to itself
such that g(a) = b, g(b) = c, and g(c) = a.
Let f be the function from the set {a, b, c} to the set {1,2, 3}
such that f (a) = 3, f (b) = 2, and f (c) = 1. What is the
composition of fog, and what is the composition of gof ?
Solution: Consider diagram representation of information.
The composition 𝑓𝑜g a g a f 1
is defined by
b b 2
(fog)(a) = f(g(a)) = f (b) = 2,
fog b = f g b c c 3

= f(c) = 1,
(fog)(c) = f(g(c)) = f(a) = 3.
Note that 𝑔𝑜f is not defined, because the range of f is not a
subset of the domain of g.
Deepali Phalak 16
Example Let f and g be the functions from the set of
integers to the set of integers defined by f (p) = 2p + 3
and g(q) = 3q + 2. What is the composition of f and g?
What is the composition of g and f ?
Solution:
Both the compositions fo g and g o f are defined.
Moreover,
(fo g)(x) = f (g(x)) = f (3x + 2)
= 2(3x + 2) + 3 = 6x + 7
and
(g o f )(x) = g(f (x)) = g(2x + 3)
= 3(2x + 3) + 2 = 6x + 11.

Try putting some value of x (say 1) and verify !!!

Deepali Phalak 17
 EXAMPLES
 Function 𝑓: 𝑅 − 1 → 𝑅 − {3} is defined as
3𝑥−2
𝑓 𝑥 = . Prove that 𝑓 is bijective
𝑥−1
 Functions 𝑓: 𝑅 → 𝑅 , 𝑔: 𝑅 → 𝑅 are defined as
𝑓 𝑥 = 5𝑥 + 3, 𝑔 𝑥 = 1 + 3𝑥 then find 𝑓𝑜𝑔
,𝑓𝑜𝑓 , 𝑔𝑜𝑓 & 𝑔𝑜𝑔𝑜𝑓
 Functions 𝑓: 𝑅 → 𝑅 , 𝑔: 𝑅 → 𝑅 are defined as
𝑓 𝑥 = 2𝑥 2 + 5, 𝑔 𝑥 = 5 + 3𝑥
then find 𝑓𝑜𝑔, 𝑔−1 𝑜𝑓 , 𝑓𝑜𝑔−1 & 𝑔−1 𝑜𝑔−1 𝑜𝑓
Is 𝑓 −1 exist? Justify your claim.

Deepali Phalak 18