This sheet introduces subgroups—the fundamental substructures of groups—and cyclic groups, the simplest class of groups.


Subgroups#

Definition 2.1. Let (G,∗)(G, *) be a group. A nonempty subset H⊆GH \subseteq G is called a subgroup of GG if HH is closed under the operation ∗* and, with the induced operation, HH itself forms a group. We denote this by H≤GH \leq G.

Theorem 2.2 (Subgroup Criterion). A nonempty subset HH of a group GG is a subgroup if and only if for all a,b∈Ha, b \in H, we have a∗b−1∈Ha * b^{-1} \in H.

inherit associvity

Theorem 2.3 (Finite Subgroup Criterion). If HH is a finite nonempty subset of a group GG and HH is closed under the group operation (i.e., ab∈Hab \in H for all a,b∈Ha, b \in H), then HH is a subgroup of GG.

Theorem 2.4. Let H≤GH \leq G. Then:

(a) The identity element of HH is the identity element of GG.

(b) The inverse of an element in HH is its inverse in GG.

Definition 2.5. The trivial subgroup of a group GG is the subgroup {e}\{e\} consisting only of the identity element. A subgroup HH is called a proper subgroup if H≠GH \neq G.

Theorem 2.10. The intersection of any collection of subgroups of a group GG is again a subgroup of GG.

Definition 2.11. Let SS be a nonempty subset of a group GG. The subgroup generated by SS, denoted ⟨S⟩\langle S \rangle, is the intersection of all subgroups of GG containing SS. Equivalently, ⟨S⟩\langle S \rangle consists of all finite products of elements of SS and their inverses. If G=⟨S⟩G = \langle S \rangle, we say that SS generates GG.

Exercise 2.12. Show that the union of two subgroups is a subgroup if and only if one is contained in the other.

Exercise 2.13. Let H≤GH \leq G and K≤GK \leq G. Prove that HK={hk∣h∈H,k∈K}HK = \{hk \mid h \in H, k \in K\} is a subgroup of GG if and only if HK=KHHK = KH.


Cyclic Subgroups#

Definition 2.14. Let GG be a group and a∈Ga \in G. The cyclic subgroup generated by aa is⟨a⟩={an∣n∈Z},\langle a \rangle = \{a^n \mid n \in \mathbb{Z}\},where a0=ea^0 = e, an=a∗a∗⋯∗aa^n = a * a * \cdots * a (nn factors) for n>0n > 0, and an=(a−1)−na^n = (a^{-1})^{-n} for n<0n < 0.

The order of a group is the number of its elements. We denote ∣G∣|G| as its order.

Definition 2.15. A group GG is cyclic if G=⟨a⟩G = \langle a \rangle for some a∈Ga \in G. Such an element aa is called a generator of GG.

Example 2.16. (Z,+)(\mathbb{Z}, +) is cyclic; both 11 and −1-1 are generators.

Example 2.17. (Zn,+n)(\mathbb{Z}_n, +_n) is cyclic; 11 is a generator.

Example 2.18. The group of nnth roots of unity in C\mathbb{C} is cyclic under multiplication.

Definition 2.19. The order of an element a∈Ga \in G, denoted ∣a∣|a|, is the smallest positive integer nn such that an=ea^n = e. If no such nn exists, aa has infinite order.

Theorem 2.20. If aa has finite order nn, then:⟨a⟩={e,a,a2,…,an−1},\langle a \rangle = \{e, a, a^2, \ldots, a^{n-1}\},and these nn elements are distinct.

Theorem 2.21. For any a∈Ga \in G, ∣a∣=∣⟨a⟩∣|a| = |\langle a \rangle|.

Theorem 2.22. If ak=ea^k = e, then ∣a∣|a| divides kk.

Theorem 2.23 (Order of a Power). Let aa have order nn. Then for any integer kk:
∣ak∣=ngcd⁡(n,k).|a^k| = \frac{n}{\gcd(n, k)}.

Corollary 2.24. aka^k generates ⟨a⟩\langle a \rangle iff gcd⁡(n,k)=1\gcd(n, k) = 1.

Exercise 2.25. Find the order of each element in Z6\mathbb{Z}_6.

Exercise 2.26. Find the order of each element in S3S_3.

Exercise 2.27. Let aa have order 1212. Find the orders of a2,a3,a4,a5,a6a^2, a^3, a^4, a^5, a^6.


Subgroups of Cyclic Groups#

Theorem 2.28. Let G=⟨a⟩G = \langle a \rangle be infinite cyclic. Then every nontrivial subgroup is infinite cyclic, and the subgroups are precisely ⟨ak⟩\langle a^k \rangle for k∈Z+k \in \mathbb{Z}^+.

Theorem 2.29. Let G=⟨a⟩G = \langle a \rangle be a cyclic group of order nn.

(a) For each divisor dd of nn, there is exactly one subgroup of order dd, namely ⟨an/d⟩\langle a^{n/d} \rangle.

(b) The subgroups of GG are precisely ⟨ad⟩\langle a^d \rangle for each divisor dd of nn.

(c) If H=⟨ak⟩H = \langle a^k \rangle, then ∣H∣=n/gcd⁡(n,k)|H| = n / \gcd(n, k).

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

Theorem 2.31 (Subgroup Lattice of Cyclic Groups). For a cyclic group G=⟨a⟩G = \langle a \rangle of order nn, the subgroups form a lattice under inclusion, ordered by divisibility: ⟨ad⟩⊆⟨ae⟩\langle a^d \rangle \subseteq \langle a^e \rangle iff e∣de \mid d.

Exercise 2.32. Find all subgroups of Z12\mathbb{Z}_{12}.

Exercise 2.33. Find all subgroups of Z18\mathbb{Z}_{18}.

Exercise 2.34. How many subgroups does Z24\mathbb{Z}_{24} have? List them.

Exercise 2.35. Let G=⟨a⟩G = \langle a \rangle be cyclic of order nn. Prove that aka^k generates GG if and only if gcd⁡(k,n)=1\gcd(k, n) = 1.


Generators of Cyclic Groups#

Definition 2.36. The Euler phi-function φ(n)\varphi(n) is the number of integers kk with 1≤k≤n1 \leq k \leq n such that gcd⁡(k,n)=1\gcd(k, n) = 1.

Theorem 2.37. A cyclic group of order nn has exactly φ(n)\varphi(n) generators.

Example 2.38. Z12\mathbb{Z}_{12} has φ(12)=4\varphi(12) = 4 generators. They are 1,5,7,111, 5, 7, 11.

Exercise 2.39.
(a) Find all generators of Z20\mathbb{Z}_{20}.
(b) Find all generators of Z15\mathbb{Z}_{15}.
(c) How many generators does Z100\mathbb{Z}_{100} have?
(d) For which nn does Zn\mathbb{Z}_n have exactly 2 generators? Exactly 4 generators?

Exercise 2.40. Prove that if GG is cyclic of order nn, then GG has exactly one subgroup of each order dividing nn.

Exercise 2.41. Let GG be a cyclic group of order nn. How many elements of order dd does GG have for each d∣nd \mid n? Express your answer in terms of φ\varphi.

Summary#

We have introduced:

  • Subgroups and the subgroup criterion
  • Finite subgroup criterion (closure under operation suffices for finite subsets)
  • The subgroup generated by a set
  • Cyclic subgroups and generators
  • The order of an element
  • The order of a power: ∥ak∥=n/gcd⁡(n,k)\|a^k\| = n / \gcd(n, k)
  • Classification of subgroups of cyclic groups
  • Subgroup lattice of cyclic groups
  • Euler's phi-function and counting generators
  • The Fundamental Theorem of Cyclic Groups