Show that a one-one function $f: \{1, 2, 3\} \rightarrow \{1, 2, 3\}$ must be onto.

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(N/A) Let $A = \{1, 2, 3\}$. The function $f: A \rightarrow A$ is given as one-one.
By the definition of a one-one function,distinct elements in the domain $A$ must map to distinct elements in the codomain $A$.
Since the domain $A$ has $3$ elements,their images $f(1), f(2),$ and $f(3)$ must be $3$ distinct elements of the codomain $A$.
Because the codomain $A$ also contains exactly $3$ elements,the set of images ${f(1), f(2), f(3)}$ must be equal to the entire codomain $A$.
Therefore,every element in the codomain has a pre-image in the domain,which satisfies the definition of an onto function.
Thus,$f$ must be onto.

Explore More

Similar Questions

$A$ mapping from $\mathbb{N}$ to $\mathbb{N}$ is defined as follows: $f: \mathbb{N} \rightarrow \mathbb{N}$ where $f(n) = (n+5)^2$ for all $n \in \mathbb{N}$ (where $\mathbb{N}$ is the set of natural numbers). Then:

If $f(x) = (\frac{3}{5})^x + (\frac{4}{5})^x - 1$,$x \in R$,then the equation $f(x) = 0$ has

If the function $f: R \rightarrow R$ is defined by $f(x) = \begin{cases} 2x-3, & \text{if } x < -2 \\ x^2-1, & \text{if } -2 \leq x \leq 2 \\ 3x+2, & \text{if } x > 2 \end{cases}$ then $f$ is

If $P(S)$ denotes the set of all subsets of a given set $S$,then the number of one-to-one functions from the set $S = \{ 1, 2, 3 \}$ to the set $P(S)$ is

For $A = \{-1, -2, 3, 4\}$,the number of one-one functions from $A$ to $A$ is . . . . . . .

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo