Skip to content

Subgroups

2.1 Definition and Criterion

A subgroup HH of GG is a subset HGH \subseteq G that is itself a group under the operation of GG.

Theorem 2.1 (Subgroup Criterion). A non-empty subset HGH \subseteq G is a subgroup if and only if For all a,bHa, b \in H:

  1. ab1Ha * b^{-1} \in H (closed under the operation and inverses).

Proof. If HH is a subgroup, closure gives ab1Ha * b^{-1} \in H. Conversely, since HH is non-empty, Pick aHa \in H. Then aa1=eHa * a^{-1} = e \in HAnd ea1=a1He * a^{-1} = a^{-1} \in H. For any a,bHa, b \in H We have b1Hb^{-1} \in HSo a(b1)1=abHa * (b^{-1})^{-1} = a * b \in HProving closure under the group operation. \blacksquare

Corollary 2.2 (Finite Subgroup Criterion). A non-empty finite subset HGH \subseteq G is a subgroup If and only if HH is closed under the group operation.

2.2 Examples of Subgroups

Example. For any group GG, {e}\{e\} and GG itself are subgroups (the trivial subgroups).

Example. The set SLn(R)SL_n(\mathbb{R}) of n×nn \times n real matrices with determinant 11 is a subgroup of GLn(R)GL_n(\mathbb{R}).

Example. The set AnA_n of even permutations in SnS_n is a subgroup called the alternating group. An=n!/2|A_n| = n!/2.

2.3 The Center of a Group

The center of GG is Z(G)={zG:zg=gz for all gG}Z(G) = \{z \in G : zg = gz \mathrm{\ for\ all\ } g \in G\}.

Proposition 2.3. Z(G)Z(G) is a subgroup of GG.

Proof. eZ(G)e \in Z(G). If z1,z2Z(G)z_1, z_2 \in Z(G) and gGg \in GThen (z1z2)g=z1(z2g)=z1(gz2)=(z1g)z2=(gz1)z2=g(z1z2)(z_1 z_2)g = z_1(z_2 g) = z_1(g z_2) = (z_1 g)z_2 = (g z_1)z_2 = g(z_1 z_2)So z1z2Z(G)z_1 z_2 \in Z(G). Also, zg=gzz g = g z implies g=z1gzg = z^{-1} g zSo gz1=z1gg z^{-1} = z^{-1} gGiving z1Z(G)z^{-1} \in Z(G). \blacksquare

2.4 Cyclic Subgroups

For gGg \in GThe cyclic subgroup generated by gg is

g={gn:nZ}\langle g \rangle = \{g^n : n \in \mathbb{Z}\}

Theorem 2.4. Every subgroup of a cyclic group is cyclic.

Proof. Let G=aG = \langle a \rangle and HGH \leq G. If H={e}H = \{e\}Then H=eH = \langle e \rangle. Otherwise, let mm be the smallest positive integer with amHa^m \in H. We claim H=amH = \langle a^m \rangle. For any akHa^k \in HWrite k=qm+rk = qm + r with 0r<m0 \leq r \lt m. Then ar=akqm=ak(am)qHa^r = a^{k - qm} = a^k (a^m)^{-q} \in H. By minimality of mm, r=0r = 0So ak=(am)qama^k = (a^m)^q \in \langle a^m \rangle. \blacksquare

Theorem 2.5. If G=aG = \langle a \rangle has order nnThen ak=n/gcd(n,k)|\langle a^k \rangle| = n / \gcd(n, k).

2.5 Worked Examples: Verifying the Subgroup Criterion

Problem. Let G=GL2(R)G = GL_2(\mathbb{R}) and H={AG:det(A)=±1}H = \{A \in G : \det(A) = \pm 1\}. Show that HGH \leq G.

Solution

Solution. HH is non-empty since I2HI_2 \in H (with det(I2)=1\det(I_2) = 1). Let A,BHA, B \in H. Then det(AB1)=det(A)det(B)1=(±1)(±1)1=±1\det(AB^{-1}) = \det(A)\det(B)^{-1} = (\pm 1)(\pm 1)^{-1} = \pm 1So AB1HAB^{-1} \in H. By the subgroup criterion, HGH \leq G. \blacksquare

Problem. Let G=(Z,+)G = (\mathbb{Z}, +) and H={5k3m:k,mZ}H = \{5k - 3m : k, m \in \mathbb{Z}\}. Show that H=ZH = \mathbb{Z}.

Solution

Solution. First, HH is a subgroup of (Z,+)(\mathbb{Z}, +): it is non-empty (0=5030H0 = 5 \cdot 0 - 3 \cdot 0 \in H), And if a=5k13m1a = 5k_1 - 3m_1 and b=5k23m2b = 5k_2 - 3m_2Then ab=5(k1k2)3(m1m2)Ha - b = 5(k_1 - k_2) - 3(m_1 - m_2) \in H.

Since gcd(5,3)=1\gcd(5, 3) = 1By Bezout”s identity there exist k,mZk, m \in \mathbb{Z} with 5k3m=15k - 3m = 1 So 1H1 \in H. Therefore H=1=ZH = \langle 1 \rangle = \mathbb{Z}. \blacksquare

2.6 Intersection of Subgroups

Theorem 2.6. If {Hi}iI\{H_i\}_{i \in I} is a family of subgroups of GGThen iIHi\bigcap_{i \in I} H_i is a subgroup of GG.

Proof. Since eHie \in H_i for all iiWe have eiIHie \in \bigcap_{i \in I} H_iSo the intersection is Non-empty. If a,biIHia, b \in \bigcap_{i \in I} H_iThen a,bHia, b \in H_i for all iiSo ab1Hiab^{-1} \in H_i For all ii (since each HiH_i is a subgroup). Thus ab1iIHiab^{-1} \in \bigcap_{i \in I} H_i. By the subgroup criterion, iIHiG\bigcap_{i \in I} H_i \leq G. \blacksquare

Remark. The union of subgroups need not be a subgroup. For example, in Z\mathbb{Z} 23\langle 2 \rangle \cup \langle 3 \rangle is not a subgroup since 2+3=5232 + 3 = 5 \notin \langle 2 \rangle \cup \langle 3 \rangle.

2.7 The Subgroup Generated by a Set

Let SGS \subseteq G be any subset (possibly empty). The subgroup generated by SS is

S={HG:SH}\langle S \rangle = \bigcap\{H \leq G : S \subseteq H\}

This is the smallest subgroup of GG containing SSAnd it equals the set of all finite products Of elements of SS and their inverses:

S={s1ϵ1s2ϵ2skϵk:siS, ϵi{1,1}, k0}\langle S \rangle = \{s_1^{\epsilon_1} s_2^{\epsilon_2} \cdots s_k^{\epsilon_k} : s_i \in S,\ \epsilon_i \in \{1, -1\},\ k \geq 0\}

When S={g1,,gn}S = \{g_1, \ldots, g_n\}We write g1,,gn\langle g_1, \ldots, g_n \rangle.

Example. In S3S_3, (1 2),(2 3)=S3\langle (1\ 2), (2\ 3) \rangle = S_3 since (1 2)(2 3)=(1 2 3)(1\ 2)(2\ 3) = (1\ 2\ 3), (1 2 3)(1 2)=(1 3)(1\ 2\ 3)(1\ 2) = (1\ 3)And we obtain all six elements.

Example. In D4D_4, r2,s={e,r2,s,r2s}V4\langle r^2, s \rangle = \{e, r^2, s, r^2s\} \cong V_4 (the Klein four-group).

Problem. Show that Sn=(1 2),(1 2  n)S_n = \langle (1\ 2), (1\ 2\ \ldots\ n) \rangle.

Solution

Solution. Let σ=(1 2  n)\sigma = (1\ 2\ \ldots\ n) and τ=(1 2)\tau = (1\ 2). For any 1i<n1 \leq i \lt n σi1τσ(i1)=(i i+1)\sigma^{i-1}\tau\sigma^{-(i-1)} = (i\ i+1) (conjugation by σ\sigma shifts the transposition). Since adjacent transpositions (i i+1)(i\ i+1) generate SnS_n (every permutation factors into adjacent Transpositions), we have Sn=σ,τS_n = \langle \sigma, \tau \rangle. \blacksquare