मराठी

For sets A, B and C, let f: A → B, g: B → C be functions such that g o f is surjective. Then g is surjective.

Advertisements
Advertisements

प्रश्न

For sets A, B and C, let f: A → B, g: B → C be functions such that g o f is surjective. Then g is surjective.

पर्याय

  • True

  • False

MCQ
चूक किंवा बरोबर
Advertisements

उत्तर

This statement is True.

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 1: Relations And Functions - Solved Examples [पृष्ठ १०]

APPEARS IN

एनसीईआरटी एक्झांप्लर Mathematics Exemplar [English] Class 12
पाठ 1 Relations And Functions
Solved Examples | Q 33 | पृष्ठ १०

व्हिडिओ ट्यूटोरियलVIEW ALL [5]

संबंधित प्रश्‍न

Check the injectivity and surjectivity of the following function:

f : Z → Z given by f(x) = x3


Show that the function f : R → {x ∈ R : –1 < x < 1} defined by f(x) = `x/(1 + |x|)`, x ∈ R is one-one and onto function.


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) = 5x3 + 4


Set of ordered pair of  a function? If so, examine whether the mapping is injective or surjective :{(xy) : x is a person, y is the mother of x}


Find gof and fog when f : R → R and g : R → R is defined by  f(x) = 2x + x2 and  g(x) = x3


Let A = {abc}, B = {u vw} and let f and g be two functions from A to B and from B to A, respectively, defined as :
f = {(av), (bu), (cw)}, g = {(ub), (va), (wc)}.
Show that f and g both are bijections and find fog and gof.


Give examples of two functions f : N → Z and g : Z → Z, such that gof is injective but gis not injective.


If f : A → B and g : B → C are one-one functions, show that gof is a one-one function.


Find fog and gof  if : f (x) = |x|, g (x) = sin x .


Let  f  be any real function and let g be a function given by g(x) = 2x. Prove that gof = f + f.


Let A = R - {3} and B = R - {1}. Consider the function f : A → B defined by f(x) = `(x-2)/(x-3).`Show that f is one-one and onto and hence find f-1.

                    [CBSE 2012, 2014]


If f : R → (0, 2) defined by `f (x) =(e^x - e^(x))/(e^x +e^(-x))+1`is invertible , find f-1.


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.


Write the total number of one-one functions from set A = {1, 2, 3, 4} to set B = {abc}.


If f : R → Rg : R → are given by f(x) = (x + 1)2 and g(x) = x2 + 1, then write the value of fog (−3).


If f(x) = 4 −( x - 7)3 then write f-1 (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},\]

 


If a function\[f : [2, \infty )\text{ to B defined by f}\left( x \right) = x^2 - 4x + 5\] is a bijection, then B =


The function

\[f : R \to R\] defined by\[f\left( x \right) = \left( x - 1 \right) \left( x - 2 \right) \left( x - 3 \right)\]

(a) one-one but not onto
(b) onto but not one-one
(c) both one and onto
(d) neither one-one nor onto


A function f from the set of natural numbers to the set of integers defined by

\[f\left( n \right)\begin{cases}\frac{n - 1}{2}, & \text{when n is odd} \\ - \frac{n}{2}, & \text{when n is even}\end{cases}\]

 


Which of the following functions from

\[A = \left\{ x \in R : - 1 \leq x \leq 1 \right\}\]

 


Let  \[f\left( x \right) = \frac{1}{1 - x} . \text{Then}, \left\{ f o \left( fof \right) \right\} \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 R\] is given by \[f\left( x \right) = x^3 + 3, \text{then} f^{- 1} \left( x \right)\] is equal to

 


Mark the correct alternative in the following question:
If the set A contains 7 elements and the set B contains 10 elements, then the number one-one functions from A to B is


Let A = ℝ − {3}, B = ℝ − {1}. Let f : A → B be defined by \[f\left( x \right) = \frac{x - 2}{x - 3}, \forall x \in A\] Show that f is bijective. Also, find
(i) x, if f−1(x) = 4
(ii) f−1(7)


Which function is used to check whether a character is alphanumeric or not?


Let f, g: R → R be two functions defined as f(x) = |x| + x and g(x) = x – x ∀ x ∈ R. Then, find f o g and g o f


Let f: R → R be defined by f(x) = 3x – 4. Then f–1(x) is given by ______.


Are the following set of ordered pairs functions? If so, examine whether the mapping is injective or surjective.
{(x, y): x is a person, y is the mother of x}


Let f: R – `{3/5}` → R be defined by f(x) = `(3x + 2)/(5x - 3)`. Then ______.


Let f: `[2, oo)` → R be the function defined by f(x) = x2 – 4x + 5, then the range of f 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 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.

  • Let f: R → R be defined by f(x) = x2 is:

Let [x] denote the greatest integer ≤ x, where x ∈ R. If the domain of the real valued function f(x) = `sqrt((|[x]| - 2)/(|[x]| - 3)` is (–∞, a) ∪ [b, c) ∪ [4, ∞), a < b < c, then the value of a + b + c is ______.


The solution set of the inequation log1/3(x2 + x + 1) + 1 > 0 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.


Which condition represents an onto (surjective) function?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×