In an introductory cryptography course, our teacher demonstrated a proof for $(\mathbb{Z},+) \ncong (\mathbb{Q},+)$. I'm not convinced, even though the statement may be correct (I don't know).
Earlier in the course, we had seen the isomorphism of the Klein-4 group as $(\{0,1\}^2,+)$ and the 2D symmetry group of a rectangle not being a square (using identity, vertical reflection, horizontal reflection and 180 degree rotation).
Now, our teacher made a list of different equations and whether or not they could be solved in the sets $\mathbb{Z}^+, \mathbb{Z}, \mathbb{Q}$ and $\mathbb{R}$. This to show that some equations can be solved in certain sets but not in others (like $x=3$ being solvable in all four sets, but $3x=5$ only in the latter two and $x^2=-1$ in none of the considered sets).
Then, she stated that if we have some equation using an operation $\odot$ that is solvable in $A$ but not in $B$, then $(A,\odot) \ncong (B,\odot)$ (supposing of course that $(A,\odot)$ and $(B,\odot)$ are groups). This already is a rather vague description, isn't it?
She then proposed the equation $x+x=3$ which is solvable in $\mathbb{Q}$ but not in $\mathbb{Z}$. While that is obviously correct, I'm not sure if this argument is sound and if it actually proves the two groups not being isomorph.
I have difficulties to express my concerns. Somehow, I would expect the constant $3$ in that equation to be some number from the particular set instead of some constant. I'm not convinced by the argument because if we'd map all odd numbers from $\mathbb{Q}$ to even numbers in $\mathbb{Z}$, the equation would in fact be solvable in $\mathbb{Z}$.
What I'd like to know is:
- Is the proof given by my teacher valid (and why)?
- If not, are these groups still isomorph (out of curiosity)?