Question
Question: Consider \(f:\left\\{ 1,2,3 \right\\}\to \left\\{ a,b,c \right\\}\) and \(g:\left\\{ a,b,c \right\\}...
Consider f:\left\\{ 1,2,3 \right\\}\to \left\\{ a,b,c \right\\} and g:\left\\{ a,b,c \right\\}\to \left\\{ apple,ball,cat \right\\} defined as f(1)=a,f(2)=b,f(3)=c,g(a)=apple,g(b)=ball,g(c)=cat . Show that f,g,g∘f are invertible. Find f−1,g−1 and (g∘f)−1 . Show that (g∘f)−1=f−1∘g−1 .
Solution
Hint: At first we have to check if the functions f,g are one to one and onto or not. A function is invertible only if the function is both one to one and onto.
Complete step-by-step answer:
The function f is defined as:
f:\left\\{ 1,2,3 \right\\}\to \left\\{ a,b,c \right\\}.
f(1)=a,f(2)=b,f(3)=c .
Here \left\\{ 1,2,3 \right\\} is the domain of the function f. \left\\{ a,b,c \right\\} is the codomain of the function f.
We know that a function is said to be one to one if every different element of the domain has different images.
Here image of 1 is a. Image of 2 is b. Image of 3 is c. Therefore, every different element of the domain has a different image. Hence, f is one to one.
We know that a function is said to be onto if for every element of the codomain, we can find out at least one preimage from the domain.
The preimage of a is 1. Preimage of b is 2. Preimage of c is 3.
Therefore, every element of the codomain has a preimage. Hence, f is a onto function.
Therefore, f is both one to one and onto. So, f is invertible.
Similarly, the function g is defined as:
g:\left\\{ a,b,c \right\\}\to \left\\{ apple,ball,cat \right\\}
g(a)=apple,g(b)=ball,g(c)=cat
Here \left\\{ a,b,c \right\\} is the domain of the function. \left\\{ apple,ball,cat \right\\} is the codomain of the function.
The function g is one to one as image of a is apple, image of b is ball, image of c is cat. Therefore every element of the domain has a different image.
The function g is onto as preimage of apple is a, preimage of ball is b, preimage of cat is c. Therefore every element of the codomain has one preimage in the domain.
Hence, g is both one to one and onto. So, g is invertible.
Now, (g\circ f):\left\\{ 1,2,3 \right\\}\to \left\\{ apple,ball,cat \right\\} is defined as:
As (g∘f)(1)=g(f(1))=g(a)=apple
(g∘f)(2)=g(f(2))=g(b)=ball(g∘f)(3)=g(f(3))=g(c)=cat
g∘f is one to one as every element of the domain \left\\{ 1,2,3 \right\\} has different image.
g∘f is onto as every element of the codomain \left\\{ apple,ball,cat \right\\} has a preimage in the domain.
Therefore g∘f is invertible.
We know that if a function f maps one element x to y, then the inverse function maps the image y to x. That is:
f(x)=y⇒f−1(y)=x
Therefore,
f(1)=a⇒f−1(a)=1f(2)=b⇒f−1(b)=2f(3)=c⇒f−1(c)=3
Hence,
{{f}^{-1}}:\left\\{ a,b,c \right\\}\to \left\\{ 1,2,3 \right\\} , such that:
f−1(a)=1,f−1(b)=2,f−1(c)=3
Similarly,
g;(a)=apple⇒g−1(apple)=ag;(b)=ball⇒g−1(ball)=bg;(c)=cat⇒g−1(cat)=c
Therefore,
{{g}^{-1}}:\left\\{ apple,ball,cat \right\\}\to \left\\{ a,b,c \right\\} , such that:
g−1(apple)=ag−1(ball)=bg−1(cat)=c
Similarly,
(g∘f)(1)=apple⇒(g∘f)−1(apple)=1(g∘f)(2)=ball⇒(g∘f)−1(ball)=2(g∘f)(3)=cat⇒(g∘f)−1(cat)=3
Therefore,
{{\left( g\circ f \right)}^{-1}}:\left\\{ apple,ball,cat \right\\}\to \left\\{ 1,2,3 \right\\} , such that:
(g∘f)−1(apple)=1(g∘f)−1(ball)=b(g∘f)−1(cat)=c
Now,
(f−1∘g−1)(apple)=f−1(g−1(apple))=f−1(a)=1(f−1∘g−1)(ball)=f−1(g−1(ball))=f−1(b)=2(f−1∘g−1)(cat)=f−1(g−1(cat))=f−1(c)=3
Therefore,
(g∘f)−1(apple)=(g−1∘f−1)(apple)(g∘f)−1(ball)=(g−1∘f−1)(ball)(g∘f)−1(cat)=(g−1∘f−1)(cat)
Hence, (g∘f)−1=(f−1∘g−1)
Note: We generally make mistakes to find out the inverse function. Always remember:
f(x)=y⇒f−1(y)=x