मराठी

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}

Advertisements
Advertisements

प्रश्न

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}

बेरीज
Advertisements

उत्तर

 f = {(xy) : x is a person, y is the mother of x}

As, for each element x in domain set, there is a unique related element y in co-domain set.

So, f is the function.

Injection test:
As, y can be mother of two or more persons
So, f is not injective.

Surjection test :

For every mother y defined by (xy), there exists a person x for whom y is mother.
So, f is surjective.
Therefore, f is surjective function.

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 2: Functions - Exercise 2.1 [पृष्ठ ३२]

APPEARS IN

आर.डी. शर्मा Mathematics Volume 1 and 2 [English] Class 12
पाठ 2 Functions
Exercise 2.1 | Q 9.1 | पृष्ठ ३२

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

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

Check the injectivity and surjectivity of the following function:

f : R → R given by f(x) = x2


In the following case, state whether the function is one-one, onto or bijective. Justify your answer.

f : R → R defined by f(x) = 1 + x2


 Which of the following functions from A to B are one-one and onto ?  

f3 = {(ax), (bx), (cz), (dz)} ; A = {abcd,}, B = {xyz}. 


Classify the following function as injection, surjection or bijection : f : N → N given by f(x) = x2


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 : R → R, defined by f(x) = 3 − 4x


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) = x and g(x) = |x| .


Let f : R → R and g : R → R be defined by f(x) = x2 and g(x) = x + 1. Show that fog ≠ gof.


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^2` + 2 , g (x) = 1 − `1/ (1-x)`.


Let f(x) = x2 + x + 1 and g(x) = sin x. Show that fog ≠ gof.


Let

f (x) =`{ (1 + x, 0≤ x ≤ 2) , (3 -x , 2 < x ≤ 3):}`

Find fof.


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 A = {1, 2, 3, 4}; B = {3, 5, 7, 9}; C = {7, 23, 47, 79} and f : A → Bg : B → C be defined as f(x) = 2x + 1 and g(x) = x2 − 2. Express (gof)−1 and f−1 og−1 as the sets of ordered pairs and verify that (gof)−1 = f−1 og−1.


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


If f : A → Ag : A → A are two bijections, then prove that fog is a surjection ?


Which of the following graphs represents a one-one function?


If A = {abc} and B = {−2, −1, 0, 1, 2}, write the total number of one-one functions from A to B.


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


Let f : R − {−1} → R − {1} be given by\[f\left( x \right) = \frac{x}{x + 1} . \text{Write } f^{- 1} \left( x \right)\]


Let A = {1, 2, 3, 4} and B = {ab} be two sets. Write the total number of onto functions from A to B.


\[f : R \to R \text{given by} f\left( x \right) = x + \sqrt{x^2} \text{ is }\]

 

 


The function 

f : A → B defined by 

f (x) = - x2 + 6x - 8 is a bijection if 

 

 

 

 


Let

f : R → R be given by

\[f\left( x \right) = \left[ x^2 \right] + \left[ x + 1 \right] - 3\]

where [x] denotes the greatest integer less than or equal to x. Then, f(x) is
 


(d) one-one and onto


If \[f : R \to R is given by f\left( x \right) = 3x - 5, then f^{- 1} \left( x \right)\] 

 


If  \[f : R \to \left( - 1, 1 \right)\] is defined by

\[f\left( x \right) = \frac{- x|x|}{1 + x^2}, \text{ then } f^{- 1} \left( x \right)\] equals

 


Mark the correct alternative in the following question:

Let f : → R be given by f(x) = tanx. Then, f-1(1) is

 

 


Let R be the set of real numbers and f: R → R be the function defined by f(x) = 4x + 5. Show that f is invertible and find f–1.


Set A has 3 elements and the set B has 4 elements. Then the number of injective mappings that can be defined from A to B 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 f: R → R be the function defined by f(x) = 2x – 3 ∀ x ∈ R. write f–1 


Which of the following functions from Z into Z are bijections?


Let f : [0, ∞) → [0, 2] be defined by `"f" ("x") = (2"x")/(1 + "x"),` then f is ____________.


Let f: R → R defined by f(x) = 3x. Choose the correct answer


A function f: x → y is said to be one – one (or injective) if:


If f: [0, 1]→[0, 1] is defined by f(x) = `(x + 1)/4` and `d/(dx) underbrace(((fofof......of)(x)))_("n"  "times")""|_(x = 1/2) = 1/"m"^"n"`, m ∈ N, then the value of 'm' is ______.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×