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
संबंधित प्रश्न
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 given by f(x) = x2
Classify the following function as injection, surjection or bijection : f : N → N given by f(x) = x3
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = |x|
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = sinx
Let A = [-1, 1]. Then, discuss whether the following function from A to itself is one-one, onto or bijective : `f (x) = x/2`
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 + x2 and g(x) = x3
Give examples of two functions f : N → Z and g : Z → Z, such that gof is injective but gis not injective.
Find fog and gof if : f(x)= x + 1, g (x) = 2x + 3 .
Let f, g, h be real functions given by f(x) = sin x, g (x) = 2x and h (x) = cos x. Prove that fog = go (fh).
Find f −1 if it exists : f : A → B, where A = {1, 3, 5, 7, 9}; B = {0, 1, 9, 25, 49, 81} and f(x) = x2
Let f : [−1, ∞) → [−1, ∞) be given by f(x) = (x + 1)2 − 1, x ≥ −1. Show that f is invertible. Also, find the set S = {x : f(x) = f−1 (x)}.
Let f be a function from C (set of all complex numbers) to itself given by f(x) = x3. Write f−1 (−1).
If f : C → C is defined by f(x) = x4, write f−1 (1).
If f : R → R is defined by f(x) = 10 x − 7, then write f−1 (x).
If f : R → R is defined by f(x) = 3x + 2, find f (f (x)).
Let A = {1, 2, 3}, B = {4, 5, 6, 7} and let f = {(1, 4), (2, 5), (3, 6)} be a function from A to B. State whether f is one-one or not.
Let\[A = \left\{ x \in R : - 1 \leq x \leq 1 \right\} = \text{B and C} = \left\{ x \in R : x \geq 0 \right\} and\]\[S = \left\{ \left( x, y \right) \in A \times B : x^2 + y^2 = 1 \right\} \text{and } S_0 = \left\{ \left( x, y \right) \in A \times C : x^2 + y^2 = 1 \right\}\]
Then,
The function \[f : [0, \infty ) \to \text {R given by } f\left( x \right) = \frac{x}{x + 1} is\]
Let \[f\left(x\right) = x^3\] be a function with domain {0, 1, 2, 3}. Then domain of \[f^{-1}\] is ______.
Let
\[f : R \to R\] be given by \[f\left( x \right) = x^2 - 3\] Then, \[f^{- 1}\] is given by
The domain of the function f: R → R defined by f(x) = `sqrt(x^2 - 3x + 2)` 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
h = {(1,4), (2, 5), (3, 5)}
Let X = {-1, 0, 1}, Y = {0, 2} and a function f : X → Y defiend by y = 2x4, is ____________.
The function f: R → R defined as f(x) = x3 is:
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?
Function f: R → R, defined by f(x) = `x/(x^2 + 1)` ∀ x ∈ R is not
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.
If log102 = 0.3010.log103 = 0.4771 then the number of ciphers after decimal before a significant figure comes in `(5/3)^-100` is ______.
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)
Let a function `f: N rightarrow N` be defined by
f(n) = `{:[(2n",", n = 2"," 4"," 6"," 8","......),(n - 1",", n = 3"," 7"," 11"," 15","......),((n + 1)/2",", n = 1"," 5"," 9"," 13","......):}`
then f 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 ______.
The function f(x) = [x], where [x] denotes the greatest integer less than or equal to x; is continuous at ______.
A function is onto when every element of the codomain has:
Which condition represents an onto (surjective) function?
