Logo

Chapter 5: Direct and Semidirect Products and Abelian Groups

5.1 Direct Products

Proposition 1: If G1,…,GnG_{1},\dots,G_{n} are groups, ∣G1×⋯×Gn∣=∣G1∣…∣Gn∣\lvert G_{1}\times\dots \times G_{n} \rvert=\lvert G_{1} \rvert\dots \lvert G_{n} \rvert. Note that if ∣Gi∣=∞\lvert G_{i} \rvert=\infty, for any ii, the direct product's order is similarly infinite.
Proposition 2: Let G=G1×⋯×GnG=G_{1}\times\dots \times G_{n}.

Definition: The elementary abelian group is Epn=Zp×⋯×Zp⏟nE_{p^{n}}=\underbrace{ Z_{p}\times\dots \times Z_{p} }_{ n }, with the property that xp=1,∀x∈Epnx^{p}=1,\forall x \in E_{p^{n}}.

5.2 The Fundamental Theorem of Finitely Generated Abelian Groups

Definition:

Theorem 3: (Chapter Title) Let GG be a finitely generated abelian group.

Fact:

Corollary 4: If nn is the product of distinct primes, then up to isomorphism the only abelian group of order nn is ZnZ_{n}.
Fact: Determining all possible isomorphism classes of abelian groups of order nn is solved by factoring nn and partitioning into invariant factors.
Theorem 5: Let GG be an abelian group of order n>1n>1 and let the unique factorization of nn into distinct prime powers be n=p1α1…pkαkn=p_{1}^{\alpha_{1}}\dots p_{k}^{\alpha_{k}}.

Fact: Determining all the possible invariant factor decompositions of finitely generated abelian groups of order nn is equivalent to determining the number of ways to partition each α\alpha (for each pαp^{\alpha} in the factorization of nn), then independently combining them.
Proposition 6: Let m,n∈Z+m,n\in \mathbb{Z}^+.

Example: (Invariant Factors/Cyclic Decomposition →\to Elementary Divisors): ∣G∣=1800\lvert G \rvert=1800, G≅Z30×Z30×Z2G\cong Z_{30}\times Z_{30}\times Z_{2} ⟶\longrightarrow E={2,2,2,3,3,5,5}E=\{ 2,2,2,3,3,5,5 \}.
Example: (Elementary Divisors →\to Invariant Factors): ∣G∣=1800\lvert G \rvert=1800, E={2,2,2,3,3,25}E=\{ 2,2,2,3,3,25 \} ⟶\longrightarrow G≅Z2∗3∗25×Z2∗3∗1×Z2∗1∗1≅Z150×Z6×Z2G\cong Z_{2*3*25}\times Z_{2*3*1}\times Z_{2*1*1}\cong Z_{150}\times Z_{6}\times Z_{2}.
Example: (Elementary Divisors):

Definition:

5.4 Recognizing Direct Products

Definition: Let GG be a group, x,y∈Gx,y\in G, and A,B⊆GA,B\subseteq G with A,B≠∅A,B\neq \emptyset.

Proposition 7: Let GG be a group, x,y∈Gx,y\in G, and H≤GH\leq G.

Proposition 8: Let H,K≤GH,K\leq G. The number of distinct ways of writing each element of the set HKHK in the form hkhk is ∣H∩K∣\lvert H\cap K \rvert. If H∩K=1H\cap K=1, each element of HKHK can be written uniquely as hkhk.
Theorem 9: Let GG be a group with H,K≤GH,K\leq G satisfying

Definition: If GG is a group satisfying Theorem 9, HKHK is called the internal direct product and H×KH\times K is called the external direct product.

5.5 Semidirect Products

Theorem 10: Let H,KH,K be groups and let φ:K→Aut(H)\varphi:K\to \mathrm{Aut}(H) be a homomorphism. Let ⋅\cdot denote the left action of KK on HH determined by φ\varphi. Let GG be the set of (h,k)(h,k), then define the following multiplication on GG: (h1,k1)(h2,k2)=(h1  k1⋅h2,k1k2)(h_{1},k_{1})(h_{2},k_{2})=(h_{1}\;k_{1}\cdot h_{2},k_{1}k_{2}). Then,

Now, identifying HH,KK with their isomorphic copies in GG.

Proposition 11: Let H,KH,K be groups and let φ:K→Aut(H)\varphi:K\to \mathrm{Aut}(H) be a homomorphism. Then the following are equivalent:

Theorem 12: Suppose GG is a group with H,K≤GH,K\leq G such that

Definition: Let H≤GH\leq G. The complement for HH in GG is some K≤GK\leq G with G=HKG=HK and H∩K=1H\cap K=1.