Advertisements
Advertisements
Question
Give examples of two surjective functions f1 and f2 from Z to Z such that f1 + f2 is not surjective.
Advertisements
Solution
We know that f1: R → R, given by f1(x) = x, and f2(x) = -x are surjective functions.
Proving f1 is surjective :
Let y be an element in the co-domain (R), such that f1(x) = y.
f1(x) = y
⇒ x = y, which is in R.
So, for every element in the co-domain, there exists some pre-image in the domain.
So, f1is surjective .
Proving f2 is surjective :Let f2(x) = f2(y)−x =−yx = y
Let y be an element in the co domain (R) such that f2(x) = y.
f2(x) = y
⇒ x = y, which is in R.
So, for every element in the co-domain, there exists some pre-image in the domain.
So, f2 is surjective .
Proving (f1 + f2) is not surjective :
Given:
(f1 + f2) (x) = f1 (x) + f2 (x)= x + (-x) =0
So, for every real number x, (f1 + f2) (x)=0
So, the image of every number in the domain is same as 0.
⇒ Range = {0}
Co-domain = R
So, both are not same.
So, f1 + f2 is not surjective.
APPEARS IN
RELATED QUESTIONS
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.
Let f : R → R be defined as f(x) = 3x. Choose the correct answer.
Give an example of a function which is one-one but not onto ?
Give an example of a function which is not one-one but onto ?
Give an example of a function which is neither one-one nor onto ?
Which of the following functions from A to B are one-one and onto?
f1 = {(1, 3), (2, 5), (3, 7)} ; A = {1, 2, 3}, B = {3, 5, 7}
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = x3 + 1
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
Let A = {1, 2, 3}. Write all one-one from A to itself.
Show that if f1 and f2 are one-one maps from R to R, then the product f1 × f2 : R → R defined by (f1 × f2) (x) = f1 (x) f2 (x) need not be one - one.
Find gof and fog when f : R → R and g : R → R is defined by f(x) = 2x + 3 and g(x) = x2 + 5 .
Find fog and gof if : f (x) = |x|, g (x) = sin x .
Find fog and gof if : f(x) = `x^2` + 2 , g (x) = 1 − `1/ (1-x)`.
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).
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)}
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.
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.
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)}.
If A = {1, 2, 3} and B = {a, b}, write the total number of functions from A to B.
Let \[f : \left[ - \frac{\pi}{2}, \frac{\pi}{2} \right] \to\] A be defined by f(x) = sin x. If f is a bijection, write set A.
If the mapping f : {1, 3, 4} → {1, 2, 5} and g : {1, 2, 5} → {1, 3}, given by f = {(1, 2), (3, 5), (4, 1)} and g = {(2, 3), (5, 1), (1, 3)}, then write fog. [NCERT EXEMPLAR]
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 A = {a, b, c, d} and f = {a, b), (b, d), (c, a), (d, c)}, show that f is one-one from A onto A. Find f–1
Let A = {1, 2, 3, ...n} and B = {a, b}. Then the number of surjections from A into B is ______.
Which of the following functions from Z into Z is bijective?
Let f : R → R, g : R → R be two functions such that f(x) = 2x – 3, g(x) = x3 + 5. The function (fog)-1 (x) is equal to ____________.
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. Based on the given information, f is best defined as:
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?
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 ____________.
If `f : R -> R^+ U {0}` be defined by `f(x) = x^2, x ∈ R`. The mapping is
If f; R → R f(x) = 10x + 3 then f–1(x) is:
`x^(log_5x) > 5` implies ______.
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 ______.
The given function f : R → R is not ‘onto’ function. Give reason.
A function is called one-one if different elements of the domain have:
If every seat in a classroom is occupied by one student, the situation resembles:
A perfect one-to-one matching between users and unique IDs is similar to:
Which condition represents a one-one (injective) function?
