English

Let C be the set of complex numbers. Prove that the mapping f: C → R given by f(z) = |z|, ∀ z ∈ C, is neither one-one nor onto.

Advertisements
Advertisements

Question

Let C be the set of complex numbers. Prove that the mapping f: C → R given by f(z) = |z|, ∀ z ∈ C, is neither one-one nor onto.

Sum
Advertisements

Solution

Given, f: C → R such that f(z) = |z|, ∀ z ∈ C

Now, let take z = 6 + 8i

Then,

f(6 + 8i) = |6 + 8i|

= `sqrt(6^2 + 8^2)` 

= `sqrt(100)`

= 10

And, for z = 6 – 8i

f(6 – 8i) = |6 – 8i|

= `sqrt(6^2 - 8^2)` 

= `sqrt(100)`

= 10

Hence, f(z) is many-one.

Also, |z| ≥ 0, ∀ z ∈ C

But the co-domain given is ‘R’

Therefore, f(z) is not onto.

shaalaa.com
  Is there an error in this question or solution?
Chapter 1: Relations And Functions - Exercise [Page 11]

APPEARS IN

NCERT Exemplar Mathematics Exemplar [English] Class 12
Chapter 1 Relations And Functions
Exercise | Q 10 | Page 11

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 S = {a, b, c} and T = {1, 2, 3}. Find F−1 of the following functions F from S to T, if it exists.

F = {(a, 3), (b, 2), (c, 1)} 


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

 f2 = {(2, a), (3, b), (4, c)} ; A = {2, 3, 4}, B = {a, b, c}


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|


If f : A → B is an injection, such that range of f = {a}, determine the number of elements in A.


Show that the function f : R − {3} → R − {2} given by f(x) = `(x-2)/(x-3)` is a bijection.


Verify associativity for the following three mappings : f : N → Z0 (the set of non-zero integers), g : Z0 → Q and h : Q → R given by f(x) = 2x, g(x) = 1/x and h(x) = ex.


Find fog and gof  if : f(x) = c, c ∈ R, g(x) = sin `x^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 : A → A, g : A → A are two bijections, then prove that fog is an injection ?


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


If f : R → R is defined by f(x) = 10 x − 7, then write f−1 (x).


If f : R → R defined by f(x) = 3x − 4 is invertible, then write f−1 (x).


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.


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


Write the domain of the real function

`f (x) = 1/(sqrt([x] - x)`.


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


Which of the following functions from

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

 


If \[g \left( f \left( x \right) \right) = \left| \sin x \right| \text{and} f \left( g \left( x \right) \right) = \left( \sin \sqrt{x} \right)^2 , \text{then}\]

 


The inverse of the function

\[f : R \to \left\{ x \in R : x < 1 \right\}\] given by

\[f\left( x \right) = \frac{e^x - e^{- x}}{e^x + e^{- x}}\] is 

 


If the function

\[f : R \to R\]  be such that

\[f\left( x \right) = x - \left[ x \right]\] where [x] denotes the greatest integer less than or equal to x, then \[f^{- 1} \left( x \right)\]

 


 Let
\[g\left( x \right) = 1 + x - \left[ x \right] \text{and} f\left( x \right) = \begin{cases}- 1, & x < 0 \\ 0, & x = 0, \\ 1, & x > 0\end{cases}\] where [x] denotes the greatest integer less than or equal to x. Then for all \[x, f \left( g \left( x \right) \right)\] is equal to


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


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.


If f: R → R is defined by f(x) = x2 – 3x + 2, write f(f (x))


Using the definition, prove that the function f: A→ B is invertible if and only if f is both one-one and onto


Let A = {1, 2, 3, ...n} and B = {a, b}. Then the number of surjections from A into B is ______.


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


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


The number of bijective functions from set A to itself when A contains 106 elements 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?

Students of Grade 9, planned to plant saplings along straight lines, parallel to each other to one side of the playground ensuring that they had enough play area. Let us assume that they planted one of the rows of the saplings along the line y = x − 4. Let L be the set of all lines which are parallel on the ground and R be a relation on L.

Answer the following using the above information.

  • The function f: R → R defined by f(x) = x − 4 is ____________.

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


Consider a function f: `[0, pi/2] ->` R, given by f(x) = sinx and `g[0, pi/2] ->` R given by g(x) = cosx then f and g are


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 S = {1, 2, 3, 4, 5, 6, 7}. Then the number of possible functions f: S `rightarrow` S such that f(m.n) = f(m).f(n) for every m, n ∈ S and m.n ∈ S is equal to ______.


A function is a rule that assigns each element of one set to exactly how many elements of another set?


Many students choosing the same favourite subject resembles which type of function?


Which condition represents an onto (surjective) function?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×