2.2 second exam

  2.2.1 practice exam questions
  2.2.2 my solution to second midterm practice exam

2.2.1 practice exam questions

PDF

2.2.2 my solution to second midterm practice exam

   2.2.2.1 Problem 1
   2.2.2.2 Problem 2
   2.2.2.3 Problem 3
   2.2.2.4 Problem 4
   2.2.2.5 Problem 5
   2.2.2.6 Problem 6
   2.2.2.7 Problem 7
   2.2.2.8 Problem 8
   2.2.2.9 Problem 9
   2.2.2.10 Problem 10
   2.2.2.11 Problem 11
PDF (letter size)
PDF (legal size)

2.2.2.1 Problem 1

Question: Given Matrix \[ A=\begin{pmatrix} 1 & \frac{1}{2} & 3\\ \frac{-1}{3} & \frac{-3}{2} & -1\\ \frac{-1}{2} & \frac{-1}{4} & \frac{-3}{2}\end{pmatrix} \] for what vectors \(\bar{b}\) does \(A\bar{x}=\bar{b}\) have a solution?

answer  Let \(\bar{b}=\left ( b_{1},b_{2},b_{3}\right ) .\) We start by setting up the augmented matrix. The augmented matrix is\[\begin{pmatrix} 1 & \frac{1}{2} & 3 & b_{1}\\ \frac{-1}{3} & \frac{-3}{2} & -1 & b_{2}\\ \frac{-1}{2} & \frac{-1}{4} & \frac{-3}{2} & b_{3}\end{pmatrix} \] Applying row operation: \(R_{2}=R_{2}+\frac{1}{3}R_{1}\) gives\[\begin{pmatrix} 1 & \frac{1}{2} & 3 & b_{1}\\ 0 & -\frac{4}{3} & 0 & b_{2}+\frac{b_{1}}{3}\\ \frac{-1}{2} & \frac{-1}{4} & \frac{-3}{2} & b_{3}\end{pmatrix} \] \(R_{3}=R_{3}+\frac{1}{2}R_{1}\) gives\[\begin{pmatrix} 1 & \frac{1}{2} & 3 & b_{1}\\ 0 & -\frac{4}{3} & 0 & b_{2}+\frac{b_{1}}{3}\\ 0 & 0 & 0 & b_{3}+\frac{1}{2}b_{1}\end{pmatrix} \] The above is Echelon form. Therefore, from last row, we see that \(0x_{3}=b_{3}+\frac{1}{2}b_{1}\). For solution to exist, we need \(b_{3}+\frac{1}{2}b_{1}=0\) or \(b_{3}=-\frac{1}{2}b_{1}\).  Hence any vector \(b\) where the third entry is \(-\frac{1}{2}\) the first entry, will result in \(A\bar{x}=\bar{b}\) having (infinite) solutions. So \(\bar{b}\) needs to have this form\begin{align*} \bar{b} & =\begin{pmatrix} b_{1}\\ b_{2}\\ \frac{-1}{2}b_{1}\end{pmatrix} \\ & =b_{1}\begin{pmatrix} 1\\ 0\\ \frac{-1}{2}\end{pmatrix} +b_{2}\begin{pmatrix} 0\\ 1\\ 0 \end{pmatrix} \end{align*}

2.2.2.2 Problem 2

part a  For what vector \(\bar{b}\) does \(A\bar{x}=\bar{b}\) have solution\[ A=\begin{pmatrix} 2 & -1 & \frac{1}{2}\\ 3 & 1 & 2\\ 0 & 6 & 3 \end{pmatrix} \] answer

Let \(\bar{b}=\left ( b_{1},b_{2},b_{3}\right ) \) then the augmented matrix is\[\begin{pmatrix} 2 & -1 & \frac{1}{2} & b_{1}\\ 3 & 1 & 2 & b_{2}\\ 0 & 6 & 3 & b_{3}\end{pmatrix} \] Applying row operations: \(R_{2}=R_{2}-\frac{3}{2}R_{1}\) gives\[\begin{pmatrix} 2 & -1 & \frac{1}{2} & b_{1}\\ 0 & \frac{5}{2} & \frac{5}{4} & b_{2}-\frac{3}{2}b_{1}\\ 0 & 6 & 3 & b_{3}\end{pmatrix} \] \(R_{3}=R_{3}-\frac{6}{\left ( \frac{5}{2}\right ) }R_{2}\) gives \[\begin{pmatrix} 2 & -1 & \frac{1}{2} & b_{1}\\ 0 & \frac{5}{2} & \frac{5}{4} & b_{2}-\frac{3}{2}b_{1}\\ 0 & 0 & 0 & \frac{18}{5}b_{1}-\frac{12}{5}b_{2}+b_{3}\end{pmatrix} \] The above is Echelon form. Last row says that \(0x_{3}=\frac{18}{5}b_{1}-\frac{12}{5}b_{2}+b_{3}\). Therefore for solution to exist, we need \[ \frac{18}{5}b_{1}-\frac{12}{5}b_{2}+b_{3}=0 \] This will generate infinite number of solutions. Any \(\bar{b}\) vector of 3 elements where the above constraint is satisfied, will make \(A\bar{x}=\bar{b}\) have (infinite) number of solutions.  Solving for \(b_{1}\) in terms of \(b_{2},b_{3}\)\[ b_{1}=\frac{12}{18}b_{2}-\frac{5}{18}b_{3}\] Hence \(\bar{b}\) can be written as\[ \bar{b}=\begin{pmatrix} \frac{12}{18}b_{2}-\frac{5}{18}b_{3}\\ b_{2}\\ b_{3}\end{pmatrix} \] One such example of \(\bar{b}\) can be\[ \bar{b}=\begin{pmatrix} \frac{7}{18}\\ 1\\ 1 \end{pmatrix} \] part b Find all possible solutions (or no solution) for \[ \bar{b}=\begin{pmatrix} 0\\ \frac{12}{5}\\ 1 \end{pmatrix} ,\begin{pmatrix} 0\\ 1\\ \frac{12}{5}\end{pmatrix} \] We need to first check if these vectors meet the constraint found in part (a), which is \(b_{1}=\frac{12}{18}b_{2}-\frac{5}{18}b_{3}\,.\) For the first vector given, we get\begin{align*} & 0\overset{?}{=}\frac{12}{18}\left ( \frac{12}{5}\right ) -\frac{5}{18}\left ( 1\right ) \\ & 0\overset{?}{=}\frac{119}{90} \end{align*}

Which is not valid. Therefore, \(\bar{b}=\begin{pmatrix} 0\\ \frac{12}{5}\\ 1 \end{pmatrix} \) will produce no solution for when used in \(A\bar{x}=\bar{b}\). Now we check the second vector to see if it meets the constraint or not.\begin{align*} & 0\overset{?}{=}\frac{12}{18}\left ( 1\right ) -\frac{5}{18}\left ( \frac{12}{5}\right ) \\ & 0\overset{?}{=}0 \end{align*}

Yes. It satisfies the constraint. Hence this vector will produce solution for \(A\bar{x}=\bar{b}.\) To find the solution, we plugin this \(\bar{b}\) vector and solve for \(x\)

\[\begin{pmatrix} 1 & \frac{1}{2} & 3\\ \frac{-1}{3} & \frac{-3}{2} & -1\\ \frac{-1}{2} & \frac{-1}{4} & \frac{-3}{2}\end{pmatrix}\begin{pmatrix} x_{1}\\ x_{2}\\ x_{3}\end{pmatrix} =\begin{pmatrix} 0\\ 1\\ \frac{12}{5}\end{pmatrix} \]

Following the row operation we did above, the output is

\begin{align*} \begin{pmatrix} 2 & -1 & \frac{1}{2} & b_{1}\\ 0 & \frac{5}{2} & \frac{5}{4} & b_{2}-\frac{3}{2}b_{1}\\ 0 & 0 & 0 & \frac{18}{5}b_{1}-\frac{12}{5}b_{2}+b_{3}\end{pmatrix} & =\begin{pmatrix} 2 & -1 & \frac{1}{2} & 0\\ 0 & \frac{5}{2} & \frac{5}{4} & 1\\ 0 & 0 & 0 & -\frac{12}{5}\left ( 1\right ) +\frac{12}{5}\end{pmatrix} \\ & =\begin{pmatrix} 2 & -1 & \frac{1}{2} & 0\\ 0 & \frac{5}{2} & \frac{5}{4} & 1\\ 0 & 0 & 0 & 0 \end{pmatrix} \end{align*}

Hence from last row \(x_{3}=t\), and from second row \(\frac{5}{2}x_{2}+\frac{5}{4}t=1\) or \(x_{2}=\frac{2}{5}-\frac{1}{2}t\) and from first row \(2x_{1}-x_{2}+\frac{1}{2}x_{3}=0\) or \(2x_{1}=\left ( \frac{2}{5}-\frac{1}{2}t\right ) -\frac{1}{2}t\) hence solution is

\begin{align*} \begin{pmatrix} x_{1}\\ x_{2}\\ x_{3}\end{pmatrix} & =\begin{pmatrix} \frac{1}{5}-\frac{t}{2}\\ \frac{2}{5}-\frac{1}{2}t\\ t \end{pmatrix} \\ & =\begin{pmatrix} \frac{1}{5}\\ \frac{2}{5}\\ 0 \end{pmatrix} +t\begin{pmatrix} -\frac{1}{2}\\ -\frac{1}{2}t\\ 1 \end{pmatrix} \end{align*}

2.2.2.3 Problem 3

Consider \(A\bar{x}=\bar{b}\) for\[ A=\begin{pmatrix} \frac{2}{3} & a_{12} & -2\\ -\frac{1}{5} & \frac{-1}{3} & \frac{3}{5}\\ \frac{1}{2} & \frac{5}{6} & \frac{-3}{2}\end{pmatrix} \] (a) for what values of \(a_{12}\) is \(A\) non-singular? (b) For what values of \(a_{12}\) is \(A\) singular? (c) In all cases of \(A\) singular, analyze the system \(A\bar{x}=\bar{b}\). For what vectors \(\bar{b}\) lead to solution \(\bar{x}\)? What are those solutions?

Answer (a). Expanding along first row gives\begin{align*} \left \vert A\right \vert & =\frac{2}{3}A_{11}+a_{12}A_{12}-2A_{13}\\ & =\frac{2}{3}\left ( -1\right ) ^{1+1}M_{11}+a_{12}\left ( -1\right ) ^{1+2}M_{12}-2\left ( -1\right ) ^{1+3}M_{13}\\ & =\frac{2}{3}M_{11}-a_{12}M_{12}-2M_{13}\\ & =\frac{2}{3}\begin{vmatrix} \frac{-1}{3} & \frac{3}{5}\\ \frac{5}{6} & \frac{-3}{2}\end{vmatrix} -a_{12}\begin{vmatrix} -\frac{1}{5} & \frac{3}{5}\\ \frac{1}{2} & \frac{-3}{2}\end{vmatrix} -2\begin{vmatrix} -\frac{1}{5} & \frac{-1}{3}\\ \frac{1}{2} & \frac{5}{6}\end{vmatrix} \\ & =\frac{2}{3}\left ( 0\right ) -a_{12}\left ( 0\right ) -2\left ( 0\right ) \\ & =0a_{12} \end{align*}

Therefore, there are no values of \(a_{12}\) will make \(A\) non-singular, since anything times zero is zero.

(b) This follows from part (a). For any value \(a_{12}\), the matrix \(A\) remains singular.

(c) Let \(\bar{b}=\left ( b_{1},b_{2},b_{3}\right ) ,\) then the augmented matrix is\[\begin{pmatrix} \frac{2}{3} & a_{12} & -2 & b_{1}\\ -\frac{1}{5} & \frac{-1}{3} & \frac{3}{5} & b_{2}\\ \frac{1}{2} & \frac{5}{6} & \frac{-3}{2} & b_{3}\end{pmatrix} \] \(R_{2}=R_{2}-\left ( \frac{-\frac{1}{5}}{\frac{2}{3}}\right ) R_{1}\) gives\[\begin{pmatrix} \frac{2}{3} & a_{12} & -2 & b_{1}\\ 0 & \frac{3}{10}a_{12}-\frac{1}{3} & 0 & \frac{3}{10}b_{1}+b_{2}\\ \frac{1}{2} & \frac{5}{6} & \frac{-3}{2} & b_{3}\end{pmatrix} \] \(R_{3}=R_{3}-\frac{\frac{1}{2}}{\frac{2}{3}}R_{1}\) gives\[\begin{pmatrix} \frac{2}{3} & a_{12} & -2 & b_{1}\\ 0 & \frac{3}{10}a_{12}-\frac{1}{3} & 0 & \frac{3}{10}b_{1}+b_{2}\\ 0 & \frac{5}{6}-\frac{3}{4}a_{12} & 0 & b_{3}-\frac{3}{4}b_{1}\end{pmatrix} \] \(R_{3}=R_{3}-\frac{\frac{5}{6}-\frac{3}{4}a_{12}}{\frac{3}{10}a_{12}-\frac{1}{3}}R_{2}\) gives \[\begin{pmatrix} \frac{2}{3} & a_{12} & -2 & b_{1}\\ 0 & \frac{3}{10}a_{12}-\frac{1}{3} & 0 & \frac{3}{10}b_{1}+b_{2}\\ 0 & 0 & 0 & \frac{5}{2}b_{2}+b_{3}\end{pmatrix} \] From last row, we see that \(0x_{3}=\frac{5}{2}b_{2}+b_{3}\). Hence we need (for infinite solutions)  to have the constraint\begin{align*} \frac{5}{2}b_{2}+b_{3} & =0\\ b_{2} & =-\frac{2}{5}b_{3} \end{align*}

In which case we assume \(x_{3}=t\) in this case (parameter). The second row says that\[ \left ( \frac{3}{10}a_{12}-\frac{1}{3}\right ) x_{2}=\frac{3}{10}b_{1}+b_{2}\] Here we have to consider the case where \(a_{12}=\frac{10}{9}\) (which can happen, since \(a_{12}\) can be any value for \(A\) singular). In this case, we end up with \(0x_{2}=\frac{3}{10}b_{1}+b_{2}\). Then now, for solution to exist, we need \(\frac{3}{10}b_{1}+b_{2}=0\) or \(b_{1}=-\frac{10}{3}b_{2}\) and now we set \(x_{2}=s\), second parameter.

On the other hand, if \(a_{12}\neq \frac{10}{9}\) then this leads to \(\left ( \frac{3}{10}a_{12}-\frac{1}{3}\right ) x_{2}=\frac{3}{10}b_{1}+b_{2}\) and now \(x_{2}=\frac{\frac{3}{10}b_{1}+b_{2}}{\frac{3}{10}a_{12}-\frac{1}{3}}\). Therefore in summary \[ x_{2}=\left \{ \begin{array} [c]{ccc}s & & a_{12}=\frac{10}{9}\text{ and}\frac{3}{10}b_{1}+b_{2}=0\\ \frac{\frac{3}{10}b_{1}+b_{2}}{\frac{3}{10}a_{12}-\frac{1}{3}} & & a_{12}\neq \frac{10}{9}\end{array} \right . \] Finally, first row gives\begin{align*} \frac{2}{3}x_{1}+a_{12}x_{2}-2x_{3} & =b_{1}\\ x_{1} & =b_{1}-a_{12}x_{2}+2x_{3}\\ & =\frac{3}{2}b_{1}-\frac{3}{2}a_{12}x_{2}+3t \end{align*}

If \(a_{12}=\frac{10}{9}\) and\(\,\frac{3}{10}b_{1}+b_{2}=0\) then \(x_{2}=s\) and above becomes\begin{align*} x_{1} & =\frac{3}{2}b_{1}-\frac{3}{2}\left ( \frac{10}{9}\right ) s+3t\\ & =3t-\frac{5}{3}s+\frac{3}{2}b_{1} \end{align*}

If \(a_{12}\neq \frac{10}{9}\) then \(x_{2}=\frac{\frac{3}{10}b_{1}+b_{2}}{\frac{3}{10}a_{12}-\frac{1}{3}}\) and \(x_{1}\) becomes \[ x_{1}=\frac{3}{2}b_{1}-\frac{3}{2}a_{12}\left ( \frac{\frac{3}{10}b_{1}+b_{2}}{\frac{3}{10}a_{12}-\frac{1}{3}}\right ) +3t \] Therefore in summary \[ x_{1}=\left \{ \begin{array} [c]{ccc}3t-\frac{5}{3}s+\frac{3}{2}b_{1} & & a_{12}=\frac{10}{9}\text{ and}\frac{3}{10}b_{1}+b_{2}=0\\ \frac{3}{2}b_{1}-\frac{3}{2}a_{12}\left ( \frac{\frac{3}{10}b_{1}+b_{2}}{\frac{3}{10}a_{12}-\frac{1}{3}}\right ) +3t & & a_{12}\neq \frac{10}{9}\end{array} \right . \] Hence solution vector is,

for case \(a_{12}=\frac{10}{9}\) and\(\frac{3}{10}b_{1}+b_{2}=0\) and \(\frac{5}{2}b_{2}+b_{3}=0\) then solution is\begin{align*} \begin{pmatrix} x_{1}\\ x_{2}\\ x_{3}\end{pmatrix} & =\begin{pmatrix} 3t-\frac{5}{3}s+\frac{3}{2}b_{1}\\ s\\ t \end{pmatrix} =\begin{pmatrix} 3t-\frac{5}{3}s+2b_{3}\\ s\\ t \end{pmatrix} \\ & =t\begin{pmatrix} 3\\ 0\\ 1 \end{pmatrix} +s\begin{pmatrix} -\frac{5}{3}\\ 1\\ 0 \end{pmatrix} +\begin{pmatrix} 2b_{3}\\ 0\\ 0 \end{pmatrix} \end{align*}

And the \(\bar{b}\) vector now is \begin{align*} \bar{b} & =\begin{pmatrix} b_{1}\\ b_{2}\\ b_{3}\end{pmatrix} =\begin{pmatrix} -\frac{10}{3}b_{2}\\ -\frac{2}{5}b_{3}\\ b_{3}\end{pmatrix} =\begin{pmatrix} \frac{4}{3}b_{3}\\ -\frac{2}{5}b_{3}\\ b_{3}\end{pmatrix} \\ & =b_{3}\begin{pmatrix} \frac{4}{3}\\ -\frac{2}{5}\\ 1 \end{pmatrix} \end{align*}

For case \(a_{12}\neq \frac{10}{9}\) and \(\frac{5}{2}b_{2}+b_{3}=0\)

\begin{align*} \begin{pmatrix} x_{1}\\ x_{2}\\ x_{3}\end{pmatrix} & =\begin{pmatrix} \frac{3}{2}b_{1}-\frac{3}{2}a_{12}\left ( \frac{\frac{3}{10}b_{1}+b_{2}}{\frac{3}{10}a_{12}-\frac{1}{3}}\right ) +3t\\ \frac{\frac{3}{10}b_{1}+b_{2}}{\frac{3}{10}a_{12}-\frac{1}{3}}\\ t \end{pmatrix} \\ & =t\begin{pmatrix} 3\\ 0\\ t \end{pmatrix} +\begin{pmatrix} \frac{3}{2}b_{1}-\frac{3}{2}a_{12}\left ( \frac{\frac{3}{10}b_{1}+b_{2}}{\frac{3}{10}a_{12}-\frac{1}{3}}\right ) \\ \frac{\frac{3}{10}b_{1}+b_{2}}{\frac{3}{10}a_{12}-\frac{1}{3}}\\ 0 \end{pmatrix} \end{align*}

And the \(\bar{b}\) vector now is \begin{align*} \bar{b} & =\begin{pmatrix} b_{1}\\ b_{2}\\ b_{3}\end{pmatrix} =\begin{pmatrix} b_{1}\\ -\frac{2}{5}b_{3}\\ b_{3}\end{pmatrix} \\ & =b_{1}\begin{pmatrix} 1\\ 0\\ 0 \end{pmatrix} +b_{3}\begin{pmatrix} 1\\ -\frac{2}{5}\\ 1 \end{pmatrix} \end{align*}

2.2.2.4 Problem 4

Given that two vectors \(\bar{u},\bar{v}\) are L.I., are \(3\bar{u}-5\bar{v}\) and \(\bar{v}\) L.I. or L.D.? prove your answer.

answer

The two vectors are L.I. if the only solution to \[ c_{1}\left ( 3\bar{u}-5\bar{v}\right ) +c_{2}\left ( \bar{v}\right ) =\bar{0}\] is \(c_{1}=0,c_{2}=0.\) Therefore\begin{align} c_{1}\left ( 3\bar{u}-5\bar{v}\right ) +c_{2}\left ( \bar{v}\right ) & =3c_{1}\bar{u}-5c_{1}\bar{v}+c_{2}\bar{v}\nonumber \\ & =3c_{1}\bar{u}+\bar{v}\left ( c_{2}-5c_{1}\right ) \tag{1} \end{align}

Let \begin{align} 3c_{1} & =k_{1}\tag{2}\\ c_{2}-5c_{1} & =k_{2}\nonumber \end{align}

And (1) becomes\[ c_{1}\left ( 3\bar{u}-5\bar{v}\right ) +c_{2}\left ( \bar{v}\right ) =k_{1}\bar{u}+k_{2}\bar{v}\] But \(\bar{u},\bar{v}\) are L.I., hence \(k_{1}\bar{u}+k_{2}\bar{v}=\bar{0}\) implies that \(k_{1}=k_{2}=0\). This means (from (2)) that\begin{align*} 3c_{1} & =0\\ c_{2}-5c_{1} & =0 \end{align*}

First equation gives \(c_{1}=0\). The second equation now gives \(c_{2}=0\). Hence this shows that \(3\bar{u}-5\bar{v}\) and \(\bar{v}\) are L.I.

2.2.2.5 Problem 5

Are the following statements true or false? If false, correct it.

1.
Square matrix with two identical rows is row equivalent to identity matrix
2.
Inverse of square matrix \(A\) exists if \(A\) is row equivalent to identity matrix \(I\) with the same dimension.
3.
Determinant of upper triangle square matrix is sum of diagonal elements.

Answer

1.
False. Since two rows are identical, the matrix is singular which means there are no row operations which leads to reduced Echelon form.
2.
True.
3.
False. Determinant of upper triangle square matrix is product (not sum) of diagonal elements.

2.2.2.6 Problem 6

Prove property 4 of the seven properties of determinants.

Answer

Property 4 says that if \(A,B,C\) are identical except for one row \(i\), and that row is such that \(A\left ( i\right ) +B\left ( i\right ) =C\left ( i\right ) \) then \(\left \vert A\right \vert +\left \vert B\right \vert =\left \vert C\right \vert \)

Let the three matrices be \[ A=\begin{pmatrix} \times & \times & \times & \times \\ a_{i1} & a_{i2} & \cdots & a_{in}\\ \times & \times & \times & \times \\ \times & \times & \times & \times \end{pmatrix} ,B=\begin{pmatrix} \times & \times & \times & \times \\ b_{i1} & b_{i2} & \cdots & b_{in}\\ \times & \times & \times & \times \\ \times & \times & \times & \times \end{pmatrix} ,C=\begin{pmatrix} \times & \times & \times & \times \\ c_{i1} & c_{i2} & \cdots & c_{in}\\ \times & \times & \times & \times \\ \times & \times & \times & \times \end{pmatrix} \] Where in the above, the \(i^{th}\) is shown. We are also told that \(A\left ( i\right ) +B\left ( i\right ) =C\left ( i\right ) \) which implies\begin{align} a_{i1}+b_{i1} & =c_{i1}\nonumber \\ a_{i2}+b_{i2} & =c_{i2}\nonumber \\ \vdots & =\vdots \tag{1}\\ a_{in}+b_{in} & =c_{in}\nonumber \end{align}

Taking the determinant of each matrix, and expanding along the \(i^{th}\) row gives\[ \left \vert A\right \vert =a_{i1}A_{i1}+a_{i2}A_{i2}+\cdots +a_{in}A_{in}\] Similarly for \(B\) and \(C\)\[ \left \vert B\right \vert =b_{i1}B_{i1}+b_{i2}B_{i2}+\cdots +b_{in}B_{in}\] And\[ \left \vert C\right \vert =c_{i1}C_{i1}+c_{i2}C_{i2}+\cdots +c_{in}C_{in}\] Where But since \(A_{ij}=B_{ij}=C_{ij}\) is the submatrix for all matrices, we are told the matrices are identical in all other rows (and columns) except for the \(i^{th}\) row. Then we can just use any one of them. Lets use \(C_{ij}\) for each case. Therefore from above, we can write \begin{align} \left \vert A\right \vert +\left \vert B\right \vert & =\left ( a_{i1}C_{i1}+a_{i2}C_{i2}+\cdots +a_{in}C_{in}\right ) +\left ( b_{i1}C_{i1}+b_{i2}C_{i2}+\cdots +b_{in}C_{in}\right ) \nonumber \\ & =\left ( a_{i1}+b_{i1}\right ) C_{i1}+\left ( a_{i2}+b_{i2}\right ) C_{i2}+\cdots +\left ( a_{in}+b_{in}\right ) C_{in} \tag{2} \end{align}

Substituting (1) into (2) gives\begin{align*} \left \vert A\right \vert +\left \vert B\right \vert & =c_{i1}C_{i1}+c_{i2}C_{i2}+\cdots +c_{in}C_{in}\\ & =\left \vert C\right \vert \end{align*}

QED.

2.2.2.7 Problem 7

Consider matrix\[ A=\begin{pmatrix} 1 & 2 & -1\\ 2 & -1 & 2\\ 0 & a_{32} & a_{33}\end{pmatrix} \]

1.
Find condition on \(a_{32},a_{33}\) such that \(A^{-1}\) exist.
2.
Find value of determinant for \(a_{32}=1\) and \(a_{33}=-2\). How many columns of \(A\) are independent for \(a_{32}=1,a_{33}=-2\,\)?
3.
For \(a_{32}=5,a_{33}=-4\), can \(p^{T}=\left ( 3,5,0\right ) \) be expressed as linear combination of columns of \(A\)?
4.
Find value of the determinant for \(a_{32}=5,a_{33}=-4\). How many columns of \(A\) are independent?

Answer

(1) Expanding along last row gives\begin{align*} \left \vert A\right \vert & =a_{32}A_{32}+a_{33}A_{33}\\ & =a_{32}\left ( -1\right ) ^{3+2}M_{32}+a_{33}\left ( -1\right ) ^{3+3}M_{33}\\ & =-a_{32}M_{32}+a_{33}M_{33}\\ & =-a_{32}\begin{vmatrix} 1 & -1\\ 2 & 2 \end{vmatrix} +a_{33}\begin{vmatrix} 1 & 2\\ 2 & -1 \end{vmatrix} \\ & =-4a_{32}-5a_{33} \end{align*}

Hence for \(A^{-1}\) to exist, we want \(\left \vert A\right \vert \neq 0\), which means we want \(-4a_{32}-5a_{33}\neq 0\) or \[ 4a_{32}+5a_{33}\neq 0 \] (2) When \(a_{32}=1\) and \(a_{33}=-2\), the matrix becomes\[ A=\begin{pmatrix} 1 & 2 & -1\\ 2 & -1 & 2\\ 0 & 1 & -2 \end{pmatrix} \] Expanding along last row gives\begin{align*} \left \vert A\right \vert & =a_{32}A_{32}+a_{33}A_{33}\\ & =\left ( -1\right ) ^{3+2}M_{32}-2\left ( -1\right ) ^{3+3}M_{33}\\ & =-M_{32}-2M_{33}\\ & =-\begin{vmatrix} 1 & -1\\ 2 & 2 \end{vmatrix} -2\begin{vmatrix} 1 & 2\\ 2 & -1 \end{vmatrix} \\ & =-4+10\\ & =6 \end{align*}

Since \(\left \vert A\right \vert \neq 0\), Hence all columns are L.I. (Matrix is full rank).

(3) For \(a_{32}=5,a_{33}=-4\) the matrix becomes\[ A=\begin{pmatrix} 1 & 2 & -1\\ 2 & -1 & 2\\ 0 & 5 & -4 \end{pmatrix} \] To find if \(p^{T}=\left ( 3,5,0\right ) \) can be expressed are linear combinations of columns of \(A\), implies\[ c_{1}\begin{pmatrix} 1\\ 2\\ 0 \end{pmatrix} +c_{2}\begin{pmatrix} 2\\ -1\\ 5 \end{pmatrix} +c_{3}\begin{pmatrix} -1\\ 2\\ -4 \end{pmatrix} =\begin{pmatrix} 3\\ 6\\ 0 \end{pmatrix} \] Has solution in \(c\). The above can be written as\[\begin{pmatrix} 1 & 2 & -1\\ 2 & -1 & 2\\ 0 & 5 & -4 \end{pmatrix}\begin{pmatrix} c_{1}\\ c_{2}\\ c_{3}\end{pmatrix} =\begin{pmatrix} 3\\ 6\\ 0 \end{pmatrix} \] Setting up the augmented matrix gives\[\begin{pmatrix} 1 & 2 & -1 & 3\\ 2 & -1 & 2 & 6\\ 0 & 5 & -4 & 0 \end{pmatrix} \] \(R_{2}=R_{2}-2R_{1}\) gives\[\begin{pmatrix} 1 & 2 & -1 & 3\\ 0 & -5 & 4 & 0\\ 0 & 5 & -4 & 0 \end{pmatrix} \] \(R_{3}=R_{3}+R_{2}\) gives\[\begin{pmatrix} 1 & 2 & -1 & 3\\ 0 & -5 & 4 & 0\\ 0 & 0 & 0 & 0 \end{pmatrix} \] Therefore, last row gives \(0c_{3}=0\). Hence \(c_{3}\) can be any value, say \(t\). Second row gives\begin{align*} -5c_{2}+4c_{3} & =0\\ c_{2} & =\frac{4}{5}t \end{align*}

And from first row\begin{align*} c_{1}+2c_{2}-c_{3} & =3\\ c_{1} & =3-2c_{2}+c_{3}\\ & =3-2\frac{4}{5}t+t\\ & =3-\frac{9}{5}t \end{align*}

Hence there are infinite solutions.\begin{align*} \begin{pmatrix} c_{1}\\ c_{2}\\ c_{3}\end{pmatrix} & =\begin{pmatrix} 3-\frac{9}{5}t\\ \frac{4}{5}t\\ t \end{pmatrix} \\ & =\begin{pmatrix} 3\\ 0\\ 0 \end{pmatrix} +t\begin{pmatrix} -\frac{9}{5}\\ \frac{4}{5}\\ 1 \end{pmatrix} \end{align*}

For any \(t\) we can find linear combination of columns of \(A\) which gives \(p^{T}\). For example, using \(t=0\) results in solution \(c_{1}=3,c_{2}=0,c_{3}=0\). To verify\begin{align*} c_{1}\begin{pmatrix} 1\\ 2\\ 0 \end{pmatrix} +c_{2}\begin{pmatrix} 2\\ -1\\ 5 \end{pmatrix} +c_{3}\begin{pmatrix} -1\\ 2\\ -4 \end{pmatrix} & =3\begin{pmatrix} 1\\ 2\\ 0 \end{pmatrix} \\ & =\begin{pmatrix} 3\\ 6\\ 0 \end{pmatrix} \\ & =p \end{align*}

(4). For \(a_{32}=5,a_{33}=-4\) the matrix becomes\[ A=\begin{pmatrix} 1 & 2 & -1\\ 2 & -1 & 2\\ 0 & 5 & -4 \end{pmatrix} \] The determinant is zero, this is because from part (3), we ended up with one zero pivot in Echelon form, which implies \(\left \vert A\right \vert =0\). Since solution has one parameter family, and matrix is \(3\times 3\), then there are now 2 L.I. columns in \(A\). This is the same as saying rank of \(A\) is 2.

2.2.2.8 Problem 8

Consider \(3\times 3\) matrix \(A\). Show that \(\left \vert A\right \vert ^{T}=\left \vert A\right \vert \)

Answer Let \(A\) be

\[ A=\begin{pmatrix} a_{11} & a_{12} & a_{13}\\ a_{21} & a_{22} & a_{23}\\ a_{31} & a_{32} & a_{33}\end{pmatrix} \] Expanding along first row gives\begin{align} \left \vert A\right \vert & =a_{11}\left ( -1\right ) ^{1+1}M_{11}+a_{12}\left ( -1\right ) ^{1+2}M_{12}+a_{13}\left ( -1\right ) ^{1+3}M_{13}\nonumber \\ & =a_{11}\begin{vmatrix} a_{22} & a_{23}\\ a_{32} & a_{33}\end{vmatrix} -a_{12}\begin{vmatrix} a_{21} & a_{23}\\ a_{31} & a_{33}\end{vmatrix} +a_{13}\begin{vmatrix} a_{21} & a_{22}\\ a_{31} & a_{32}\end{vmatrix} \nonumber \\ & =a_{11}\left ( a_{22}a_{33}-a_{23}a_{32}\right ) -a_{12}\left ( a_{21}a_{33}-a_{23}a_{31}\right ) +a_{13}\left ( a_{21}a_{32}-a_{22}a_{31}\right ) \nonumber \\ & =a_{11}a_{22}a_{33}-a_{11}a_{23}a_{32}-a_{12}a_{21}a_{33}+a_{12}a_{23}a_{31}+a_{13}a_{21}a_{32}-a_{13}a_{22}a_{31} \tag{1} \end{align}

Now \[ A^{T}=\begin{pmatrix} a_{11} & a_{21} & a_{31}\\ a_{12} & a_{22} & a_{32}\\ a_{13} & a_{23} & a_{33}\end{pmatrix} \] Expanding along first row gives\begin{align} \left \vert A^{T}\right \vert & =a_{11}\left ( -1\right ) ^{1+1}M_{11}+a_{21}\left ( -1\right ) ^{1+2}M_{12}+a_{31}\left ( -1\right ) ^{1+3}M_{13}\nonumber \\ & =a_{11}\begin{vmatrix} a_{22} & a_{32}\\ a_{23} & a_{33}\end{vmatrix} -a_{21}\begin{vmatrix} a_{12} & a_{32}\\ a_{13} & a_{33}\end{vmatrix} +a_{31}\begin{vmatrix} a_{12} & a_{22}\\ a_{13} & a_{23}\end{vmatrix} \nonumber \\ & =a_{11}\left ( a_{22}a_{33}-a_{32}a_{23}\right ) -a_{21}\left ( a_{12}a_{33}-a_{32}a_{13}\right ) +a_{31}\left ( a_{12}a_{23}-a_{22}a_{13}\right ) \nonumber \\ & =a_{11}a_{22}a_{33}-a_{11}a_{32}a_{23}-a_{21}a_{12}a_{33}+a_{21}a_{32}a_{13}+a_{31}a_{12}a_{23}-a_{31}a_{22}a_{13} \tag{2} \end{align}

Examining (1) and (2), we see they are the same. Hence \(\left \vert A\right \vert =\left \vert A^{T}\right \vert \)

2.2.2.9 Problem 9

Find \(\left \vert A\right \vert \)\[ A=\begin{pmatrix} 1 & 2 & -2 & 5\\ -1 & 2 & 3 & 4\\ 1 & 3 & 1 & -2\\ -1 & -3 & 0 & -4 \end{pmatrix} \] Answer

\(R_{2}=R_{2}+R_{1}\) gives\[ A=\begin{pmatrix} 1 & 2 & -2 & 5\\ 0 & 4 & 1 & 9\\ 1 & 3 & 1 & -2\\ -1 & -3 & 0 & -4 \end{pmatrix} \] \(R_{3}=R_{3}-R_{1}\) gives\[ A=\begin{pmatrix} 1 & 2 & -2 & 5\\ 0 & 4 & 1 & 9\\ 0 & 1 & 3 & -7\\ -1 & -3 & 0 & -4 \end{pmatrix} \] \(R_{4}=R_{4}+R_{1}\) gives\[ A=\begin{pmatrix} 1 & 2 & -2 & 5\\ 0 & 4 & 1 & 9\\ 0 & 1 & 3 & -7\\ 0 & -1 & -2 & 1 \end{pmatrix} \] \(R_{3}=R_{3}-\frac{1}{4}R_{2}\) gives\[ A=\begin{pmatrix} 1 & 2 & -2 & 5\\ 0 & 4 & 1 & 9\\ 0 & 0 & \frac{11}{4} & -\frac{37}{4}\\ 0 & -1 & -2 & 1 \end{pmatrix} \] \(R_{4}=R_{4}+\frac{1}{4}R_{2}\) gives \[ A=\begin{pmatrix} 1 & 2 & -2 & 5\\ 0 & 4 & 1 & 9\\ 0 & 0 & \frac{11}{4} & -\frac{37}{4}\\ 0 & 0 & -\frac{7}{4} & \frac{13}{4}\end{pmatrix} \] \(R_{4}=R_{4}-\frac{-\frac{7}{4}}{\frac{11}{4}}R_{3}\) gives\[ A=\begin{pmatrix} 1 & 2 & -2 & 5\\ 0 & 4 & 1 & 9\\ 0 & 0 & \frac{11}{4} & -\frac{37}{4}\\ 0 & 0 & 0 & -\frac{29}{11}\end{pmatrix} \] Hence \begin{align*} \left \vert A\right \vert & =1\times 4\times \frac{11}{4}\times -\frac{29}{11}\\ & =-29 \end{align*}

2.2.2.10 Problem 10

Using elementary row operations, find the inverse of \[ A=\begin{pmatrix} 3 & 5 & 6\\ 2 & 4 & 3\\ 2 & 3 & 5 \end{pmatrix} \] Answer

Set up augmented matrix\[ C=\begin{pmatrix} 3 & 5 & 6 & 1 & 0 & 0\\ 2 & 4 & 3 & 0 & 1 & 0\\ 2 & 3 & 5 & 0 & 0 & 1 \end{pmatrix} \] \(R_{2}=R_{2}-\frac{2}{3}R_{1}\) gives\[ C=\begin{pmatrix} 3 & 5 & 6 & 1 & 0 & 0\\ 0 & \frac{2}{3} & -1 & -\frac{2}{3} & 1 & 0\\ 2 & 3 & 5 & 0 & 0 & 1 \end{pmatrix} \] \(R_{3}=R_{3}-\frac{2}{3}R_{1}\) gives \[ C=\begin{pmatrix} 3 & 5 & 6 & 1 & 0 & 0\\ 0 & \frac{2}{3} & -1 & -\frac{2}{3} & 1 & 0\\ 0 & -\frac{1}{3} & 1 & -\frac{2}{3} & 0 & 1 \end{pmatrix} \] \(R_{3}=R_{3}-\frac{-\frac{1}{3}}{\frac{2}{3}}R_{2}\) gives \[ C=\begin{pmatrix} 3 & 5 & 6 & 1 & 0 & 0\\ 0 & \frac{2}{3} & -1 & -\frac{2}{3} & 1 & 0\\ 0 & 0 & \frac{1}{2} & -1 & \frac{1}{2} & 1 \end{pmatrix} \] Start backward elimination now. \(R_{1}=R_{1}-\frac{5}{\frac{2}{3}}R_{2}\) gives \[ C=\begin{pmatrix} 3 & 0 & \frac{27}{2} & 6 & -\frac{15}{2} & 0\\ 0 & \frac{2}{3} & -1 & -\frac{2}{3} & 1 & 0\\ 0 & 0 & \frac{1}{2} & -1 & \frac{1}{2} & 1 \end{pmatrix} \] \(R_{1}=R_{1}-\frac{\frac{27}{2}}{\frac{1}{2}}R_{3}\) gives \[ C=\begin{pmatrix} 3 & 0 & 0 & 33 & -21 & -27\\ 0 & \frac{2}{3} & -1 & -\frac{2}{3} & 1 & 0\\ 0 & 0 & \frac{1}{2} & -1 & \frac{1}{2} & 1 \end{pmatrix} \] \(R_{2}=R_{2}-\frac{-1}{\frac{1}{2}}R_{3}\) gives\[ C=\begin{pmatrix} 3 & 0 & 0 & 33 & -21 & -27\\ 0 & \frac{2}{3} & 0 & -\frac{8}{3} & 2 & 2\\ 0 & 0 & \frac{1}{2} & -1 & \frac{1}{2} & 1 \end{pmatrix} \] Divide each row by diagonal element to make LHS identity matrix. \(R_{1}=\frac{R_{1}}{3}\) gives \[ C=\begin{pmatrix} 1 & 0 & 0 & 11 & -7 & -9\\ 0 & \frac{2}{3} & 0 & -\frac{8}{3} & 2 & 2\\ 0 & 0 & \frac{1}{2} & -1 & \frac{1}{2} & 1 \end{pmatrix} \] \(R_{2}=\frac{R_{2}}{\frac{2}{3}}\) gives\[ C=\begin{pmatrix} 1 & 0 & 0 & 11 & -7 & -9\\ 0 & 1 & 0 & -4 & 3 & 3\\ 0 & 0 & \frac{1}{2} & -1 & \frac{1}{2} & 1 \end{pmatrix} \] \(R_{3}=\frac{R_{3}}{\frac{1}{2}}\) gives\[ C=\begin{pmatrix} 1 & 0 & 0 & 11 & -7 & -9\\ 0 & 1 & 0 & -4 & 3 & 3\\ 0 & 0 & 1 & -2 & 1 & 2 \end{pmatrix} \] Hence \[ A^{-1}=\begin{pmatrix} 11 & -7 & -9\\ -4 & 3 & 3\\ -2 & 1 & 2 \end{pmatrix} \]

2.2.2.11 Problem 11

(a) Show that any plane through the origin is subspace of \(\mathbb{R} ^{3}\)

(b) Show that the plane \(x+3y-2z=5\) is not subspace of \(\mathbb{R} ^{3}\)

Answer

part(a) The plane through the origin is the set \(W\) of all vectors \(\mathbf{v}=\begin{pmatrix} x\\ y\\ z \end{pmatrix} \), such that \(ax+by+cz=0\), where \(x,y,z\) are the coordinates of the vector \(\mathbf{v}\) and \(\,a,b,c\) are any arbitrary constants not all zero. To show that \(W\) is subspace of \(\mathbb{R} ^{3}\), we need to show that additions of any two vectors \(\mathbf{u},\mathbf{v}\in W\) gives vector \(\mathbf{w}\in W\) (closed under addition) and multiplying any vector \(\mathbf{u}\in W\) by any scalar \(k\) gives vector \(k\mathbf{u}\in W\) (closed under scalar multiplication).  We are told the zero vector \(\mathbf{0}\in W\) already, so we do not have to show this. (since the plane passes though origin).

To show closure under addition, consider any two vectors \(\mathbf{v}_{1}=\begin{pmatrix} x_{1}\\ y_{1}\\ z_{1}\end{pmatrix} \) and \(\mathbf{u}=\begin{pmatrix} x_{2}\\ y_{2}\\ z_{2}\end{pmatrix} \). Since these two vectors are taken from \(W\), then we know they satisfy the equation of the plane already. i.e. \begin{align} ax_{1}+by_{1}+cz_{1} & =0\nonumber \\ ax_{2}+by_{2}+cz_{2} & =0 \tag{1} \end{align}

Now lets add these two vectors\begin{align} \mathbf{v}+\mathbf{u} & =\begin{pmatrix} x_{1}\\ y_{1}\\ z_{1}\end{pmatrix} +\begin{pmatrix} x_{2}\\ y_{2}\\ z_{2}\end{pmatrix} \nonumber \\ & =\begin{pmatrix} x_{1}+x_{2}\\ y_{1}+y_{2}\\ z_{1}+z_{2}\end{pmatrix} \tag{2} \end{align}

We now need to check if the above vector in still in \(W\) (i.e. in the plane passing through the origin).  To do so, we take the original equation of the plane \(ax+by+cz=0\ \)and replace \(x,y,z\) in this equation by the coordinates in (2) and see if we still get zero in the RHS. This results in\begin{align*} & a\left ( x_{1}+x_{2}\right ) +b\left ( y_{1}+y_{2}\right ) +c\left ( z_{1}+z_{2}\right ) \overset{?}{=}0\\ & ax_{1}+ax_{2}+by_{1}+by_{2}+cz_{1}+cz_{2}\overset{?}{=}0\\ & \left ( ax_{1}+by_{1}+cz_{1}\right ) +\left ( ax_{2}+by_{2}+cz_{2}\right ) \overset{?}{=}0 \end{align*}

Substituting (1) into the above gives\[ 0+0\overset{?}{=}0 \] Yes. Therefore \(\mathbf{v}+\mathbf{u}\in W\).  To check closure under scalar multiplication.\begin{align} k\mathbf{v} & =k\begin{pmatrix} x_{1}\\ y_{1}\\ z_{1}\end{pmatrix} \nonumber \\ & =\begin{pmatrix} kx_{1}\\ ky_{1}\\ kz_{1}\end{pmatrix} \tag{3} \end{align}

We now need to check if the above vector in still in \(W\) (i.e. in the plane passing through the origin).  To do so, we take the original equation of the plane \(ax+by+cz=0\ \)and replace \(x,y,z\) in this equation by the coordinates in (3) and see if we still get zero in the RHS. This results in

\begin{align*} & a\left ( kx_{1}\right ) +b\left ( ky_{1}\right ) +c\left ( kz_{1}\right ) \overset{?}{=}0\\ k & \left ( ax_{1}+by_{1}+cz_{1}\right ) \overset{?}{=}0 \end{align*}

But since \(ax_{1}+by_{1}+cz_{1}=0\) from (1). Therefore \(k\left ( ax_{1}+by_{1}+cz_{1}\right ) =0\). So closed under scalar multiplication.

Part b A subspace must include the zero vector \(\mathbf{0}=\left ( 0,0,0\right ) \). Replacing the coordinates of this vector into LHS of \(x+3y-2z=5\) gives\begin{align*} & 0+3\left ( 0\right ) -2\left ( 0\right ) \overset{?}{=}5\\ & 0\overset{?}{=}5 \end{align*}

No. Hence not satisfied. Therefore not subspace of \(\mathbb{R} ^{3}\).