Intereting Posts

Does every normal number have irrationality measure $2$?
How to show that the nth power of a $nxn$ nilpotent matrix equals to zero $A^n=0$
Showing a collection generates a sigma algebra
$H_{n-1}(M;\mathbb{Z})$ is a free abelian group
Which calculus text should I use for self-study?
Surface integral
Overlapping Polynomials
Finding a direction with smaller values of a Lipschitz function
How to interpret Fourier Transform result?
Sine and cosine series
The degree of a polynomial which also has negative exponents.
Asymptotic expression for sum of first n prime numbers?
Are infinitesimals equal to zero?
In Godel's first incompleteness theorem, what is the appropriate notion of interpretation function?
The value of the rational “Möbius”-like transformations at infinity

Given a cycle in of a permutation , for example :

$σ=(123) $; $σ_{2}=(45)$

What is the inverse cycle ? meaning $σ^{-1}$

- An Example for a Graph with the Quaternion Group as Automorphism Group
- How many ways are there for 10 women and six men to stand in a line
- prove that $\binom{n}{0}^2+\binom{n}{1}^2+\binom{n}{2}^2+\cdots+\binom{n}{n}^2=\binom{2n}{n}$
- Unique Groups for Game Tournament
- Number of ways of choosing $m$ objects with replacement from $n$ objects
- How many ways are there to arrange the letters in the word “mississippi” such that all “p” precede all “i”?

Regards

- arrangement of $n$ oranges and $n$ apples around a circle
- How many arrangements of $\{a,2b,3c,4d, 5e\}$ have no identical consecutive letters?
- Counting set partitions of $\{1,2,…,n\}$ into exactly $k$ non-empty subsets with max size $m$
- Odd/Even Permutations
- Are the primitive groups linearly primitive?
- Number of permutations which fixes a certain number of point
- Solving permutation problem sequentially.
- Combinatorics problem: $n$ people line up to $m$ clubs
- Abstract algebra: for a polynomial $p$, prove $\sigma(\tau(p))=(\sigma\tau)(p)$ for all $\sigma, \tau \in S_n$
- The kernel of an action on the orbits of normal subgroup if group acts such that $\mbox{fix}(g) \in \{0,p\}$ for $g \ne 1$

To elaborate on my comment:

To find the inverse of a permutation just write it backwards. If $\tau = (1243)(67)$ then $\tau^{-1}=(76)(3421)$ which can then be rewritten as $\tau^{-1}=(1342)(67)$.

For for the above question: $(123)^{-1}=(321)=(132)$.

How does one prove this?

First consider a single cycle: $\sigma=(a_1a_2\dots a_k)$. If $b \not\in \{a_1,\dots,a_k\}$, then $\sigma(b)=b$ so $\sigma^{-1}(b)=b$. Thus $b$ shouldn’t appear in the

inverse. Next $\sigma(a_i)=a_{i+1}$ so $\sigma^{-1}(a_{i+1})=a_i$.

Thus if $\sigma$: $a_1 \mapsto a_2 \mapsto a_3 \mapsto \cdots \mapsto a_k \mapsto a_1$,

then $\sigma^{-1}$: $a_k \mapsto a_{k-1} \mapsto a_{k-2} \mapsto \cdots \mapsto a_1 \mapsto a_k$.

This is precisely the cycle $(a_k,a_{k-1}\dots,a_2, a_1)$ which is nothing more than $\sigma$ written backwards.

Now what about a list of cycles? Say $\sigma=\sigma_1\cdots \sigma_\ell$. Recall that $\sigma^{-1}=(\sigma_1\cdots \sigma_\ell)^{-1}=\sigma_\ell^{-1}\cdots \sigma_1^{-1}$. So we reverse the list of cycles and then write each one backwards — thus the inverse is just the whole thing written backwards.

One thing to note: This still works even if $\sigma$ is not written in terms of disjoint cycles.

So, you have that $\sigma_1$ is the cycle such that,

$$\begin{align} 1 \mapsto 2 \\ 2 \mapsto 3 \\ 3 \mapsto 1\end{align}$$

It’s inverse, $\sigma_1^{-1}$ is a cycle such that composition, $ \sigma_1 \circ \sigma_1^{-1}=\sigma_1^{-1} \circ \sigma_1$ is identity. So, the inverse cycle should look like :

$$\begin{align} 2 \mapsto 1 \\ 3 \mapsto 2 \\ 1 \mapsto 3\end{align}$$

What is this in cycle notation?

$\sigma_1^{-1} \equiv(213)$

I’ll let you try the other one.

A particularly easy way of doing this, once you understand what the inverses do is: **just to write the cycle backwards!**

Note that for $(123)$, this is just $(321)$. Now, recall, that set of all permutations form a group. In a group, inverses are unique. So,

can you tell me why $(321)$ and $(213)$ are the same?

Another way to look at Bill Cook’s fifth paragraph in his answer:

First consider a single cycle: $\sigma=(a_1a_2\dots a_k)$. If $b \not\in \{a_1,\dots,a_k\}$, then $\sigma(b)=b$ so $\sigma^{-1}(b)=b$. Thus $b$ shouldn’t appear in the

inverse. Next $\sigma(a_i)=a_{i+1}$ so $\sigma^{-1}(a_{i+1})=a_i$. Thus if $\sigma$: $a_1 \mapsto a_2 \mapsto a_3 \mapsto \cdots \mapsto a_{k – 1} \mapsto a_k \mapsto a_1$, then $\sigma^{-1}$:

$a_1 \color{aqua}{\leftarrow} a_2 \color{aqua}{\leftarrow} a_3 \color{aqua}{\leftarrow}\cdots \color{aqua}{\leftarrow} a_{k – 1} \color{aqua}{\leftarrow} a_k \color{aqua}{\leftarrow} a_1 \iff$

$a_k \color{aqua}{\mapsto} a_{k-1} \color{aqua}{\mapsto} a_{k-2} \color{aqua}{\mapsto} \cdots \color{aqua}{\leftarrow} a_2 \color{aqua}{\mapsto} a_1 \color{aqua}{\mapsto} a_k$.

This is precisely the cycle $(a_k,a_{k-1}\dots,a_2, a_1)$ which is nothing more than $\sigma$ written backwards.

- Can we specify all row equivalent matrices of a given matrix?
- Help on total ordering and partial ordering
- Number of nonnegative integral solutions of $x_1 + x_2 + \cdots + x_k = n$
- Additive Class is closed under arbitrary union?
- Is there any uncountably infinite set that does not generate the reals?
- Are hyperoperators primitive recursive?
- Show that if $p \equiv 3$ mod $4$ is a prime in $\mathbb{Z}$, then $p$ is a prime in $\mathbb{Z}$
- Fourier operator $\mathcal{F}:L^p(\mathbb{T})\rightarrow \ell^{p'}(\mathbb Z)$ ($1< p < 2$, $\frac{1}{p}+\frac{1}{p'}=1$) is not onto
- Proof of strictly increasing nature of $y(x)=x^{x^{x^{\ldots}}}$ on $[1,e^{\frac{1}{e}})$?
- Is the arbitrary product of metric spaces a metric space?
- Finding Coordinate along Ellipse Perimeter
- Generalization of the Bernoulli polynomials ( in relation to the Index )
- This inequality $a+b^2+c^3+d^4\ge \frac{1}{a}+\frac{1}{b^2}+\frac{1}{c^3}+\frac{1}{d^4}$
- Which of the following sets are compact in $\mathbb{M}_n(\mathbb{R})$
- Question about Fredholm operator