Coset — Definition, Formula & Examples
A coset is the set you get by multiplying every element of a subgroup by a fixed element from the larger group. Left cosets and right cosets partition the group into equal-sized, non-overlapping pieces.
Let be a group and a subgroup of . For any element , the left coset of with respect to is the set , and the right coset is . The collection of all distinct left cosets (or right cosets) of in forms a partition of .
Key Formula
Where:
- = The ambient group
- = A subgroup of G
- = A fixed element of G (the coset representative)
- = The left coset of H determined by g
How It Works
To build a left coset , pick an element from the group and multiply it on the left with every element of the subgroup . Each coset has exactly elements. Two left cosets are either identical or completely disjoint, so they slice the group into equal-sized blocks. The number of distinct cosets, called the index , satisfies Lagrange's theorem: . When left and right cosets coincide for every , the subgroup is called normal, which is the condition needed to form a quotient group.
Worked Example
Problem: Let under addition mod 6, and let . Find all distinct left cosets of in .
Step 1: Compute the coset by adding 0 to every element of .
Step 2: Compute .
Step 3: Compute .
Step 4: Check the remaining elements. , , and . No new cosets appear.
Answer: The three distinct left cosets are , , and . They partition into 3 blocks of size 2, consistent with Lagrange's theorem: .
Why It Matters
Cosets are the building blocks of Lagrange's theorem, which explains why the order of a subgroup must divide the order of the group. They also underpin quotient groups, which appear throughout algebra, number theory, and cryptographic protocols like those based on elliptic curves.
Common Mistakes
Mistake: Assuming a coset is itself a subgroup.
Correction: A coset is a subgroup only when (making it equal to itself). In general, cosets do not contain the identity element and are not closed under the group operation.
