upgrade
upgrade

Groups and Geometries

Essential Concepts of Cosets

Study smarter with Fiveable

Get study guides, practice questions, and cheatsheets for all your subjects. Join 500,000+ students with a 96% pass rate.

Get Started

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 GG and a subgroup HH, 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={ghhH}gH = \{gh \mid h \in 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 GG and subgroup HH, the left coset is gH={ghhH}gH = \{gh \mid h \in H\} and the right coset is Hg={hghH}Hg = \{hg \mid h \in H\}
  • Cosets partition GG into disjoint subsets—every element of GG belongs to exactly one coset, with no overlaps
  • The subgroup itself is always a coset—specifically, eH=H=HeeH = H = He where ee is the identity element

Left Cosets

  • Formed by left multiplication—multiply the fixed element gg on the left of every element in HH
  • All left cosets have identical sizegH=H|gH| = |H| for any gGg \in G, which is essential for counting arguments
  • Equality test: g1H=g2Hg_1H = g_2H if and only if g11g2Hg_1^{-1}g_2 \in H—this equivalence relation defines the partition

Right Cosets

  • Formed by right multiplication—multiply the fixed element gg on the right: Hg={hghH}Hg = \{hg \mid h \in H\}
  • Same cardinality as left cosetsHg=H|Hg| = |H|, so the number of left cosets equals the number of right cosets
  • Equality test: Hg1=Hg2Hg_1 = Hg_2 if and only if g1g21Hg_1g_2^{-1} \in H—note the different inverse position compared to left cosets

Compare: Left cosets gHgH vs. Right cosets HgHg—both partition GG into H|H|-sized pieces, but they may form different partitions when HH 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 ggHg \in gH can serve as the representative for that coset
  • Choice is not unique—if g1H=g2Hg_1H = g_2H, both g1g_1 and g2g_2 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][G : H] equals the number of distinct cosets of HH in GG—this counts both left and right cosets (the numbers are always equal)
  • Finite group formula: [G:H]=G/H[G : H] = |G| / |H| when GG is finite—this ratio is always a positive integer
  • Measures "relative size"—the index tells you how much larger GG is than HH in terms of coset structure

Lagrange's Theorem

  • The order of HH divides the order of GG—written HG|H| \mid |G|, this is the foundational divisibility result in finite group theory
  • Proof relies on coset partition—since cosets are disjoint, equal-sized, and cover GG, we get G=[G:H]H|G| = [G:H] \cdot |H|
  • Immediate consequences: the order of any element divides G|G|, and groups of prime order have no proper nontrivial subgroups

Compare: Index [G:H][G : H] vs. Order H|H|—index counts cosets while order counts elements, but Lagrange's Theorem binds them together: G=[G:H]H|G| = [G:H] \cdot |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(g_1H)(g_2H) = g_1g_2H—this tries to multiply cosets by multiplying representatives
  • Problem: may not be well-defined—different representatives could give different results unless HH has special properties
  • Well-defined precisely when HH is normal—normality ensures the product is independent of representative choice

Normal Subgroups and Cosets

  • Normality condition: HH is normal in GG (written HGH \triangleleft G) if gH=HggH = Hg for all gGg \in G
  • Equivalent formulation: gHg1=HgHg^{-1} = H for all gg—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 HH, 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={gHgG}G/H = \{gH \mid g \in G\} with operation (g1H)(g2H)=g1g2H(g_1H)(g_2H) = g_1g_2H—only valid when HGH \triangleleft G
  • The cosets become elements—the quotient group "collapses" HH to the identity element of the new group
  • Order formula: G/H=[G:H]|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 HH in GG—essential for computing index and understanding group structure
  • Method: pick elements gGg \in G and compute gHgH until all of GG 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)|G| = |\text{Orb}(x)| \cdot |\text{Stab}(x)|

Compare: Coset enumeration vs. Subgroup listing—enumeration counts how HH partitions GG, while listing subgroups identifies all possible HH. Both use Lagrange's Theorem but answer different structural questions.


Quick Reference Table

ConceptBest Examples
Coset definitionLeft coset gHgH, Right coset HgHg, Identity coset eH=HeH = H
Partition propertyDisjoint cosets, Equal cardinality gH=H\|gH\| = \|H\|
Index computation[G:H]=G/H[G:H] = \|G\|/\|H\|, Counting distinct cosets
Lagrange's TheoremHG\|H\| \mid \|G\|, Order of elements divides group order
Normality conditiongH=HggH = Hg, gHg1=HgHg^{-1} = H, Kernel of homomorphism
Quotient groupsG/HG/H when HGH \triangleleft G, Z/nZ\mathbb{Z}/n\mathbb{Z}
Well-defined operationsCoset multiplication requires normality

Self-Check Questions

  1. If HH is a subgroup of GG with G=24|G| = 24 and H=6|H| = 6, how many distinct left cosets does HH have in GG? What theorem guarantees this is an integer?

  2. Compare left cosets and right cosets: under what condition on HH are they guaranteed to be the same sets? Give the name of this property.

  3. Why does coset multiplication (g1H)(g2H)=g1g2H(g_1H)(g_2H) = g_1g_2H fail to be well-defined for non-normal subgroups? What could go wrong with different representative choices?

  4. Two elements g1,g2Gg_1, g_2 \in G satisfy g1H=g2Hg_1H = g_2H. What can you conclude about g11g2g_1^{-1}g_2? How does this relate to the equivalence relation defined by cosets?

  5. 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?