Math Problem Statement

Let G be group, let H be a subgroup of G, and let a and b be elements of G. Prove that |aH| = |Hb|.

Solution

Let GG be a group, HH be a subgroup of GG, and let a,bGa, b \in G. We want to prove that the left coset aHaH and the right coset HbHb of HH in GG have the same cardinality, i.e., aH=Hb|aH| = |Hb|.

Step-by-Step Proof:

1. Define the cosets:

  • The left coset of HH with respect to aa is given by: aH={ahhH}.aH = \{ ah \mid h \in H \}.
  • The right coset of HH with respect to bb is given by: Hb={hbhH}.Hb = \{ hb \mid h \in H \}.

We need to show that these two sets, aHaH and HbHb, have the same size (i.e., the same number of distinct elements).

2. Construct a bijection between aHaH and HbHb:

Consider the map f:aHHbf : aH \to Hb defined by: f(ah)=hbfor all hH.f(ah) = hb \quad \text{for all } h \in H. This map takes each element of the left coset aHaH, which is of the form ahah, and maps it to an element of the right coset HbHb, namely hbhb.

3. Show that ff is well-defined:

For f(ah)=hbf(ah) = hb to be well-defined, we must check that if two elements in aHaH are equal, their images under ff must also be equal.

Suppose ah1=ah2ah_1 = ah_2 for some h1,h2Hh_1, h_2 \in H. Then, by left-multiplying both sides by a1a^{-1}, we get: h1=h2.h_1 = h_2. Therefore, f(ah1)=f(ah2)f(ah_1) = f(ah_2), meaning the map is well-defined.

4. Show that ff is injective (one-to-one):

Suppose f(ah1)=f(ah2)f(ah_1) = f(ah_2), meaning: hb1=hb2for some h1,h2H.hb_1 = hb_2 \quad \text{for some } h_1, h_2 \in H. This implies that: h1=h2.h_1 = h_2. Therefore, ff is injective.

5. Show that ff is surjective (onto):

For any element x=hbHbx = hb \in Hb, there exists a corresponding element x=ahaHx = ah \in aH under the map ff. Therefore, the map is surjective.

Since ff is both injective and surjective, it is a bijection between the sets aHaH and HbHb. Therefore, the two sets must have the same cardinality.

Conclusion:

Since ff is a bijection, we conclude that: aH=Hb.|aH| = |Hb|.


Additional Exploration:

Would you like further details on any specific part of the proof? Here are some related questions that might help deepen your understanding of this topic:

  1. How do cosets partition a group into disjoint subsets?
  2. Can we apply a similar argument to prove that left cosets and right cosets of a normal subgroup have the same size?
  3. How does the index of a subgroup relate to the number of cosets?
  4. How can we prove that the left and right cosets of any subgroup HH in GG have the same cardinality using Lagrange’s Theorem?
  5. What happens if HH is a normal subgroup in terms of coset equivalence?

Tip: A good strategy for proving set equalities is to construct a well-defined bijection, which is often the simplest way to show two sets have the same cardinality.

Ask a new question for Free

By Image

Drop file here or Click Here to upload

Math Problem Analysis

Mathematical Concepts

Group Theory
Cosets
Bijections

Formulas

Left coset: aH = {ah | h ∈ H}
Right coset: Hb = {hb | h ∈ H}

Theorems

Lagrange's Theorem
Bijection between sets

Suitable Grade Level

Undergraduate - Abstract Algebra