Lagrange’s theorem is a fundamental result in group theory stating that, for a finite group , the number of elements in any subgroup divides the number of elements in . More precisely,
where and are the orders of the group and subgroup, and is the number of distinct left cosets of in . The theorem connects a group’s algebraic structure with the arithmetic of its order. It restricts possible subgroups and element orders, underlies several results in number theory, and provides a basic example of counting by partitioning a set into equally sized pieces.
Statement and terminology
The order of a finite group is its number of elements. A subgroup is a subset that is itself a group under the operation inherited from .
For an element , the left coset of represented by is
The index is the number of distinct left cosets. Right cosets, defined by , give the same index.
Lagrange’s theorem states that if is finite and , then
In particular,
No commutativity assumption is needed: the theorem applies to both abelian and nonabelian finite groups. Nor must be a normal subgroup.
The subgroup hypothesis is essential. An arbitrary subset need not have a size dividing the group order.
Proof by cosets
The standard proof rests on two facts: the left cosets partition , and every coset has the same size as .
Cosets partition the group
Every element belongs to some left coset, since , where is the identity element.
If two left cosets and intersect, there are elements such that
Consequently,
which implies . Interchanging and gives the reverse inclusion. Thus two left cosets are either identical or disjoint.
The distinct left cosets therefore form a partition of .
Every coset has the same size
For each , the map
is a bijection. Its inverse sends to . Hence
If there are distinct cosets, then is a disjoint union of sets, each containing elements. Therefore
which proves the theorem.
Equivalently, the cosets are the classes of the equivalence relation
Lagrange’s theorem counts these equally sized classes.
Examples
Integers modulo 12
Consider the additive group , familiar from modular arithmetic. The subgroup generated by is
Its distinct cosets are
There are four cosets, each with three elements, so
The symmetric group on three letters
The symmetric group consists of the six permutations of three objects. The subgroup
has order , so its index is .
This example also shows why normality is unnecessary. The subgroup is not normal in , but its cosets still partition into three sets of size . Normality is required to define a quotient group using coset multiplication, not to establish Lagrange’s theorem.
Consequences for elements and groups
Element orders divide the group order
The order of an element , denoted , is the least positive integer such that , when such an integer exists.
In a finite group, generates a cyclic subgroup
of order . Applying Lagrange’s theorem gives
It follows that
for every .
This is a restriction on possible element orders, not a guarantee that every divisor of occurs as an element order. For example, the group
has order , but every nonidentity element has order .
Every group of prime order is cyclic
Suppose , where is a prime number. If , then and . Thus
so generates all of .
Consequently, every group of prime order is cyclic and is isomorphic to the additive group . Its only subgroups are the identity subgroup and the whole group.
Orders of images and kernels
For a group homomorphism
with finite, two elements have the same image precisely when they lie in the same coset of the kernel. Hence
In particular, the order of the image divides .
This is the counting aspect of the first isomorphism theorem: the image is isomorphic to the quotient of by the kernel.
Applications in number theory
Lagrange’s theorem supplies a group-theoretic explanation for important congruences in number theory.
Fermat’s little theorem
For a prime , the nonzero residue classes modulo form a multiplicative group of order . Therefore, if does not divide ,
This is the multiplicative form of Fermat’s little theorem. It implies the equivalent statement
for every integer , including multiples of .
Euler’s theorem
More generally, the invertible residue classes modulo an integer form a group of order , where counts the residue classes relatively prime to .
Lagrange’s theorem therefore yields Euler’s theorem:
The relative-primality condition ensures that belongs to the multiplicative group of invertible classes. Without it, the congruence need not hold.
Limits of the converse
Lagrange’s theorem gives a necessary condition for a subgroup to exist, but not a sufficient one. If , there need not be a subgroup of order .
A standard counterexample is the alternating group , the group of even permutations of four objects. It has order but no subgroup of order .
To see why, suppose such a subgroup existed. Its index would be , making it normal, with quotient group of order . Every 3-cycle in would map to the identity in that quotient: its image has cube equal to the identity, whereas the only nonidentity element of a group of order does not. Thus would contain all eight 3-cycles, as well as the identity, contradicting .
There are important partial converses:
- Cauchy’s theorem: if a prime divides , then contains an element, and therefore a subgroup, of order .
- Sylow’s theorems: if is the largest power of dividing , then has subgroups of order , with additional constraints on their conjugacy and number.
- Finite cyclic groups: for every positive divisor of the group order, there is exactly one subgroup of order .
These results require arguments beyond Lagrange’s theorem itself.
Infinite groups and related counting formulas
The coset argument remains valid for infinite groups, although ordinary integer divisibility no longer expresses the conclusion. In the usual set-theoretic framework with the axiom of choice, it gives an identity of cardinalities:
For example, has index in the additive group , although both groups are countably infinite. Thus equal infinite cardinalities do not determine the index.
A related formula concerns a chain of subgroups :
When the indices are finite, this is an identity of positive integers.
Lagrange’s theorem is also closely related to counting orbits under a group action. If a finite group acts on a set and is the stabilizer of an element , then
The orbit size therefore divides the group order.
Historical background and naming
The theorem is named after Joseph-Louis Lagrange. His work on algebraic equations in 1770–1771 studied how expressions in the roots of a polynomial change under permutations. These investigations produced counting results that anticipated the modern theorem.
Lagrange did not formulate the result in the later language of abstract groups, subgroups, and cosets. Its familiar form belongs to the subsequent development of permutation groups and abstract algebra.
The name “Lagrange’s theorem” is also used in some mathematical traditions for the mean value theorem in calculus. That result concerns derivatives and is distinct from the subgroup-order theorem.