This sheet introduces cosets, derives Lagrange's Theorem—one of the most important counting theorems in group theory—and defines normal subgroups.

Commentary. Cosets are the fundamental tool for understanding the relationship between a group and its subgroups. They partition a group into equal-sized pieces, which leads directly to Lagrange's Theorem: the order of any subgroup divides the order of the group. This simple counting theorem has profound consequences—it tells us, for example, that every group of prime order is cyclic, and that the order of every element divides the order of the group. Normal subgroups, which are subgroups whose left and right cosets coincide, are exactly the subgroups that can serve as kernels of homomorphisms.

Equivalence Relations and Equivalence Classes#

Definition 3.0.1(Equivalence Relation). Let SS be a set. A relation ∼\sim on SS is an equivalence relation if for all a,b,c∈Sa, b, c \in S:

  1. Reflexive: a∼aa \sim a.
  2. Symmetric: If a∼ba \sim b, then b∼ab \sim a.
  3. Transitive: If a∼ba \sim b and b∼cb \sim c, then a∼ca \sim c.

Definition 3.0.2 (Equivalence Class). For a∈Sa \in S, the equivalence class of aa is:[a]={x∈S∣x∼a}.[a] = \{x \in S \mid x \sim a\}.

The set of all equivalence classes is denoted S/∼S/\sim.

Theorem 3.0.3(Equivalence Classes Partition the Set). If ∼\sim is an equivalence relation on SS, then the equivalence classes of ∼\sim form a partition of SS. That is:

  • Every element of SS belongs to at least one equivalence class.
  • If two equivalence classes intersect, they are equal.

Theorem 3.0.4(Equivalence Relation from a Partition). Conversely, if SS is partitioned into a collection of nonempty disjoint subsets, then the relation a∼ba \sim b iff aa and bb belong to the same subset is an equivalence relation.

Corollary.3.0.5 There is a one-to-one correspondence between equivalence relations on SS and partitions of SS.

Example.3.0.6 On Z\mathbb{Z}, define a∼ba \sim b iff a−ba - b is divisible by nn. The equivalence classes are the residue classes modulo nn:[0],[1],…,[n−1].[0], [1], \ldots, [n-1].

Remark. In Sheet 3, left cosets of a subgroup HH in a group GG are precisely the equivalence classes of the relation a∼ba \sim b iff a−1b∈Ha^{-1}b \in H. In Sheet 8, ideals and quotient rings use the same construction.

Cosets#

Definition 3.1. Let H≤GH \leq G and a∈Ga \in G. The left coset of HH in GG containing aa is:aH={ah∣h∈H}.aH = \{ah \mid h \in H\}.The right coset of HH in GG containing aa is:Ha={ha∣h∈H}.Ha = \{ha \mid h \in H\}.

Theorem 3.2. Let H≤GH \leq G. The left cosets of HH in GG form a partition of GG.

Theorem 3.3. For any a∈Ga \in G, the map h↦ahh \mapsto ah is a bijection from HH to aHaH. Hence all left cosets have the same cardinality as HH.

Theorem 3.4. For a,b∈Ga, b \in G, the following are equivalent:

  1. aH=bHaH = bH
  2. a−1b∈Ha^{-1}b \in H
  3. b∈aHb \in aH
  4. a∈bHa \in bH

Theorem 3.5. Two left cosets of HH in GG are either equal or disjoint.

Example 3.6. In Z\mathbb{Z}, the cosets of 3Z3\mathbb{Z} are:3Z,1+3Z,2+3Z.3\mathbb{Z}, \quad 1 + 3\mathbb{Z}, \quad 2 + 3\mathbb{Z}.

Example 3.7. In S3S_3, let H={ι,(12)}H = \{\iota, (12)\}. The left cosets are:H={ι,(12)},(13)H={(13),(123)},(23)H={(23),(132)}.H = \{\iota, (12)\}, \quad (13)H = \{(13), (123)\}, \quad (23)H = \{(23), (132)\}.

Exercise 3.8. Let G=Z12G = \mathbb{Z}_{12} and H=⟨3⟩H = \langle 3 \rangle. List all left cosets of HH in GG.

Exercise 3.9. Let G=D4G = D_4 and H=⟨ρ⟩H = \langle \rho \rangle (the rotations). List all left cosets of HH in GG.


Connecting Cosets to Equivalence Classes#

Theorem 3.9.1(Cosets as Equivalence Classes). Let H≤GH \leq G. Define a relation ∼L\sim_L on GG by:a∼Lb  ⟺  a−1b∈H.a \sim_L b \iff a^{-1}b \in H.

Then ∼L\sim_L is an equivalence relation, and for each a∈Ga \in G, the equivalence class of aa is:[a]=aH={ah∣h∈H}.[a] = aH = \{ah \mid h \in H\}.

Similarly, define a∼Rb  ⟺  ab−1∈Ha \sim_R b \iff ab^{-1} \in H. Then ∼R\sim_R is an equivalence relation, and the equivalence class of aa is:[a]=Ha={ha∣h∈H}.[a] = Ha = \{ha \mid h \in H\}.

Remark. The correspondence between equivalence classes and cosets is the reason we can form quotient groups G/HG/H: the elements of G/HG/H are equivalence classes under ∼L\sim_L, and the coset multiplication is well-defined when HH is normal.


Lagrange's Theorem#

Theorem 3.10 (Lagrange's Theorem). If GG is finite and H≤GH \leq G, then ∣H∣|H| divides ∣G∣|G|. Moreover,∣G∣=(G:H)⋅∣H∣,|G| = (G:H) \cdot |H|,where (G:H)(G:H) is the index of HH in GG, i.e., the number of distinct left cosets of HH in GG; GG is finite if there exists n∈Nn\in \mathbb{N}, ∣G∣=n|G|=n

Corollary 3.11. The order of any element of a finite group divides the order of the group.

Say a∈Ga\in G, consider <a>≤G<a>\leq G and ∣<a>∣=∣a∣|<a>|=|a|.
By Theorem 3.10, ∣a∣|a| devides ∣G∣|G|.

Corollary 3.12. Every group of prime order is cyclic.

By corollary 3.11, we know that the order of all elements in GG with a prime order pp, is either pp or 1.
Pick a,ba, b that a≠b∈Ga\neq b\in G, ap=bp=ea^p=b^p=e.
Suppose for contradiction that a≠bka\neq b^k, k∈Zk\in \mathbb{Z} then ap≠bpk=(bp)k=ek=ea^{p}\neq b^{pk}=(b^{p})^k=e^k=e.
Contradiction arises.
Thus, the supposition is wrong, a=bka=b^k.
So except from the identity with the order of 1, all other elements could be expressed as other elements to k powers. That fits the definition of cyclic group.

Alternative proof: We have <a>≤G<a>\leq G and prove <a>=G<a> =G. Then G is cyclic.

Corollary 3.13. If GG is finite of order nn, then an=ea^n = e for every a∈Ga \in G.

By theorem 3.11.

Corollary 3.14. If H≤GH \leq G and K≤HK \leq H, then (G:K)=(G:H)(H:K)(G:K) = (G:H)(H:K).

Use Lagrange's Theorem respectively to G,H; G,K, and H,K.

Theorem 3.15. If (G:H)=2(G:H) = 2, then HH contains the square of every element of GG.

Theorem 3.4. what about the intuition solution here?

Example 3.16. A group of order 77 is cyclic; every nonidentity element is a generator.

Exercise 3.17. Let GG be a group of order pqpq where pp and qq are distinct primes. Show that every proper subgroup of GG is cyclic.

Exercise 3.19. Show that a group of order 1515 has an element of order 33 and an element of order 55.

Exercise 3.20. Prove that if GG is a finite group and H≤GH \leq G with (G:H)=p(G:H) = p where pp is the smallest prime dividing ∣G∣|G|, then HH is normal in GG.


Normal Subgroups#

Definition 3.21. A subgroup N≤GN \leq G is normal in GG, denoted N◃GN \triangleleft G, if for all g∈Gg \in G and n∈Nn \in N:gng−1∈N.gng^{-1} \in N.

Theorem 3.22. The following are equivalent for N≤GN \leq G:

  1. N◃GN \triangleleft G.
  2. gNg−1=NgNg^{-1} = N for all g∈Gg \in G.
  3. gN=NggN = Ng for all g∈Gg \in G.
  4. NN is the kernel of some homomorphism from GG to another group. (no need to do it until u know what the kernel and homomorphism are)
  5. Every left coset of NN is also a right coset of NN.

Theorem 3.23. If N◃GN \triangleleft G, then the set of cosets G/NG/N forms a group under the operation:(aN)(bN)=(ab)N.(aN)(bN) = (ab)N.

1, This operation is Closed--(ab)N(ab)N is a coset of G.
2, Identity: (aN)(N)=aN  ⟹  N(aN)(N)=aN\implies N is identity.
3, Inverse: (aN)(a−1N)=(a−1a)N=N(aN)(a^{-1}N)=(a^{-1}a)N=N
4, Associativity: [(aN)(bN)](cN)=[(ab)N](cN)=(abc)N=(aN)[(bN)(cN)]=(aN)[(bc)N]=(abc)N[(aN)(bN)](cN)=[(ab)N](cN)=(abc)N=(aN)[(bN)(cN)]=(aN)[(bc)N]=(abc)N

Example 3.24. Every subgroup of an abelian group is normal.

Example 3.25. An◃SnA_n \triangleleft S_n.

Example 3.26. The subgroup of rotations in DnD_n is normal. The subgroup generated by a reflection is not normal when n≥3n \geq 3.

Theorem 3.27. The intersection of normal subgroups is normal.

Theorem 3.28. If H≤GH \leq G and (G:H)=2(G:H) = 2, then H◃GH \triangleleft G.

Theorem 3.29. If N◃GN \triangleleft G and H≤GH \leq G, then N∩H◃HN \cap H \triangleleft H.

First of all, N∩H≤HN \cap H\leq H.
Secondly, we prove it is normal.
Let n∈N∩Hn\in N\cap H i.e. n∈Nn\in N and n∈Hn\in H
Because H is closed, for all h∈Hh\in H, hnh−1∈Hhnh^{-1}\in H .
By N◃GN\triangleleft G and h∈Gh\in G, hnh−1∈Nhnh^{-1}\in N.
Thus, for all h∈H,h\in H, hnh−1∈N∩H.hnh^{-1}\in N\cap H.
Overall, N∩H◃HN \cap H \triangleleft H.

Theorem 3.30. If N◃GN \triangleleft G and H≤GH \leq G with N≤HN \leq H, then H/N≤G/NH/N \leq G/N. Moreover, H/N◃G/NH/N \triangleleft G/N iff H◃GH \triangleleft G.

Theorem 3.31. If N◃GN \triangleleft G and H≤GH \leq G, then HN={hn∣h∈H,n∈N}HN = \{hn \mid h \in H, n \in N\} is a subgroup of GG.

∣HN∣≤∣G∣|HN|\leq |G|
e∈HNe\in HN.
Associativity holds.
All the hh and nn are in HNHN (he=h,en=n)(he=h,en=n).
Closed: hnh1n1=(hnh1)n=n′n=n0∈HNhnh_{1}n_{1}=(hnh_{1})n=n'n=n_{0}\in HN (By N is normal, N is closed and n∈HNn\in HN respectively.)
Since it's closed, and that for arbitrary h,nh ,n ; n−1,h−1∈HNn^{-1},h^{-1}\in HN,
the inverse of hnhn, n−1h−1∈HNn^{-1}h^{-1}\in HN.
Therefore, HN={hn∣h∈H,n∈N}HN = \{hn \mid h \in H, n \in N\} is a subgroup of GG.

Theorem 3.32. If N◃GN \triangleleft G and M◃GM \triangleleft G, then NM◃GNM \triangleleft G.

gnmg−1=gnemg−1=gn(g−1g)mg−1=(gng−1)(gmg−1)=n′m′∈NMgnmg^{-1}=gnemg^{-1}=gn(g^{-1}g)mg^{-1}=(gng^{-1})(gmg^{-1})=n'm'\in NM

Exercise 3.33. Show that A3◃S3A_3 \triangleleft S_3.

Exercise 3.37. Let N◃GN \triangleleft G. Prove that if a∈Ga \in G has finite order, then the order of aNaN in G/NG/N divides the order of aa.


The Quotient Group#

Definition 3.38. Let N◃GN \triangleleft G. The quotient group (or factor group) G/NG/N is the set of left cosets of NN in GG with operation:(aN)(bN)=(ab)N.(aN)(bN) = (ab)N.

Theorem 3.39. If N◃GN \triangleleft G, then G/NG/N is a group.

Theorem 3.23.

Theorem 3.40 (The Natural Homomorphism). If N◃GN \triangleleft G, the map
π:G→G/N,π(g)=gN\pi: G \to G/N, \qquad \pi(g) = gN
is a surjective homomorphism with kernel NN.

Theorem 3.41. If GG is cyclic, then every quotient group G/NG/N is cyclic.

Theorem 3.42. If GG is abelian, then every quotient group G/NG/N is abelian.

Theorem 3.43. If GG is finite, then ∣G/N∣=∣G∣/∣N∣|G/N| = |G|/|N|.

By lagrange theorem.

Theorem 3.44. If N◃GN \triangleleft G and G/NG/N is finite, then for every g∈Gg \in G:g∣G/N∣∈N.g^{|G/N|} \in N.

Now normal group is not only about itself and its definition. It's an elements in the quotient group whose properties can be used.

Example 3.45. Z/nZ≅Zn\mathbb{Z}/n\mathbb{Z} \cong \mathbb{Z}_n.

Example 3.46. Sn/An≅Z2S_n/A_n \cong \mathbb{Z}_2.

Example 3.47. Dn/⟨ρ⟩≅Z2D_n/\langle \rho \rangle \cong \mathbb{Z}_2 (where ρ\rho is rotation).

Exercise 3.48. Let G=Z12G = \mathbb{Z}_{12} and N=⟨3⟩N = \langle 3 \rangle. List the elements of G/NG/N and write its Cayley table. To which familiar group is G/NG/N isomorphic?

Exercise 3.49. Let G=D4G = D_4 and N=⟨ρ2⟩N = \langle \rho^2 \rangle. Compute G/NG/N. Is it abelian?

Exercise 3.50. Let GG be a group and N◃GN \triangleleft G. Prove that if G/NG/N and NN are both cyclic, it does not necessarily follow that GG is cyclic. Find a counterexample.


The Correspondence Theorem for Groups#

Theorem 3.51 (Correspondence Theorem). Let N◃GN \triangleleft G. There is a bijection between:

  • Subgroups HH of GG with N≤H≤GN \leq H \leq G, and
  • Subgroups H‾\overline{H} of G/NG/N,

given by:H↦H/N,H‾↦π−1(H‾).H \mapsto H/N, \qquad \overline{H} \mapsto \pi^{-1}(\overline{H}).

Moreover, this bijection preserves inclusions, intersections, products, and normality. Specifically:

  • H1≤H2H_1 \leq H_2 iff H1/N≤H2/NH_1/N \leq H_2/N.
  • H◃GH \triangleleft G iff H/N◃G/NH/N \triangleleft G/N.

Corollary 3.52. The subgroups of G/NG/N are exactly the subgroups of GG that contain NN.

Exercise 3.53. Let G=Z12G = \mathbb{Z}_{12} and N=⟨3⟩N = \langle 3 \rangle. List all subgroups of G/NG/N using the Correspondence Theorem.

Exercise 3.54. Let GG be a finite group and N◃GN \triangleleft G. Prove that G/NG/N has a subgroup of order dd for every dd dividing ∣G/N∣|G/N| iff GG has a subgroup of order d⋅∣N∣d \cdot |N| containing NN.


Summary#

We have introduced:

  • Left and right cosets
  • The partition of a group into cosets
  • Lagrange's Theorem and its corollaries
  • The index of a subgroup
  • Normal subgroups and their characterizations
  • The quotient group G/NG/N
  • The natural homomorphism G→G/NG \to G/N
  • Properties of quotient groups: cyclic, abelian, order
  • The Correspondence Theorem for groups
  • Applications to subgroups and quotients