Inverse of a Cycle: Proof of Inverse Cycles and Powers

  • Thread starter Thread starter fishturtle1
  • Start date Start date
  • Tags Tags
    Permutations
Click For Summary
The discussion focuses on finding the inverse of a cycle, represented as ##\alpha = (a_1a_2 ... a_s)##, and proving that ##\alpha^{-1} = \alpha^{s-1}##. The user attempts to show this relationship by manipulating powers of ##\alpha## and using the identity element ##e##. A hint is provided to consider what power of ##\alpha## results in the identity operation, leading to the conclusion that raising ##\alpha## to the ##s^{th}## power yields the identity. Ultimately, the proof confirms that ##\alpha^{-1} = \alpha^{s-1}## holds true based on the properties of permutations.
fishturtle1
Messages
393
Reaction score
82

Homework Statement


In the following problems, let ##\alpha## be a cycle of length s, say ##\alpha = (a_1a_2 ... a_s)##

3)Find the inverse of ##\alpha## and show that ##\alpha^{-1} = \alpha^{s-1}##

Homework Equations


I've observed in the previous problem that there are ##s## distinct powers of ##\alpha##, similar to how ##\mathbb{Z}_n## has n elements.

The Attempt at a Solution


The inverse of ##\alpha## is ##\alpha^{-1} = (a_sa_{s-1} ... a_2a_1)##

I need to show ##\alpha^1 = \alpha^{s-1}##
I've tried ##\alpha^{-1}\alpha^1 = \alpha^{-1}\alpha^{s-1}##
=> ##e = \alpha^{s-2}##

and ##\alpha^1\alpha^{-1} = \alpha^{s-1}\alpha^{-1}##
=> ##e = \alpha^{s-2}##

and ##\alpha^{-1}\alpha^s = \alpha^{s-1}\alpha^s##
=> ##\alpha{s-1} = \alpha^{2s-1}##, and since there are only ##s## distinct permutations, maybe somehow we can conclude ##\alpha^{2s-1} = \alpha^{2s-1-s} = \alpha^{s-1}##.. But if that's the case, I can use that same argument starting with ##\alpha^1 = \alpha^{s-1}##

I am asking for a small hint.
 
Physics news on Phys.org
fishturtle1 said:

Homework Statement



3)... show that ##\alpha^{-1} = \alpha^{s-1}##

I need to show ##\alpha^1 = \alpha^{s-1}##
Um... No. Reread the question.
 
hint: raising to what power leaves things intact? i.e. what ##\alpha## to the what power is the identity operation?
- - - -
note: it's perhaps a matter of taste (and what course you are in), but I would use permutation matrices to show this. Then again, I really like matrices and matrix groups.
 
haruspex said:
Um... No. Reread the question.
StoneTemplePython said:
hint: raising to what power leaves things intact? i.e. what ##\alpha## to the what power is the identity operation?
- - - -
note: it's perhaps a matter of taste (and what course you are in), but I would use permutation matrices to show this. Then again, I really like matrices and matrix groups.
OK i made a mistake reading the question, sorry about that, but think I can use post 3's hint..

We observed that raising a permutation, ##\alpha## of length s, to the ##s^{th}## power, we have ##\alpha^s = e##.
Therefore ##\alpha^{-1} = \alpha^{-1}e = \alpha^{-1}\alpha^s = \alpha^{s-1}## []
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 26 ·
Replies
26
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 69 ·
3
Replies
69
Views
8K