MathsFurther Pure 2 › Subgroups, Lagrange's theorem and isomorphism

Subgroups, Lagrange's theorem and isomorphism

A group can contain smaller groups, and their sizes are constrained. Lagrange's theorem states that the order of a subgroup divides the order of the group. Two groups with the same multiplication structure are isomorphic.

Builds on Groups and their axioms and Proof by induction.

IN THIS TOPIC

  • Test whether a subset is a subgroup, and list the subgroups of a small group.
  • Apply Lagrange's theorem to rule out impossible subgroup orders.
  • Decide whether two groups of the same order are isomorphic.

COMMON MISCONCEPTION

A group of order 12 could have a subgroup of order 5, since 5 is smaller than 12.

Groups inside groups

A subgroup is a subset that is itself a group under the same operation. Associativity is inherited, so only three things need checking. Is the identity present, is the subset closed, and is every element's inverse inside it. Two subgroups come free in every group, the identity on its own and the whole group. Those two are distinct in any group of order greater than 1, so such a group has at least two subgroups. In the trivial group they are the same subgroup and there is only one.

WORKED EXAMPLE

All the subgroups of a small group

Find every subgroup of the integers modulo 6 under addition.

The trivial ones are {0} of order 1, and the whole group of order 6.

{0, 3} is closed, since 3 + 3 = 0, and it contains inverses, so it is a subgroup of order 2.

{0, 2, 4} is closed with 2 + 4 = 0, giving order 3.

Four subgroups, of orders 1, 2, 3 and 6. Every one of those divides 6, and nothing of order 4 or 5 exists.

Lagrange's theorem turns that pattern into a law. In a finite group, the order of any subgroup divides the order of the group. A group of order 12 therefore has no subgroup of order 5, since 5 does not divide 12. The theorem also explains why every element's order divides the group's, because the powers of an element form a subgroup all by themselves.

Subgroup orders in a group of order 12: only divisors appear, and 5, 7, 8, 9, 10 and 11 are impossible123456789101112a subgroup's order must divide the group'sso must the order of every element
FIG. 1The subgroups of the integers modulo 12 arranged by order: only the divisors of 12 appear, and nothing sits at 5, 7, 8, 9, 10 or 11.

Same group, different clothes

Two groups are isomorphic when their elements can be paired up so that the operation is preserved, which amounts to a relabelling that turns one Cayley table into the other. Any two cyclic groups of the same order are isomorphic, so at each order the real question is how many genuinely different structures exist.

The two groups of order 4: one cyclic with an element of order 4, one where every non-identity element has order 2cyclicorder 1order 2order 4order 4Kleinorder 1order 2order 2order 2vsdifferent element orders, so no relabelling can match them
FIG. 2The two groups of order 4: the cyclic one, where a single element generates everything, and the Klein group, where every non-identity element is its own inverse.

WORKED EXAMPLE

Telling two order-four groups apart

Show that {1, −1, i, −i} under multiplication and the Klein group, in which every non-identity element squares to the identity, are not isomorphic.

In the first, i has order 4, since i, −1, −i, 1 takes four steps to return.

In the Klein group every non-identity element has order 2 by definition, so nothing has order 4.

Isomorphism preserves the order of elements, so no relabelling can match them. Both have four elements and they are different groups, and those two are the only groups of order 4 there are.

GUIDED PRACTICE

Ruling things out with Lagrange

A group has order 10. List the possible orders of its subgroups, and of its elements.

Show the working

Subgroup orders must divide 10, so only 1, 2, 5 and 10 are possible.

The powers of any element form a subgroup, so element orders come from the same list.

No element can have order 3, 4, 6, 7, 8 or 9, however large the group looks. Lagrange rules them out with no calculation at all.

ASSESSMENT FOCUS

  • For a subgroup test, check identity, closure and inverses; associativity is inherited and needs no proof.
  • Quote Lagrange by name when you use it, and state which order divides which.
  • To disprove an isomorphism, find a structural difference. Element orders and whether the group is abelian both work.

CHECK YOURSELF

A group has order 15. Explain why it cannot contain a subgroup of order 6.

Show a hint

Lagrange's theorem constrains subgroup orders.

Show the answer

By Lagrange's theorem the order of any subgroup divides 15, and the divisors are 1, 3, 5 and 15. Since 6 does not divide 15, no such subgroup exists.

A subgroup needs the identity, closure and inverses; associativity comes free from the parent group.

Lagrange: every subgroup's order divides the group's order, and so does every element's order.

WORKBOOK

Printable practice for this topic: original exam-style questions with room to work, and a fully worked answer book. Free to use; please do not redistribute or sell.

7 questions on this topicAnswer them one at a time and mark yourself against the worked answer.Practise this topic

Or read them with their worked answers on the subgroups, lagrange's theorem and isomorphism questions page.

CHECK YOUR PROGRESS

Rate how confident you feel with each objective for this lesson. Ratings are saved in this browser, on this device, unless you sign in.

  • Test whether a subset is a subgroup, and list the subgroups of a small group.
  • Apply Lagrange's theorem to rule out impossible subgroup orders.
  • Decide whether two groups of the same order are isomorphic.

Open the full revision checklist to see every objective in the course in one place.