2.1 Definition and Criterion
A subgroup H of G is a subset H⊆G that is itself a group under the operation of G.
Theorem 2.1 (Subgroup Criterion). A non-empty subset H⊆G is a subgroup if and only if For all a,b∈H:
- a∗b−1∈H (closed under the operation and inverses).
Proof. If H is a subgroup, closure gives a∗b−1∈H. Conversely, since H is non-empty, Pick a∈H. Then a∗a−1=e∈HAnd e∗a−1=a−1∈H. For any a,b∈H We have b−1∈HSo a∗(b−1)−1=a∗b∈HProving closure under the group operation. ■
Corollary 2.2 (Finite Subgroup Criterion). A non-empty finite subset H⊆G is a subgroup If and only if H is closed under the group operation.
2.2 Examples of Subgroups
Example. For any group G, {e} and G itself are subgroups (the trivial subgroups).
Example. The set SLn(R) of n×n real matrices with determinant 1 is a subgroup of GLn(R).
Example. The set An of even permutations in Sn is a subgroup called the alternating group. ∣An∣=n!/2.
2.3 The Center of a Group
The center of G is Z(G)={z∈G:zg=gz for all g∈G}.
Proposition 2.3. Z(G) is a subgroup of G.
Proof. e∈Z(G). If z1,z2∈Z(G) and g∈GThen (z1z2)g=z1(z2g)=z1(gz2)=(z1g)z2=(gz1)z2=g(z1z2)So z1z2∈Z(G). Also, zg=gz implies g=z−1gzSo gz−1=z−1gGiving z−1∈Z(G). ■
2.4 Cyclic Subgroups
For g∈GThe cyclic subgroup generated by g is
⟨g⟩={gn:n∈Z}
Theorem 2.4. Every subgroup of a cyclic group is cyclic.
Proof. Let G=⟨a⟩ and H≤G. If H={e}Then H=⟨e⟩. Otherwise, let m be the smallest positive integer with am∈H. We claim H=⟨am⟩. For any ak∈HWrite k=qm+r with 0≤r<m. Then ar=ak−qm=ak(am)−q∈H. By minimality of m, r=0So ak=(am)q∈⟨am⟩. ■
Theorem 2.5. If G=⟨a⟩ has order nThen ∣⟨ak⟩∣=n/gcd(n,k).
2.5 Worked Examples: Verifying the Subgroup Criterion
Problem. Let G=GL2(R) and H={A∈G:det(A)=±1}. Show that H≤G.
Solution
Solution. H is non-empty since I2∈H (with det(I2)=1). Let A,B∈H. Then det(AB−1)=det(A)det(B)−1=(±1)(±1)−1=±1So AB−1∈H. By the subgroup criterion, H≤G. ■
Problem. Let G=(Z,+) and H={5k−3m:k,m∈Z}. Show that H=Z.
Solution
Solution. First, H is a subgroup of (Z,+): it is non-empty (0=5⋅0−3⋅0∈H), And if a=5k1−3m1 and b=5k2−3m2Then a−b=5(k1−k2)−3(m1−m2)∈H.
Since gcd(5,3)=1By Bezout”s identity there exist k,m∈Z with 5k−3m=1 So 1∈H. Therefore H=⟨1⟩=Z. ■
2.6 Intersection of Subgroups
Theorem 2.6. If {Hi}i∈I is a family of subgroups of GThen ⋂i∈IHi is a subgroup of G.
Proof. Since e∈Hi for all iWe have e∈⋂i∈IHiSo the intersection is Non-empty. If a,b∈⋂i∈IHiThen a,b∈Hi for all iSo ab−1∈Hi For all i (since each Hi is a subgroup). Thus ab−1∈⋂i∈IHi. By the subgroup criterion, ⋂i∈IHi≤G. ■
Remark. The union of subgroups need not be a subgroup. For example, in Z ⟨2⟩∪⟨3⟩ is not a subgroup since 2+3=5∈/⟨2⟩∪⟨3⟩.
2.7 The Subgroup Generated by a Set
Let S⊆G be any subset (possibly empty). The subgroup generated by S is
⟨S⟩=⋂{H≤G:S⊆H}
This is the smallest subgroup of G containing SAnd it equals the set of all finite products Of elements of S and their inverses:
⟨S⟩={s1ϵ1s2ϵ2⋯skϵk:si∈S, ϵi∈{1,−1}, k≥0}
When S={g1,…,gn}We write ⟨g1,…,gn⟩.
Example. In S3, ⟨(1 2),(2 3)⟩=S3 since (1 2)(2 3)=(1 2 3), (1 2 3)(1 2)=(1 3)And we obtain all six elements.
Example. In D4, ⟨r2,s⟩={e,r2,s,r2s}≅V4 (the Klein four-group).
Problem. Show that Sn=⟨(1 2),(1 2 … n)⟩.
Solution
Solution. Let σ=(1 2 … n) and τ=(1 2). For any 1≤i<n σi−1τσ−(i−1)=(i i+1) (conjugation by σ shifts the transposition). Since adjacent transpositions (i i+1) generate Sn (every permutation factors into adjacent Transpositions), we have Sn=⟨σ,τ⟩. ■