Here is an example of my proof of a question:
Prove that $\mathbb{C}^*$ is isomorphic to the subgroup of $GL_2(\mathbb{R})$ consisting of matrices of the form. $$ \begin{pmatrix} a&b\\ -b&a\\ \end{pmatrix}. $$ Here is my proof:
Let $z\in\mathbb{C}^*=\{z=a-bi; a^2+b^2\neq 0\}$ and $g\in G=\{\begin{pmatrix} a&b\\ -b&a\\ \end{pmatrix} ;a^2+b^2\neq 0\} $. Suppose there exists a mapping $\phi$, such that $\phi:\mathbb{C}^*\to G$ by $\phi: z\mapsto g$. This relation is well defined and it is onto because for every $z=a-bi\in\mathbb{C}^*$, we have the representation $\begin{pmatrix} a&b\\ -b&a\\ \end{pmatrix}\in G$. It is also injective because when $\phi(z_1)=\phi(z_2)$, we have $$ \phi(z_1)= \begin{pmatrix} a_1&b_1\\ -b_1&a_1\\ \end{pmatrix} = \phi(z_2)= \begin{pmatrix} a_2&b_2\\ -b_2&a_2\\ \end{pmatrix}. $$ So $a_1-b_1i=a_2-b_2i$, in another word $a_1=a_2$ and $b_1=b_2$, therefore $z_1=z_2$.
Then to show that $\phi$ preserves the group operation, observe that $$ \begin{align} \begin{split} \phi(z_1z_2)&=\phi((a_1a_2-b_1b_2)-(a_2b_1+a_1b_2)i)\\ \\ &= \begin{pmatrix} a_1a_2-b_1b_2&a_2b_1+a_1b_2\\ -(a_2b_1+a_1b_2)&a_1a_2-b_1b_2\\ \end{pmatrix}\\ \\ &= \begin{pmatrix} a_1&b_1\\ -b_1&a_1 \end{pmatrix} \begin{pmatrix} a_2&b_2\\ -b_2&a_2 \end{pmatrix}\\ \\ &=\phi(z_1)\phi(z_2). \end{split} \end{align} $$ Hence $\phi$ is isomorphism and $\mathbb{C}^*\cong G$.
This is certainly not a hard question. And I would like you guys to comment on my proof and tell me if this is rigorous enough because, in my opinion, I found there is something unsatisfactory to me. For example, I want to explain why it is "well-defined" but I don't really know what "well-defined" means while both my textbook and my Prof always begin with "this function /map is well-defined" in their proof of bijection but rarely stating the reason. So I wonder if it is just a 'meaningless' convention for the proof of a bijection or there is something deeper underneath it?
My second unsatisfactions with this proof is about "onto/surjective". At this stage, I think I know what it means mathematically, which simply is that for every $y$ on the range we can find a unique $x$ on the domain that is mapped to it. However, when this statement is included in a proof, I immediately feel it lacks something so that as you can see from my example that I don't really prove it but instead restating or paraphrasing my previous definition of the map. This is also something that happened a lot during my reading of the textbook and my Prof's lecture. It sounds like as long as $\phi$ is "well-defined", then it must be "onto". I just want to ask is there anything I can do with the language here or actually, there is a brief proof for onto so that in any circumstances I can boost this sentence to a more convincing level?
These two questions have been around me from the beginning, and I know I haven't studied the very core part of this subject and probably never, but I just want to throw out these questions and see how you guys react to this.
Thanks.