logo

Proof of Lagrange's Theorem 📂Abstract Algebra

Proof of Lagrange's Theorem

Theorem 1

If HH is a subgroup of a finite group GG, then H|H| is a divisor of G|G|.

Proof

Upon slight consideration, it’s logically inevitable and the proof is accordingly simple.

Each coset has the same number of elements. Since HH is also one of the cosets of GG, the cardinality of the cosets of HH is H|H|. As the cosets partition GG, summing the cardinalities of all cosets equals G|G|. Let the number of cosets of HH be (G:H)( G : H ), and denote this as rr. G=H+H=rH |G| = |H| + \cdots |H| = r |H| Thus, H|H| is a divisor of G|G|.

Corollary

If GG is a finite group and G|G| is a prime number, then GG is a cyclic group.

For example, for the prime number pp, Zp\mathbb{Z}_{p} is unmistakably a cyclic group.

Counterexample 2

The alternating group A4A_{4} serves as a counterexample to the converse of Lagrange’s theorem.

Assuming the converse of Lagrange’s theorem holds, then for A4=4!2=12\displaystyle | A_{4} | = {{4!} \over {2}} = 12, there must exist a H=6|H| = 6 satisfying HA4H \leqslant A_{4}. Specifically, A4A_{4} consists of three types, 12 kinds, of cyclic groups, hence, HH is formed of six of these cycles:

  • The identity of length 11: ee
  • Cycles of length 33, and 33-cycles: (1,2,3)(1,3,2)(1,2,4)(1,4,2)(1,3,4)(1,4,3)(2,3,4)(2,4,3)(1,2,3) \\ (1,3,2) \\ (1,2,4) \\ (1,4,2) \\ (1,3,4) \\ (1,4,3) \\ (2,3,4) \\ (2,4,3)
  • Products of transpositions of length 22, Klein four-group: (1,2)(3,4)(1,3)(2,4)(1,4)(2,3)(1,2)(3,4) \\ (1,3)(2,4) \\ (1,4)(2,3) These along with only the identity ee gathered form VA4V \leqslant A_{4}, which is isomorphic to the Klein four-group. In that sense, in this post, let’s just call them Klein four.

Looking into what relation HH has with these elements…

  1. As HH is a group, it must include the identity element ee, hence, technically one needs to choose 55 cycles.
  2. Assuming Lagrange’s theorem holds, there must exist a cycle whose cardinality is 22, therefore, HH must include at least one Klein four.
  3. Since there are only three Klein fours, HH must include at least two 33-cycles.
  4. If αH\alpha \in H, then it must be α2H\alpha^2 \in H. However, since (1,i,j)2=(1,j,i)(1,i,j)^{2} = (1,j,i), if HH includes 33-cycles, it must have them in even numbers. It can’t have 66 cycles given it must include the identity.

In summary, HH must have at least one Klein four and at least two 33-cycles, notably, the 33-cycles must be in even numbers, so the possible scenario is only whether the 33 cycles are two or four. Let’s just consider the cases.

  • Case 1: Two 33-cycles, three Klein fours
    (a,b,c)(a,c)(b,d)=(b,d,c)H(a,b,c) \circ (a,c)(b,d) = (b,d,c) \notin H Regardless of which cycle (a,b,c)(a,b,c) is included, since HH has all Klein fours, we obtain (b,d,c)(b,d,c), and hence, HH is not closed under the product of cycles.

  • Case 2: Four 33-cycles, one Klein four
    Without loss of generality, let one of the 33-cycles in HH be (a,b,c)(a,b,c), and the Klein four be (a,b)(c,d)(a,b)(c,d). The point is that dd, not included in (a,b,c)(a,b,c), exists in the Klein four. (a,b,c)(a,b)(c,d)=(c,d,a)=(a,c,d) (a,b,c) \circ (a,b)(c,d) = (c,d,a) = (a,c,d) Therefore, HH must precisely have the 33-cycles (a,b,c),(a,c,b),(a,c,d),(a,d,c)(a,b,c), (a,c,b), (a,c,d), (a,d,c). However, (a,d,c)(a,b)(c,d)=(b,d,a)=(a,b,d)H (a,d,c) \circ (a,b)(c,d) = (b, d, a) = (a,b,d) \notin H thus, HH is not closed under the product of cycles as well.

We have presented HH as a counterexample demonstrating that the converse of Lagrange’s theorem does not hold, confirming that HH cannot be a group.


  1. Fraleigh. (2003). A first course in abstract algebra(7th Edition): p100. ↩︎

  2. https://www.mathcounterexamples.net/converse-of-lagrange-theorem-does-not-hold/ ↩︎