Advertisements
Advertisements
प्रश्न
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.
Advertisements
उत्तर
A and B are two non empty sets.
Let f be a function from A to B.
It is given that there is injective map from A to B.
That means f is one−one function .
It is also given that there is injective map from B to A .
That means every element of set B has its image in set A.
⇒ f is onto function or surjective.
∴ f is bijective.
(If a function is both injective and surjective, then the function is bijective.)
APPEARS IN
संबंधित प्रश्न
Let A = R – {3} and B = R – {1}. Consider the function f : A → B defined by f(x) = `((x - 2)/(x - 3))`. Is f one-one and onto? Justify your answer.
If the function `f(x) = sqrt(2x - 3)` is invertible then find its inverse. Hence prove that `(fof^(-1))(x) = x`
Which of the following functions from A to B are one-one and onto?
f2 = {(2, a), (3, b), (4, c)} ; A = {2, 3, 4}, B = {a, b, c}
Classify the following function as injection, surjection or bijection :
f : Z → Z, defined by f(x) = x2 + x
Give examples of two surjective functions f1 and f2 from Z to Z such that f1 + f2 is not surjective.
Find gof and fog when f : R → R and g : R → R is defined by f(x) = x and g(x) = |x| .
Let f = {(3, 1), (9, 3), (12, 4)} and g = {(1, 3), (3, 3) (4, 9) (5, 9)}. Show that gof and fog are both defined. Also, find fog and gof.
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
Find f −1 if it exists : f : A → B, where A = {0, −1, −3, 2}; B = {−9, −3, 0, 6} and f(x) = 3 x.
Consider f : {1, 2, 3} → {a, b, c} and g : {a, b, c} → {apple, ball, cat} defined as f (1) = a, f (2) = b, f (3) = c, g (a) = apple, g (b) = ball and g (c) = cat. Show that f, g and gof are invertible. Find f−1, g−1 and gof−1and show that (gof)−1 = f −1o g−1
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.
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.
Let f : R → R, g : R → R be two functions defined by f(x) = x2 + x + 1 and g(x) = 1 − x2. Write fog (−2).
Let f : R → R be defined as `f (x) = (2x - 3)/4.` write fo f-1 (1) .
Write the domain of the real function
`f (x) = sqrtx - [x] .`
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},\]
Let
\[A = \left\{ x \in R : - 1 \leq x \leq 1 \right\} = B\] Then, the mapping\[f : A \to \text{B given by} f\left( x \right) = x\left| x \right|\] is
Let f be an injective map with domain {x, y, z} and range {1, 2, 3}, such that exactly one of the following statements is correct and the remaining are false.
\[f\left( x \right) = 1, f\left( y \right) \neq 1, f\left( z \right) \neq 2 .\]
The value of
\[f^{- 1} \left( 1 \right)\] is
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|\]
If a function\[f : [2, \infty )\text{ to B defined by f}\left( x \right) = x^2 - 4x + 5\] is a bijection, then B =
\[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\left( x \right) = \frac{1}{1 - x} . \text{Then}, \left\{ f o \left( fof \right) \right\} \left( x \right)\]
Let f: R → R be defined by f(x) = 3x – 4. Then f–1(x) is given by ______.
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 D be the domain of the real valued function f defined by f(x) = `sqrt(25 - x^2)`. Then, write D
Let the function f: R → R be defined by f(x) = cosx, ∀ x ∈ R. Show that f is neither one-one nor onto
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)}
Using the definition, prove that the function f: A→ B is invertible if and only if f is both one-one and onto
Which of the following functions from Z into Z are bijections?
Let A = R – {3}, B = R – {1}. Let f : A → B be defined by `"f"("x") = ("x" - 2)/("x" - 3)` Then, ____________.
The function f : R → R given by f(x) = x3 – 1 is ____________.
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?
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 know among those relations, how many functions can be formed from B to G?
Raji visited the Exhibition along with her family. The Exhibition had a huge swing, which attracted many children. Raji found that the swing traced the path of a Parabola as given by y = x2.
Answer the following questions using the above information.
- The function f: Z → Z defined by f(x) = x2 is ____________.
Let f: R → R defined by f(x) = 3x. Choose the correct answer
Let f: R→R be a polynomial function satisfying f(x + y) = f(x) + f(y) + 3xy(x + y) –1 ∀ x, y ∈ R and f'(0) = 1, then `lim_(x→∞)(f(2x))/(f(x)` is equal to ______.
Let f(x) = ax (a > 0) be written as f(x) = f1(x) + f2(x), where f1(x) is an even function and f2(x) is an odd function. Then f1(x + y) + f1(x – y) equals ______.
Let S = {1, 2, 3, 4, 5, 6, 7}. Then the number of possible functions f: S `rightarrow` S such that f(m.n) = f(m).f(n) for every m, n ∈ S and m.n ∈ S is equal to ______.
The function f(x) = [x], where [x] denotes the greatest integer less than or equal to x; is continuous at ______.
A function is called one-one if different elements of the domain have:
