Advertisements
Advertisements
Question
Let A = {1, 2, 3, 4}; B = {3, 5, 7, 9}; C = {7, 23, 47, 79} and f : A → B, g : B → C be defined as f(x) = 2x + 1 and g(x) = x2 − 2. Express (gof)−1 and f−1 og−1 as the sets of ordered pairs and verify that (gof)−1 = f−1 og−1.
Advertisements
Solution
f(x)=2x+1
⇒ f= {(1, 2(1)+1), (2, 2(2)+1), (3, 2(3)+1), (4, 2(4)+1)}={(1, 3), (2, 5), (3, 7), (4, 9)}g(x)=x2−2
⇒ g= {(3, 32−2), (5, 52−2), (7, 72−2), (9, 92−2)}={(3, 7), (5, 23), (7, 47), (9, 79)}
Clearly f and g are bijections and, hence, f−1: B→A and g−1: C→B exist.
So, f−1= {(3, 1), (5, 2), (7, 3), (9, 4)}
and g−1= {(7, 3), (23, 5), (47, 7), (79, 9)}
Now, (f−1 o g−1) : C→A
f−1 o g−1={(7, 1), (23, 2), (47, 3), (79, 4)} ...(1)
Also, f : A→B and g : B → C,
⇒ gof : A → C, (gof) −1 : C→A
So, f−1 o g−1and (gof)−1 have same domains.
(gof)(x)=g (f (x))=g (2x+1)=(2x+1)2−2
⇒ (gof) (x) = 4x2+ 4x +1−2
⇒ (gof) (x) = 4x2+ 4x −1
Then, (gof) (1) = g (f (1)) = 4+4−1 =7,
(gof)(2)=g (f (2))=4+4−1=23,
(gof)(3)=g (f (3))=4+4−1=47 and
(gof)(4)=g (f (4))=4+4−1=79
So, gof={(1, 7), (2, 23), (3, 47), (4, 79)}
⇒(gof)−1={(7, 1), (23, 2), (47, 3), (79, 4)} ......(2)
From (1) and (2), we get:
(gof)−1 = f−1 o g−1
APPEARS IN
RELATED QUESTIONS
In the following case, state whether the function is one-one, onto or bijective. Justify your answer.
f : R → R defined by f(x) = 3 – 4x
Give an example of a function which is neither one-one nor onto ?
Classify the following function as injection, surjection or bijection :
f : Z → Z, defined by f(x) = x2 + x
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = sin2x + cos2x
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = `x/(x^2 +1)`
Show that the function f : R − {3} → R − {2} given by f(x) = `(x-2)/(x-3)` is a bijection.
Show that the logarithmic function f : R0+ → R given by f (x) loga x ,a> 0 is a bijection.
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.
Let f : N → N be defined by
`f(n) = { (n+ 1, if n is odd),( n-1 , if n is even):}`
Show that f is a bijection.
[CBSE 2012, NCERT]
Let A = {a, b, c}, B = {u v, w} and let f and g be two functions from A to B and from B to A, respectively, defined as :
f = {(a, v), (b, u), (c, w)}, g = {(u, b), (v, a), (w, c)}.
Show that f and g both are bijections and find fog and gof.
Let f : R → R and g : R → R be defined by f(x) = x + 1 and g (x) = x − 1. Show that fog = gof = IR.
Consider f : R → R+ → [4, ∞) given by f(x) = x2 + 4. Show that f is invertible with inverse f−1 of f given by f−1 `(x)= sqrt (x-4)` where R+ is the set of all non-negative real numbers.
If f : R → R be defined by f(x) = x3 −3, then prove that f−1 exists and find a formula for f−1. Hence, find f−1(24) and f−1 (5).
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 : R → R is given by f(x) = x3, write f−1 (1).
Let \[f : \left[ - \frac{\pi}{2}, \frac{\pi}{2} \right] \to\] A be defined by f(x) = sin x. If f is a bijection, write set A.
Let f : R − {−1} → R − {1} be given by\[f\left( x \right) = \frac{x}{x + 1} . \text{Write } f^{- 1} \left( x \right)\]
Let A = {1, 2, 3, 4} and B = {a, b} be two sets. Write the total number of onto functions from A to B.
Write the domain of the real function
`f (x) = sqrt([x] - x) .`
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 ) :}`
Which of the following functions from
to itself are bijections?
Let
The function
\[f : Z \to Z\] be given by
` f (x) = {(x/2, ", if x is even" ) ,(0 , ", if x is odd "):}`
Then, f is
Let
\[f : R \to R\] be given by \[f\left( x \right) = x^2 - 3\] Then, \[f^{- 1}\] is given by
Mark the correct alternative in the following question:
If the set A contains 5 elements and the set B contains 6 elements, then the number of one-one and onto mappings from A to B is
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.
Let X = {1, 2, 3}and Y = {4, 5}. Find whether the following subset of X ×Y are function from X to Y or not
k = {(1,4), (2, 5)}
Which of the following functions from Z into Z are bijections?
Let f: R → R be the functions defined by f(x) = x3 + 5. Then f–1(x) is ______.
Let f: R → R be given by f(x) = tan x. Then f–1(1) is ______.
Which of the following functions from Z into Z is bijective?
Let X = {-1, 0, 1}, Y = {0, 2} and a function f : X → Y defiend by y = 2x4, is ____________.
Let g(x) = x2 – 4x – 5, then ____________.
Sherlin and Danju are playing Ludo at home during Covid-19. While rolling the dice, Sherlin’s sister Raji observed and noted the possible outcomes of the throw every time belongs to set {1,2,3,4,5,6}. Let A be the set of players while B be the set of all possible outcomes.
A = {S, D}, B = {1,2,3,4,5,6}
- Raji wants to know the number of functions from A to B. How many number of functions are possible?
Let the function f: R → R be defined by f(x) = 4x – 1, ∀ x ∈ R then 'f' is
Consider a function f: `[0, pi/2] ->` R, given by f(x) = sinx and `g[0, pi/2] ->` R given by g(x) = cosx then f and g are
Prove that the function f is surjective, where f: N → N such that `f(n) = {{:((n + 1)/2",", if "n is odd"),(n/2",", if "n is even"):}` Is the function injective? Justify your answer.
Let f: R→R be a continuous function such that f(x) + f(x + 1) = 2, for all x ∈ R. If I1 = `int_0^8f(x)dx` and I2 = `int_(-1)^3f(x)dx`, then the value of I1 + 2I2 is equal to ______.
Let a and b are two positive integers such that b ≠ 1. Let g(a, b) = Number of lattice points inside the quadrilateral formed by lines x = 0, y = 0, x = b and y = a. f(a, b) = `[a/b] + [(2a)/b] + ... + [((b - 1)a)/b]`, then the value of `[(g(101, 37))/(f(101, 37))]` is ______.
(Note P(x, y) is lattice point if x, y ∈ I)
(where [.] denotes greatest integer function)
