Why This Matters
Cosets are one of the most powerful tools in abstract algebra for understanding how groups break apart into structured pieces. When you're working with a group G and a subgroup H, cosets let you partition the entire group into equally-sized, non-overlapping chunks—and this simple idea unlocks major theorems like Lagrange's Theorem, the construction of quotient groups, and deep insights into group symmetry. You're being tested on your ability to recognize how cosets organize group elements, why left and right cosets might differ, and when coset multiplication actually makes sense.
Don't just memorize the formula gH={gh∣h∈H}—understand what it represents geometrically and algebraically. Know which conditions make coset operations well-defined, how the index connects to group order, and why normal subgroups are the key to building new groups from old ones. These concepts form the backbone of group structure theory and appear repeatedly in proofs and problem-solving.
Building Blocks: Coset Definitions
A coset collects all products of a fixed group element with every element of a subgroup, creating a "shifted copy" of that subgroup within the larger group.
Definition of a Coset
- Two types exist: left and right—given group G and subgroup H, the left coset is gH={gh∣h∈H} and the right coset is Hg={hg∣h∈H}
- Cosets partition G into disjoint subsets—every element of G belongs to exactly one coset, with no overlaps
- The subgroup itself is always a coset—specifically, eH=H=He where e is the identity element
Left Cosets
- Formed by left multiplication—multiply the fixed element g on the left of every element in H
- All left cosets have identical size—∣gH∣=∣H∣ for any g∈G, which is essential for counting arguments
- Equality test: g1H=g2H if and only if g1−1g2∈H—this equivalence relation defines the partition
Right Cosets
- Formed by right multiplication—multiply the fixed element g on the right: Hg={hg∣h∈H}
- Same cardinality as left cosets—∣Hg∣=∣H∣, so the number of left cosets equals the number of right cosets
- Equality test: Hg1=Hg2 if and only if g1g2−1∈H—note the different inverse position compared to left cosets
Compare: Left cosets gH vs. Right cosets Hg—both partition G into ∣H∣-sized pieces, but they may form different partitions when H is not normal. If an exam asks when these coincide, the answer is normal subgroups.
Coset Representatives
- One element chosen to "name" each coset—any element g∈gH can serve as the representative for that coset
- Choice is not unique—if g1H=g2H, both g1 and g2 are valid representatives for the same coset
- Strategic selection simplifies proofs—choosing representatives with special properties (like smallest positive integer in number theory contexts) can streamline calculations
Counting and Structure: Index and Lagrange's Theorem
The index measures how many "copies" of a subgroup fit inside the full group, leading directly to one of algebra's most fundamental results.
Index of a Subgroup
- Definition: [G:H] equals the number of distinct cosets of H in G—this counts both left and right cosets (the numbers are always equal)
- Finite group formula: [G:H]=∣G∣/∣H∣ when G is finite—this ratio is always a positive integer
- Measures "relative size"—the index tells you how much larger G is than H in terms of coset structure
Lagrange's Theorem
- The order of H divides the order of G—written ∣H∣∣∣G∣, this is the foundational divisibility result in finite group theory
- Proof relies on coset partition—since cosets are disjoint, equal-sized, and cover G, we get ∣G∣=[G:H]⋅∣H∣
- Immediate consequences: the order of any element divides ∣G∣, and groups of prime order have no proper nontrivial subgroups
Compare: Index [G:H] vs. Order ∣H∣—index counts cosets while order counts elements, but Lagrange's Theorem binds them together: ∣G∣=[G:H]⋅∣H∣. FRQs often ask you to find one given the other two.
When Cosets Behave: Normal Subgroups and Operations
Coset multiplication only works consistently when left and right cosets coincide—this special condition defines normal subgroups.
Coset Multiplication
- Attempted definition: (g1H)(g2H)=g1g2H—this tries to multiply cosets by multiplying representatives
- Problem: may not be well-defined—different representatives could give different results unless H has special properties
- Well-defined precisely when H is normal—normality ensures the product is independent of representative choice
Normal Subgroups and Cosets
- Normality condition: H is normal in G (written H◃G) if gH=Hg for all g∈G
- Equivalent formulation: gHg−1=H for all g—the subgroup is "stable under conjugation"
- Critical importance: normality is the exact condition needed to turn cosets into a group via multiplication
Compare: Normal vs. Non-normal subgroups—for normal H, left and right cosets are identical sets, enabling quotient group construction. Non-normal subgroups still have cosets, but you can't multiply them consistently. This distinction is exam-critical.
Quotient Groups
- Construction: G/H={gH∣g∈G} with operation (g1H)(g2H)=g1g2H—only valid when H◃G
- The cosets become elements—the quotient group "collapses" H to the identity element of the new group
- Order formula: ∣G/H∣=[G:H]—the quotient group has as many elements as there are cosets
Computational Techniques: Enumeration and Representatives
Counting cosets and choosing representatives strategically are practical skills for solving group theory problems.
Coset Enumeration
- Goal: systematically list all distinct cosets of H in G—essential for computing index and understanding group structure
- Method: pick elements g∈G and compute gH until all of G is covered—stop when no new cosets appear
- Connection to orbit-stabilizer: for group actions, coset counting relates to orbit sizes via ∣G∣=∣Orb(x)∣⋅∣Stab(x)∣
Compare: Coset enumeration vs. Subgroup listing—enumeration counts how H partitions G, while listing subgroups identifies all possible H. Both use Lagrange's Theorem but answer different structural questions.
Quick Reference Table
|
| Coset definition | Left coset gH, Right coset Hg, Identity coset eH=H |
| Partition property | Disjoint cosets, Equal cardinality ∥gH∥=∥H∥ |
| Index computation | [G:H]=∥G∥/∥H∥, Counting distinct cosets |
| Lagrange's Theorem | ∥H∥∣∥G∥, Order of elements divides group order |
| Normality condition | gH=Hg, gHg−1=H, Kernel of homomorphism |
| Quotient groups | G/H when H◃G, Z/nZ |
| Well-defined operations | Coset multiplication requires normality |
Self-Check Questions
-
If H is a subgroup of G with ∣G∣=24 and ∣H∣=6, how many distinct left cosets does H have in G? What theorem guarantees this is an integer?
-
Compare left cosets and right cosets: under what condition on H are they guaranteed to be the same sets? Give the name of this property.
-
Why does coset multiplication (g1H)(g2H)=g1g2H fail to be well-defined for non-normal subgroups? What could go wrong with different representative choices?
-
Two elements g1,g2∈G satisfy g1H=g2H. What can you conclude about g1−1g2? How does this relate to the equivalence relation defined by cosets?
-
Explain how Lagrange's Theorem follows from the fact that cosets partition a group into equal-sized disjoint subsets. If an FRQ asks you to prove a subgroup has a specific index, what's your strategy?