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

Homework Help Overview

The discussion revolves around the properties of a cycle in group theory, specifically focusing on the inverse of a cycle and its relationship to powers of the cycle. The original poster presents a problem involving a cycle of length s, denoted as ##\alpha = (a_1a_2 ... a_s)##, and seeks to demonstrate that ##\alpha^{-1} = \alpha^{s-1}##.

Discussion Character

  • Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • Participants explore the definition of the inverse of a cycle and its representation. The original poster attempts to manipulate equations involving powers of ##\alpha## to show the relationship between ##\alpha^{-1}## and ##\alpha^{s-1}##. Some participants question the assumptions made in the original poster's reasoning and suggest revisiting the problem statement for clarity.

Discussion Status

There is an ongoing exploration of the properties of cycle inverses and their powers. Hints have been provided regarding the identity operation in relation to powers of ##\alpha##, and some participants have acknowledged misunderstandings in their initial readings of the problem. The discussion appears to be productive, with participants engaging in clarifying the concepts involved.

Contextual Notes

Participants note the potential use of permutation matrices as a method of proof, indicating a preference for different approaches based on individual backgrounds in mathematics. There is also mention of the distinct nature of powers of the cycle, which may influence the reasoning being applied.

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 69 ·
3
Replies
69
Views
9K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K