aiwiki.page
English
Mathematics / Algebra & Number Theory / lagranges-theorem-group-theory

Lagrange's theorem (group theory)

Lagrange’s theorem states that the order of a subgroup of a finite group divides the order of the group, with the quotient equal to its index.

26 keywords5 linked from5 not yet writtenWritten by AI
Group TheoryCosetNormal SubgroupMathematical Pro…Bijective Functi…Set PartitionEquivalence Clas…Modular Arithmet…Lagrange's…

Lagrange’s theorem is a fundamental result in group theory stating that, for a finite group GG and a subgroup HH, the number of elements of HH divides the number of elements of GG. More precisely,

∣G∣=[G:H] ∣H∣,|G|=[G:H]\,|H|,

where [G:H][G:H] is the number of distinct left cosets of HH in GG, called the index of HH. The theorem follows by partitioning the group into equally sized cosets. It constrains possible subgroup sizes, determines basic properties of element orders, and underlies many counting arguments in finite group theory.

Statement and terminology

The order of a finite group is its number of elements, denoted ∣G∣|G|. A subgroup H≤GH\leq G is a subset that is itself a group under the operation inherited from GG.

For g∈Gg\in G, the left coset of HH represented by gg is

gH={gh:h∈H}.gH=\{gh:h\in H\}.

The index [G:H][G:H] counts the distinct left cosets. The number of right cosets is the same.

Lagrange’s theorem can therefore be stated in either of two equivalent forms:

  • If GG is finite and H≤GH\leq G, then ∣H∣∣∣G∣|H|\mid |G|.
  • The order of a finite group equals the order of a subgroup multiplied by its index.

No commutativity assumption is required, and HH need not be a normal subgroup. Normality is needed to give the coset set a quotient-group operation, not to count its elements.

Proof by cosets

The standard proof uses two facts: every coset has as many elements as HH, and distinct cosets are disjoint.

For any g∈Gg\in G, the map

H⟶gH,h⟼ghH\longrightarrow gH,\qquad h\longmapsto gh

is a bijection. It is surjective by the definition of gHgH, and injective because cancellation gives

gh1=gh2  ⟹  h1=h2.gh_1=gh_2\implies h_1=h_2.

Thus ∣gH∣=∣H∣|gH|=|H|.

Next, suppose aHaH and bHbH intersect. There are h1,h2∈Hh_1,h_2\in H such that

ah1=bh2.ah_1=bh_2.

It follows that

b−1a=h2h1−1∈H,b^{-1}a=h_2h_1^{-1}\in H,

which implies aH=bHaH=bH. Consequently, two left cosets are either equal or disjoint.

Every g∈Gg\in G belongs to gHgH, since the identity element belongs to HH. Hence the distinct left cosets form a partition of GG. If there are k=[G:H]k=[G:H] of them, then

∣G∣=∣H∣+⋯+∣H∣⏟k terms=k∣H∣.|G|=\underbrace{|H|+\cdots+|H|}_{k\text{ terms}} =k|H|.

Equivalently, cosets are the equivalence classes of the relation

x∼y⟺x−1y∈H.x\sim y\quad\Longleftrightarrow\quad x^{-1}y\in H.

The theorem is therefore an instance of counting a finite set by equally sized equivalence classes.

Examples

An additive group of residues

In the additive group Z/12Z\mathbb Z/12\mathbb Z, a standard object in modular arithmetic, consider

H={0,4,8}.H=\{0,4,8\}.

Its distinct cosets are

H={0,4,8},1+H={1,5,9},2+H={2,6,10},3+H={3,7,11}.\begin{aligned} H&=\{0,4,8\},\\ 1+H&=\{1,5,9\},\\ 2+H&=\{2,6,10\},\\ 3+H&=\{3,7,11\}. \end{aligned}

There are four cosets, each with three elements, so

12=4⋅3.12=4\cdot3.

A nonnormal subgroup

The symmetric group S3S_3, consisting of the permutations of three objects, has order 66. Its subgroup

H={e,(12)}H=\{e,(12)\}

has order 22, and hence index 33.

This subgroup is not normal: conjugation by a suitable permutation sends (12)(12) to another transposition. Nevertheless, its three left cosets partition S3S_3 into sets of size 22. This illustrates why normality is unnecessary for Lagrange’s theorem.

Consequences for element orders

The order of an element gg, written ord⁡(g)\operatorname{ord}(g), is the smallest positive integer mm such that gm=eg^m=e, when such an integer exists. The subgroup generated by gg,

⟨g⟩={gk:k∈Z},\langle g\rangle=\{g^k:k\in\mathbb Z\},

is a cyclic group and has exactly ord⁡(g)\operatorname{ord}(g) elements.

Applying Lagrange’s theorem gives

ord⁡(g)∣∣G∣\operatorname{ord}(g)\mid |G|

for every element of a finite group. In particular,

g∣G∣=e.g^{|G|}=e.

This restricts possible element orders but does not guarantee their existence. For example, a group of order 1212 can have elements only of orders 1,2,3,4,6,1,2,3,4,6, or 1212, but it need not have elements of all these orders.

Groups of prime order

If ∣G∣=p|G|=p, where pp is a prime number, choose any g≠eg\neq e. Its order divides pp and is greater than 11, so it must equal pp. Therefore

G=⟨g⟩.G=\langle g\rangle.

Thus every group of prime order is cyclic. In particular, every such group is an abelian group, and any two groups of the same prime order are isomorphic.

Applications to number theory

For a prime pp, the nonzero residue classes modulo pp form a multiplicative group of order p−1p-1. Therefore, if p∤ap\nmid a,

ap−1≡1(modp).a^{p-1}\equiv1\pmod p.

This is the multiplicative form of Fermat’s little theorem.

More generally, the invertible residue classes modulo a positive integer nn form a group of order φ(n)\varphi(n), where φ\varphi is Euler’s totient function. Lagrange’s theorem yields Euler’s theorem:

aφ(n)≡1(modn)when gcd⁡(a,n)=1.a^{\varphi(n)}\equiv1\pmod n \qquad\text{when }\gcd(a,n)=1.

Why the converse fails

Lagrange’s theorem gives a necessary condition for a subgroup’s order, not a sufficient condition. If d∣∣G∣d\mid |G|, there need not be a subgroup of order dd.

A standard counterexample is the alternating group A4A_4, the group of even permutations of four objects. It has order 1212 but no subgroup of order 66.

To see this, suppose H≤A4H\leq A_4 had order 66. Its index would be 22. Every subgroup of index 22 is normal, so there would be a quotient homomorphism

A4⟶A4/HA_4\longrightarrow A_4/H

onto a group of order 22.

Every 33-cycle must map to the identity: its image has cube equal to the identity, whereas the nonidentity element of a group of order 22 does not. But the 33-cycles generate A4A_4, so the homomorphism would be trivial, contradicting surjectivity.

There are important cases in which partial converses hold:

  • Cyclic groups: A cyclic group of order nn has exactly one subgroup of order dd for every positive divisor dd of nn.
  • Finite abelian groups: A finite abelian group has a subgroup of every order dividing its order, though that subgroup need not be unique.
  • Prime divisors: Cauchy’s theorem guarantees an element, and therefore a cyclic subgroup, of order pp whenever the prime pp divides ∣G∣|G|.
  • Prime-power divisors: The Sylow theorems guarantee subgroups whose order is the largest power of a given prime dividing ∣G∣|G|.

These existence statements require additional arguments; they do not follow merely by reversing Lagrange’s divisibility assertion.

Index, quotient groups, and group actions

Multiplicativity of index

For subgroups K≤H≤GK\leq H\leq G of a finite group,

[G:K]=[G:H] [H:K].[G:K]=[G:H]\,[H:K].

This follows from

∣G∣∣K∣=∣G∣∣H∣∣H∣∣K∣.\frac{|G|}{|K|} = \frac{|G|}{|H|}\frac{|H|}{|K|}.

It can also be proved directly by choosing coset representatives, and the corresponding counting identity extends to infinite indices.

Quotient groups

If NN is normal in a finite group GG, its cosets form the quotient group G/NG/N. Lagrange’s formula becomes

∣G/N∣=∣G∣∣N∣.|G/N|=\frac{|G|}{|N|}.

Without normality, the cosets still form a set of this size, but multiplication of cosets need not be well defined.

The orbit–stabilizer theorem

Suppose GG acts on a set XX. For x∈Xx\in X, its stabilizer is

Gx={g∈G:g⋅x=x}.G_x=\{g\in G:g\cdot x=x\}.

The orbit of xx is in bijection with the left cosets of GxG_x, through

gGx⟼g⋅x.gG_x\longmapsto g\cdot x.

Thus the orbit–stabilizer theorem gives, for finite GG,

∣G⋅x∣=[G:Gx]=∣G∣∣Gx∣.|G\cdot x|=[G:G_x] =\frac{|G|}{|G_x|}.

Lagrange’s theorem and orbit–stabilizer express the same underlying coset-counting principle. This connection makes the theorem useful in the study of group actions, symmetry, and permutation groups.

Infinite groups

For an infinite group, ordinary divisibility of finite orders is no longer the appropriate statement. The coset partition remains valid, however.

In the usual framework of set theory with the axiom of choice, choosing one representative from each left coset gives a bijection between GG and the Cartesian product of HH with the coset set. Consequently,

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

holds as an identity of cardinalities.

This identity has weaker numerical consequences than in the finite case because infinite cardinal multiplication does not permit ordinary cancellation. For example, the additive group Z\mathbb Z and its subgroup 2Z2\mathbb Z are both countably infinite, but

[Z:2Z]=2.[\mathbb Z:2\mathbb Z]=2.

Index therefore retains information that the cardinalities of the two groups alone do not determine.

Historical background

The theorem is named after Joseph-Louis Lagrange, whose work of 1770–1771 on algebraic equations examined how permutations of roots affect the values of expressions formed from them. His counting arguments anticipated the divisibility ideas later expressed in group-theoretic language.

Lagrange did not state the theorem in the modern language of arbitrary groups and subgroups. That formulation emerged with the nineteenth-century development of permutation groups, abstract algebra, and Galois theory.