Solving Computations w/ Cycles: Permutations, Inverses, Orders

  • Thread starter Thread starter CoachBryan
  • Start date Start date
  • Tags Tags
    Cycles Hard Time
CoachBryan
Messages
14
Reaction score
0
So I've been sitting here for a while looking at my study guide and I am not sure how to find the product (or even the inverse) of this permutation in S9:

(2 5 1 3 6 4) (8 5 6)(1 9) = (1 3 8 5 9)(2 6 4) (Correct answer)

I know it starts off with 1 --> 3, then you get (1 3 and then after you continue with 3 --> 6 --> 8. After you start with 6 --> 4, right? But I keep coming across the wrong answer. I get (1 3 8 4 2) (8 1)

I'm pretty confused on this topic. If you could shed some light I'd greatly appreciate it. Thanks!
 
Physics news on Phys.org
Well, it was a long time ago I did those things, but, assuming that the permutations should be performed from left to right, I get:

1 --> 3 --> 3 --> 3
3 --> 6 --> 8 --> 8
8 --> 8 --> 5 --> 5
5 --> 1 --> 1 --> 9
9 --> 9 --> 9 --> 1

leading to the cycle (1 3 8 5 9)

2 --> 5 --> 6 --> 6
6 --> 4 --> 4 --> 4
4 --> 2 --> 2 --> 2

leading to the cycle (2 6 4)

7 --> 7 --> 7 --> 7

leading to the cycle (7)

So, the answer is (1 3 5 8 9)(2 6 4)(7)

but (7) needs perhaps not be included, or maybe the elements to be permuted don't even include 7. In any case, the book's answer is correct.
 
Erland said:
Well, it was a long time ago I did those things, but, assuming that the permutations should be performed from left to right, I get:

1 --> 3 --> 3 --> 3
3 --> 6 --> 8 --> 8
8 --> 8 --> 5 --> 5
5 --> 1 --> 1 --> 9
9 --> 9 --> 9 --> 1

leading to the cycle (1 3 8 5 9)

2 --> 5 --> 6 --> 6
6 --> 4 --> 4 --> 4
4 --> 2 --> 2 --> 2

leading to the cycle (2 6 4)

7 --> 7 --> 7 --> 7

leading to the cycle (7)

So, the answer is (1 3 5 8 9)(2 6 4)(7)

but (7) needs perhaps not be included, or maybe the elements to be permuted don't even include 7. In any case, the book's answer is correct.
Thanks a lot! Now it makes sense. Do you know how to find the inverse?
 
CoachBryan said:
Thanks a lot! Now it makes sense. Do you know how to find the inverse?
Just go backwards!
 
The convention that I am familiar with is that if a character is not changed by a permutation, it doesn't need to be mentioned.
So your (1 3 5 8 9)(2 6 4)(7) can be written as (1 3 5 8 9)(2 6 4).
 
Thanks guys! On the inverse problem as well. Appreciate it.
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Replies
28
Views
3K
Replies
2
Views
1K
Replies
2
Views
200
Replies
23
Views
2K
Replies
6
Views
2K
Replies
1
Views
2K
Replies
5
Views
1K
Replies
8
Views
591
Back
Top