Scribd
Upload
7 views

Composition, Inverse of Functions

Uploaded by

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

Composition, Inverse of Functions

Uploaded by

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

Composition of Functions

Let 𝑓 : 𝐴 → 𝐵 and 𝑔 : 𝐵 → 𝐶 be two functions. Then the


composition of 𝑓 and 𝑔, denoted by 𝑔𝑜𝑓, is defined as the function
𝑔𝑜𝑓 : A → C given by
𝑔𝑜𝑓 (𝑥) = 𝑔(𝑓 (𝑥)), ∀ 𝑥 ∈ 𝐴.

Q. Let 𝑓, 𝑔 : 𝑹 → 𝑹 be two functions defined as 𝑓 (𝑥) = |𝑥| + 𝑥


and 𝑔 (𝑥) = |𝑥| – 𝑥 , ∀ 𝑥 ∈ 𝑹. Then, find 𝑓 𝑜 𝑔 and 𝑔 𝑜 𝑓.
Solution.

Vinod A V,
PGT Maths, JNV Thrissur
Properties of Composition of Functions
➢ The composition of functions is not commutative.
𝑖. 𝑒. 𝑓 ∘ 𝑔 ≠ 𝑔 ∘ 𝑓
➢ The composition of functions is associative.
𝑖. 𝑒, if 𝑓, 𝑔, ℎ are three functions such that (𝑓 ∘ 𝑔) ∘ ℎ and
𝑓 ∘ (𝑔 ∘ ℎ) exist, then (𝑓 ∘ 𝑔) ∘ ℎ = 𝑓 ∘ (𝑔 ∘ ℎ).
➢ The composition of two bijections is a bijection. 𝑖. 𝑒, if 𝑓 and
𝑔 are two bijections, then 𝑔 ∘ 𝑓 is also a bijection.
Proof
Let 𝑓 ∶ 𝐴 → 𝐵 𝑎𝑛𝑑 𝑔 ∶ 𝐵 → 𝐶 be two bijections. To prove
𝑔 ∘ 𝑓: 𝐴 → 𝐶 is also a bijection.
Suppose 𝑔𝑜𝑓 (𝑥1 ) = 𝑔𝑜𝑓 (𝑥2 )
⇒ 𝑔(𝑓(𝑥1 )) = 𝑔(𝑓(𝑥2 )),
⇒ 𝑓(𝑥1 ) = 𝑓(𝑥2 ), since 𝑔 is one-one
⇒ 𝑥1 = 𝑥2, since 𝑓 is one-one
⇒ 𝑔𝑜𝑓 is one-one.
Now to prove onto.
Given an arbitrary element 𝑧 ∈ 𝐶, there exists a pre-image 𝑦
of 𝑧 under 𝑔 such that 𝑔 (𝑦) = 𝑧, since 𝑔 is onto.
Further, for y ∈ B, there exists an element x in A with
𝑓 (𝑥) = 𝑦, since 𝑓 is onto.
Therefore, 𝑔𝑜𝑓 (𝑥) = 𝑔 (𝑓 (𝑥)) = 𝑔 (𝑦) = 𝑧, showing that 𝑔𝑜𝑓
is onto.
------------
➢ Let 𝑓: 𝐴 → 𝐵. Then, 𝑓 ∘ 𝐼𝐴 = 𝐼𝐵 ∘ 𝑓 = 𝑓 𝑖. 𝑒 the composition of
any function with the identity function is the function itself.
Vinod A V,
PGT Maths, JNV Thrissur
Invertible Function
A function 𝑓 ∶ 𝑋 → 𝑌 is defined to be invertible, if there
exists a function 𝑔 ∶ 𝑌 → 𝑋 such that
𝑔 𝑜 𝑓 = 𝐼𝑥 and 𝑓 𝑜 𝑔 = 𝐼𝑥 .
The function 𝑔 is called the inverse of 𝑓 and is denoted
by𝑓 −1 .
Thus, if 𝑓: 𝐴 → 𝐵 is a bijection, then 𝑓 −1 : 𝐵 → 𝐴 is such that
𝑓(𝑥) = 𝑦 ⇔ 𝑓 −1 (𝑦) = 𝑥.

Properties of Inverse of a Function


➢ The inverse of a bijection is unique.
➢ The inverse of a bijection is also a bijection.
➢ Let 𝑓 ∶ 𝑋 → 𝑌 and 𝑔 ∶ 𝑌 → 𝑍 be two invertible functions.
Then 𝑔 𝑜 𝑓 is also invertible with (𝑔 𝑜 𝑓)−1 = 𝑓 −1 𝑜 𝑔−1 .
Proof

Since 𝑓 and 𝑔 are invertible both functions are bijections, hence


𝑔 ∘ 𝑓 is also a bijection and so invertible.
Now to show that (𝑔𝑜𝑓)−1 = 𝑓 −1 𝑜𝑔−1 , it is enough to show that
(𝑓 −1 𝑜𝑔−1 )𝑜(𝑔𝑜𝑓) = 𝐼𝑥 and (𝑔𝑜𝑓)𝑜(𝑓 −1 𝑜𝑔−1 ) = 𝐼𝑧 .
Now,
(𝑓 −1 𝑜𝑔−1 )o(gof) = ((𝑓 −1 𝑜𝑔−1 ) 𝑜𝑔) 𝑜𝑓, since composition of functions are associative.

= (𝑓 −1 𝑜(𝑔−1 𝑜𝑔)) 𝑜𝑓,


= (𝑓 −1 𝑜𝐼𝑥 ) 𝑜𝑓, by definition of 𝑔−1
= 𝐼𝑥 .
Similarly, it can be shown that (𝑔𝑜𝑓 )𝑜 (𝑓 −1 𝑜𝑔−1 ) = 𝐼𝑧 .

Q. Let 𝑓 ∶ 𝑋 → 𝑌 be an invertible function. Show that the inverse


of 𝑓 −1 is 𝑓, 𝑖. 𝑒. , (𝑓 −1 )−1 = 𝑓.

Vinod A V,
PGT Maths, JNV Thrissur

You might also like