But G/H is not a new or particularly different group, since there is an isomorphism
G/HHg→G↦g.
Example 9.2 Let
H=nZ={multiples of n}={…,−2n,−n,0,n,2n,…}.
Then
Ha={a′∈Z∣a′=kn+a,for some k∈Z}=Oa.
Proposition 9.2 There is a bijection
Z/nZ→{0,1,…,n−1}
for every
n⩾1.
Proof: Given
Oa∈Z/nZ,
let ra be the unique number such that
a=kn+ra,k∈Z,ra∈{0,1,…,n−1}.
That is, ra is the remainder obtained when dividing a by n—a concept familiar from elementary school.
Define the bijection by
Z/nZOa→{0,1,…,n−1}↦ra.
Well defined?
If
Oa=Oa′,
then
a′=a+k′n.(by the definition of an orbit)
Therefore,
a′=k′n+kn+ra=(k′+k)n+ra.
Hence
ra′=ra,
where ra′ is the unique element of
0,1,…,n−1
appearing in
a′=kn+ra′.
Thus the map is well defined.
Injective?
Given
O∗a
and
O∗b,
suppose
ra=rb.
Then
ab=kn+ra=ln+rb=ln+ra.
Therefore,
a−b=(k−l)n,
so
a∈Ob,
and hence
Oa=Ob.
Surjective?
O0O1O2On−1↦0↦1↦2⋮↦n−1.
□
By this proposition,
Z/nZ
is a group of order
n=∣{0,1,…,n−1}∣.
What is the structure of this group?
The group operation is: add the numbers and then take the remainder modulo n.
Definition 9.1 Let
a,b∈Z.
We write
a≡b(modn)
or
a=b(modn)
if
a−b=knfor some k∈Z.
Equivalently,
a≡b(modn)⟺Oa=Ob.
When we write
a(modn),
we mean the equivalence class
Oa=Ha∈G/H.
Remark It may seem inconvenient to keep track of large equivalence classes
O∗a,
O∗b,
and so on. Instead, we may simply regard
Oa
as a number: namely, the remainder r obtained when a is divided by n:
a=kn+r.
This is justified by the bijection
Z/nZ≅{0,…,n−1}.
Thus, whenever you see
“a(modn)”,
you may simply think of the number r.
Similarly, the group operation is just “clock arithmetic”:
(a,b)↦a+b(modn).
You can think of this as the remainder of (a+b) upon division by n.
§9.2 Subgroups Descend to Quotient Groups
Let G be an arbitrary group and let
H◃G.
Proposition 9.3 There is a bijection between the set of subgroups of G containing H and the set of subgroups of G/H.
Proof: Let
p:G→G/H
be the group homomorphism sending g to [g].
Given a subgroup
K⊂G,
consider the composition of group homomorphisms
KG→G/H.
Since the image of any group homomorphism is a subgroup, this shows that
p(K)
is a subgroup of
G/H.
Thus we obtain a map
{subgroups of G}→{subgroups of G/H}
given by
K↦p(K).
We prove that this map is surjective. Given
K′⊂G/H,
consider the preimage
p−1(K′)⊂G.
This is a subgroup of G, because if
p(x),p(y)∈K′,
then
p(xy)=p(x)p(y)∈K′,
since K′ is closed under multiplication.
Now it remains only to prove that for every
K⊂G,
p−1(p(K))=K.
Clearly,
K⊂p−1(p(K)).
To prove the other inclusion, let
x∈p−1(p(K)).
By the definition of p(K), there exists some
y∈K
such that
p(x)=p(y).
Then
p(xy−1)=1G/H,
so
xy−1∈H.
Since K contains H,
xy−1∈K,
and therefore
x∈K.
□
Proposition 9.4 There is a bijection between the set of normal subgroups of G containing H and the set of normal subgroups of G/H.
Proof: We first prove that if K is normal, then p(K) is normal. This gives a map
{normal subgroups of G}→{normal subgroups of G/H}.
Indeed, if
[k]∈p(K),
then
[g][k][g]−1=[gkg−1]=[k′]
for some
k′∈K,
because K is normal in G.
Therefore,
p(K)⊂G/H
is a normal subgroup.
Notice that here we used the fact that
G→G/H
is surjective; otherwise, we would not know that every element of G/H lies in the image p(G).
Surjectivity: We prove that if p(K) is normal, then
K=p−1(p(K))
is normal.
If
k∈K,g∈G,
then
[gkg−1]=[g][k][g−1]=[k′]
for some
[k′]∈p(K),
i.e. for some
k′∈K.
Therefore,
gkg−1∈p−1(p(K))=K.
We already know that this assignment is injective.
□
§9.3 Commutative Diagrams
Definition 9.2 Suppose we have groups
K,G,H,X
and maps between these groups:
If
ψ∘ϕ=β∘α:K→X,
we say that the diagram commutes, or that it is commutative.
Remark The symbol 1 will denote the trivial group. This group is uniquely determined up to isomorphism.
Now consider the diagram
What does it mean for this diagram to commute?
It means precisely that
ψ∘ϕ
is the map sending every element to the identity.
Why?
Because the maps along the left and bottom send every element of K to
1X∈X
assuming they are group homomorphisms. Thus
ψ∘ϕ
is a constant map.
Equivalently,
im(ϕ)⊂ker(ψ).
This is very close to the notion of exactness that we discussed earlier.
Example 9.3
K=G=X=1.
Example 9.4
K=SLn(R),G=GLn(R),X=R×,
where ϕ is the inclusion map and
ψ=det.
Example 9.5 Let
K⊂G
be a normal subgroup, so ϕ is the inclusion map.
Let
X=G/K.
Since K is normal in G, this is a group. Let ψ be the canonical quotient projection.
§9.4 The Universal Property of Quotient Groups
Theorem 9.5 Given a commutative diagram
there exists a unique homomorphism
ψ~:G/X→X
such that the diagram
commutes.
In other words, if
ψ:G→X
is such that
K⊂ker(ψ)
for some normal subgroup
K⊂G,
then there exists a unique map
ψ~:G/K→X
such that
ψ=ψ~∘π,
where
π:G→G/K
is the canonical quotient map.
This is called the universal property of the quotient group.
Proof: We want to define the map
ψ~:G/K→X.
Define it by taking a coset
Kg↦ψ(g),
or equivalently by choosing any preimage in G of a coset in G/K under the canonical map π.
We need to prove that this is well defined.
Suppose
Kg=Kg′,
or equivalently
g=k⋅g′.
Do we have
ψ(g)=ψ(g′)?
Indeed,
ψ(g)=ψ(k⋅g′)=ψ(k)⋅ψ(g′)=ψ(g′),
so everything works.
We now need to verify that ψ~ is unique and that
ψ=ψ~∘π.
But
ψ(g)=ψ~(Kg)=ψ~(π(g)).
Thus it remains only to prove uniqueness.
Suppose there is another such map
γ:G/K→X.
Then
ψ(g)=γ(π(g))=γ(Kg).
Hence γ and ψ~ must agree on every coset K, and we are done.
□
Remark The uniqueness follows from the requirement in the theorem that the diagram commute.
§9.5 Generalization of Quotient Groups
The idea of a universal property allows us to generalize the notion of a quotient group.
Let
G↠χH
be any surjective homomorphism. We now use a double arrow to indicate surjectivity.
Then H is a “quotient group” of G, in the sense that a diagram of the form
has a similar universal property.
To answer the question, what should K be? We simply take it to be the kernel of χ.
Thus:
Theorem 9.6 Given
G↠χH,
let
K=ker(χ).
Then the diagram
where
i:K→G
is the inclusion map, has the same universal property:
given any group homomorphism
ψ:G→X
whose kernel contains K, there exists a unique map
ψ~:H→X
such that
ψ=ψ~∘χ.
Proof: How do we define
ψ~:H→X?
Since χ is surjective, for every
h∈H
there exists some
g∈G
such that
h=χ(g),
although g need not be unique.
Now define
ψ~:=ψ(g).
We need to check that this is a well-defined homomorphism.
Suppose
χ(g)=χ(g′).
Then
χ(g)=χ(g′)
implies
χ(g⋅(g′)−1)=1H.
Therefore,
g⋅(g′)−1∈K,
and hence
g=g′⋅k
for some
k∈K.
The remainder of the argument is exactly the same as in the proof of the previous theorem.
□
Corollary 9.7 Suppose
χ:G→H
is surjective and
K=ker(χ).
Then
H≅G/K.
Remark This is the so-called First Isomorphism Theorem. Let us prove it using universal properties. We will see it again in the next chapter.
Proof: Theorem 9.3 gives a map from
G/K
to
H,
and Theorem 9.4 gives a map from
H
to
G/K.
Composing these maps gives a map
G/K→H→G/K.
This composite satisfies the required commutativity constraints.
The composite is given by the two maps obtained from the two theorems, but the identity map
G/K→G/K
also satisfies the same constraints.
Since these maps are uniquely determined, the composite must be the identity.
Similarly, in the other direction, we obtain a composite
H→G/K→H,
and the same argument shows that this composite is the identity on H.
Thus we have maps
G/K→H
and
H→G/K
whose composites in both directions are identity maps.
Therefore there is a bijection between
G/K
and
H.
Since the maps are group homomorphisms, they are in fact isomorphic as groups.
□
Remark The notion of a universal property allows us to characterize certain objects uniquely, up to isomorphism, just as we did in the proof of the corollary, because a universal property is a statement of existence and uniqueness.
If you are thinking categorically, two objects are “isomorphic in a category” precisely when they satisfy the same universal property.
In our example, two groups—the quotient group and any group onto which G maps surjectively—satisfy the same universal property in the “category of groups”, so they are isomorphic.
This is a very important idea in category theory and is related to a consequence of the Yoneda lemma.
Proposition 9.8 Let K,G be arbitrary groups and let
ϕ:K→G
be any group homomorphism.
Then there exists another group homomorphism
ψ:G→H
such that we have a universal property represented by the diagram
where
ϵ:K→1
is the trivial homomorphism sending every element of K to the identity of the trivial group 1, and the bottom arrow
1→H
is the unique homomorphism from the trivial group to H.
Proof:
Construct H and ψ.
Define
H=G/ϕ(K),
where ϕ(K) is the image of K under ϕ, and hence is a subgroup of G.
The quotient
G/ϕ(K)
consists of all cosets
gϕ(K),g∈G.
Define
ψ:G→H
to be the natural projection
ψ(g)=gϕ(K).
Thus ψ sends each element g to its coset in H, and ψ is a surjective homomorphism.
Verify commutativity of the diagram.
We need to show
ψ∘ϕ=ϵ.
For any
k∈K,
compute
ψ(ϕ(k))=ϕ(k)ϕ(K)=ϕ(K).
Since
ϕ(k)∈ϕ(K),
the coset
ϕ(k)ϕ(K)
is equal to
ϕ(K),
which is the identity element of H.
Thus
ψ(ϕ(k))
sends every element of K to the identity in H.
This agrees with the composition through ϵ:
(the unique map from 1 to H)∘ϵ(k)=1H.
Therefore, the diagram commutes.
This construction satisfies the following universal property: