Canonical: https://knowlpedia.com/algebra-groups/lagranges-theorem/

# Lagrange's Theorem

In a finite group, the order of a subgroup divides the order of the group

**Lagrange's Theorem.**
Let \(G\) be a finite [group](https://knowlpedia.com/algebra-groups/group/), and let \(H \le G\) be a [subgroup](https://knowlpedia.com/algebra-groups/subgroup/). Then all left [cosets](https://knowlpedia.com/algebra-groups/coset/) of \(H\) in \(G\) have the same [cardinality](https://knowlpedia.com/shared-foundations/cardinality/) as \(H\), the distinct left cosets form a [partition](https://knowlpedia.com/shared-foundations/partition/) of \(G\), and
\[
|G| = [G:H]\cdot |H|,
\]

where \([G:H]\) is the [index](https://knowlpedia.com/algebra-groups/index-of-subgroup/) of \(H\) in \(G\). In particular, \(|H|\) divides \(|G|\).

## Remarks

This is the basic divisibility theorem for finite groups and is the starting point for many counting arguments. A standard consequence is [the fact that the order of an element divides the order of the group](https://knowlpedia.com/algebra-groups/order-divides-group-order/).
