Lagrange's Theorem

Abstract Algebra · Axiom Academy

One of the most fundamental results in group theory: the order of any subgroup divides the order of the group. Understanding through cosets and partitions. In other words, if has elements and has elements, then must divide evenly. Example: The Symmetric Group S₃ Consider , which has order 6. Its subgroups have orders: 1, 2, 3, and 6. Notice that all of these divide 6! 2. Cosets: Partitioning the Group The key to understanding Lagrange's Theorem is the concept of cosets . Given a subgroup , we can partition the entire group into equal-sized pieces called left cosets. Let and . The left cosets are: Notice: 3 cosets × 2 elements per coset = 6 elements total! 3. The Proof: Counting Elements The proof of Lagrange's Theorem follows from the observation that cosets partition the group into equal-sized, non-overlapping pieces. The group is partitioned into distinct left cosets of . Each coset has exactly elements. The number of distinct cosets is called the index of in , denoted . 4. Application: Element Orders Lagrange's Theorem has an immediate corollary about the order of individual elements. Why? The cyclic subgroup generated by has order equal to the order of . By Lagrange's Theorem, this must divide . In (order 6), elements can only have orders 1, 2, 3, or 6. Transpositions (like (12)): order 2 3-cycles (like (123)): order 3 No elements of order 4 or 5 exist!

This is the written version of the interactive lesson above. See the full Abstract Algebra course.