01.02.02 · foundations / groups

Subgroup, coset, quotient group, isomorphism theorems

shipped3 tiersLean: none

Anchor (Master): Lang Algebra §I.3-4; Jordan 1870; Holder 1889

Intuition [Beginner]

A subgroup is a smaller group living inside a bigger one. The even numbers sit inside all the integers: add two even numbers and you get an even number, zero is even, and the negative of an even number is even. The even numbers form a subgroup of the integers under addition.

A coset is a shifted copy of a subgroup. Start with the even numbers and shift everything by : you get . That shifted copy is a coset. The original subgroup and its cosets partition the whole group into disjoint blocks that tile everything with no overlap and no gaps.

A quotient group collapses each coset down to a single point. Instead of tracking individual numbers, you track which block they fall into. The integers modulo are the canonical example: collapse every block of consecutive integers to a single residue class.

Why does this concept exist? Subgroups, cosets, and quotients let you study a large group by breaking it into manageable pieces whose structure mirrors the original.

Visual [Beginner]

The integers partitioned into even and odd cosets. The even numbers (the subgroup) and the odd numbers (its single coset) form a two-block tiling of the number line.

Integers partitioned into even and odd cosets

Each block is a coset of the subgroup of even integers. The quotient group has exactly two elements: the even block and the odd block.

Worked example [Beginner]

Consider the integers under addition and the subgroup of multiples of .

Step 1. The cosets are , , and .

Step 2. Every integer falls into exactly one of these three blocks. Adding a number from block to a number from block always lands in block .

Step 3. The quotient group has three elements: the three blocks. Block addition works like clock arithmetic with three positions. Block plus Block equals Block .

What this tells us: collapsing a subgroup produces a new group whose elements are cosets and whose operation inherits from the original.

Check your understanding [Beginner]

Formal definition [Intermediate+]

Let be a group with identity .

Definition (Subgroup). A subset is a subgroup if is itself a group under the operation inherited from . Equivalently, is non-empty and for all (the one-step subgroup test). Notation: [Dummit-Foote §3].

Definition (Left coset). For and , the left coset of containing is $$ gH = {gh : h \in H}. $$ Right cosets are defined analogously as .

Definition (Index). The index is the number of distinct left cosets of in . This may be infinite.

Definition (Normal subgroup). A subgroup is normal if for every . Equivalently, for all : left and right cosets coincide. Notation: .

Definition (Quotient group). When , the set of cosets forms a group under the operation . The identity is , and the inverse of is [Lang §I.3-4].

Counterexamples to common slips [Intermediate+]

  • A subgroup is not the same as a subset. The subset of is not a subgroup: is not in .
  • Left cosets and right cosets need not coincide. In the symmetric group , take . Then but .
  • The quotient set is a group only when is normal. The coset multiplication is well-defined precisely when left and right cosets coincide.

Key theorem with proof [Intermediate+]

Theorem (Lagrange). Let be a finite group and . Then divides , and .

Proof. Define the relation on by if .

Reflexivity: , so .

Symmetry: if , then , so .

Transitivity: if and , then , so .

Thus is an equivalence relation. The equivalence class of is : for write with . The cosets partition into disjoint sets.

The map given by is a bijection (its inverse is ). Every coset has exactly elements. If there are cosets and they partition , then .

Bridge. Lagrange's theorem builds toward 03.03.02 (group action), where the orbit-stabiliser theorem reproduces the same counting argument in a broader setting. This result appears again in 01.02.01 (group), where the order of an element divides the order of the group as an immediate corollary. The foundational reason is that cosets tile the group with equal-size blocks, and this is exactly the mechanism behind every divisibility result in finite group theory. The central insight is that the subgroup's order measures the internal symmetry of the group, and the bridge is between that measurement and the arithmetic of the group's order.

Exercises [Intermediate+]

Advanced results [Master]

Theorem 1 (First Isomorphism Theorem). Let be a group homomorphism. Then and .

The isomorphism is where . Well-definedness follows from for [Dummit-Foote §3].

Theorem 2 (Second Isomorphism Theorem). Let and . Then and .

This is the algebraic analogue of the parallelogram law for vector subspaces: when all groups are finite.

Theorem 3 (Third Isomorphism Theorem). Let and with . Then and .

This is the cancellation law for quotients: quotienting by and then by is the same as quotienting directly by [Lang §I.3-4].

Theorem 4 (Correspondence Theorem). Let . There is a bijection between subgroups of containing and subgroups of , given by . Under this bijection, normal subgroups correspond to normal subgroups.

This identifies the lattice of intermediate subgroups between and with the lattice of subgroups of the quotient .

Theorem 5 (Jordan-Holder). Let be a finite group. Any two composition series $$ {e} = G_0 \trianglelefteq G_1 \trianglelefteq \cdots \trianglelefteq G_r = G $$ have the same length , and the composition factors are the same up to permutation.

A group is simple if its only normal subgroups are and itself. Simple groups are the indecomposable building blocks of finite group theory. The Jordan-Holder theorem guarantees that the multiset of simple composition factors is an invariant of [Rotman §3].

Theorem 6 (Cauchy). If is a finite group and a prime divides , then contains an element of order .

Cauchy's theorem is a partial converse to Lagrange: while not every divisor of is the order of a subgroup (as the alternating group shows for the divisor ), every prime divisor is.

Synthesis. Lagrange's theorem is the foundational reason that the arithmetic of group orders constrains subgroup structure, and this is exactly the starting point for every counting argument in the theory. The three isomorphism theorems generalise the familiar rank-nullity picture from linear algebra: the First Isomorphism Theorem identifies the quotient by a kernel with the image, the Second identifies the quotient of by its overlap with , and the Third identifies the quotient of quotients. Putting these together with the Correspondence Theorem, the bridge is between the subgroup lattice of and the intermediate subgroups of containing . The central insight is that normal subgroups are kernels of homomorphisms, and the pattern generalises across algebra: rings modulo ideals, modules modulo submodules, and topological spaces modulo identifications all follow the same isomorphism-theorem template.

Full proof set [Master]

Proposition 1 (First Isomorphism Theorem). Let be a homomorphism. Then .

Proof. Set . Define by .

Well-defined: if then , so , giving .

Homomorphism: .

Injective: implies , so , hence is the identity coset.

Surjective: for choose with ; then .

Therefore is an isomorphism.

Proposition 2 (Third Isomorphism Theorem). Let and with . Then .

Proof. Define by . This is well-defined because ensures implies , so .

Homomorphism: .

Surjective: for any , .

Kernel: .

By the First Isomorphism Theorem applied to , .

Proposition 3 (Correspondence Theorem). Let . The maps (from subgroups of containing to subgroups of ) and (from subgroups of to subgroups of containing ) are mutually inverse bijections preserving normality, index, and inclusion.

Proof. Let be the canonical projection. For a subgroup of containing , the image is a subgroup of (it is closed under the quotient operation because is closed). For a subgroup of , the preimage is a subgroup of containing (it contains because , the identity of ).

These maps are mutually inverse: because contains and the fibers of over are exactly the cosets with . Conversely, because is surjective onto .

If with , then : for any and , since . Conversely, if , then because is a homomorphism and normality pulls back through surjective homomorphisms.

Connections [Master]

  • Group 01.02.01. This unit builds directly on the definition of a group, its identity element, and its operation. The subgroup, coset, and quotient constructions here are the structural machinery that the earlier group unit introduces at the axiomatic level. The foundational reason that normal subgroups correspond to kernels of homomorphisms appears again in the group unit's advanced results as a preview.

  • Subspace, basis, dimension 01.01.04. The analogy between subgroups and subspaces runs deep: both are closed subsets of an ambient algebraic structure, both admit cosets or translates, and both yield quotient objects (quotient groups and quotient vector spaces). The First Isomorphism Theorem for groups parallels the rank-nullity theorem for linear maps, and this is exactly the pattern that linear algebra units develop for vector spaces.

  • Group action 03.03.02. Lagrange's theorem generalises to the orbit-stabiliser theorem when a group acts on a set: the size of an orbit equals the index of the stabiliser. The coset decomposition in Lagrange's proof is the same partition that orbits induce. The quotient group maps injectively into the orbit of , and this connection identifies coset spaces with homogeneous spaces in the Lie-group setting.

  • Dirichlet -functions 21.03.02. The multiplicative group — central to the definition of a Dirichlet character — is the unit group of the residue ring obtained from the quotient construction of the present unit applied to modulo . The Chinese remainder theorem then identifies it as a product of cyclic and near-cyclic factors, and Dirichlet characters factor through this structural decomposition; the number of Dirichlet characters modulo is exactly , the order of this unit group.

Historical & philosophical context [Master]

Galois around 1830 introduced the concept of a normal subgroup (which he called a "proper decomposition") in his work on the solvability of polynomial equations by radicals [Galois 1830]. The quotient construction arose implicitly: Galois observed that when a group of permutations admits a "proper decomposition," the substitution groups form a new group. Jordan systematised these ideas in his 1870 Traite des substitutions, establishing the isomorphism theorems and the correspondence between normal subgroups and quotient groups in the language of permutation groups [Jordan 1870].

Holder proved the Jordan-Holder theorem on composition series in 1889, establishing that the simple factors of a finite group form a well-defined invariant [Rotman §3]. Noether reoriented group theory around homomorphisms and quotients in the 1920s, making the isomorphism theorems central to the abstract-algebra curriculum. The modern three-theorem formulation (First, Second, Third Isomorphism Theorems) follows her Göttingen lectures and their influence on van der Waerden's Moderne Algebra (1930–31).

Bibliography [Master]

@book{Lang2002,
  author = {Lang, Serge},
  title = {Algebra},
  edition = {Revised 3rd},
  publisher = {Springer},
  year = {2002},
  series = {Graduate Texts in Mathematics 211},
}

@book{DummitFoote2004,
  author = {Dummit, David S. and Foote, Richard M.},
  title = {Abstract Algebra},
  edition = {3rd},
  publisher = {Wiley},
  year = {2004},
}

@book{Rotman1995,
  author = {Rotman, Joseph J.},
  title = {An Introduction to the Theory of Groups},
  edition = {4th},
  publisher = {Springer},
  year = {1995},
  series = {Graduate Texts in Mathematics 148},
}

@book{Jordan1870,
  author = {Jordan, Camille},
  title = {Traite des substitutions et des equations algebriques},
  publisher = {Gauthier-Villars},
  year = {1870},
}

@article{Holder1889,
  author = {H\"older, Otto},
  title = {Zur\"uckf\"uhrung einer beliebigen algebraischen Gleichung auf eine Kette von Gleichungen},
  journal = {Mathematische Annalen},
  volume = {34},
  year = {1889},
  pages = {26--56},
}

@book{Aluffi2009,
  author = {Aluffi, Paolo},
  title = {Algebra: Chapter 0},
  publisher = {AMS},
  year = {2009},
  series = {Graduate Studies in Mathematics 104},
}