Skip to content
Tutorials Center
My learning

Topics

Lesson 16 of 37 ยท Cosets and Lagrange

Lagrange's Theorem

Prove Lagrange's theorem that the order of a subgroup divides the order of the group, check it by computer in S3, and see why the converse fails.

If a finite group has 12 elements, can it have a subgroup of 5 elements? Lagrange's theorem says no. It is the first deep result of finite group theory and its proof is a single counting argument using cosets.

Statement

Theorem (Lagrange). Let G be a finite group and H a subgroup. Then |H| divides |G|, and

|G| = [G : H] ยท |H|,

where [G : H] is the number of left cosets of H in G.

Proof

By the previous lesson, the left cosets of H partition G, and each coset has exactly |H| elements. If there are k = [G : H] cosets, then counting the elements of G coset by coset gives |G| = k ยท |H|. โˆŽ

That is the whole proof: the work was done in showing cosets are disjoint and equal in size.

Testing it

We list every subgroup of Sโ‚ƒ by brute force, and check each size divides 6.

Python Every subgroup of Sโ‚ƒ has order dividing 6

Press Run (or Ctrl + Enter) to see the result here.

Program input ยท what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

You will find one subgroup of order 1, three of order 2 (generated by the transpositions), one of order 3 (the rotations) and one of order 6. Lagrange forbids a subgroup of order 4 or 5, and the search finds none.

The converse is false

Does every divisor of |G| occur as the order of some subgroup? For โ„ค_n, yes. In general, no. The alternating group Aโ‚„ has order 12 but no subgroup of order 6.

Python Aโ‚„ has no subgroup of order 6

Press Run (or Ctrl + Enter) to see the result here.

Program input ยท what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

The program checks all C(11, 5) = 462 candidate sets of 6 elements containing the identity and finds none that is closed. So 6 divides 12 but is not a subgroup order of Aโ‚„.

Lagrange's theorem gives only a necessary condition: |H| must divide |G|. It never guarantees that a subgroup of a given size exists. (Cauchy's theorem later guarantees subgroups of prime order p whenever p divides |G|.)

What Lagrange tells us at a glance

Group order Possible subgroup orders
6 1, 2, 3, 6
7 1, 7
12 1, 2, 3, 4, 6, 12 (not all realized by every group)
15 1, 3, 5, 15

For a group of prime order p, the only subgroup orders are 1 and p, so every non-identity element generates the whole group, which is therefore cyclic. The next lesson uses this.

flowchart LR
    G["|G| = 12"] --> D["divisors:<br/>1, 2, 3, 4, 6, 12"]
    D --> Q["candidate orders<br/>of subgroups"]

Lagrange narrows the list of possible subgroup sizes to the divisors of |G|.

Check your understanding

Quick check ยท 4 questions

of 4 answered You scored / 4 ยท perfect!

  1. 1. Can a group of order 15 have a subgroup of order 4?

    By Lagrange the order of a subgroup divides 15.
  2. 2. If |G| = 36 and H has index 4, what is |H|?

    |G| = [G : H]|H| gives |H| = 36/4 = 9.
  3. 3. Which statement is FALSE?

    Aโ‚„ has order 12 but no subgroup of order 6; the converse of Lagrange fails.
  4. 4. How many subgroups of order 4 can Sโ‚ƒ have?

    4 does not divide 6, so none are possible.

Summary

  • Lagrange's theorem: for a finite group, |G| = [G : H]ยท|H|, so |H| divides |G|.
  • The proof counts elements of G using equal-sized, disjoint cosets.
  • The converse is false: Aโ‚„ has no subgroup of order 6.
  • The theorem rules out many possible subgroup sizes immediately.

Next: Consequences of Lagrange's Theorem