What Are the Left Cosets of H in S_3?

  • Context: Undergrad 
  • Thread starter Thread starter BustedBreaks
  • Start date Start date
  • Tags Tags
    Cosets
Click For Summary
SUMMARY

The left cosets of the subgroup H = {(1), (13)} in the symmetric group G = S_3 are derived through permutation multiplication. The computation (12)H results in the set {(12), (132)}, confirming that (12)(13) equals (132). The discussion highlights the importance of understanding right-to-left computation in permutations and emphasizes the need to review permutation operations for clarity. Additionally, it addresses the notation preference for writing permutations, advocating for starting with the smallest number.

PREREQUISITES
  • Understanding of symmetric groups, specifically S_3.
  • Familiarity with permutation notation and operations.
  • Knowledge of subgroup properties and coset definitions.
  • Ability to perform right-to-left multiplication of permutations.
NEXT STEPS
  • Study the properties of symmetric groups, focusing on S_3 and its subgroups.
  • Learn about permutation multiplication techniques and conventions.
  • Explore the concept of cosets in group theory, including left and right cosets.
  • Review examples of computing permutations and their products in detail.
USEFUL FOR

Students of abstract algebra, mathematicians interested in group theory, and anyone seeking to deepen their understanding of permutations and cosets in symmetric groups.

BustedBreaks
Messages
62
Reaction score
0
I am having trouble understanding this example:

Let G=S_3 and H={(1),(13)}. Then the left cosets of H in G are

(1)H=H
(12)H={(12), (12)(13)}={(12),(132)}=(132)HI cannot figure out how to produce this relation:

(12)H={(12), (12)(13)}={(12),(132)}=(132)H

I understand (12)H={(12), (12)(13)} but not how (12)(13) = (132) or the equivalence after that...
 
Physics news on Phys.org
Note that since (12) and (13) are in S3, they are actually the elements (12)(3) and (13)(2), where 3 and 2 are fixed respectively.

(12)(13), we do computation from right to left, so 1 goes to 3 from (13), then 3 goes to itself in (12). So we have (13...). Now 3 goes to 1 in (13) and 1 goes to 2 in (12), so in (13...) we have 3 goes to 2. Hence (132). This is a quick dirty answer to your question, but I think you should reread or review computations done using permutations.
 
daveyinaz said:
Note that since (12) and (13) are in S3, they are actually the elements (12)(3) and (13)(2), where 3 and 2 are fixed respectively.

(12)(13), we do computation from right to left, so 1 goes to 3 from (13), then 3 goes to itself in (12). So we have (13...). Now 3 goes to 1 in (13) and 1 goes to 2 in (12), so in (13...) we have 3 goes to 2. Hence (132). This is a quick dirty answer to your question, but I think you should reread or review computations done using permutations.

Okay so I get your method here and I am trying to apply it to this one (23)(13) but I am not getting the answer the book has which is (123)

I set it up like this

(23) (13)
123 123
132 321

then

so 1 goes to 3 then 3 goes to 2, 2 goes to 2 then 2 goes to 3, 3 goes to 1 and 1 goes to 1 so I get 231... I know you said your way was quick and dirty, so maybe I am missing something completely?

EDIT:

Okay so I'm pretty sure that 231 and 123 are the same thing but is there a preference for writing it out?
 
The convention is to start with the smallest number.
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 13 ·
Replies
13
Views
1K
  • · Replies 1 ·
Replies
1
Views
679
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K