In one of my math exercises, I'm being asked to prove that
for all $a, b \in G | (a^{-1})^{-1} = a$
with G a group. However, nowhere is stated that it is a commutative group. My first thought was that, because inverses are unique, the inverse of $a^{-1}$ can only be $a$; This thought is correct according to the answers. However, if the group is not commutative, is it not possible that there is another unique inverse for $a$?
The exact words of the answer are:
The result follow from Theorem 16.1(b) because both $(a^{-1})^{-1}$ and $a$ are inverses of $a^{-1}$.
Where Theorem 16.1(b) states The inverse of every element of a group G is unique.
If we wanted the group axioms to say
then that'd be all we need. Indeed for any $g\in G$, we have that $gg'=1$, $g'\in G$. Then we also have some other $g''$ for which $g'g''=1$. But then, by associativity
$$g(g'g'')=g$$
$$(gg')g''=g$$
$$1g''=g$$
$$g''=g$$
So left and right inverses (which exist axiomatically) coincide.
This said, $a^{-1}$ is just a convenient symbol for the element $g\in G$ for which $ag=ga=1$. Thus, $(a^{-1})^{-1}$ is a convenient symbol for the element $g'\in G$ for which $a^{-1}g'=g'a^{-1}=1$; which is just $a$.