Find P.Q & Q.P from Permutations of X (1,2,3,4,5)

FatTail
Messages
2
Reaction score
0
hi
if P and Q are 2 permutations of X, their product, P.Q, is the permutation of X (X=1,2,3,4,5), obtained by following the mapping Q with the mapping P. if Q=2 3 4 1 5, and P is 1 2 5 3 4, then how do i find P.Q and Q.P ?

i have tried a few mappings but can never get the same answer as in the book :)

answer for P.Q is 2 5 3 1 4
answer for Q.P is 2 3 5 4 1

please can anyone explain the steps.
thanks
 
Physics news on Phys.org
"Q=2 3 4 1 5" means that this mapping happens:

<br /> \begin{tabular}{ | c | c | c | c | c | }<br /> \hline<br /> 1 &amp; 2 &amp; 3 &amp; 4 &amp; 5 \\<br /> \Downarrow &amp; \Downarrow &amp; \Downarrow &amp; \Downarrow &amp; \Downarrow \\<br /> 2 &amp; 3 &amp; 4 &amp; 1 &amp; 5 \\ \hline<br /> \end{tabular}<br />

In other words:

1 gets mapped to 2,
2 gets mapped to 3,

And so on.

Similarly, "P=1 2 5 3 4" means this happens:

<br /> \begin{tabular}{ | c | c | c | c | c | }<br /> \hline<br /> 1 &amp; 2 &amp; 3 &amp; 4 &amp; 5 \\<br /> \Downarrow &amp; \Downarrow &amp; \Downarrow &amp; \Downarrow &amp; \Downarrow \\<br /> 1 &amp; 2 &amp; 5 &amp; 3 &amp; 4 \\ \hline<br /> \end{tabular}<br />

That is,

1 gets mapped to 1,
2 gets mapped to 2,
3 gets mapped to 5,

and so on.

So to find the product P.Q, you want to build a table like the ones above by "following the arrows". So first you need to find out what 1 gets mapped to under the product P.Q. Whenever you have a product of permutations, you work from right to the left. So you start with Q. You know that Q maps 1 to 2. And then P maps 2 to 2. So the first entry of the table is 2.

<br /> \begin{tabular}{ | c | c | c | c | c | }<br /> \hline<br /> 1 &amp; 2 &amp; 3 &amp; 4 &amp; 5 \\<br /> \Downarrow &amp; \Downarrow &amp; \Downarrow &amp; \Downarrow &amp; \Downarrow \\<br /> 2 &amp; ? &amp; ? &amp; ? &amp; ? \\ \hline<br /> \end{tabular}<br />

Next, you want to find out what 2 gets mapped to. Q maps 2 to 3, and P maps 3 to 5. So the second entry is a 5.

<br /> \begin{tabular}{ | c | c | c | c | c | }<br /> \hline<br /> 1 &amp; 2 &amp; 3 &amp; 4 &amp; 5 \\<br /> \Downarrow &amp; \Downarrow &amp; \Downarrow &amp; \Downarrow &amp; \Downarrow \\<br /> 2 &amp; 5 &amp; ? &amp; ? &amp; ? \\ \hline<br /> \end{tabular}<br />

And so on.

To find Q.P, perform the same process, but start with P.
 
Q= 2 3 4 1 5, if I understand your notation, would also be written
\left(\begin{array}{ccccc}1 &amp; 2 &amp; 3 &amp; 4 &amp; 5 \\ 2 &amp; 3 &amp; 4 &amp; 1 &amp; 5\end{array}\right)
and means that 1 is changed into 2, 2 is changed into 3, 3 is changed into 4, 4 is changed into 1, and 5 is changed into itself (remains the same). P= 1 2 5 3 4 is
\left(\begin{array}{ccccc}1 &amp; 2 &amp; 3 &amp; 4 &amp; 5 \\ 1 &amp; 2 &amp; 5 &amp; 3 &amp; 4\end{array}\right)
and means that 1 and 2 remain the same, 3 is changed into 5, 4 is changed into 3, and 5 is changed into 4. The standard convention is that Q.P means that P is applied first, then Q (but check with your teacher or text- that varies). So P leaves 1 along and then Q changes 1 to 2: together, 1 changes to 2. P leaves 2 alone and then Q changes 2 to 3: together, 2 changes to 3. P changes 3 to 5 and then Q leaves 5 alone: together, 3 changes to 5. P changes 4 to 3 and then Q changes 3 to 4: together 4 remains the same. P changes 5 to 4 and then Q changes 4 to 1: together 5 changes to 1. That is the permutation
\left(\begin{array}{ccccc}1 &amp; 2 &amp; 3 &amp; 4 &amp; 5 \\ 2 &amp; 3 &amp; 5 &amp; 4 &amp; 1\end{array}\right)
In your notation I think that would be 2 3 5 4 1.

Similarly, P.Q means that we apply Q first. Q changes 1 to 2 and then P leaves 2 alone: together 1 changes to 2. Q changes 2 to 3 and then P changes 3 to 5: together 2 changes to 5. Q changes 3 to 4 and then P changes 4 to 3: together 3 stays the same. Q changes 4 to 1 and then P leaves one alone: together 4 changes to 1. Q leaves 5 alone and then P changes 5 to 4: together 5 changes to 4. That is
\left(\begin{array}{ccccc}1 &amp; 2 &amp; 3 &amp; 4 &amp; 5 \\2 &amp; 5 &amp; 3 &amp; 1 &amp; 4\end{array}\right)
or, in your notation 2 5 3 1 4.

Again check your text's convention on order. If what your text has reverses those two answer, it is using the other convention.
 
To add, a permutation is a function, and the term "product" of permutations is actually a composition of functions, i.e. if P and Q are permutations of X, then the product PQ is defined as P(Q(x)), where x is an element of X.
 
thanks guys. i get it now :)
 
##\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...
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...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top