# Lagrange's theorem (group theory)

{{#invoke:Hatnote|hatnote}}

**Lagrange's theorem**, in the mathematics of group theory, states that for any finite group *G*, the order (number of elements) of every subgroup *H* of *G* divides the order of *G*. The theorem is named after Joseph-Louis Lagrange.

## Contents

## Proof of Lagrange's Theorem

This can be shown using the concept of left cosets of *H* in *G*. The left cosets are the equivalence classes of a certain equivalence relation on *G* and therefore form a partition of *G*. Specifically, *x* and *y* in *G* are related if and only if there exists *h* in *H* such that *x = yh*. If we can show that all cosets of *H* have the same number of elements, then each coset of *H* has precisely |*H*| elements. We are then done since the order of *H* times the number of cosets is equal to the number of elements in *G*, thereby proving that the order of *H* divides the order of *G*. Now, if *aH* and *bH* are two left cosets of *H*, we can define a map *f* : *aH* → *bH* by setting *f*(*x*) = *ba*^{−1}*x*. This map is bijective because its inverse is given by

This proof also shows that the quotient of the orders |*G*| / |*H*| is equal to the index [*G* : *H*] (the number of left cosets of *H* in *G*). If we allow *G* and *H* to be infinite, and write this statement as

then, seen as a statement about cardinal numbers, it is equivalent to the Axiom of choice.

## Using the theorem

A consequence of the theorem is that the order of any element *a* of a finite group (i.e. the smallest positive integer number *k* with *a*^{k} = *e,* where *e* is the identity element of the group) divides the order of that group, since the order of *a* is equal to the order of the cyclic subgroup generated by *a*. If the group has *n* elements, it follows

This can be used to prove Fermat's little theorem and its generalization, Euler's theorem. These special cases were known long before the general theorem was proved.

The theorem also shows that any group of prime order is cyclic and simple. This in turn can be used to prove Wilson's theorem, that if *p* is prime then *p* is a factor of .

## Existence of subgroups of given order

Lagrange's theorem raises the converse question as to whether every divisor of the order of a group is the order of some subgroup. This does not hold in general: given a finite group *G* and a divisor *d* of |*G*|, there does not necessarily exist a subgroup of *G* with order *d*. The smallest example is the alternating group *G* = *A*_{4}, which has 12 elements but no subgroup of order 6. A *CLT group* is a finite group with the property that for every divisor of the order of the group, there is a subgroup of that order. It is known that a CLT group must be solvable and that every supersolvable group is a CLT group: however there exist solvable groups that are not CLT (for example *A*_{4}, the alternating group of degree 4) and CLT groups that are not supersolvable (for example *S*_{4}, the symmetric group of degree 4).

There are partial converses to Lagrange's theorem. For general groups, Cauchy's theorem guarantees the existence of an element, and hence of a cyclic subgroup, of order any prime dividing the group order; Sylow's theorem extends this to the existence of a subgroup of order equal to the maximal power of any prime dividing the group order. For solvable groups, Hall's theorems assert the existence of a subgroup of order equal to any unitary divisor of the group order (that is, a divisor coprime to its cofactor).

## History

Lagrange did not prove Lagrange's theorem in its general form. He stated, in his article *Réflexions sur la résolution algébrique des équations*,^{[1]} that if a polynomial in *n* variables has its variables permuted in all *n* ! ways, the number of different polynomials that are obtained is always a factor of *n* !. (For example if the variables *x*, *y*, and *z* are permuted in all 6 possible ways in the polynomial *x* + *y* - *z* then we get a total of 3 different polynomials: *x* + *y* − *z*, *x* + *z* - *y*, and *y* + *z* − *x*. Note that 3 is a factor of 6.) The number of such polynomials is the index in the symmetric group *S*_{n} of the subgroup *H* of permutations that preserve the polynomial. (For the example of *x* + *y* − *z*, the subgroup *H* in *S*_{3} contains the identity and the transposition (*xy*).) So the size of *H* divides *n* !. With the later development of abstract groups, this result of Lagrange on polynomials was recognized to extend to the general theorem about finite groups which now bears his name.

The first complete proof of the theorem was provided by Carl Friedrich Gauss and published in his *Disquisitiones Arithmeticae* in 1801.

## Notes

- ↑ Lagrange, J. L. (1771) "Réflexions sur la résolution algébrique des équations" [Reflections on the algebraic solution of equations] (part II),
*Nouveaux Mémoires de l’Académie Royale des Sciences et Belles-Lettres de Berlin*, pages 138-254; see especially pages 202-203. Available on-line (in French, among Lagrange's collected works) at: http://math-doc.ujf-grenoble.fr/cgi-bin/oeitem?id=OE_LAGRANGE__3_205_0 [Click on "Section seconde. De la résolution des équations du quatrième degré 254-304"].

## References

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}