English

If F : Q → Q, G : Q → Q Are Two Functions Defined by F(X) = 2 X and G(X) = X + 2, Show that F and G Are Bijective Maps. Verify that (Gof)−1 = F−1 Og −1.

Advertisements
Advertisements

Question

If f : Q → Qg : Q → Q are two functions defined by f(x) = 2 x and g(x) = x + 2, show that f and g are bijective maps. Verify that (gof)−1 = f−1 og −1.

Advertisements

Solution

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.

⇒ 2x = y 

⇒ `x = y/2 in Q` (domain)

⇒ is onto.
So, f is a bijection and, hence, it is invertible.

Finding f  -1:

Let f−1 (x) =y             ...(1)

⇒ x = f (y)

⇒ x = 2y

⇒ `y = x/2`

So, ` f^1 (x) = x/2`    (from (1))

njectivity 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.

⇒ x +2 =y

⇒ x= 2 -y ∈ Q (domain)

 ⇒ g is onto.
So, g is a bijection and, hence, it is invertible.

Finding g -1:

Let g−1(x) = y             ...(2)

⇒ x = g (y)

⇒ x = y+2

⇒ y = x − 2

So, g−1 (x) = x − 2        (From (2)

Verification of (gof)−1 = f−1 og −1:

f(x) = 2x ; g (x) = x + 2

and `f^-1 (x) = x/2 ; g^-1 (x)= x-2`

`Now, (f^-1 o  g^-1) (x) = f^-1 (g^-1)(x))  `

⇒ `(f^-1 o  g ^-1)(x) = f^-1 (x-2) `

⇒ `(f ^-1 o   g^-1) (x) = (x-2)/2 .......... (3)`

(gof) (x) = g (f(x))

= g (2x)

= 2x + 2

Let (gof)-1 (x) = y  ............ (4)

x = (gof) (y)

⇒ x = 2y +2

⇒ 2y = x - 2 

⇒ `y= (x-2)/2`

⇒` (gof)^-1 (x) = (x-2)/2`       [form (4) ....... (5) ]

from (3) and (5)

⇒ `(gof)^-1  = f^-1  o  g^-1`

shaalaa.com
  Is there an error in this question or solution?
Chapter 2: Functions - Exercise 2.4 [Page 69]

APPEARS IN

R.D. Sharma Mathematics Volume 1 and 2 [English] Class 12
Chapter 2 Functions
Exercise 2.4 | Q 12 | Page 69

RELATED QUESTIONS

Show that the signum function f : R → R, given by

`f(x) = {(1", if"  x > 0), (0", if"  x  = 0), (-1", if"  x < 0):}`

is neither one-one nor onto.


In the following case, state whether the function is one-one, onto or bijective. Justify your answer.

f : R → R defined by f(x) = 1 + x2


If the function `f(x) = sqrt(2x - 3)` is invertible then find its inverse. Hence prove that `(fof^(-1))(x) = x`


Give an example of a function which is neither one-one nor onto ?


Classify the following function as injection, surjection or bijection :

f : R → R, defined by f(x) = 1 + x2


Let A = {1, 2, 3}. Write all one-one from A to itself.


Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of each of the following:
(i) an injective map from A to B
(ii) a mapping from A to B which is not injective
(iii) a mapping from A to B.


Find gof and fog when f : R → R and g : R → R is defined by f(x) = 2x + 3 and  g(x) = x2 + 5 .


Let f : R → R and g : R → R be defined by f(x) = x2 and g(x) = x + 1. Show that fog ≠ gof.


Let  f  be any real function and let g be a function given by g(x) = 2x. Prove that gof = f + f.


Let A and B be two sets, each with a finite number of elements. Assume that there is an injective map from A to B and that there is an injective map from B to A. Prove that there is a bijection from A to B.


If f : A → Ag : A → A are two bijections, then prove that fog is a surjection ?


Let A = {x ∈ R : −4 ≤ x ≤ 4 and x ≠ 0} and f : A → R be defined by \[f\left( x \right) = \frac{\left| x \right|}{x}\]Write the range of f.


Write whether f : R → R, given by `f(x) = x + sqrtx^2` is one-one, many-one, onto or into.


Which one the following relations on A = {1, 2, 3} is a function?
f = {(1, 3), (2, 3), (3, 2)}, g = {(1, 2), (1, 3), (3, 1)}                                                                                                        [NCERT EXEMPLAR]


A function f  from the set of natural numbers to integers defined by

`{([n-1]/2," when  n is  odd"   is ),(-n/2,when  n  is  even ) :}`

 

 


If the function\[f : R \to \text{A given by} f\left( x \right) = \frac{x^2}{x^2 + 1}\] is a surjection, then A =

 

 


The  function f : [-1/2, 1/2, 1/2] → [-π /2,π/2], defined by f (x) = `sin^-1` (3x - `4x^3`), is

 


\[f : R \to R\] is defined by

\[f\left( x \right) = \frac{e^{x^2} - e^{- x^2}}{e^{x^2 + e^{- x^2}}} is\]

 


The inverse of the function

\[f : R \to \left\{ x \in R : x < 1 \right\}\] given by

\[f\left( x \right) = \frac{e^x - e^{- x}}{e^x + e^{- x}}\] is 

 


If  \[g\left( x \right) = x^2 + x - 2\text{ and} \frac{1}{2} gof\left( x \right) = 2 x^2 - 5x + 2\] is equal to


Mark the correct alternative in the following question:
Let A = {1, 2, ... , n} and B = {a, b}. Then the number of subjections from A into B is


Let f: R → R be defined by f(x) = 3x – 4. Then f–1(x) is given by ______.


Consider the set A containing n elements. Then, the total number of injective functions from A onto itself is ______


Let A be a finite set. Then, each injective function from A into itself is not surjective.


For sets A, B and C, let f: A → B, g: B → C be functions such that g o f is injective. Then both f and g are injective functions.


Are the following set of ordered pairs functions? If so, examine whether the mapping is injective or surjective.
{(x, y): x is a person, y is the mother of x}


Let f: R → R be given by f(x) = tan x. Then f–1(1) is ______.


The number of bijective functions from set A to itself when A contains 106 elements is ____________.


Let f : R → R be defind by f(x) = `1/"x"  AA  "x" in "R".` Then f is ____________.


Which of the following functions from Z into Z is bijective?


An organization conducted a bike race under 2 different categories-boys and girls. Totally there were 250 participants. Among all of them finally, three from Category 1 and two from Category 2 were selected for the final race. Ravi forms two sets B and G with these participants for his college project. Let B = {b1,b2,b3} G={g1,g2} where B represents the set of boys selected and G the set of girls who were selected for the final race.

Ravi decides to explore these sets for various types of relations and functions.

  • Ravi wants to find the number of injective functions from B to G. How many numbers of injective functions are possible?

The graph of the function y = f(x) is symmetrical about the line x = 2, then ______.


Let A = {1, 2, 3, ..., 10} and f : A `rightarrow` A be defined as

f(k) = `{{:(k + 1, if k  "is odd"),(     k, if k  "is even"):}`.

Then the number of possible functions g : A `rightarrow` A such that gof = f is ______.


ASSERTION (A): The relation f : {1, 2, 3, 4} `rightarrow` {x, y, z, p} defined by f = {(1, x), (2, y), (3, z)} is a bijective function.

REASON (R): The function f : {1, 2, 3} `rightarrow` {x, y, z, p} such that f = {(1, x), (2, y), (3, z)} is one-one.


Find the domain of sin–1 (x2 – 4).


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×