Advertisements
Advertisements
प्रश्न
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.
Advertisements
उत्तर
We know that f1: R → R, given by f1(x) = x, and f2(x) = x are one-one.
Proving f1 is one-one:
Let x and y be two elements in the domain R, such that
f1(x) = f1(y)
⇒ x = y
So, f1 is one-one.
Proving f2 is one-one:
Let x and y be two elements in the domain R, such that
f2(x) = f2(y)
⇒ x = y
So, f2 is one-one.
Proving f1 × f2 is not one-one:
Given:
(f1 × f2) (x) = f1 (x) × f2 (x) = x × x = x2
Let x and y be two elements in the domain R, such that
( f1 × f2) (x) = (f1 × f2) (y)
⇒ x2 = y2
⇒ x = ± y
So, (f1 × f2) is not one-one.
APPEARS IN
संबंधित प्रश्न
Show that the function f : R* → R* defined by f(x) = `1/x` is one-one and onto, where R* is the set of all non-zero real numbers. Is the result true if the domain R* is replaced by N, with the co-domain being the same as R?
Give an example of a function which is not one-one but onto ?
Classify the following function as injection, surjection or bijection : f : Z → Z given by f(x) = x3
Classify the following function as injection, surjection or bijection :
f : Q − {3} → Q, defined by `f (x) = (2x +3)/(x-3)`
Let A = [-1, 1]. Then, discuss whether the following function from A to itself is one-one, onto or bijective : `f (x) = x/2`
Let A = {1, 2, 3}. Write all one-one from A to itself.
If A = {1, 2, 3}, show that a one-one function f : A → A must be onto.
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 gof and fog when f : R → R and g : R → R is defined by f(x) = 8x3 and g(x) = x1/3.
Find fog (2) and gof (1) when : f : R → R ; f(x) = x2 + 8 and g : R → R; g(x) = 3x3 + 1.
If f : A → B and g : B → C are onto functions, show that gof is a onto function.
Find fog and gof if : f(x) = c, c ∈ R, g(x) = sin `x^2`
if `f (x) = sqrt(1-x)` and g(x) = `log_e` x are two real functions, then describe functions fog and gof.
Consider f : {1, 2, 3} → {a, b, c} and g : {a, b, c} → {apple, ball, cat} defined as f (1) = a, f (2) = b, f (3) = c, g (a) = apple, g (b) = ball and g (c) = cat. Show that f, g and gof are invertible. Find f−1, g−1 and gof−1and show that (gof)−1 = f −1o g−1
Let A = {1, 2, 3, 4}; B = {3, 5, 7, 9}; C = {7, 23, 47, 79} and f : A → B, g : 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.
Show that the function f : Q → Q, defined by f(x) = 3x + 5, is invertible. Also, find f−1
If A = {a, b, c} and B = {−2, −1, 0, 1, 2}, write the total number of one-one functions from A to B.
If f : R → R is defined by f(x) = x2, find f−1 (−25).
Let f : R → R be the function defined by f(x) = 4x − 3 for all x ∈ R Then write f . [NCERT EXEMPLAR]
Let M be the set of all 2 × 2 matrices with entries from the set R of real numbers. Then, the function f : M→ R defined by f(A) = |A| for every A ∈ M, is
If a function\[f : [2, \infty )\text{ to B defined by f}\left( x \right) = x^2 - 4x + 5\] is a bijection, then B =
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) = x^2 and g\left( x \right) = 2^x\] Then, the solution set of the equation
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 \[g\left( x \right) = x^2 + x - 2\text{ and} \frac{1}{2} gof\left( x \right) = 2 x^2 - 5x + 2\] is equal to
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
Let A = R − (2) and B = R − (1). If f: A ⟶ B is a function defined by`"f(x)"=("x"-1)/("x"-2),` how that f is one-one and onto. Hence, 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 ______.
Let A be a finite set. Then, each injective function from A into itself is not surjective.
Let f: R – `{3/5}` → R be defined by f(x) = `(3x + 2)/(5x - 3)`. Then ______.
Let f : R `->` R be a function defined by f(x) = x3 + 4, then f is ______.
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 n(A) = 4 and n(B) = 6, Then the number of one – one functions from 'A' to 'B' is:
`x^(log_5x) > 5` implies ______.
Difference between the greatest and least value of f(x) = `(1 + (cos^-1x)/π)^2 - (1 + (sin^-1x)/π)^2` is ______.
Let a and b are two positive integers such that b ≠ 1. Let g(a, b) = Number of lattice points inside the quadrilateral formed by lines x = 0, y = 0, x = b and y = a. f(a, b) = `[a/b] + [(2a)/b] + ... + [((b - 1)a)/b]`, then the value of `[(g(101, 37))/(f(101, 37))]` is ______.
(Note P(x, y) is lattice point if x, y ∈ I)
(where [.] denotes greatest integer function)
