This will be the most common way to understand a Quotient Group. To highlight this, consider the example . We claim that where in this case then has:
The idea is to find some surjective morphism in which .
Know that is generated by , so is determined by and . We also know the key relations are that . Thus if we want such a morphism then:
When we look at the codomain of its in terms of adding $\mathbb
Let's use a different example to look at the other 3 theorems we'll cover.
Notice how the lattice makes a literal diamond between subgroups. The next theorem covers when these cases happen.
Theorem
Suppose and (see Normalizer, so every element of normalizes , so for all ). Then:
is the smallest subgroup containing and . It is the "tip" of the diamond in the lattice.
and
This may be the most useless theorem ever, but the last finding is really important. Namely, for when you want to "cancel" from then you have to consider the factor of (ie: you get some elements of that "bleed over")
If we alternatively look at then the left cosets of in are:
Notice we don't care which representative we use for each subgroup of cosets, so then we can use the bar notation to indicate a coset:
which all are elements of . But look! We can make some map:
namely, use such that . Then for each normal subgroup in the lattice (see the orange boxes in the picture of the lattice):
has
.
... we can repeat with each normal subgroup, and we'll get .
But some of them became the other normal subgroups. Namely
...
We can make a lattice for what becomes what, and what stays the same:
Which is the same lattice picture we had before, but only with the normal subgroups!
s, hence multiplying by 4.
Further using the other relations:
Lastly, we want to be surjective and .
The idea here is to treat the numbers as binary numbers. Namely and as they are flags for if we have an extra from the Left and Right Cosets of .
Notice here is surjective as we wanted. We can make a table to check:
1
(0,0)
(1,0)
(0,0)
(1,0)
(0,1)
(1,1)
(0,1)
(1,1)
Notice:
The coset had .
The other outcomes got partitioned by their cosets.
Thus we got as desired.
But notice that in this case we really could've used a whole bunch of other maps since we only have (some arithmetic just works out).
Proof
Proof
The first two will be quick to check, so let's look at (3). Define by .
Let's see if is well defined. Suppose . Then using Left (and Right) Cosets form a Subgroup, then . Thus . Then being a morphism. Thus showing it's well defined.
We should check is a morphism:
Now is surjective? Let , then there is some where . But then .
Now is injective? Notice:
so is injective. Thus is an isomorphism between the two groups!
☐
Let's use a different example to look at the other 3 theorems we'll cover.