On isomorphism theorems.
This post follows last article, in this articles we discuss some properties about isomorphisms theorems, which are tightly connected to the definition of subgroups and quotient groups.
First, the first isomorphism theorem tells us that for any homomorphism , we can decompose it into
Consider the part . This tells us a particular interesting thing, that every group with any homomorphism out of it carries a quotient group structure, especially when is not injective and it’s also not trivial, which means that there are elements that got mapped to the same element in , and furthermore that does not send all to , we shall have a non trivial quotient group
because if , then we may naturally consider the set , then we have and , since , this creates non trivial kernel and therefore non trivial quotient group.
The reason why is an isomorphism also contains an interesting intuition. We know that a map is not an isomorphism when it’s not injective or not surjective, but by definition of , this map is clearly surjective. Furthermore, we can consider the quotient group have “collapsed” all elements that can possible cause any non-injectivity: if and , then this information will be recorded by and therefore quotient out removes the non-injectivity. Actually, it’s fair easy to see that any group homomorphism determines an equivalence relation that is compatible with the group structure. And is the subgroup that records the “null displacement” w.r.t. this equivalence relation.
Now we come to a closely-related lemma of the third isomorphism theorem
Lemma 1.1.
Let . Then for each subgroup containing , can be identified with a subgroup of . Defined by function
Furthermore, this function is a bijection preserving inclusions.
We don’t care about the inclusion part, what I want to justify is the actuall important thing of this lemma. The lemma itself looks nonsensical upon first read. But actually it shows that Any subgroup of is also a quotient group where . Notice that when giving the inverse, we define
we now show that in fact, , notice that is defined to be
as is just the elements in that makes , the definition automatically collapse to just . Since is just any subgroup of we pick, we can conclude that any subgroup of is itself a quotient group. And this quotient group has a one-to-one correspondence with subgroups of containing , thus we may have the following diagram (notice this is not a commutative diagram in the tranditional sense, as arrows are not functions)
That is, each subgroup of containing uniquely determines a subgroup of and vice versa in a surjective sense that there are “no other subgroups of and not described by this correspondence”.