Chapter 5: Direct and Semidirect Products and Abelian Groups
5.1 Direct Products
Proposition 1: If G1,…,Gn are groups, ∣G1×⋯×Gn∣=∣G1∣…∣Gn∣. Note that if ∣Gi∣=∞, for any i, the direct product's order is similarly infinite. Proposition 2: Let G=G1×⋯×Gn.
For each fixed i, the set of elements which have the identity of Gj in the jth position for all j=i is a subgroup of G isomorphic to Gi≅{(1,…,1,gi,1,…,1)∣gi∈Gi}.
For each fixed i, define πi:G→Gi by πi((g1,…,gn))=gi. Then πi is a surjective homomorphism with kerπi≅G1×⋯×Gi−1×Gi+1×⋯×Gn.
Definition: The elementary abelian group is Epn=nZp×⋯×Zp, with the property that xp=1,∀x∈Epn.
5.2 The Fundamental Theorem of Finitely Generated Abelian Groups
Definition:
A group G is finitely generated if ∃A⊆G with ∣A∣ finite such that G=⟨A⟩. (e.g. Z is finitely generated because Z=⟨1⟩).
For each r∈Z with r≥0, let Zr=rZ×⋯×Z, where Z0=1. The group Zr is called the free abelian group of rank r.
Theorem 3: (Chapter Title) Let G be a finitely generated abelian group.
Then G≅Zr×Zn1×⋯×Zns, provided that r≥0, nj≥2,∀j, and ni+1∣ni,∀1≤i≤s−1.
G only has one possible (unique) representation of this form.
r is called the free rank or Betti number of G, the integers n1,…,ns are the invariant factors of G, and the representation if called the invariant factor decomposition of G.
Fact:
Two finitely generated abelian groups are isomorphic ⟺ same free rank and same list of invariant factors.
A finitely generated abelian group is finite only if r=0.
Every prime divisor of n must divide the first invariant factor n1.
The type of G is (n1,…,ns).
Corollary 4: If n is the product of distinct primes, then up to isomorphism the only abelian group of order n is Zn. Fact: Determining all possible isomorphism classes of abelian groups of order n is solved by factoring n and partitioning into invariant factors. Theorem 5: Let G be an abelian group of order n>1 and let the unique factorization of n into distinct prime powers be n=p1α1…pkαk.
Then G≅A1×⋯×Ak, where ∣Ai∣=piαi (these are not alternating groups).
For each A∈{A1,..,Ak} with ∣A∣=pα, A≅Zpβ1×⋯×Zpβt with β1≥⋯≥βt≥1 and ∑i=1tβi=α.
G has only one possible (unique) decomposition of the form in (1), and each A similarly has only a unique decomposition of the form in (2). Note also that Zpβ1×⋯×Zpβt are the invariant factors of Ai.
The integers pβi are called the elementary divisors of G. The decomposition in (1),(2) is called the elementary divisor decomposition of G.
Fact: Determining all the possible invariant factor decompositions of finitely generated abelian groups of order n is equivalent to determining the number of ways to partition each α (for each pα in the factorization of n), then independently combining them. Proposition 6: Let m,n∈Z+.
If G is a finite abelian group of type (n1,…,nt), then t is called the rank of G.
The exponent of G is the smallest n∈Z+ such that xn=1,∀x∈G. If ∄n, then the exponent is ∞.
5.4 Recognizing Direct Products
Definition: Let G be a group, x,y∈G, and A,B⊆G with A,B=∅.
[x,y]=x−1y−1xy is called the commutator of x and y.
Define [A,B]=⟨[a,b]∣a∈A,b∈B⟩.
Define G′=⟨[x,y]∣x,y∈G⟩ to be the commutator subgroup of G.
Proposition 7: Let G be a group, x,y∈G, and H≤G.
xy=yx[x,y]. Importantly, xy=yx⟺[x,y]=1.
H⊴G⟺[H,G]<H.
σ[x,y]=[σ(x),σ(y)] for any σ∈Aut(G). Also, G′charG and G/G′ is abelian.
G/G′ is the largest abelian quotient of G, i.e. H⊴G and G/H is abelian ⟺G′≤H.
If φ:G→A is any homomorphism of G into an abelian group A, then φ factors through G′, i.e. G′≤kerφ.
Proposition 8: Let H,K≤G. The number of distinct ways of writing each element of the set HK in the form hk is ∣H∩K∣. If H∩K=1, each element of HK can be written uniquely as hk. Theorem 9: Let G be a group with H,K≤G satisfying
H,K⊴G.
H∩K=1. Then, HK≅H×K.
Definition: If G is a group satisfying Theorem 9, HK is called the internal direct product and H×K is called the external direct product.
5.5 Semidirect Products
Theorem 10: Let H,K be groups and let φ:K→Aut(H) be a homomorphism. Let ⋅ denote the left action of K on H determined by φ. Let G be the set of (h,k), then define the following multiplication on G: (h1,k1)(h2,k2)=(h1k1⋅h2,k1k2). Then,
G is a group with order ∣H∣∣K∣.
H≅{(h,1)∣h∈H} and K≅{(1,k)∣k∈K}, and the isomorphic copies of H,K in G are subgroups of G.
Now, identifying H,K with their isomorphic copies in G.
H⊴G.
H∩K=1.
∀h∈H,∀k∈K, khk−1=k⋅h=φ(k)(h).
Proposition 11: Let H,K be groups and let φ:K→Aut(H) be a homomorphism. Then the following are equivalent:
H⋊K≅H×K
φ is the trivial homomorphism
K⊴H⋊K.
Theorem 12: Suppose G is a group with H,K≤G such that
H⊴G
H∩K=1. Let φ:K→Aut(H) be the homomorphism that maps k to an inner automorphism. Then HK≅H⋊K.
Definition: Let H≤G. The complement for H in G is some K≤G with G=HK and H∩K=1.