Show that the function f: R* \(\to\) R* defined by f (x)= \(\frac {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 co-domain being same as R* ?
It is given that f : R* \(\to\) R* is defined by f (x)= \(\frac {1} {x}\) .
One-one: f (x)=f (y)
\(\Rightarrow\) \(\frac {1} {x}\) = \(\frac {1} {y}\)
\(\Rightarrow \) x=y.
∴ f is one-one.
Onto:
It is clear that for y∈ R* , there exists x = \(\frac {1} {y}\) ∈ R* (exists as y ≠ 0 ) such that f (x)= \(\dfrac {1} { \frac {1} {y}}\)=y.
∴ f is onto.
Thus, the given function (f) is one-one and onto.
Now, consider function g: N \(\to\) R* defined by
g (x)= \(\frac {1} {x}\)
we have g (x1)=g (x2) \(\Rightarrow\) \(\frac {1} {x_1}\)= \(\frac {1} {x_2}\)\(\Rightarrow\) x1 = x2
∴ g is one-one.
Further, it is clear that g is not onto as for 1.2 ∈R* there does not exit any x in N such
that g (x) = \(\frac {1} {1.2}\)
Hence, function g is one-one but not onto.
A school is organizing a debate competition with participants as speakers and judges. $ S = \{S_1, S_2, S_3, S_4\} $ where $ S = \{S_1, S_2, S_3, S_4\} $ represents the set of speakers. The judges are represented by the set: $ J = \{J_1, J_2, J_3\} $ where $ J = \{J_1, J_2, J_3\} $ represents the set of judges. Each speaker can be assigned only one judge. Let $ R $ be a relation from set $ S $ to $ J $ defined as: $ R = \{(x, y) : \text{speaker } x \text{ is judged by judge } y, x \in S, y \in J\} $.
During the festival season, a mela was organized by the Resident Welfare Association at a park near the society. The main attraction of the mela was a huge swing, which traced the path of a parabola given by the equation:\[ x^2 = y \quad \text{or} \quad f(x) = x^2 \]
A function is said to be one to one function when f: A → B is One to One if for each element of A there is a distinct element of B.
A function which maps two or more elements of A to the same element of set B is said to be many to one function. Two or more elements of A have the same image in B.
If there exists a function for which every element of set B there is (are) pre-image(s) in set A, it is Onto Function.
A function, f is One – One and Onto or Bijective if the function f is both One to One and Onto function.
Read More: Types of Functions