Advertisements
Advertisements
Question
Let f be an injective map with domain {x, y, z} and range {1, 2, 3}, such that exactly one of the following statements is correct and the remaining are false.
\[f\left( x \right) = 1, f\left( y \right) \neq 1, f\left( z \right) \neq 2 .\]
The value of
\[f^{- 1} \left( 1 \right)\] is
Options
x
y
z
none of these
Advertisements
Solution
\[\text{Case}-1: Letf\left( x \right) = 1 \text{ P be true}.\]
\[\text{Then,f } \left( y \right)\neq1 \text{ and f }\left( z \right) \neq 2\text{ are false}.\]
\[\text{So,f } (y) = 1 \text{ and } f \left( z \right) = 2\]
\[\Rightarrow f\left( x \right) = 1, f\left( y \right) = 1\]
\[ \Rightarrow \text{ x and y have the same images}.\]
\[\text{This contradicts the fact that fis one-one}.\]
\[\text{Case}-2: \text{Letf}\left( y \right) \neq1 \text{be true}.\]
\[\text{Then},f\left( x \right) = 1 \text{and}f\left( z \right) \neq 2 \text{ are false}.\]
\[So, f\left( x \right) \neq1 \text{and f}\left( z \right) = 2\]
\[\Rightarrow f\left( x \right) \neq 1, f\left( y \right) \neq 1 andf\left( z \right) = 2\]
\[\Rightarrow\text{There is no pre-image for 1}.\]
\[\text{This contradicts the fact that range is}\left\{ 1, 2, 3 \right\}.\]
\[\text{Case}-3: Letf\left( z \right) \neq 2\text{ be true}.\]
\[\text{Then},f\left( x \right) = 1\text{and}f\left( y \right) \neq 1 \text{are false}.\]
\[So, f\left( x \right) \neq1 \text {and} f\left( y \right) = 1\]
\[\Rightarrow f\left( x \right) = 2, f\left( y \right) = 1 \text{and }f\left( z \right) = 3\]
\[ \Rightarrow f \left( y \right) = 1\]
\[ \Rightarrow f^{- 1} \left( 1 \right) = y\]
So, the answer is (b).
APPEARS IN
RELATED QUESTIONS
Check the injectivity and surjectivity of the following function:
f : N → N given by f(x) = x3
Show that the function f : R → R given by f(x) = x3 is injective.
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 : 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 A = {1, 2, 3}, show that a one-one function f : A → A must be onto.
Let f : R → R and g : R → R be defined by f(x) = x2 and g(x) = x + 1. Show that fog ≠ gof.
Give examples of two functions f : N → Z and g : Z → Z, such that gof is injective but gis not injective.
Find fog and gof if : f(x)= x + 1, g (x) = 2x + 3 .
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.
Let f : [−1, ∞) → [−1, ∞) be given by f(x) = (x + 1)2 − 1, x ≥ −1. Show that f is invertible. Also, find the set S = {x : f(x) = f−1 (x)}.
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 : C → C is defined by f(x) = (x − 2)3, write f−1 (−1).
Let A = {x ∈ R : −4 ≤ x ≤ 4 and x ≠ 0} and f : A → R be defined by \[f\left( x \right) = \frac{\left| x \right|}{x}\]Write the range of f.
Let f be an invertible real function. Write ( f-1 of ) (1) + ( f-1 of ) (2) +..... +( f-1 of ) (100 )
The function \[f : [0, \infty ) \to \text {R given by } f\left( x \right) = \frac{x}{x + 1} is\]
Which of the following functions from
to itself are bijections?
If a function\[f : [2, \infty )\text{ to B defined by f}\left( x \right) = x^2 - 4x + 5\] is a bijection, then B =
Let
The function \[f : R \to R\] defined by
\[f\left( x \right) = 6^x + 6^{|x|}\] is
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
Let \[f\left( x \right) = \frac{1}{1 - x} . \text{Then}, \left\{ f o \left( fof \right) \right\} \left( x \right)\]
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 \[f\left( x \right) = \frac{\alpha x}{x + 1}, x \neq - 1\] Then, for what value of α is \[f \left( f\left( x \right) \right) = x?\]
Mark the correct alternative in the following question:
Let A = {1, 2, ... , n} and B = {a, b}. Then the number of subjections from A into B is
Write about strlen() function.
Let f: R → R be the function defined by f(x) = 4x – 3 ∀ x ∈ R. Then write f–1
The domain of the function f: R → R defined by f(x) = `sqrt(x^2 - 3x + 2)` is ______
Let A be a finite set. Then, each injective function from A into itself is not surjective.
Using the definition, prove that the function f: A→ B is invertible if and only if f is both one-one and onto
Let f : R → R be defind by f(x) = `1/"x" AA "x" in "R".` Then f is ____________.
Let f : R → R be a function defined by f(x) `= ("e"^abs"x" - "e"^-"x")/("e"^"x" + "e"^-"x")` then f(x) is
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
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.
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 ______.
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 one of the following graphs is a function of x?
![]() |
![]() |
| Graph A | Graph B |
The trigonometric equation tan–1x = 3tan–1 a has solution for ______.
A function is called bijective if it is both:
For \(f(x)=x^2+x\), if \(y=1\), which two domain elements have the same image?


