Are all functions that have an inverse bijective functions? To have an inverse, a function must be injective i.e one-one.
Now, I believe the function must be surjective i.e. onto, to have an inverse, since if it is not surjective, the function's inverse's domain will have some elements left out which are not mapped to any element in the range of the function's inverse. 
So is it true that all functions that have an inverse must be bijective? 
Thank you.
 A: Yep, it must be surjective, for the reasons you describe. It must also be injective, because if $f(x_1) = f(x_2) = y$ for $x_1 \ne x_2$, where does $f^{-1}$ send $y$?
A: All the answers point to yes, but you need to be careful as what you mean by inverse (of course, mathematics always requires thinking). I will try not to get into set-theoretic issues and appeal to your intuition.
If $f : X \to Y$ is a map of sets which is injective, then for each $x \in X$, we have an element $y = f(x)$ uniquely determined by $x$, so we can define $g : Y \to X$ by sending those $y \in f(X)$ to that element $x$ for which $f(x) = y$, and the fact that $f$ is injective will show that $g$ will be well-defined ; for those $y \in Y \backslash f(X)$, just send them wherever you want (this would require this axiom of choice, but let's not worry about that). The function $g$ satisfies $g(f(x)) = g(y) = x$, so that $g \circ f$ is the identity map ; that is, $f$ admits a left inverse. 
Conversely, suppose $f$ admits a left inverse $g$, and assume $f(x_1) = f(x_2)$. Then $x_1 = g(f(x_1)) = g(f(x_2)) = x_2$, so $f$ is injective. That is, 
A function $f : X \to Y$ is injective if and only if it admits a left-inverse $g : Y \to X$ such that $g \circ f = \mathrm{id}_X$. 
Similarly, it is not hard to show that $f$ is surjective if and only if it has a right inverse, that is, a function $g : Y \to X$ with $f \circ g = \mathrm{id}_Y$. I'll let you ponder on this one. 
If you're looking for a little more fun, feel free to look at this ; it is a bit harder though, but again if you don't worry about the foundations of set theory you can still get some good intuition out of it.
Hope that helps,
A: If $f\colon A \to B$ has an inverse $g\colon B \to A$, then 
\begin{align*}
(g \circ f)(x) & = x~\text{for each}~x \in A\\
(f \circ g)(x) & = x~\text{for each}~x \in B
\end{align*}
A function is bijective if it is both injective and surjective.
injective:  The condition $(g \circ f)(x) = x$ for each $x \in A$ implies that $f$ is injective.  
Suppose $(g \circ f)(x_1) = (g \circ f)(x_2)$.  Then $x_1 = (g \circ f)(x_1) = (g \circ f)(x_2) = x_2$.  Hence, $f$ is injective.
surjective: The condition $(f \circ g)(x) = x$ for each $x \in B$ implies that $f$ is surjective.
Let $b \in B$.  Suppose that $g(b) = a$.  Then $(f \circ g)(b) = f(g(b)) = f(a) = b$, so there exists $a \in A$ such that $f(a) = b$.  Thus, $f$ is surjective.
Therefore, if $f\colon A \to B$ has an inverse, it is both injective and surjective, so it is bijective.
A: I won't bore you much by using the terms injective, surjective and bijective.
Let's keep it simple - a function is a machine which gives a definite output to a given input
Let's say a function (our machine) can state the physical state of a substance. Lets denote it with S(x).
Now when we put water into it, it displays "liquid".Put sand into it and it displays "solid".
Put milk into it and it again states "liquid"
So is it a function? - Yes because it gives only one output for any input.
Let's make this machine work the other way round.
Until now we were considering S(some matter)=the physical state of the matter
Now we want a machine that does the opposite. That means we want the inverse of S.
Therefore what we want the machine to give us the stuffs which are of the state that we chose.....too confusing? Let me put it this way....
When we opt for "liquid", we want our machine to give us milk and water. But if for a given input there exists multiple outputs, then will the machine be a function? No - it will just be a relation on the matters to the physical state of the matter.
Therefore inverse of a function is not possible if there can me multiple inputs to get the same output.
Let's again consider our machine
 S(some matter)=it's state
Now we have matters like sand, milk and air.
One by one we will put it in our machine to get our required state.
Now for sand it gives solid ;for milk it will give liquid and for air it gives gas.
That was pretty simple, wasn't it?
Only this time there is a little twist......Our machine has gone through some expensive research and development and now has the capability to identify even the plasma state  (like electric spark)!!
So if we consider our machine to be working in the opposite way, we should get milk when we chose liquid; 
Sand when we chose solid ; air when we chose gas.......
And when we choose plasma it should give........nah - it won't be able to give anything because there was no previous input that was in the plasma state......but a function should have an output for the inputs that we have defined in the domain.......again too confusing??
If we didn't originally provide a substance in the plasma state, how can we expect to get one when we ask for it!
Would you get any money from someone who is not indebted to you?? Obviously no!
So the inverse of our machine or function is not possible because the state which was left out originally had no substance in the domain and as inverse traces us back to the domain.......Our output for plasma doesn't exist
Hence it's not a function
That's it! Hope I was able to get my point across.
A: The claim that every function with an inverse is bijective is false.  A simple counter-example is $f(x)=1/x$, which has an inverse but is not bijective.  $f$ is not bijective because although it is one-to-one, it is not onto (due to the number $0$ being missing from its range).
For additional correct discussion on this topic, see this duplicate question rather than the other answers on this page.
A: Yes. Think about the definition of a continuous mapping.
Let $f:X\to Y$ be a function between two spaces. Topologically, a continuous mapping of $f$ is if $f^{-1}(G)$ is open in $X$ whenever $G$ is open in $Y$. In basic terms, this means that if you have $f:X\to Y$ to be continuous, then $f^{-1}:Y\to X$ has to also be continuous, putting it into one-to-one correspondence. 
Thus, all functions that have an inverse must be bijective.
A: Yes. A function is invertible if and only if the function is bijective. 
For a pairing between X and Y (where Y need not be different from X) to be a bijection, four properties must hold:
(1) Each element of X must be paired with at least one element of Y,
(2) No element of X may be paired with more than one element of Y,
(3) Each element of Y must be paired with at least one element of X, and
(4) No element of Y may be paired with more than one element of X.

A bijection f with domain X (indicated by f: X → Y in functional notation) also defines a relation starting in Y and going to X. Properties (3) and (4) of a bijection say that this inverse relation is a function with domain Y. Moreover, properties (1) and (2) then say that this inverse function is a surjection and an injection, that is, the inverse function exists and is also a bijection. 
The 'counterexample' given in the other answer, i.e. $f: X \to Y$ via $f(x) = \frac{1}{x}$ which maps $\mathbb{R} - \{0\} \to \mathbb{R} - \{0\}$ is actually bijective.
Let $f(x_1) = f(x_2) \implies \frac{1}{x_1} = \frac{1}{x_2}$, then it follows that $x_1 = x_2$, so f is injective.
Let $x = \frac{1}{y}$. Then, $\forall \ y \in Y, f(x) = \frac{1}{\frac{1}{y}} = y$. So f is surjective.
