Abstract Algebra 05 - Direct and Semi-Direct Products, and Group Classification
January 10, 2021
This is the fifth post of the Introduction to Abstract Algebra series, and the last post about group theory. In this post, we will finalize our tool box by introducing automorphisms, direct products, and semi-direct products. Finally, we can start to harvest our efforts with group classification.
If G1,G2,⋯,Gn are groups, the direct products of the groups, denoted by G1×G2×⋯×Gn, is the direct products of the sets with following binary operation, (g1,g2,⋯,gn)∘(g1′,g2′,⋯,gn′)=(g1∘1g1′,g2∘2g2′,⋯,gn∘ngn′).
Proposition 5.2: Direct Products
If G1×G2×⋯×Gn is a direct product of n groups,
For each i∈[n], there exists a subjective homomorphism πi:G1×G2×⋯×Gn→Gi, where πi((g1,⋯,gn))=gi.
For each i∈[n], there exists a injective homomorphism ψi:Gi→G1×G2×⋯×Gn, where ψi(gi)=(e1,⋯,gi,⋯,en).
G1×G2×⋯×Gn≅Gσ(1)×Gσ(2)×⋯×Gσ(n) for σ∈Sn.
Proposition 5.3: Recognition Principle of Direct Products (Internal Direct Products)
If G is a group, and H,K are two normal subgroups such that HK=G and H∩K={e}, then G≅H×K. We say G is the internal direct product of H and K.
Automorphisms
Definition 5.4: Automorphism
For a group G, an automorphism is an isomorphism from G to itself. Aut(G) denotes the set of all automorphisms.
Proposition 5.5: The Conjugation Action and Automorphism
If H⊴G, the action of G acting on H by conjugation is a homomorphism of G to Aut(H). The kernel of the action is CG(H), and thus G/CG(H)≅ a subgroup of Aut(G).
If H⊂G, NG(H)/CG(H)≅ a subgroup of Aut(G).
Proposition 5.6:Aut(Z/nZ)≅(Z/nZ)×
Classification of Finitely Generated Abelian Groups
First, we need to understand that mathematicians consider only the abstract structure of groups. So as long as two groups are isomorphic, we consider them as the “same”, no matter the actual elements or operations of the specific group. We’d like to classify groups into their “representatives” up to isomporphism. For example, groups of order 4 are either isomorphic to C4 or C2×C2 (called the Klein four-group).
Definition 5.7: Finitely Generated Groups
A group G is finitely generated if there exists g1,⋯,gn∈G for some finite n such that G=⟨g1,⋯,gn⟩.
Theorem 5.8: Chinese Remainder
If n1,n2,⋯,nr are relatively prime integers, Gn1×Gn2×⋯×Gnr≅Gn1×⋯×nr.
Theorem 5.9: Fundamental Theorem of Abelian Groups
If G is a finitely generated abelian group, then we have G≅Z×⋯×Z×Z/n1×⋯Z/nk such that n1,⋯,nk≥2 and ni+1∣ni for i∈[k−1]. This decomposition is unique.
Equivalently, put ∣G∣=p1a1p2a2⋯prar, then G≅A1×⋯×Ar where Ai=piai. Moreover, for each Ai, Ai≅Z/pb1×⋯×Z/pbm where b1≥⋯≥bm. This decomposition is unique.
Example 5.1: Fundamental Theorem of Abelian Groups
Let G=Z/8×Z/6×Z/15, then G≅Z/120×Z/6≅Z/8×Z/2×Z/3×Z/3×Z/5.
Proof. The theorem can be proven by induction on the size of a group. We also need the technique of “taking a group to a power”. The full proof can be found here.
Semi-Direct Products
Definition/Theorem 5.10: Semi-Direct Products
Let H and K be groups and let ϕ be a homomorphism from K to Aut(H). Define the group G={(h,k)∣h∈H,k∈K}, with the binary operation (h1,k1)∘(h2,k2)=(h1ϕ(k1)(h2),k1k2). G is the semi-direct product of H and K, denoted as G=H⋊K. We have that
G is a group, and ∣G∣=∣H∣∣K∣.
H≅{(h,eK)∈G:h∈H},K≅{(eH,k)∈G:k∈K}.
H⊴G.
H∩K=e.
khk−1=ϕ(k)(h) for all h∈H,k∈K.
Proof. The first claim can be shown by directly checking the associativity and inverse of the binary operation, using the definitions of homomorphisms. The second claim can be shown by defining isomorphisms. With the second claim, we can identify H with {(h,eK)∈G:h∈H} and K with {(eH,k)∈G:k∈K}, or h∈H with (h,e) and k∈K with (e,k). The following claims are thus straightforward to show.
Proposition 5.11: Recognition of Semi-Direct Products
If G is a group, and H is a normal subgroup and K is a subgroup such that HK=G and H∩K={e}, then G≅H⋊ϕK, where ϕ:K→Aut(H) such that ϕ(k)(h)=khk−1.
Examples of Group Classification
Example 5.2: Groups of Order pq, p,q Primes
Assume WLOG that p<q. Let P∈Sylp(G),Q∈Sylq(G) be two subgroups. By the Sylow’s theorems, nq≡1modq and nq∣p, but we assume p<q, so nq=1. We also have np≡1modp and np∣q.
If p∤q−1, np=1 is the only possibility. Then G≅P×Q, a cyclic group.
Else if p∣q−1, it is possible that np=q. Then G≅Q⋊ϕP, where ϕ:P→Aut(Q)≅Z/q−1. P is a cyclic group, say P=⟨y⟩, and Aut(Q) is also cyclic and contains a unique subgroup of order p (by classification of finitely generated abelian groups), say <γ>∈Q. ϕi(y)=γi for i=0,⋯,p−1. When i=0, the trivial homomorphism gives the direct product G≅P×Q. The other p−1 homomorphisms gives p−1 isomorphic non-abelian groups G≅Q⋊ϕiP.
Example 5.3: Groups of Order 30
First, factor out 30=2×3×5.
By the Sylow’s theorems, n3=1 or 10,n5=1 or 6. Either n3=1 or n5=1, otherwise the number of elements exceeds 30, which means one of them is normal in G, so the product of a 3-group and a 5-group is a group of order 15, and from Example 5.2, we have that it is isomorphic to Z/15. Let the group be H≅Z/15. Note that H is normal in G since it has index of 2. Let K be a group of order 2. Since G=HK,H∩K=e, we have G≅H⋊ϕK, hwere ϕ:K→Aut(H)≅(Z/15)×≅Z/4×Z/2. Note that K contains only the identity and an element of order 2. Let H=⟨a⟩×⟨b⟩≅Z/5Z/3. There are only three elements in Aut(H) of order 2:
ψ1∈Aut(H), where ψ1(a)=a−1, ψ1(b)=b
ψ2∈Aut(H), where ψ2(a)=a,ψ2(b)=b−1
ψ3∈Aut(H), where ψ3(a)=a−1,ψ2(b)=b−1
Corresponding to these three elements are three homomorphisms:
G≅Q⋊ϕ1P≅Z/5×D6
G≅Q⋊ϕ2P≅Z/3×D10
G≅Q⋊ϕ3P≅D30
References
[1] Siegel, Kyler. MATH GU4041 Introduction to Modern Algebra I. Department of Mathematics, Columbia University. 2019.
[2] Dummit, David and Foote, Richard. Abstract Algebra. Third Edition. John Wiley and Sons, Inc. 2004.