10
$\begingroup$

I've been having lectures in group theory with Hungerford's book. We were presented with the following theorem:

enter image description here

And then with:

enter image description here

enter image description here

enter image description here

Previous to the lectures about them, I was understanding most of the stuff, that is: I kinda could figure out the motivation for things. But when I came into these theorems, things got pretty weird for me. I don't understand the motivation for them. I have the following guesses:

  • Theorem 5.6 is used to prove Corollary 5.7 but I think it has a utility on its own: If given an homomorphism $f: G \to H$ with $N\lhd G$, we have a unique homomorphism $\overline{f} : G/N\to H$, then we could use this to know what homomorphisms could exist betwen $G$ and $H$ and this depends only on the normal subgroups of $G$. Does that make sense?

  • For the isomorphism theorems, I noticed they are corollaries so they must be very important. One of the reasons I conjectured for them is that we can construct very interesting isomorphisms. But why are those isomorphisms interesting? It's not clear to me what interesting stuff one could do with them.

I know my guesses are maybe too obvious or wrong, but I can't figure out on my own the answer to that question. Can you help me?

$\endgroup$
3
  • 10
    $\begingroup$ I found it hard to appreciate these in the abstract. It becomes clearer with lots and lots of examples. An algebraist may feel differently, but to me, but they aren't profound statements in the abstract; they're more like basic tools. Often the profound stuff is in creating inputs to these theorems so that you learn something of interest. $\endgroup$ – leslie townes Feb 27 at 4:31
  • 4
    $\begingroup$ You should try to understand the homomorphism theorem (5.6) and consequently the first isomorphism theorem perfectly. These are arguably the most important results you will see for your later algebraic life. The other two not so much because they somewhat follow directly from the previously mentioned results. $\endgroup$ – Qi Zhu Feb 27 at 5:53
  • 2
    $\begingroup$ “they are corollaries so they must be very important”. I’m not sure what your train of thought is, there. Certainly, the fact that they have high-falluting-sounding names should signal their importance (theorems with names tend to be important...) But the fact that they are “corollaries” doesn’t generally signal much, other than that they are easy consequences of previous results. Just because it’s allegedly a lemma does not make Zorn’s Lemma less important. What someone calls a corollary, lemma, or theorem, depends on whether one wants to put the meat of the proof. $\endgroup$ – Arturo Magidin Feb 27 at 6:10
14
$\begingroup$

Let’s say you have a group you are interested in. One way to try to understand the group is to stare at it intently until you see interesting things about it.

But the big insight of abstract algebra in general (and of Category Theory) is that you can also learn a lot about the group by considering morphisms, both into and out of the group. In fact, the Yoneda embedding tells you that understanding all the ways that all groups can map into $G$ will completely determine the isomorphism type of $G$, and that understanding all the ways in which you can map from $G$ to all other groups will completely determine the isomorphism type of $G$ as well.

In addition, one can view these maps as casting “shadows” of the object $G$; with some luck, the different shadows will each be simpler than the group, and perhaps we can piece together enough “shadows” to get a full picture of what the group looks like without having to look at the full group (in turns out that is not always possible, as witnessed by simple groups, but it works for many other types of groups).

The First Isomorphism Theorem tell you that if you want to understand the way that $G$ maps into other groups, you don’t need to go scour the universe to find those groups: you can “realize” any map $f\colon G\to H$ by finding a suitable normal subgroup $K$ of $G$, and then the image of $G$ under $f$ will behave exactly the same way as the image of $G$ under the canonical (and usually well-understood) quotient map $\pi\colon G\to G/K$ behaves. So in a sense you can understand all those images of $G$ by staring at suitable shadows of $G$: just the quotient ones.

The Third Isomorphism Theorem tells you that you that iterating the process won’t get you any new information: if you take a quotient of $G/K$, you are still just taking a quotient of $G$.

The Second Isomorphism Theorem tells you how the subgroups of $G$ behave under the map $G\to G/N$: namely the image of $K$ in the map will be $K/(N\cap K)$, but this will be isomorphic to $KN/N$. When you connect it with the Fourth (or Lattice) isomorphism theorem, which you did not quote, it provides complete information about what happens to the subgroups of $G$ under the map $G\to G/N$: the subgroups that contain $N$ are mapped to the subgroups of $G/N$ in a one-to-one, inclusion preserving, normality preserving manner, while the subgroups of $G$ that do not contain $N$ correspond, under the Second Isomorphism Theorem, to certain subgroups that do contain $N$.

These theorems are valid in a much more general setting: they apply, suitably modified to account for some technical issues, to any kind of algebraic structure: semigroups, monoids, rings, lattices, and more. They form a backbone of investigations, tools used over and over again, because one is always looking at homomorphisms to better understand the structures, and because one is always looking at quotients to simplify matters and try to get a better sense of the object one is studying.

$\endgroup$
2
  • $\begingroup$ The thing about the Yoneda embedding looks true but it seems really confusing: How can we think about all the ways in which all groups map into G and from G? Is this somehow related to your explanation of the first isomorphism theorem? $\endgroup$ – Billy Rubina Feb 28 at 14:53
  • 1
    $\begingroup$ @BillRubina: The Yonedda embedding tells us that two groups $G$ and $H$ are isomorphic if and only if the family of all sets $\mathrm{Hom}(G,K)$ and $\mathrm{Hom}(H,K)$ as $K$ ranges over all groups are “naturally isomorphic”, and that this holds if and only if the family of all sets $\mathrm{Hom}(K,G)$ and $\mathrm{Hom}(K,H)$ as $K$ ranges over all groups are “naturally isomoprhic”. In this case, the second part is irrelevant to the isomorphism theorems (but it does fit into the general picture of “look at morphisms, rather than at the groups”). $\endgroup$ – Arturo Magidin Feb 28 at 17:59
1
$\begingroup$

Not sure, how much below information can help you. But may help others and I too can get more intuitive insight of this very important theorem, by some experts.

The way I understand the group is a kind of Symmetries of an object. On which one can perform some actions. Now when it comes to comparing two groups or symmetries, what mathematical approach we can take, to find it if they are 'same' or 'similar' to some extent. we understand these by a function which maps elements(vertices,edges etc..) of symmetries to other objects symmetries, and then apply action on elements and compare how do they appear on other symmetries.

As you know isomorphism and homomorphism are the tool to compare two symmetries. Most of the time we would like to know when two symmetries doesn't result same kind of o/p , then what extent they behave same? i.e., if we give up bijection constraint and try to find what we loose and still behave somewhat similar we use a tool called homomorphism.

Now, one can ask , that what are the properties that is lost when we move from isomorphism to homomorphism, and what is still preserved? and two of the important properties are ${Ker(\phi)}$ and ${Im(\phi)}$ , So image of ${Im(\phi)}$, which help us to find out what part of the other symmetry H is going to hit by this function. ${Ker(\phi)}$ : If we sacrifice one-to-oneness, then in our structure preserving function more than one elements will hit to identity of the other symmetry. i.e, some non identity element from the domain symmetry is going to be mapped on the identity of the other symmetry. And it is the most important property which help us to find out how many homomorphism is possible between two group.

so mathematically any function which follow ${\phi (a \cdot b)= \phi(a) \cdot \phi(b)}$, has enough power to tell us something about these two groups even if it is not bijection. for ex. ${D_4 \rightarrow Z_4}$ are two different order group, but still we can find homomorphism between them.

Continuing same example of ${D_4 \rightarrow Z_4}$ if we partition D4 into rotation and reflection and send rotation to 0 ${(e_H)}$ in ${Z_4}$ and reflection to 2 in ${Z_4}$, These partition acts almost similar to sub group {0,2} of ${Z_4}$ (is it normal subgroup?)

Having these two piece of information ${Im(\phi)}$ and ${Ker(\phi)}$ we can compare narrower part of symmetries and gain some information about the structure of other group.

First Isomorphism Theorem: Here we use homomorphism to tell us something about of the structure of that symmetry via this theorem.

which tells that image of that homomorphism is isomorphic to the factor group of a domain by the kernel of it.(Kernel is a property of homomorphism and not of a group) This also, tell us, that every homomorphism is hiding isomomorphism inside them.

for ex. ${Z_{12} \rightarrow Z_3}$ by mapping ${\phi(x)=x mod3}$. ${Ker(\phi)= \{0,3,6,9\} \cong Z_4}$, using this we can get more information i.e, factoring out ${Z_{12}}$ with kernel, there are still 3 cosets are hiding under the domain group can be achieved via ${Im(\phi)}$ which is isomorphic to ${Z_3}$ these 3 coset form a factor group which is isomorphic to cyclic group ${Z_3}$

Hence, if you give me the homomorphism between two group, I look at the Kernel of that homomorphism, that is the normal subgroup of domain group and they are exactly the building blocks of symmetries(groups).

  1. Use homomorphism to discover normal subgroups and to determine factor group. 2. building a cosets out of this and which will be in one to one correspondence with other group that you get via ${Im(\phi)}$.
$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.