Advertisements
Advertisements
प्रश्न
If f : A → A, g : A → A are two bijections, then prove that fog is a surjection ?
Advertisements
उत्तर
Given: A → A, g : A → A are two bijections.
Then, fog : A → A
Surjectivity of fog:
Let z be an element in the co-domain of fog (A).
Now, z ∈ A (co-domain of f) and f is a surjection.
So, z = f(y), where y ∈ A (domain of f) ...(1)
Now, y∈A (co-domain of g) and g is a surjection.So, y=g(x), where x∈A (domain of g) ...(2)
From (1) and (2),
z = f (y) = f (g (x)) = (fog) (x), where x ∈ A (domain of fog)
So, fog is a surjection.
APPEARS IN
संबंधित प्रश्न
Show that the function f : R* → R* defined by f(x) = `1/x` is one-one and onto, where R* is the set of all non-zero real numbers. Is the result true, if the domain R* is replaced by N with co-domain being same as R?
Show that the signum function f : R → R, given by
`f(x) = {(1", if" x > 0), (0", if" x = 0), (-1", if" x < 0):}`
is neither one-one nor onto.
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. Show that f is one-one.
Let f: R → R be defined as f(x) = 10x + 7. Find the function g: R → R such that g o f = f o g = 1R.
Show that the function f : R → R given by f(x) = x3 is injective.
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 A = {−1, 0, 1} and f = {(x, x2) : x ∈ A}. Show that f : A → A is neither one-one nor onto.
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) = x3 − x
Classify the following function as injection, surjection or bijection :
f : Q → Q, defined by f(x) = x3 + 1
If f : A → B is an injection, such that range of f = {a}, determine the number of elements in A.
Show that the exponential function f : R → R, given by f(x) = ex, is one-one but not onto. What happens if the co-domain is replaced by`R0^+` (set of all positive real numbers)?
Find the number of all onto functions from the set A = {1, 2, 3, ..., n} to itself.
If f : A → B and g : B → C are one-one functions, show that gof is a one-one function.
Let f be a function from R to R, such that f(x) = cos (x + 2). Is f invertible? Justify your answer.
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 : A → A, g : A → A are two bijections, then prove that fog is an injection ?
Let f be a function from C (set of all complex numbers) to itself given by f(x) = x3. Write f−1 (−1).
\[f : R \to R \text{given by} f\left( x \right) = x + \sqrt{x^2} \text{ is }\]
The function \[f : R \to R\] defined by
\[f\left( x \right) = 6^x + 6^{|x|}\] is
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
A function f: R→ R defined by f(x) = `(3x) /5 + 2`, x ∈ R. Show that f is one-one and onto. Hence find f−1.
Let f: R → R be the function defined by f(x) = 2x – 3 ∀ x ∈ R. write f–1
Let A = [–1, 1]. Then, discuss whether the following functions defined on A are one-one, onto or bijective:
f(x) = `x/2`
Let A = [–1, 1]. Then, discuss whether the following functions defined on A are one-one, onto or bijective:
h(x) = x|x|
Which of the following functions from Z into Z are bijections?
The function f : R → R defined by f(x) = 3 – 4x is ____________.
If N be the set of all-natural numbers, consider f: N → N such that f(x) = 2x, ∀ x ∈ N, then f is ____________.
A function f: x → y is said to be one – one (or injective) if:
Let n(A) = 4 and n(B) = 6, Then the number of one – one functions from 'A' to 'B' is:
Let the function f: R → R be defined by f(x) = 4x – 1, ∀ x ∈ R then 'f' is
Difference between the greatest and least value of f(x) = `(1 + (cos^-1x)/π)^2 - (1 + (sin^-1x)/π)^2` is ______.
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 ______.
Let A = {1, 2, 3, ..., 10} and f : A `rightarrow` A be defined as
f(k) = `{{:(k + 1, if k "is odd"),( k, if k "is even"):}`.
Then the number of possible functions g : A `rightarrow` A such that gof = f is ______.
Which one of the following graphs is a function of x?
![]() |
![]() |
| Graph A | Graph B |
For \(f:\mathbb{R}\to\mathbb{R}\) defined by \(f(x)=1+x^2\), which statement is correct?
Many students choosing the same favourite subject resembles which type of function?


