Introduction
Lagrange’s theorem is a beautiful result in group theory that has many neat applications. The notion of cosets is fundamental to the proof of Lagrange’s theorem and, independent of their utility in proving Lagrange’s theorem, they’re a very neat construction.
Cosets and equivalence relations
Let
and
be groups with
. We say that
is congruent to
modulo
and write
if
(note that we use
if the operation of our groups is addition). The important thing to notice is that congruence modulo
is in fact an equivalence relation on
. In case the notion of equivalence relation is unfamiliar, I’ll define it; an equivalence relation is a binary relation on some set
that satisfies the following criteria (we’ll denote the operation by
):
![]()
![]()
![]()
If
, then its equivalence class with respect to congruence modulo
is the set
. We refer to this set as the left coset of
with respect to
. As you can probably guess, we define the right coset of
with respect to
as
. For groups
and
with
, we define
as the set of left cosets of
in
. The set of right cosets of
in
is defined analogously.
Proposition: Congruence between two numbers modulo
is an equivalence relation
Proof: Reflexivity: If
, then
and therefore ![]()
Symmetry: If
and
, then
, and therefore
. But this means that ![]()
Transitivity: Suppose
, where
and
. Then
. But in this case,
contains their product,
. Thus, ![]()
The following proposition about equivalence classes (sets of elements that are ‘equivalent’ to each other under the equivalence relation and are denoted
) is very useful.
Proposition: The equivalence classes of a set partition it
Proof: Let’s say we’re working with some nonempty set
. We want to show that
is a partition of
. Due to the reflexivity of equivalence relations, we know that
. Hence each equivalence class is nonempty. Suppose that
and
, which implies
and
. By symmetry, we have that
and then by transitivity we know that
, which shows that
, showing that two equivalence classes only have common elements when they are the same equivalence class and demonstrating that equivalence classes partition a set.
![]()
This of course means that, since cosets are an equivalence class, the left cosets
in
partition
. The index of
in
, denoted
, is the number of left cosets of
in ![]()
Lagrange’s theorem
Having spoken a little about cosets, we can now tackle Lagrange’s theorem.
Lagrange’s Theorem: Let
and
be groups.
divides ![]()
Proof: To prove this, we just have to use what we’ve learned about cosets. We’ve known that
is partitioned into left cosets, which means
is simply the sum of the sizes of the left cosets. If
then
by the cancellation law and hence
consists of exactly
elements. This means that
=![]()
divides ![]()
Corollaries
I’ll now show two useful corollaries of Lagrange’s Theorem.
Corollary 1: Let
be a finite group and
. Then the order of
divides the order of
.
Proof: The order of the element
is also the order of the cyclic subgroup generated by
, and that must divide the order of ![]()
Corollary 2: Every group of prime order is cylic
Proof: Take
where
is prime. As
divides
and
, we must have that
. But then
, and therefore ![]()




