is true. 12. A general permutation matrix P (as opposed to an elementary permutation matrix) is a square matrix with exactly a single "1" in cach row and cach column; all other entries are zero. Show that p-1 = pt for any n xn permutation matrix, as defined above, by showing that the ones and zeros are in exactly the right place so that PPT = I. (You may skip proving the second equation necessary to showing the existence of an inverse as it is so similar to showing the first one.) So, you will have to work out the individual entries... It will be helpful to specify the index of the "1" in a typical row and column. is true. 12. A general permutation matrix P (as opposed to an elementary permutation matrix) is a square matrix with exactly a single "1" in cach row and cach column; all other entries are zero. Show that p-1 = pt for any n xn permutation matrix, as defined above, by showing that the ones and zeros are in exactly the right place so that PPT = I. (You may skip proving the second equation necessary to showing the existence of an inverse as it is so similar to showing the first one.) So, you will have to work out the individual entries... It will be helpful to specify the index of the "1" in a typical row and column