Injectivity of f:
Let x and y be two elements of domain (Q), such that
f(x) = f(y)
2x = 2y
x = y
So, f is one-one.
Surjectivity of f:
Let y be in the co-domain (Q), such that f(x) = y.
f is onto.
So, f is a bijection and, hence, it is invertible.
Finding f -1:
Injectivity of g:
Let x and y be two elements of domain (Q), such that
g(x) = g(y)
x + 2 = y + 2
x = y
So, g is one-one.
Surjectivity of g:
Let y be in the co domain (Q), such that g(x) = y.
g is onto.
So, g is a bijection and, hence, it is invertible.
Finding g -1:
Verification of (gof)−1 = f−1 og −1: