MHB Proof of Conjugate Cycles Property of Permutations

  • Thread starter Thread starter Kiwi1
  • Start date Start date
  • Tags Tags
    Conjugate Cycles
Kiwi1
Messages
106
Reaction score
0
Prove:

Let \alpha = (a_1,...,a_s) be a cycle and let \pi be a permutation in Sn. Then \pi \alpha \pi ^{-1} is the cycle (\pi(a_1), ... \pi(a_s))

My attempt.
(\pi \alpha \pi ^{-1})^s = (\pi \alpha^s \pi ^{-1})=e so if this thing is a cycle and its length divides s.

Assume \pi (a_1) is a member of the cycle. Then:

\pi \alpha \pi ^{-1}(\pi (a_1))=\pi (a_2)

and

\pi \alpha \pi ^{-1}(\pi (a_i))=\pi (a_{i+1}) for 1 \leq i < s

and finally

\pi (a_{s+1})=\pi \alpha \pi ^{-1}(\pi (a_s))=\pi(a_1) (validating the assumption)

I think I have all of the components of a proof here. But how can I make it more rigorous?
 
Physics news on Phys.org
Hi,

You got it, but if you want to see another way of writing it, I would have do the following.

Let $s_{1},\ldots,s_{n}$ be all the elements on $\mathcal{S}_{n}$.

If $s_{i}\neq a_{j}$ for any $j$, then $\pi\alpha\pi^{-1}(s_{i})=s_{i}$.

If $s_{i}=a_{j}$ for some $j$, then $\pi\alpha\pi^{-1}(s_{i})=a_{j+1}$ (Here we denote $a_{1}=a_{s+1}$).

And that's all.
 
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...
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
Back
Top