Abstract Algebra · Undergraduate
Cosets and Lagrange's Theorem
Quick answer
A coset of a subgroup H is what you get by shifting all of H by one element: aH = {ah : h in H}. The cosets of H split the group into pieces that do not overlap and all have the same size as H. So the order of H divides the order of G, which is Lagrange's theorem. It has quick consequences: the order of every element divides |G|, every group of prime order is cyclic, and a^(p − 1) ≡ 1 (mod p) for every a not divisible by a prime p, which is Fermat's little theorem.
What you'll learn
- List the cosets of a subgroup
- Prove Lagrange's theorem by counting cosets
- Use Lagrange's theorem to rule out subgroups and element orders
- Derive Fermat's little theorem and compute large powers mod p
Shifting a subgroup
Let be a subgroup of . For any , the left coset of by is
In with , the cosets are the shifts of :
| Coset | Elements |
|---|---|
Four cosets, each of size , covering all elements exactly once.
Lagrange’s theorem. If is a subgroup of a finite group , then divides , and the number of cosets, the index, is .
Why the cosets tile the group
Two facts do the work. Each coset has exactly elements, because is one-to-one: forces after multiplying by . Two cosets are either equal or disjoint: if lies in both and , then , so , and every element of equals , which lies in ; by symmetry the two cosets are equal. Every element lies in its own coset . So is cut into equal pieces of size , and is a multiple of .
Worked examples
Common mistakes
Practice problems
-
List the possible orders of subgroups of a group of order .
Answer
Full solution
By Lagrange’s theorem they must divide .
-
Find the index of in .
Answer
Full solution
has elements, and .
-
Find without multiplying it out.
Answer
Full solution
Fermat’s little theorem with .
-
Find .
Answer
Full solution
and , so .
-
Explain why every group of order is cyclic.
Answer
Any element other than has order dividing and greater than , so its order is .
Full solution
That element generates a subgroup of size : the whole group.
-
Does have an element of order ?
Answer
No
Full solution
, and does not divide . (A 5-cycle needs five symbols.)
-
List the cosets of in .
Answer
Full solution
Six cosets of size , matching .
-
A student says a group of order must have a subgroup of order because divides . Respond.
Answer
Lagrange’s theorem does not run backward; is a counterexample.
Full solution
The theorem says subgroup orders divide . It does not promise a subgroup for each divisor.
Frequently asked questions
What is a coset?
For a subgroup H of G and an element a of G, the left coset aH is the set of all products ah with h in H. In additive notation it is a + H.
What does Lagrange's theorem say?
If H is a subgroup of a finite group G, then |H| divides |G|. The number of cosets, |G|/|H|, is the index of H.
What follows about the order of an element?
The order of a divides |G|, since it is the size of the subgroup ⟨a⟩. So a^|G| = e.
Is the converse true?
No. A₄ has 12 elements but no subgroup of order 6, even though 6 divides 12.
How does Lagrange's theorem give Fermat's little theorem?
The nonzero numbers mod a prime p form a group under multiplication of order p − 1, so a^(p − 1) = 1 for each of them.