Advertisements
Advertisements
प्रश्न
Using the definition, prove that the function f: A→ B is invertible if and only if f is both one-one and onto
Advertisements
उत्तर
Let f: A → B be many-one function.
Let f(a) = p and f(b) = p
So, for inverse function we will have f-1(p) = a and f-1(p) = b
Thus, in this case inverse function is not defined as we have two images ‘a and b’ for one pre-image ‘p’.
But for f to be invertible it must be one-one.
Now, let f: A → B is not onto function.
Let B = {p, q, r} and range of f be {p, q}.
Here image ‘r’ has not any pre-image, which will have no image in set A.
And for f to be invertible it must be onto.
Thus, ‘f’ is invertible if and only if ‘f’ is both one-one and onto.
A function f = X → Y is invertible iff f is a bijective function.
APPEARS IN
संबंधित प्रश्न
Prove that the greatest integer function f : R → R, given by f(x) = [x], is neither one-one nor onto, where [x] denotes the greatest integer less than or equal to x.
Give examples of two functions f: N → Z and g: Z → Z such that g o f is injective but gis not injective.
(Hint: Consider f(x) = x and g(x) =|x|)
Let S = {a, b, c} and T = {1, 2, 3}. Find F−1 of the following functions F from S to T, if it exists.
F = {(a, 2), (b, 1), (c, 1)}
Let A = {–1, 0, 1, 2}, B = {–4, –2, 0, 2} and f, g : A → B be functions defined by f(x) = x2 – x, x ∈ A and g(x) = `2|x - 1/2| – 1`, x ∈ A. Are f and g equal?
Justify your answer. (Hint: One may note that two functions f : A → B and g : A → B such that f(a) = g(a) ∀ a ∈ A are called equal functions.)
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = 5x3 + 4
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = 3 − 4x
State with reason whether the following functions have inverse :
g : {5, 6, 7, 8} → {1, 2, 3, 4} with g = {(5, 4), (6, 3), (7, 4), (8, 2)}
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 A = {a, b, c} and B = {−2, −1, 0, 1, 2}, write the total number of one-one functions from A to B.
What is the range of the function
`f (x) = ([x - 1])/(x -1) ?`
Let the function
\[f : R - \left\{ - b \right\} \to R - \left\{ 1 \right\}\]
\[f\left( x \right) = \frac{x + a}{x + b}, a \neq b .\text{Then},\]
The function
f : A → B defined by
f (x) = - x2 + 6x - 8 is a bijection if
Let M be the set of all 2 × 2 matrices with entries from the set R of real numbers. Then, the function f : M→ R defined by f(A) = |A| for every A ∈ M, is
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 ) :}`
\[f : Z \to Z\] be given by
` f (x) = {(x/2, ", if x is even" ) ,(0 , ", if x is odd "):}`
Then, f 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 the function
\[f : R \to R\] be such that
\[f\left( x \right) = x - \left[ x \right]\] where [x] denotes the greatest integer less than or equal to x, then \[f^{- 1} \left( x \right)\]
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 : [2, \infty ) \to X\] be defined by
\[f\left( x \right) = 4x - x^2\] Then, f is invertible if X =
If \[f : R \to \left( - 1, 1 \right)\] is defined by
\[f\left( x \right) = \frac{- x|x|}{1 + x^2}, \text{ then } f^{- 1} \left( x \right)\] equals
If \[f : R \to R\] is given by \[f\left( x \right) = x^3 + 3, \text{then} f^{- 1} \left( x \right)\] is equal to
Let f: R → R be the function defined by f(x) = 4x – 3 ∀ x ∈ R. Then write f–1
Let A be a finite set. Then, each injective function from A into itself is not surjective.
Let f: R → R be the function defined by f(x) = 2x – 3 ∀ x ∈ R. write f–1
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
g = {(1, 4), (2, 4), (3, 4)}
Let g(x) = x2 – 4x – 5, then ____________.
A general election of Lok Sabha is a gigantic exercise. About 911 million people were eligible to vote and voter turnout was about 67%, the highest ever
Let I be the set of all citizens of India who were eligible to exercise their voting right in the general election held in 2019. A relation ‘R’ is defined on I as follows:
R = {(V1, V2) ∶ V1, V2 ∈ I and both use their voting right in the general election - 2019}
- Mr. ’X’ and his wife ‘W’ both exercised their voting right in the general election-2019, Which of the following is true?
A general election of Lok Sabha is a gigantic exercise. About 911 million people were eligible to vote and voter turnout was about 67%, the highest ever
Let I be the set of all citizens of India who were eligible to exercise their voting right in the general election held in 2019. A relation ‘R’ is defined on I as follows:
R = {(V1, V2) ∶ V1, V2 ∈ I and both use their voting right in the general election - 2019}
- Three friends F1, F2, and F3 exercised their voting right in general election-2019, then which of the following is true?
If `f : R -> R^+ U {0}` be defined by `f(x) = x^2, x ∈ R`. The mapping is
Difference between the greatest and least value of f(x) = `(1 + (cos^-1x)/π)^2 - (1 + (sin^-1x)/π)^2` is ______.
Let f(1, 3) `rightarrow` R be a function defined by f(x) = `(x[x])/(1 + x^2)`, where [x] denotes the greatest integer ≤ x, Then the range of f is ______.
If A = {x ∈ R: |x – 2| > 1}, B = `{x ∈ R : sqrt(x^2 - 3) > 1}`, C = {x ∈ R : |x – 4| ≥ 2} and Z is the set of all integers, then the number of subsets of the set (A ∩ B ∩ C) C ∩ Z 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.
Let A = R – {2} and B = R – {1}. If f: A `→` B is a function defined by f(x) = `(x - 1)/(x - 2)` then show that f is a one-one and an onto function.
A function is onto when every element of the codomain has:
For \(f(x)=x^2+x\), if \(y=1\), which two domain elements have the same image?
Let \(X=\{-1,2,5,8,11\}\), \(Y=\{4,6,8\}\), and suppose different elements \(2,5,8\) of \(X\) have the same image \(4\). What type of function is it with respect to the one-one property?
A perfect one-to-one matching between users and unique IDs is similar to:
