14 Lagrange's Theorem

Last time we talked about:

Some examples include:

  1. G=Z. Since it's an Abelian Group then automatically we get that all subgroups are normal. Using K=4Z gives the quotient group Z4Z={0+4Z,1+4Z,2+4Z,3+4Z} with operation a+4Z+b+4Z=(a+b)+4Z. It comes with the projection Homomorphism (or Group Morphism) π:ZZ4Z where nn+4Z. This is just our usual group Z4Z.
  2. If G=D8 with K=Z(D8) (see Center) where oomputing gives K={1,r2}=r2, then here the center is always normal. Then GK is a group of order:
|GK|=|G||K|=82=4

using Lagrange's Divisibility Theorem of Order of Subgroups.

We could ask: Is D8K a Cyclic Group? We can check by cranking out the orders and seeing if they are all equal via Orders of Cyclic Subgroups, in this case if they have an element of order 4 since our group GK had 4 things in it: (we discussed this in 31 Quotient Groups and Homomorphisms#5)

Now we could ask: Is D8K isomorphic to a familiar group? This is a big question we'll tackle later in the future.

Another Example

Have G=S3 with K=(1 2 3)={1,(1 2 3),(1 3 2)}. We can generate the left cosets:

New Theorem

Theorem

Suppose φ:GH is a Homomorphism (or Group Morphism). Then:

  1. Ker(φ)G
  2. im(φ)H
  3. The map GKim(φ) where gKφ(g) is an Isomorphism, where K=Ker(φ). Thus GKer(φ)im(φ)

An Example

This will be the most common way to understand a Quotient Group. To highlight this, consider the example G=D8. We claim that D8K where in this case K=r2 then has:
D8KZ2×Z2
The idea is to find some surjective morphism φ:D8Z2×Z2 in which Ker(φ)=K.

Know that D8 is generated by r,s, so φ is determined by φ(r) and φ(s). We also know the key relations are that r4=1=s2,rs=sr3. Thus if we want such a morphism φ then:
φ(r4)=4φ(r)=0=(0,0)

When we look at the codomain of φ its in terms of adding $\mathbb

s, hence multiplying by 4.

Further using the other relations:
φ(s2)=2φ(s)=0,φ(r)+φ(s)=φ(s)φ(r)
Lastly, we want φ to be surjective and Ker(φ)={1,r2}.
Z2×Z2={(0,0),(0,1),(1,0),(1,1)}
The idea here is to treat the numbers as binary numbers. Namely r(0,1) and s(1,0) as they are flags for if we have an extra r,s from the Left and Right Cosets of K.

Notice here φ is surjective as we wanted. We can make a table to check:

1 r r2 r3 s sr sr2 sr3
(0,0) (1,0) (0,0) (1,0) (0,1) (1,1) (0,1) (1,1)
Notice:
  • The 1K coset had φ(1K)=(0,0).
  • The other outcomes got partitioned by their cosets.
  • Thus we got Ker(φ)=K as desired.

But notice that in this case we really could've used a whole bunch of other maps since we only have mod2 (some arithmetic just works out).

Proof

Proof

The first two will be quick to check, so let's look at (3). Define ψ:GKer(φ)im(φ) by ψ(gKer(φ))=φ(g).

Let's see if ψ is well defined. Suppose g1Ker(φ)=g2Ker(φ). Then using Left (and Right) Cosets form a Subgroup, then g21g1Ker(φ). Thus φ(g21g1)=1. Then φ(g2)1φ(g1)=1H being a morphism. Thus φ(g1)=φ(g2) showing it's well defined.

We should check ψ is a morphism:
ψ((g1Ker(φ))(g2Ker(φ)))=ψ(g1g2Ker(φ))=φ(g1g2)=φ(g1)φ(g2)=ψ(g1Ker(φ))ψ(g2Ker(φ))
Now is ψ surjective? Let him(φ), then there is some gG where φ(g)=h. But then ψ(gKer(φ))=φ(g)=h.

Now is ψ injective? Notice:
Ker(ψ)={gKer(φ)GKer(φ)|φ(g)=1H}={gKer(φ)|gKer(φ)}={gKer(φ)|gKer(φ)=1Ker(φ)}={1Ker(φ)}={1GKer(φ)}
so ψ is injective. Thus ψ is an isomorphism between the two groups!