Question #75633

f is the function from {a, b, c} to {1, 2, 3} such that f(a)=2, f(b)=3, f(c)=1. Is f invertible, and if it is, what is its inverse?

Expert's answer

Answer on Question #75633 – Math – Discrete Mathematics

Consider the function ff.

Let's denote the set {a,b,c}\{a, b, c\} as set AA and the set {1,2,3}\{1, 2, 3\} as set BB. Then function ff is a mapping f ⁣:ABf \colon A \to B, f(a)=2f(a) = 2, f(b)=3f(b) = 3, f(c)=1f(c) = 1.

a) ff is an injective function (ff is an "into" function) because for m,nA:mn f(m)f(n)\forall m, n \in A: m \neq n \text{ } f(m) \neq f(n).

b) ff is a surjective mapping (ff is an "onto" function), because f(A)=Bf(A) = B.

c) ff is an injective mapping and ff is an surjective mapping, therefore ff is a bijective mapping. Then there is an inverse mapping f1 ⁣:BAf^{-1} \colon B \to A, which can be defined as follows:


yB!xA:f(x)=y. Then x=f1(y).\forall y \in B \exists ! x \in A: f (x) = y. \text{ Then } x = f ^ {- 1} (y).


As a result, a=f1(2),b=f1(3),c=f1(1)a = f^{-1}(2), b = f^{-1}(3), c = f^{-1}(1).

Answer provided by https://www.AssignmentExpert.com

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

LATEST TUTORIALS
APPROVED BY CLIENTS