Show that the function is 1-1 and onto

  • MHB
  • Thread starter evinda
  • Start date
  • Tags
    Function
In summary, the conversation discusses proving that if a function f is one-to-one and onto from set A to set B, then its inverse function f^{-1} is also one-to-one and onto from set B to set A. The conversation also mentions an attempt at a proof and a question on how to show it.
  • #1
evinda
Gold Member
MHB
3,836
0
Hi! (Smile)

I want to prove that, if $f: A \xrightarrow[\text{onto}]{\text{1-1}} B$, then $f^{-1}: B \xrightarrow[\text{onto}]{\text{1-1}} A$.

That's what I have tried:

Let $x,y \in dom(f)$, with $x \neq y$.
Then, since $f:\text{ 1-1 }$, we have that $f(x) \neq f(y)$.
Also, since $f: \text{ onto } $, $\forall b \in B,\exists x$, such that $b=f(x)$.

Is it right so far?

We want to show that, if $y_1,y_2 \in B$, with $y_1 \neq y_2$, then $f^{-1}(y_1) \neq f^{-1}(y_2)$ and that $\forall x \in A, \exists d$, such that $f^{-1}(x)=d$, right?

If so, how could we show this? :confused:
 
Physics news on Phys.org
  • #2
Hi,

It's correct except the last equality, \(\displaystyle f^{-1}\) should be applied in the rhs.

Given \(\displaystyle y \in B\) and the condition f onto implies that \(\displaystyle f^{-1}(y) \) is non empty, and 1-1 implies that \(\displaystyle f^{-1}(y)\) is just one point so the inverse of f is well defined.

Try to reverse this argumentation.
 

FAQ: Show that the function is 1-1 and onto

What is a one-to-one function?

A one-to-one function is a type of function where each input has exactly one unique output. This means that no two different inputs can have the same output. In other words, each element in the domain is mapped to a unique element in the range.

What is an onto function?

An onto function is a type of function where every element in the range has at least one corresponding element in the domain. This means that there are no elements in the range that are not mapped to by any element in the domain.

How can I show that a function is one-to-one?

To show that a function is one-to-one, you can use the horizontal line test. This involves drawing horizontal lines across the graph of the function. If each horizontal line only intersects the graph at one point, then the function is one-to-one.

How can I show that a function is onto?

To show that a function is onto, you can use the vertical line test. This involves drawing vertical lines across the graph of the function. If each vertical line intersects the graph at least once, then the function is onto. Another way to show that a function is onto is to prove that every element in the range has at least one corresponding element in the domain.

Can a function be both one-to-one and onto?

Yes, a function can be both one-to-one and onto. This type of function is called a one-to-one correspondence or a bijection, and it means that every element in the domain has exactly one unique corresponding element in the range, and every element in the range has at least one corresponding element in the domain.

Similar threads

Replies
1
Views
2K
Replies
1
Views
747
Replies
14
Views
3K
Replies
2
Views
2K
Replies
17
Views
3K
Replies
5
Views
1K
Replies
1
Views
1K
Replies
1
Views
950
Back
Top