Linear Algebra/Determinants Exist/Solutions

From Wikibooks, open books for an open world
< Linear Algebra‎ | Determinants Exist
Jump to: navigation, search

Solutions[edit]

These summarize the notation used in this book for the 2- and 3- permutations.


\begin{array}{c|cc}
i          &1      &2    \\
\hline
\phi_1(i)  &1      &2     \\
\phi_2(i)  &2      &1     
\end{array}
\qquad
\begin{array}{c|ccc}
i          &1     &2   &3    \\
\hline
\phi_1(i)  &1     &2   &3    \\
\phi_2(i)  &1     &3   &2    \\
\phi_3(i)  &2     &1   &3    \\
\phi_4(i)  &2     &3   &1    \\
\phi_5(i)  &3     &1   &2    \\
\phi_6(i)  &3     &2   &1    
\end{array}

Problem 1

Give the permutation expansion of a general 2 \! \times \! 2 matrix and its transpose.

Answer

This is the permutation expansion of the determinant of a 2 \! \times \! 2 matrix


\begin{vmatrix}
a  &b  \\
c  &d
\end{vmatrix}
=ad\cdot \begin{vmatrix}
1  &0  \\
0  &1
\end{vmatrix}
+bc\cdot \begin{vmatrix}
0  &1 \\
1  &0
\end{vmatrix}

and the permutation expansion of the determinant of its transpose.


\begin{vmatrix}
a  &c  \\
b  &d
\end{vmatrix}
=ad\cdot\begin{vmatrix}
1  &0  \\
0  &1
\end{vmatrix}
+cb\cdot\begin{vmatrix}
0  &1 \\
1  &0
\end{vmatrix}

As with the 3 \! \times \! 3 expansions described in the subsection, the permutation matrices from corresponding terms are transposes (although this is disguised by the fact that each is self-transpose).

This exercise is recommended for all readers.
Problem 2

This problem appears also in the prior subsection.

  1. Find the inverse of each 2-permutation.
  2. Find the inverse of each 3-permutation.
Answer

Each of these is easy to check.

  1. permutation       \phi_1       \phi_2
    inverse       \phi_1       \phi_2
  2. permutation       \phi_1       \phi_2       \phi_3       \phi_4       \phi_5       \phi_6
    inverse       \phi_1       \phi_2       \phi_3       \phi_5       \phi_4       \phi_6
This exercise is recommended for all readers.
Problem 3
  1. Find the signum of each 2-permutation.
  2. Find the signum of each 3-permutation.
Answer
  1.  \sgn(\phi_1)=+1 ,  \sgn(\phi_2)=-1
  2.  \sgn(\phi_1)=+1 ,  \sgn(\phi_2)=-1 ,  \sgn(\phi_3)=-1 ,  \sgn(\phi_4)=+1 ,  \sgn(\phi_5)=+1 ,  \sgn(\phi_6)=-1
Problem 4

What is the signum of the n-permutation  \phi=\langle n,n-1,\dots,2,1 \rangle  ? (Strang 1980)

Answer

The pattern is this.


\begin{array}{c|ccccccc}
 i  & 1  & 2  & 3  & 4  & 5 
& 6  &\ldots \\
\hline
 \sgn(\phi_i)  & +1  & -1  & -1  & +1 
& +1  & -1  &\ldots
\end{array}

So to find the signum of \phi_{n!}, we subtract one n!-1 and look at the remainder on division by four. If the remainder is 1 or 2 then the signum is -1, otherwise it is +1. For n>4, the number n! is divisible by four, so n!-1 leaves a remainder of -1 on division by four (more properly said, a remainder or 3), and so the signum is +1. The n=1 case has a signum of +1, the n=2 case has a signum of -1 and the n=3 case has a signum of -1.

Problem 5

Prove these.

  1. Every permutation has an inverse.
  2.  \sgn(\phi^{-1})=\sgn(\phi)
  3. Every permutation is the inverse of another.
Answer
  1. Permutations can be viewed as one-one and onto maps  \phi:\{1,\ldots,n\}\to \{1,\ldots,n\} . Any one-one and onto map has an inverse.
  2. If it always takes an odd number of swaps to get from  P_\phi to the identity, then it always takes an odd number of swaps to get from the identity to  P_\phi (any swap is reversible).
  3. This is the first question again.
Problem 6

Prove that the matrix of the permutation inverse is the transpose of the matrix of the permutation P_{\phi^{-1}}={{P_{\phi}}^{\rm trans}}, for any permutation \phi.

Answer

If \phi(i)=j then \phi^{-1}(j)=i. The result now follows on the observation that P_{\phi} has a 1 in entry i,j if and only if \phi(i)=j, and P_{\phi^{-1}} has a 1 in entry j,i if and only if \phi^{-1}(j)=i,

This exercise is recommended for all readers.
Problem 7

Show that a permutation matrix with  m inversions can be row swapped to the identity in  m steps. Contrast this with Corollary 4.6.

Answer

This does not say that  m is the least number of swaps to produce an identity, nor does it say that  m is the most. It instead says that there is a way to swap to the identity in exactly  m steps.

Let  \iota_j be the first row that is inverted with respect to a prior row and let  \iota_k be the first row giving that inversion. We have this interval of rows.


\begin{pmatrix}
\vdots      \\
\iota_k     \\
\iota_{r_1} \\
\vdots      \\
\iota_{r_s} \\
\iota_j     \\
\vdots
\end{pmatrix}
\qquad j<k<r_1<\dots <r_s

Swap.


\begin{pmatrix}
\vdots      \\
\iota_j     \\
\iota_{r_1} \\
\vdots      \\
\iota_{r_s} \\
\iota_k     \\
\vdots
\end{pmatrix}

The second matrix has one fewer inversion because there is one fewer inversion in the interval ( s vs.  s+1 ) and inversions involving rows outside the interval are not affected.

Proceed in this way, at each step reducing the number of inversions by one with each row swap. When no inversions remain the result is the identity.

The contrast with Corollary 4.6 is that the statement of this exercise is a "there exists" statement: there exists a way to swap to the identity in exactly m steps. But the corollary is a "for all" statement: for all ways to swap to the identity, the parity (evenness or oddness) is the same.

This exercise is recommended for all readers.
Problem 8

For any permutation \phi let g(\phi) be the integer defined in this way.


g(\phi)=\prod_{i<j} [\phi(j)-\phi(i)]

(This is the product, over all indices  i and  j with  i<j , of terms of the given form.)

  1. Compute the value of g on all 2-permutations.
  2. Compute the value of g on all 3-permutations.
  3. Prove this.
    
\sgn(\phi)=\frac{g(\phi)}{|g(\phi)|}

Many authors give this formula as the definition of the signum function.

Answer
  1. First, g(\phi_1) is the product of the single factor 2-1 and so g(\phi_1)=1. Second, g(\phi_2) is the product of the single factor 1-2 and so g(\phi_2)=-1.
  2. 
\begin{array}{r|cccccc}
\text{permutation } \phi 
&\phi_{1} &\phi_{2} &\phi_{3} 
&\phi_{4} &\phi_{5} &\phi_{6} \\
\hline
g(\phi) &2 &-2 &-2 &2 &2 &-2 
\end{array}
  3. Note that  \phi(j)-\phi(i) is negative if and only if  \iota_{\phi(j)} and  \iota_{\phi(i)} are in an inversion of their usual order.

References[edit]

  • Strang, Gilbert (1980), Linear Algebra and its Applications (2nd ed.), Hartcourt Brace Javanovich