Proving There are No Permutations of Order 18 in S_9: Permutation Question

  • Thread starter Thread starter TTob
  • Start date Start date
  • Tags Tags
    Permutation
Click For Summary

Homework Help Overview

The problem involves proving that there are no permutations of order 18 in the symmetric group S_9. The discussion centers around the properties of cycle decompositions and the relationship between the least common multiple of cycle lengths and the total number of elements in the permutation.

Discussion Character

  • Conceptual clarification, Assumption checking

Approaches and Questions Raised

  • Participants discuss the implications of cycle decomposition, particularly the relationship between the orders of cycles and the total number of elements. Questions are raised about the validity of the equation r_1 + ... + r_k = 9 and its relevance to the problem.

Discussion Status

Some participants are exploring the conditions under which the least common multiple of cycle lengths can equal 18, while others are questioning the assumptions made regarding the cycle orders and their sums. There is an ongoing examination of the implications of these assumptions without reaching a consensus.

Contextual Notes

Participants are working under the constraints of the symmetric group S_9 and are considering the implications of cycle lengths and their orders in relation to the total number of elements involved in the permutations.

TTob
Messages
21
Reaction score
0

Homework Statement


prove that there are not permutations of order 18 in S_9.


Homework Equations





The Attempt at a Solution


let t=c_1,...,c_k is cycle decomposition of such permutation. let r_1,...,r_k the orders of c_1,...,c_k.

then lcm(r_1,...,r_k) = 18 and r_1+...+r_k = 9.

What To Do Next ?
 
Physics news on Phys.org
Why is r_1+...+r_k=9? There is definitely something to be said about the r_i's, but this is not it!
 
morphism said:
Why is r_1+...+r_k=9? There is definitely something to be said about the r_i's, but this is not it!
because this is cycle decomposition and hence c_1 is r_1-cycle,..., c_k is r_k cycle.
 
well, here are my thoughts, but wait for morphism to confirm it.

Like you said, let

[tex]\alpha=\beta_1\beta_2...\beta_k-----(@)[/tex] be such a permutation written as a product of k disjoint cycles. Let [tex]o(\beta_i)=r_i,i\in\{1,2,...,k\}[/tex] be the orders of those cycles respectively.

Then we know that the order of that permutation is the least common multiple of the lengths(orders) of the cycles, that is

[tex]lcm[r_1,r_2,...,r_k]=18[/tex] (in here we are using proof by contradiction, that is we are assuming that indeed there is such a permutation in S_9 whose order is 18)

But this is not possible, why?

In order for [tex]lcm[r_1,r_2,...,r_k]=18[/tex] to be true there must be cycles in (@) with orders 9 and 6. But, such a thing is not possible, because say:

[tex]\beta_1=(a_1a_2a_3a_4a_5a_6), and \beta_2=(b_1b_2...b_9)[/tex] if

[tex]\beta=\beta_1\beta_2[/tex] there must be some [tex]a_i=b_j[/tex] for i=1,2...6 and j=1,2,...,9.

So, the contradiction derived, tells us that the assumption that [tex]lcm[r_1,r_2,...,r_k]=18[/tex] is not true.
 

Similar threads

Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
8
Views
1K
Replies
3
Views
4K
  • · Replies 60 ·
3
Replies
60
Views
9K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
3
Views
1K