मराठी

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|) - Mathematics

Advertisements
Advertisements

प्रश्न

Give examples of two functions fN → Z and gZ → Z such that g o f is injective but gis not injective.

(Hint: Consider f(x) = x and g(x) =|x|)

Advertisements

उत्तर

Define fN → Z as f(x) = x and gZ → Z as g(x) =|x|.

We first show that g is not injective.

It can be observed that:

g(−1) = `|-1| = 1`

g(1) =  `|1| = 1`

∴ g(−1) = g(1), but −1 ≠ 1.

∴ g is not injective.

Now, gofN → Z is defined as

`gof(x) = g(f(x)) = g(x) = |x|`

Let xy ∈ N such that gof(x) = gof(y).

⇒ |x| = |y|

Since x and y ∈ N, both are positive.

`:. |x| = |y| => x = y`

Hence, gof is injective

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

APPEARS IN

एनसीईआरटी Mathematics Part 1 and 2 [English] Class 12
पाठ 1 Relations and Functions
Exercise 1.5 | Q 6 | पृष्ठ २९

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

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

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.


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


Let fR → be defined as f(x) = 10x + 7. Find the function gR → R such that g o f = f o = 1R.


Find the number of all onto functions from the set {1, 2, 3, ..., n} to itself.


Let S = {abc} 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)} 


Prove that the function f : N → N, defined by f(x) = x2 + x + 1, is one-one but not onto


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 : Q → Q, defined by f(x) = x3 + 1


Let A = [-1, 1]. Then, discuss whether the following function from A to itself is one-one, onto or bijective : `f (x) = x/2`


If f : R → R be the function defined by f(x) = 4x3 + 7, show that f is a bijection.


Find the number of all onto functions from the set A = {1, 2, 3, ..., n} to itself.


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


Find gof and fog when f : R → R and g : R → R is defined by  f(x) = x and g(x) = |x| .


Let f be a real function given by f (x)=`sqrt (x-2)`
Find each of the following:

(i) fof
(ii) fofof
(iii) (fofof) (38)
(iv) f2

Also, show that fof ≠ `f^2` .


 If f, g : R → R be two functions defined as f(x) = |x| + x and g(x) = |x|- x, ∀x∈R" .Then find fog and gof. Hence find fog(–3), fog(5) and gof (–2).


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 → (0, 2) defined by `f (x) =(e^x - e^(x))/(e^x +e^(-x))+1`is invertible , find f-1.


If A = {1, 2, 3, 4} and B = {abcd}, define any four bijections from A to B. Also give their inverse functions.


Let f  be a function from C (set of all complex numbers) to itself given by f(x) = x3. Write f−1 (−1).


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


Let f : R → Rg : R → R be two functions defined by f(x) = x2 + x + 1 and g(x) = 1 − x2. Write fog (−2).


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


Write the domain of the real function

`f (x) = sqrtx - [x] .`


Write the domain of the real function

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


Let

\[f : R \to R\]  be a function defined by

\[f\left( x \right) = \frac{e^{|x|} - e^{- x}}{e^x + e^{- x}} . \text{Then},\]
 

Let

\[f : R \to R\]
\[f\left( x \right) = \frac{x^2 - 8}{x^2 + 2}\]
Then,  f is


Let the function f: R → R be defined by f(x) = 4x – 1, ∀ x ∈ R. Then, show that f is one-one.


Let f: R → R be the function defined by f(x) = 4x – 3 ∀ x ∈ R. Then write f–1 


Consider the set A containing n elements. Then, the total number of injective functions from A onto itself is ______


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 X = {1, 2, 3}and Y = {4, 5}. Find whether the following subset of X ×Y are function from X to Y or not

k = {(1,4), (2, 5)}


Let A = {0, 1} and N be the set of natural numbers. Then the mapping f: N → A defined by f(2n – 1) = 0, f(2n) = 1, ∀ n ∈ N, is onto.


The smallest integer function f(x) = [x] is ____________.


Let f : R → R be defind by f(x) = `1/"x"  AA  "x" in "R".` Then f is ____________.


Range of `"f"("x") = sqrt((1 - "cos x") sqrt ((1 - "cos x")sqrt ((1 - "cos x")....infty))`


'If 'f' is a linear function satisfying f[x + f(x)] = x + f(x), then f(5) can be equal to:


Prove that the function f is surjective, where f: N → N such that `f(n) = {{:((n + 1)/2",", if "n is odd"),(n/2",", if  "n is even"):}` Is the function injective? Justify your answer.


For x ∈ R, x ≠ 0, let f0(x) = `1/(1 - x)` and fn+1 (x) = f0(fn(x)), n = 0, 1, 2, .... Then the value of `f_100(3) + f_1(2/3) + f_2(3/2)` is equal to ______.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×