Advertisements
Advertisements
प्रश्न
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.
Advertisements
उत्तर
Proving f is a bijection :
f = {(a, v), (b, u), (c, w)} and f : A → B
Injectivity of f: No two elements of A have the same image in B.
So, f is one-one.
Surjectivity of f: Co-domain of f = {u v, w}
Range of f = {u v, w}
Both are same.
So, f is onto.
Hence, f is a bijection.
Proving g is a bijection :
g = {(u, b), (v, a), (w, c)} and g : B → A
Injectivity of g: No two elements of B have the same image in A.
So, g is one-one.
Surjectivity of g: Co-domain of g = {a, b, c}
Range of g = {a, b, c}
Both are the same.
So, g is onto.
Hence, g is a bijection.
Finding fog :
Co-domain of g is same as the domain of f.
So, fog exists and fog : {u v, w} → {u v, w}
(fog) (u) = f (g (u)) = f (b) = u
(fog) (v) = f (g (v)) = f (a) = v
(fog) (w) = f (g (w)) = f (c) = w
So, fog = { (u, u), (v, v), (w, w) }
Finding gof :
Co-domain of f is same as the domain of g.
So, fog exists and gof : {a, b, c} → {a, b, c}
(gof) (a) = g (f (a)) = g (v) = a
(gof) (b) = g (f (b)) = g (u) = b
(gof) (c) = g (f (c)) = g (w) = c
So, gof = { (a, a), (b, b), (c, c) }
APPEARS IN
संबंधित प्रश्न
Check the injectivity and surjectivity of the following function:
f : N → N given by f(x) = x3
Let f : R → R be defined as f(x) = 3x. Choose the correct answer.
Find the number of all onto functions from the set {1, 2, 3, ..., n} to itself.
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 one-one but not onto ?
Show that f : R→ R, given by f(x) = x — [x], is neither one-one nor onto.
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]
Verify associativity for the following three mappings : f : N → Z0 (the set of non-zero integers), g : Z0 → Q and h : Q → R given by f(x) = 2x, g(x) = 1/x and h(x) = ex.
Consider f : N → N, g : N → N and h : N → R defined as f(x) = 2x, g(y) = 3y + 4 and h(z) = sin z for all x, y, z ∈ N. Show that ho (gof) = (hog) of.
Find fog and gof if : f(x) = `x^2` + 2 , g (x) = 1 − `1/ (1-x)`.
If f(x) = 2x + 5 and g(x) = x2 + 1 be two real functions, then describe each of the following functions:
(1) fog
(2) gof
(3) fof
(4) f2
Also, show that fof ≠ f2
If f, g : R → R be two functions defined as f(x) = |x| + x and g(x) = |x|- x, ∀x∈R" .Then find fog and gof. Hence find fog(–3), fog(5) and gof (–2).
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.
Let A = R - {3} and B = R - {1}. Consider the function f : A → B defined by f(x) = `(x-2)/(x-3).`Show that f is one-one and onto and hence find f-1.
[CBSE 2012, 2014]
If A = {1, 2, 3, 4} and B = {a, b, c, d}, define any four bijections from A to B. Also give their inverse functions.
If f : R → R, g : R → are given by f(x) = (x + 1)2 and g(x) = x2 + 1, then write the value of fog (−3).
The function f : R → R defined by
`f (x) = 2^x + 2^(|x|)` is
Which of the following functions form Z to itself are bijections?
Let
\[A = \left\{ x : - 1 \leq x \leq 1 \right\} \text{and} f : A \to \text{A such that f}\left( x \right) = x|x|\]
\[f : Z \to Z\] be given by
` f (x) = {(x/2, ", if x is even" ) ,(0 , ", if x is odd "):}`
Then, f 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
Let
\[A = \left\{ x \in R : x \leq 1 \right\} and f : A \to A\] be defined as
\[f\left( x \right) = x \left( 2 - x \right)\] Then,
\[f^{- 1} \left( x \right)\] is
If \[F : [1, \infty ) \to [2, \infty )\] is given by
\[f\left( x \right) = x + \frac{1}{x}, then f^{- 1} \left( x \right)\]
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:
Let A = {1, 2, ... , n} and B = {a, b}. Then the number of subjections from A into B is
Let A = ℝ − {3}, B = ℝ − {1}. Let f : A → B be defined by \[f\left( x \right) = \frac{x - 2}{x - 3}, \forall x \in A\] Show that f is bijective. Also, find
(i) x, if f−1(x) = 4
(ii) f−1(7)
Let f, g: R → R be two functions defined as f(x) = |x| + x and g(x) = x – x ∀ x ∈ R. Then, find f o g and g o f
Let f: R → R be defined by f(x) = x2 + 1. Then, pre-images of 17 and – 3, respectively, are ______.
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}
The function f : R → R defined by f(x) = 3 – 4x is ____________.
Given a function If as f(x) = 5x + 4, x ∈ R. If g : R → R is inverse of function ‘f then
Students of Grade 9, planned to plant saplings along straight lines, parallel to each other to one side of the playground ensuring that they had enough play area. Let us assume that they planted one of the rows of the saplings along the line y = x − 4. Let L be the set of all lines which are parallel on the ground and R be a relation on L.
Answer the following using the above information.
- The function f: R → R defined by f(x) = x − 4 is ____________.
Students of Grade 9, planned to plant saplings along straight lines, parallel to each other to one side of the playground ensuring that they had enough play area. Let us assume that they planted one of the rows of the saplings along the line y = x − 4. Let L be the set of all lines which are parallel on the ground and R be a relation on L.
Answer the following using the above information.
- Let f: R → R be defined by f(x) = x − 4. Then the range of f(x) is ____________.
For x ∈ R, x ≠ 0, let f0(x) = `1/(1 - x)` and fn+1 (x) = f0(fn(x)), n = 0, 1, 2, .... Then the value of `f_100(3) + f_1(2/3) + f_2(3/2)` is equal to ______.
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.
A function is called many-one if two or more different elements of the domain have:
A function is called into if:
A perfect one-to-one matching between users and unique IDs is similar to:
