algebra911.com

Lagrange Theorem In Group Theory

Q: What is the 'index' of a subgroup?

The index of a subgroup $H$ in a group $G$ is the number of distinct cosets of $H$ in $G$. According to Lagrange's Theorem, this is equal to the order of $G$ divided by the order of $H$.

Q: What's the simplest non-trivial example of Lagrange's Theorem?

A great simple example is the group $G = \{0, 1, 2, 3\}$ with addition modulo 4. Its order is 4. The set $H = \{0, 2\}$ is a subgroup of order 2. As Lagrange's Theorem predicts, 2 divides 4.

Download as PDF

Ever wonder if there are hidden rules governing abstract math structures? Lagrange's Theorem is a beautiful and powerful rule in group theory that connects simple division to complex algebraic groups. It tells us that the size of a smaller group living inside a larger one must divide it perfectly.

Lagrange Theorem In Group Theory — an original Algebra911 reference diagram defining lagrange theorem in group theory with its key formula and a worked example. — Lagrange's Theorem in Group Theory: A Beginner's Guide

What Is Lagrange's Theorem?

Lagrange's Theorem is a fundamental principle in group theory which states that for any finite group, the size of any of its subgroups must be a divisor of the size of the group itself. In simpler terms, if you have a mathematical structure called a group with a certain number of elements, and you find a smaller group living inside it (a subgroup), the number of elements in the smaller group will divide evenly into the number of elements in the larger one. This elegant theorem provides a powerful restriction on the possible structures a group can have.

For example, if a group has $15$ elements, you immediately know that any subgroup it might have can only have $1$ , $3$ , $5$ , or $15$ elements—no other size is possible! We use the term order to refer to the number of elements in a group. So, we can state the theorem more formally.

G

is a finite group and

H

is a subgroup of

G

, then the order of

H

divides the order of

G

We often write this using mathematical notation as $| H | ∣ | G |$ , where the vertical bar means 'divides'. This theorem connects the basic properties of numbers (division) to the abstract structure of groups, making it a cornerstone of algebra.

The Building Blocks: What Are Groups and Subgroups?

To truly understand Lagrange's Theorem, we first need to get comfortable with its main characters: groups and subgroups. A group is a set of elements combined with an operation (like addition or multiplication) that follows four specific rules:

Closure: If you combine any two elements from the set using the operation, the result is also in the set.
Associativity: When combining three or more elements, it doesn't matter how you group them: $(a * b) * c = a * (b * c)$ .
Identity Element: There's a special element (let's call it $e$ ) that doesn't change other elements when combined with them. For addition, this is $0$ ; for multiplication, it's $1$ . So, $a * e = e * a = a$ .
Inverse Element: For every element $a$ in the set, there's a corresponding inverse element $a^{- 1}$ such that when you combine them, you get the identity element: $a * a^{- 1} = e$ .

A simple example is the set of integers $Z$ with the operation of addition. It's a group! But Lagrange's Theorem deals with finite groups—groups with a limited number of elements.

A great example of a finite group is the set $G = Z_{4} = {0, 1, 2, 3}$ with addition modulo $4$ (like a 4-hour clock). The order of this group, written $| G |$ , is $4$ .

A subgroup is a smaller set of elements from within a group that also forms a group under the same operation. It's a group living inside another group. In our $Z_{4}$ example, consider the set $H = {0, 2}$ . Let's check if it's a subgroup:

Closure: $0 + 0 = 0$ , $0 + 2 = 2$ , $2 + 0 = 2$ , $2 + 2 = 4 \equiv 0$ . All results are in $H$ . Check!
Identity: The identity element $0$ is in $H$ . Check!
Inverses: The inverse of $0$ is $0$ . The inverse of $2$ is $2$ (since $2 + 2 = 0$ ). Every element in $H$ has an inverse in $H$ . Check!

Since $H$ satisfies the rules, it is a subgroup of $G$ . Notice its order is $| H | = 2$ , and the order of the main group is $| G | = 4$ . And look— $2$ divides $4$ ! This is Lagrange's Theorem in action.

How Do Cosets Help Explain the Theorem?

So why must the subgroup's order divide the group's order? The secret lies in a concept called cosets. A coset is created by taking a subgroup and 'shifting' it by an element from the larger group. This process neatly slices the entire group into equal-sized pieces, with each piece being the same size as the original subgroup.

Let's stick with our example: group $G = {0, 1, 2, 3}$ and subgroup $H = {0, 2}$ . We can form the left cosets of $H$ by adding each element of $G$ to the set $H$ . We denote a coset formed with element $g$ as $g + H$ .

For $g = 0$ : $0 + H = {0 + 0, 0 + 2} = {0, 2}$ . This is just the subgroup $H$ itself.
For $g = 1$ : $1 + H = {1 + 0, 1 + 2} = {1, 3}$ . This is a new set.
For $g = 2$ : $2 + H = {2 + 0, 2 + 2} = {2, 0} = {0, 2}$ . This is the same set as $0 + H$ .
For $g = 3$ : $3 + H = {3 + 0, 3 + 2} = {3, 5} \equiv {3, 1} = {1, 3}$ . This is the same set as $1 + H$ .

Look at what happened! We only ended up with two distinct cosets: ${0, 2}$ and ${1, 3}$ . These cosets have three amazing properties that form the intuitive proof of Lagrange's Theorem:

They are all the same size. Both cosets have 2 elements, which is the same as the order of our subgroup $H$ .
They are disjoint. The two cosets have no elements in common. An element is either in ${0, 2}$ or in ${1, 3}$ , but never both.
They cover the whole group. If you put the distinct cosets together ( ${0, 2} \cup {1, 3}$ ), you get back the entire original group $G = {0, 1, 2, 3}$ .

This means the group $G$ has been perfectly partitioned into a number of non-overlapping chunks, where each chunk has size $| H |$ . If you have $k$ chunks, then the total size of $G$ must be $k \times | H |$ . This directly implies that $| H |$ must divide $| G |$ !

The number of distinct cosets is called the index of the subgroup, written $[G : H]$ . In our case, the index is $2$ . This gives us a more complete version of the theorem.

| G | = | H | \cdot [G : H]

Worked Example: Exploring the Symmetries of a Rectangle

Example 1

Let's consider the group of symmetries of a non-square rectangle. These are the motions that leave the rectangle looking unchanged. Let's call this group $V_{4}$ . It has four elements:

$e$ : The 'identity' motion (doing nothing).
$h$ : A horizontal flip across the vertical axis.
$v$ : A vertical flip across the horizontal axis.
$r$ : A 180-degree rotation about the center.

The group operation is 'composition' (doing one motion after another). The order of this group is $| V_{4} | = 4$ .

Problem: Find all possible orders of subgroups of $V_{4}$ and identify one subgroup for each possible order.

Solution:

Step 1: Apply Lagrange's Theorem.
The order of the group is $4$ . According to Lagrange's Theorem, the order of any subgroup must divide $4$ . The divisors of $4$ are $1$ , $2$ , and $4$ . So, any subgroup must have $1$ , $2$ , or $4$ elements. There cannot be a subgroup of order $3$ .

Step 2: Find the subgroups.

Order 1: Every group has a 'trivial' subgroup containing only the identity element. So, $H_{1} = {e}$ is a subgroup of order 1.
Order 2: We need to find a set of two elements that forms a group. It must contain the identity $e$ . Let's try $H_{2} = {e, h}$ . Is it a group?
- It has the identity.
- The inverse of $h$ is $h$ itself (flipping twice gets you back to the start), so all elements have inverses.
- Is it closed? $e \circ h = h$ , $h \circ e = h$ , and $h \circ h = e$ . All results are in $H_{2}$ . Yes!
So, ${e, h}$ is a subgroup of order 2. Similarly, ${e, v}$ and ${e, r}$ are also subgroups of order 2.
Order 4: The group itself is always a subgroup of itself. So, $H_{3} = {e, h, v, r}$ is a subgroup of order 4.

We have found subgroups for every possible order predicted by Lagrange's Theorem, confirming how it restricts the structure of the group.

Worked Example: The Group of Integers Modulo 6

Example 2

Let's look at the group $G = (Z_{6}, +) = {0, 1, 2, 3, 4, 5}$ under addition modulo 6. The order of this group is $| G | = 6$ .

Problem: Find all subgroups of $Z_{6}$ and for the subgroup of order 3, show how its cosets partition the group.

Solution:

Step 1: Find possible subgroup orders.
By Lagrange's Theorem, the possible orders of subgroups are the divisors of 6, which are $1, 2, 3,$ and $6$ .

Step 2: Identify the subgroups.
By checking all possible subsets, we find the following subgroups:

Order 1: $H_{1} = {0}$
Order 2: $H_{2} = {0, 3}$
Order 3: $H_{3} = {0, 2, 4}$
Order 6: $H_{4} = {0, 1, 2, 3, 4, 5}$

As predicted, there are no subgroups of order 4 or 5.

Step 3: Analyze the cosets of the subgroup of order 3.
Let's use the subgroup $H = H_{3} = {0, 2, 4}$ . Its order is $| H | = 3$ . Let's find its distinct left cosets by adding elements of $G$ to it.

$0 + H = {0 + 0, 0 + 2, 0 + 4} = {0, 2, 4}$
$1 + H = {1 + 0, 1 + 2, 1 + 4} = {1, 3, 5}$
$2 + H = {2 + 0, 2 + 2, 2 + 4} = {2, 4, 0} = {0, 2, 4}$ (This is the same as $0 + H$ )
$3 + H = {3 + 0, 3 + 2, 3 + 4} = {3, 5, 7} \equiv {3, 5, 1} = {1, 3, 5}$ (This is the same as $1 + H$ )

We can see a pattern. The only distinct cosets are $H = {0, 2, 4}$ and $1 + H = {1, 3, 5}$ . There are two cosets. The index is $[G : H] = 2$ .

Notice how these two cosets are the same size (size 3), have no elements in common, and together they form the entire group $G$ . This perfectly demonstrates the partition that proves Lagrange's Theorem: $| G | = | H | \cdot [G : H] ⟹ 6 = 3 \cdot 2$ .

Is the Converse of Lagrange's Theorem True?

Lagrange's Theorem says: IF you have a subgroup, THEN its order must divide the group's order. This leads to a natural question: is the reverse true? If a number $d$ divides the order of a group $G$ , must there be a subgroup of order $d$ ? This is known as the converse of Lagrange's Theorem, and the answer is a surprising NO.

Example 3

The smallest group for which the converse of Lagrange's Theorem fails is called the Alternating Group on 4 elements, denoted $A_{4}$ . Proving this is a bit advanced, but we can explore the result.

Facts about $A_{4}$ :

$A_{4}$ is the group of rotational symmetries of a regular tetrahedron.
It has an order of $| A_{4} | = 12$ .

Problem: Does $A_{4}$ have a subgroup for every divisor of 12?

Solution:

Step 1: List the divisors of the group's order.
The order is 12. The divisors of 12 are $1, 2, 3, 4, 6,$ and $12$ .

Step 2: Check for subgroups.
It can be shown that $A_{4}$ has:

A subgroup of order 1 (the trivial subgroup).
Subgroups of order 2.
Subgroups of order 3.
A subgroup of order 4.
A subgroup of order 12 (the group itself).

Step 3: Identify the missing piece.
Notice the number $6$ in our list of divisors. It turns out, and this is a famous result in group theory, that $A_{4}$ has no subgroup of order 6.

This is a perfect counterexample. Even though $6$ divides $12$ , there is no subgroup of order $6$ in $A_{4}$ . This proves that the converse of Lagrange's Theorem is false. Just because a number divides the group's size doesn't guarantee a subgroup of that size exists.

What Are Some Common Mistakes to Avoid?

When working with Lagrange's Theorem, a few common pitfalls can trip students up. Being aware of them is the best way to steer clear.

Mistake 1: Assuming the Converse is True. This is the most common error. As we saw with the group $A_{4}$ , just because a number divides a group's order doesn't mean a subgroup of that size must exist. Lagrange's theorem is a one-way street.
Mistake 2: Applying it to Infinite Groups. Lagrange's Theorem is explicitly about finite groups. The concepts of 'order' and 'divisibility' don't apply in the same way to infinite groups like the set of all integers $(Z, +)$ .
Mistake 3: Confusing Cosets with Subgroups. A coset $g H$ is formed by shifting a subgroup $H$ . Unless $g$ is an element of $H$ (in which case $g H = H$ ), the coset will not be a subgroup. A quick way to tell is that most cosets don't contain the identity element, which is a requirement for all subgroups.
Mistake 4: Mixing up the Order of a Group and the Order of an Element. The 'order of a group' is its total number of elements. The 'order of an element $g$ ' is the smallest positive integer $n$ such that $g^{n}$ equals the identity. A very useful corollary of Lagrange's Theorem is that the order of any element must divide the order of the group.

Lagrange's Theorem: A Quick Reference

Here is a brief summary of the key ideas covered in this lesson.

Concept	Description
The Theorem	If $H$ is a subgroup of a finite group $G$ , then the order of $H$ must divide the order of $G$ . Notation: $\| H \| ∣ \| G \|$ .
The Formula	$\| G \| = \| H \| \cdot [G : H]$ , where $[G : H]$ is the index of $H$ in $G$ .
Order of a Group $\| G \|$	The number of elements in the group.
Subgroup	A subset of a group that is itself a group under the same operation.
Coset	A 'shift' of a subgroup $H$ by an element $g$ from the group $G$ . Cosets partition the group into equal-sized, non-overlapping pieces.
Index $[G : H]$	The number of distinct cosets of $H$ in $G$ . It's equal to $\| G \| / \| H \|$ .
Converse	The converse is false. A number $d$ can divide $\| G \|$ without there being a subgroup of order $d$ .

Frequently Asked Questions

Who was Lagrange?

Joseph-Louis Lagrange was an 18th-century Italian-French mathematician and astronomer. He made huge contributions to number theory, classical mechanics, and calculus. The theorem is named in his honor for his early work on permutations of roots of polynomials, which laid groundwork for group theory.

Does Lagrange's Theorem work for infinite groups?

No, it only applies to finite groups. The theorem is fundamentally about the relationship between the sizes (orders) of the group and subgroup, and this concept of division requires finite numbers.

What is the 'order' of a group?

The order of a group is simply the number of elements it contains. For example, the group $Z_{4} = {0, 1, 2, 3}$ under addition modulo 4 has an order of 4.

What is the 'index' of a subgroup?

The index of a subgroup $H$ in a group $G$ is the number of distinct cosets of $H$ in $G$ . According to Lagrange's Theorem, this is equal to the order of $G$ divided by the order of $H$ .

Why is Lagrange's Theorem so important?

It's a foundational result in finite group theory that provides a powerful constraint on a group's structure. It drastically narrows down the possible sizes for subgroups, which is a crucial first step in classifying and understanding different types of finite groups.

What's the simplest non-trivial example of Lagrange's Theorem?

A great simple example is the group $G = {0, 1, 2, 3}$ with addition modulo 4. Its order is 4. The set $H = {0, 2}$ is a subgroup of order 2. As Lagrange's Theorem predicts, 2 divides 4.

If a number divides the order of a group, is there always a subgroup of that size?

Not necessarily. This is the 'converse' of the theorem, which is famously false. The group $A_{4}$ has order 12, but it has no subgroup of order 6, even though 6 divides 12.

What is an important consequence of Lagrange's Theorem?

A key corollary is that the order of any element in a finite group must divide the order of the group. This also leads to the interesting fact that any group whose order is a prime number must be a cyclic group.