# Lagrange's theorem (group theory)

Lagrange's theorem can be extended to the equation of indexes between three subgroups of G.^{[1]}

**Extension of Lagrange's theorem** — If H is a subgroup of G and K is a subgroup of H, then

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.

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 *A*_{4} (the alternating group of degree 4), which has 12 elements but no subgroup of order 6.

A "Converse of Lagrange's Theorem" (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}) 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).

The converse of Lagrange's theorem states that if d is a divisor of the order of a group G, then there exists a subgroup H where |*H*| = *d*.

We will examine the alternating group *A*_{4}, the set of even permutations as the subgroup of the Symmetric group *S*_{4}.

|*A*_{4}| = 12 so the divisors are 1, 2, 3, 4, 6, 12. Assume to the contrary that there exists a subgroup H in *A*_{4} with |*H*| = 6.

Let *K* = *H* ⋂ *V*. Since both H and V are subgroups of *A*_{4}, K is also a subgroup of *A*_{4}.

From Lagrange's theorem, the order of K must divide both 6 and 4, the orders of H and V respectively. The only two positive integers that divide both 6 and 4 are 1 and 2. So |*K*| = 1 or 2.

Since any element of the form (*a b c*) squared is (*a c b*), and (*a b c*)(*a c b*) = *e*, any element of H in the form (*a b c*) must be paired with its inverse. Specifically, the remaining 5 elements of H must come from distinct pairs of elements in *A*_{4} that are not in V. This is impossible since pairs of elements must be even and cannot total up to 5 elements. Thus, the assumptions that |*K*| = 1 is wrong, so |*K*| = 2.

Note that the cosets generated by a subgroup of a group form a partition of the group. The cosets generated by a specific subgroup are either identical to each other or disjoint. The index of a subgroup in a group [*A*_{4} : *H*] = |*A*_{4}|/|*H*| is the number of cosets generated by that subgroup. Since |*A*_{4}| = 12 and |*H*| = 6, H will generate two left cosets, one that is equal to H and another, gH, that is of length 6 and includes all the elements in *A*_{4} not in H.

Since there are only 2 distinct cosets generated by H, then H must be normal. Because of that, *H* = *gHg*^{−1} (∀*g* ∈ *A*_{4}). In particular, this is true for *g* = (*a b c*) ∈ *A*_{4}. Since *H* = *gHg*^{−1}, *gvg*^{−1} ∈ *H*.

Without loss of generality, assume that *a* = 1, *b* = 2, *c* = 3, *d* = 4. Then *g* = (1 2 3), *v* = (1 2)(3 4), *g*^{−1} = (1 3 2), *gv* = (1 3 4), *gvg*^{−1} = (1 4)(2 3). Transforming back, we get *gvg*^{−1} = (*a* *d*)(*b* *c*). Because V contains all disjoint transpositions in *A*_{4}, *gvg*^{−1} ∈ *V*. Hence, *gvg*^{−1} ∈ *H* ⋂ *V* = *K*.

Since *gvg*^{−1} ≠ *v*, we have demonstrated that there is a third element in K. But earlier we assumed that |*K*| = 2, so we have a contradiction.

Therefore, our original assumption that there is a subgroup of order 6 is not true and consequently there is no subgroup of order 6 in *A*_{4} and the converse of Lagrange's theorem is not necessarily true.
Q.E.D.

Lagrange himself did not prove the theorem in its general form. He stated, in his article *Réflexions sur la résolution algébrique des équations*,^{[3]} 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 (*x y*).) 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.

Camille Jordan finally proved Lagrange's theorem for the case of any permutation group in 1861.^{[6]}