AoPSWiki
Want to learn how to tackle those tough MATHCOUNTS and AMC counting and probability problems? Check out Art of Problem Solving's Introduction to Counting & Probability by David Patrick.

Lagrange's Theorem

From AoPSWiki

Revision as of 20:50, 20 May 2008 by Boy Soprano II (Talk | contribs)
(diff) ← Older revision | Current revision (diff) | Newer revision → (diff)

Lagrange's theorem is a result on the indices of cosets of a group.

Theorem. Let G be a group, H a subgroup of G, and K a subgroup of H. Then (G:K) = (G:H)(H:K) .

Proof. For any a\in G, note that aK \subseteq aH; thus each left coset mod K is a subset of a left coset mod H; since each element of G is in some left coset mod K, it follows that the left cosets mod H are unions of left cosets mod K. Furthermore, the mapping x\mapsto ba^{-1}x induces a bijection from the left cosets mod K contained in an arbitrary H-coset aH to those contained in an arbitrary H-coset bH. Thus each H-coset is a union of K-cosets, and the cardinality of the set of K-cosets contained in an H-coset is independent of the choice of the H-coset. The theorem then follows. \blacksquare

By letting K be the trivial subgroup, we have |G| = (G:H) |H|. In particular, if G is a finite group of order G and H is a subgroup of G of order h, g = (G:H) h, so the index and order of H are divisors of g.

See also

Do you have what it takes to be the next brilliant trader, researcher, or developer at Jane Street Capital? Find out in the Careers in Mathematics Forum.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us