Lagrange's Theorem Equation, Derivation & Rearrangements

Core idea

Overview

Lagrange's Theorem states that for any finite group G, the order of every subgroup H must divide the order of the parent group G. The resulting quotient is known as the index of H in G, representing the number of unique left or right cosets of H in G.

When to use: Use this theorem when investigating the potential sizes of subgroups or the number of cosets within a finite group. It is essential for verifying whether a specific integer can theoretically be the order of a subgroup for a given group size.

Why it matters: This theorem is a cornerstone of abstract algebra, providing the foundation for more complex results like Cauchy's Theorem and Sylow's Theorems. It also underpins modern cryptographic security by limiting the possible orders of elements in cyclic groups used in encryption.

Symbols

Variables

[G:H] = Index [G:H], |G| = Order of Group G, |H| = Order of Subgroup H

[G : H]

Index [G:H]

V a r iab l e

∣ G ∣

Order of Group G

V a r iab l e

∣ H ∣

Order of Subgroup H

V a r iab l e

Walkthrough

Derivation

Derivation/Understanding of Lagrange's Theorem

Lagrange's Theorem states that for any finite group G and any subgroup H, the order of H divides the order of G, and the quotient is the index of H in G.

G is a finite group.
H is a subgroup of G.

1

Definition of Cosets and Partitioning G:

This means that every element of $G$ belongs to exactly one left coset of $H$ , and the union of all distinct left cosets is $G$ .

Let $H$ be a subgroup of a finite group $G$. For any $a \in G$, the left coset of $H$ containing $a$ is $aH = \{ah \mid h \in H\}$. The set of all distinct left cosets of $H$ in $G$ forms a partition of $G$.

2

Equinumerosity of Cosets:

This establishes that every left coset of $H$ has the same number of elements as the subgroup $H$ itself.

For any $a \in G$, the mapping $f: H \to aH$ defined by $f(h) = ah$ is a bijection. Therefore, $|aH| = |H|$ for all $a \in G$.

3

Counting Elements in G:

The group $G$ is the disjoint union of $k$ distinct left cosets, where $k$ is the number of distinct left cosets.

Since the distinct left cosets partition $G$, we can write $G = a_1H \cup a_2H \cup \dots \cup a_kH$, where $a_iH \cap a_jH = \emptyset$ for $i \neq j$.

4

Deriving Lagrange's Theorem:

By summing the sizes of the disjoint cosets, and knowing each coset has size $∣ H ∣$ , we arrive at the theorem's formula, which shows that the order of H divides the order of G.

$|G| = |a_1H| + |a_2H| + \dots + |a_kH|$. Since $|a_iH| = |H|$ for all $i$, we have $|G| = k \cdot |H|$. The number of distinct left cosets, $k$, is defined as the index of $H$ in $G$, denoted by $[G:H]$. Thus, $|G| = [G:H] \cdot |H|$.

Result

$|G| = |a_1H| + |a_2H| + \dots + |a_kH|$. Since $|a_iH| = |H|$ for all $i$, we have $|G| = k \cdot |H|$. The number of distinct left cosets, $k$, is defined as the index of $H$ in $G$, denoted by $[G:H]$. Thus, $|G| = [G:H] \cdot |H|$.

Source: A First Course in Abstract Algebra by John B. Fraleigh

Free formulas

Rearrangements

Solve for $∣ G ∣$

Make orderG the subject

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

orderG is already the subject of the formula.

Difficulty: 1/5

Solve for $[G : H]$

Make [G:H] the subject

\frac{∣ G ∣}{∣ H ∣}

To make the index [G:H] the subject of Lagrange's Theorem, divide both sides of the equation by the order of subgroup H, |H|.

Difficulty: 2/5

The static page shows the finished rearrangements. The app keeps the full worked algebra walkthrough.

Visual intuition

Graph

The graph is a discrete set of points representing an inverse relationship where the index [G:H] is plotted against the order of the subgroup |H|. As the subgroup order increases, the index decreases hyperbolically to maintain the constant product |G|, resulting in a series of points along a hyperbola.

Graph type: hyperbolic

Why it behaves this way

Intuition

Visualize the entire group G as a collection of distinct, equally-sized partitions, where each partition is a coset formed by shifting the subgroup H.

|G|

The total number of distinct elements in the finite group G.

Represents the overall 'size' or 'population' of the group.

|H|

The total number of distinct elements in the subgroup H.

Represents the 'size' of a smaller, self-contained structure (the subgroup) within the larger group.

[G:H]

The number of distinct left (or right) cosets of H in G.

Represents how many 'chunks' or 'partitions' of the subgroup H are needed to completely cover the group G without overlap.

Free study cues

Insight

Canonical usage

This equation relates the integer counts of elements in a finite group, its subgroup, and the number of cosets, all of which are dimensionless quantities.

Common confusion

Students might mistakenly try to assign physical units to group orders or indices, or confuse them with magnitudes of vectors or other physical quantities.

Dimension note

All quantities in Lagrange's Theorem-the order of a group (|G|), the order of a subgroup (|H|), and the index of a subgroup ([G:H])-are integer counts of elements or cosets.

Unit systems

$∣ G ∣$ dimensionless (count) · Represents the number of elements in the finite group G. It is a non-negative integer.

$∣ H ∣$ dimensionless (count) · Represents the number of elements in the subgroup H. It is a non-negative integer.

$[G : H]$ dimensionless (count) · Represents the index of H in G, which is the number of distinct left (or right) cosets of H in G. It is a positive integer.

One free problem

Practice Problem

A finite group G has an order of 48. If H is a subgroup of G with an order of 12, what is the index of H in G?

Order of Group G48

Order of Subgroup H12

Solve for: $r es u l t$

Hint: The index is the ratio of the group order to the subgroup order.

The full worked solution stays in the interactive walkthrough.

Where it shows up

Real-World Context

In computational group theory and cryptography (like RSA and Elliptic Curve Cryptography), Lagrange's theorem restricts the possible orders of elements, which ensures the security parameters of the cyclic groups being used.

Study smarter

Tips

Note that the theorem only applies to finite groups and does not guarantee the existence of a subgroup for every divisor.
The index [G:H] must always be an integer.
Remember that the order of any element in G must also divide the order of G because elements generate cyclic subgroups.

Avoid these traps

Common Mistakes

Applying the theorem to infinite groups where the concept of 'divisibility' of orders doesn't apply the same way.
Assuming that a subgroup must exist for every divisor of the group order.

Keep going

Related Formulas

Common questions

Frequently Asked Questions

Lagrange's Theorem states that for any finite group G and any subgroup H, the order of H divides the order of G, and the quotient is the index of H in G.

Use this theorem when investigating the potential sizes of subgroups or the number of cosets within a finite group. It is essential for verifying whether a specific integer can theoretically be the order of a subgroup for a given group size.

This theorem is a cornerstone of abstract algebra, providing the foundation for more complex results like Cauchy's Theorem and Sylow's Theorems. It also underpins modern cryptographic security by limiting the possible orders of elements in cyclic groups used in encryption.

Applying the theorem to infinite groups where the concept of 'divisibility' of orders doesn't apply the same way. Assuming that a subgroup must exist for every divisor of the group order.