Equality of Cycles
From ProofWiki
Theorem
Let $S_n$ denote the symmetric group on $n$ letters.
Let $\rho, \sigma \in S_n$ both be $k$-cycles of $S_n$.
Then $\rho = \sigma$ iff they are identical when written with the lowest element first.
Proof
You can help Proof Wiki by expanding it.
To discuss it in more detail, feel free to use the talk page.
When this page/section has been completed, {{Stub}} should be removed from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page (see the proofread template for usage).
