Why are all bijective group homomorphisms $\phi: G \to H$ automatically isomorphisms? That is, their inverses are also homomorphisms.
I have seen this fact mentioned before, but never a proof.
We need to show that $\phi^{-1}(ab) = \phi^{-1}(a) \phi^{-1}(b)$ for all $a, b \in G$… no idea where to start.
The inverse of a bijective map is bijective. We must show that for all $x$ and $y\in H$, $$\phi ^{-1}(x) \phi ^{-1} (y) = \phi ^{-1}(xy)$$Set $a = \phi ^{-1}(x), b = \phi ^{-1} (y)$ and $ c = \phi ^{-1} (xy)$. Since $\phi $ is a homomorphism, $$\phi (ab) = \phi (a)\phi (b) = x y = \phi (c) \Rightarrow \phi ^{-1}(x)\phi ^{-1}(y)=\phi ^{-1}(xy)$$