Consequences of Lagrange’s Theorem
students, in this lesson you will see why Lagrange’s theorem is one of the most powerful tools in finite group theory 📘✨ It does more than tell us a subgroup’s size. It gives important consequences about the possible orders of elements, the structure of groups, and what kinds of subgroups can or cannot exist. By the end, you should be able to explain these consequences clearly, use them in examples, and connect them to cosets and indices.
1. The big idea behind Lagrange’s theorem
Lagrange’s theorem says that if $H$ is a subgroup of a finite group $G$, then the order of $H$ divides the order of $G$.
In symbols, if $|G|$ is finite and $H \le G$, then $|H| \mid |G|$.
This works because the left cosets of $H$ partition the group $G$. Each left coset has exactly $|H|$ elements, and the number of cosets is the index $[G : H]$. So we can write
$$|G| = [G : H] \cdot |H|.$$
That equation is the starting point for many important consequences. Since $|G|$ is built from the subgroup size and the number of cosets, information about one part gives information about the others. This is useful in a wide range of problems, from checking whether a subgroup can exist to finding possible element orders in a group 🔍
For example, if a group has $|G| = 12$, then any subgroup must have order dividing $12$. So subgroup orders can only be $1,2,3,4,6,$ or $12$. A subgroup of order $5 is impossible in a group of order $12$.
2. Orders of elements must divide the group order
One of the most important consequences of Lagrange’s theorem is about element orders.
If $g \in G$, then the order of $g$, written $\operatorname{ord}(g)$, is the order of the cyclic subgroup generated by $g$, namely $\langle g \rangle$. Since $\langle g \rangle$ is a subgroup of $G$, Lagrange’s theorem tells us that
$$\operatorname{ord}(g) = |\langle g \rangle| \mid |G|.$$
This means every element order must divide the group order.
Example
Suppose $G$ has order $15$. What orders can elements of $G$ have?
Since element orders must divide $15$, the only possible orders are $1, 3, 5,$ and $15.
So an element of order $4$ cannot exist in a group of order $15$.
This idea is very helpful in finite groups because it narrows down the possibilities quickly. If you are asked whether a group of a certain order can contain an element of a certain order, Lagrange’s theorem gives an immediate test ✅
Why this matters
In many algebra problems, the first step is not to find the exact answer but to eliminate impossible cases. Lagrange’s theorem gives a fast way to do that. For instance:
- If $|G| = 8$, there is no element of order $3$.
- If $|G| = 10$, there is no element of order $4$.
- If $|G| = 21$, there is no element of order $8$.
This is a powerful filter for reasoning about group structure.
3. Prime order groups are cyclic
Another major consequence comes when the order of a group is prime.
If $|G| = p$ where $p$ is prime, then every non-identity element $g \in G$ has order dividing $p$. The divisors of $p$ are only $1$ and $p$. Since the identity is the only element of order $1$, any non-identity element must have order $p$.
That means every non-identity element generates the whole group:
$$\langle g \rangle = G.$$
So every group of prime order is cyclic.
Example
Let $|G| = 7$. Then for any $g \ne e$, the order $\operatorname{ord}(g)$ must divide $7$. The only possibility is
$$\operatorname{ord}(g) = 7.$$
Therefore $g$ generates $G$, and $G$ is cyclic.
This result is a direct consequence of Lagrange’s theorem and is often used to classify small groups. It tells us that prime-order groups are very simple in structure.
4. There are no proper nontrivial subgroups in a prime order group
A group $G$ with prime order has another consequence: it has no subgroups other than $\{e\}$ and $G$ itself.
Why? If $H \le G$, then $|H|$ must divide $|G| = p$. So $|H|$ can only be $1$ or $p$.
This means there is no subgroup of order $2$, $3$, or any other proper size.
Example
If a group has order $11$, the only possible subgroup orders are $1$ and $11$.
So if someone claims there is a subgroup of size $5$, that is impossible.
This consequence is very useful because it shows that prime-order groups are not just cyclic; they are also extremely limited in their subgroup structure. In practice, this makes them easier to understand and work with.
5. Restrictions on possible group structures
Lagrange’s theorem does not tell us everything about a group, but it gives strong restrictions. A finite group must have subgroups and elements whose orders fit inside the divisibility pattern of $|G|$.
Example: order $6$
If $|G| = 6$, possible element orders are divisors of $6$:
$$1,2,3,6.$$
So an element of order $4$ is impossible.
This does not mean every group of order $6$ is the same. Different groups can have different internal structure, but all must obey the same divisibility rules. For example, one group of order $6$ may be cyclic, while another may not be. Lagrange’s theorem tells you what cannot happen, even when it does not fully determine what does happen.
Example: order $8$
If $|G| = 8$, then element orders can only be
$$1,2,4,8.$$
So no element can have order $3$ or $5$.
This sort of restriction is often the first step in proving a group is not cyclic, or in showing that a certain subgroup cannot exist.
6. The index of a subgroup is tied to size
The index $[G : H]$ is the number of left cosets of $H$ in $G$. Lagrange’s theorem shows that
$$[G : H] = \frac{|G|}{|H|}$$
when $G$ is finite.
So the index is always a positive integer. This means the subgroup size must divide the group size.
Example
If $|G| = 20$ and $|H| = 5$, then
$$[G : H] = \frac{20}{5} = 4.$$
So there are exactly $4$ left cosets of $H$ in $G$.
This is a consequence of Lagrange’s theorem because the theorem comes from the fact that cosets all have the same size as $H$ and together they cover the whole group. The index therefore measures how many translated copies of $H$ fill the group.
7. If the subgroup has index 2, it is normal
A very important consequence in group theory is this: any subgroup of index $2$ is normal.
If $[G : H] = 2$, then there are exactly two left cosets of $H$ in $G$. There are also exactly two right cosets. Since one coset is $H$ itself, every other element of $G$ lies in the only other coset. This forces left cosets and right cosets to match.
So
$$gH = Hg \quad \text{for all } g \in G,$$
which means $H \trianglelefteq G$.
Why this is useful
Normal subgroups are important because they allow quotient groups to be formed. The index $2$ case appears often in examples because it is one of the easiest ways to prove normality.
Example
If $|G| = 12$ and $|H| = 6$, then
$$[G : H] = 2.$$
So $H$ is normal in $G$.
This is a strong structural fact that follows from the counting idea behind Lagrange’s theorem.
8. Group order and subgroup order must fit together
Lagrange’s theorem is often used by checking divisibility in both directions.
If you know the order of the group, you can predict possible subgroup orders and element orders. If you know the order of an element, you know the size of the cyclic subgroup it generates.
Example
Suppose $|G| = 30$.
Possible subgroup orders must divide $30$, so they may be $1,2,3,5,6,10,15,$ or $30.
Possible element orders also must divide $30$, so an element of order $7$ cannot exist.
This is especially helpful in proofs by contradiction. If a problem assumes an element or subgroup of a forbidden order exists, Lagrange’s theorem lets you show the assumption cannot be true.
Conclusion
students, the consequences of Lagrange’s theorem are central to understanding finite groups. The theorem shows that subgroup sizes divide the group size, and that element orders also divide the group size because they come from cyclic subgroups. From this, we learn that prime-order groups are cyclic, prime-order groups have no proper nontrivial subgroups, and subgroups of index $2$ are normal. We also learn how to use divisibility to rule out impossible subgroup and element orders. These ideas connect directly to cosets, index, and the broader structure of groups 🔗
Study Notes
- Lagrange’s theorem says that if $H \le G$ and $G$ is finite, then $|H| \mid |G|$.
- The number of left cosets of $H$ in $G$ is the index $[G : H]$.
- For finite groups, $|G| = [G : H] \cdot |H|$.
- The order of any element $g \in G$ divides $|G|$ because $\operatorname{ord}(g) = |\langle g \rangle|$.
- If $|G|$ is prime, then $G$ is cyclic.
- If $|G|$ is prime, then the only subgroups are $\{e\}$ and $G$.
- If a subgroup has index $2$, then it is normal.
- Lagrange’s theorem helps eliminate impossible subgroup orders and element orders.
- It gives strong restrictions, but it does not fully determine the structure of every finite group.