Lagrange's theorem says that, for a finite group and subgroup ,
Here is the number of left cosets. Every lies in . If and meet, write ; then , so . Hence the left cosets partition . The bijection makes each coset have elements. Adding their cardinalities proves Lagrange's theorem.
Every lies in , since both subgroups contain the identity. If two double cosets intersect, choose
Then , so every element of lies in . Reversing the argument gives equality. Thus the double cosets partition the group.
Unlike single cosets, double cosets can have different cardinalities. For finite , decompose into left cosets of , or apply the orbit-stabilizer theorem to the action of on . Its stabiliser subgroup is , giving
This formula explains the counterexamples in the following parts.
False. Let and . For , direct multiplication gives the double coset
It has four elements, and . This is a concrete example of double-coset sizes not dividing group order; Lagrange's theorem applies to subgroups, not to arbitrary double cosets.
False. Use the same subgroups of . The double coset has two elements, while has four. Thus even a fixed pair of subgroups can give different double-coset sizes. Their disjoint union is all six elements of .
False. Realize the symmetries of a square as a dihedral group of order eight, generated by and , with and . Take . Its double cosets are precisely
These are disjoint and exhaust the eight symmetries. There are three double cosets, and . This proves that double-coset counts need not divide group order. Specifying the order-eight realization avoids competing conventions for the notation of a dihedral group.

Articles by others on the same topic (0)

There are currently no matching articles.