Sorry if I sound too ignorant, I'm barely starting to study abstract algebra.
While learning about Group theory, I found a video that explains the concept of Group Homomorphisms.
If I understood correctly, it goes something like this: $G$ is a group with the operator $*$ and $H$ is a group with the operator $+$, a homomorphism between these two groups would be a function that maps two elements of $G$ into $H$ in the following way:
$f(x)+f(y)=f(x*y)$
It seems as a pretty simple definition, in fact, I wonder if one could just construct a function $g$ as a homomorphism of two groups, in other words, defining $g$ as some function such that $g(x)+g(y)=g(x*y)$. However, the lady ends the video saying that "some groups are so different from one another, there are no structural similarities at all", meaning -I think- that there exist pair of groups that are not homomorphic.
Is this the case? Or are all groups homomorphic? Whether they are or not, could someone provide a proof or explanation?
Any thoughts/ideas would be really appreciated!
Best Answer
Mathematicians typically don't use the word "homomorphic" that way, for the reason (as pointed out above) that for any two groups, $G,H$, the $0$-map (or trivial map):
$0:G \to H$ given by $0(g) = e_H$ for all $g \in G$ (map everything in $G$ to the group identity of $H$), always exists.
In any case, the existence, or non-existence, of a (non-trivial) homomorphism between two groups is a poor yardstick of similarity; for distinct primes $p, q$ there is no non-trivial group homomorphism $f: \Bbb Z/p\Bbb Z \to \Bbb Z/q\Bbb Z$, but very few mathmeticans would claim this groups are "dissimilar" (they are both simple cyclic groups).
It is (perhaps) more fruitful to think of a homomorphism $f: G \to f(G) \subseteq H$ as "preserving" partial information about $G$ "inside" of $H$. Some information about $G$ can be lost, as homomorphisms are not always one-to-one (when they are one-to-one, this is a highly desirable situation, as we have a "copy" of $G$ inside $H$, and $H$ may be "easier" to understand than $G$).
Groups can be very different from one another (as opposed to, say, finite-dimensional vector spaces over the reals, which are all rather alike). This is mostly because groups have so few rules, that some wildly disparate sets and operations can still qualify to be groups. Mathematicians have developed classifications, such as order, simplicity, etc. to help distinguish groups by type, and it turns out this is....complicated.