2.2-exam1-2004¶
Quiz 1, 2004 · Section 2.2: Elimination Matrices and Inverse Matrices Source: exam1_1.pdf, pp. 105, 114
Problem¶
3 For each of these statements, say whether the claim is true or false and give a brief justification.
(a) True/False: The set of \(3 \times 3\) non-invertible matrices forms a subspace of the set of all \(3 \times 3\) matrices.
(b) True/False: If the system \(Ax = b\) has no solution then \(A\) does not have full row rank.
(c) True/False: There exist \(n \times n\) matrices \(A\) and \(B\) such that \(B\) is not invertible but \(AB\) is invertible.
(d) True/False: For any permutation matrix \(P\), we have that \(P^2 = I\).
Solution
(a) False. Consider for example \[ \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 0 \end{bmatrix} + \begin{bmatrix} 0 & 0 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 1 \end{bmatrix} = \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{bmatrix}. \] The matrix on the right hand side is invertible, but the two on the left hand side are not. (b) True. For \(Ax = b\) to have no solution we must have a row of 0's in the reduced row echelon form. Hence the number of pivots will be less than the number of rows, and so the matrix \(A\) does not have full row rank. (c) False. Suppose \(AB\) is invertible, and consider \(C = (AB)^{-1}A\). Then \[ CB = (AB)^{-1}AB = I, \] so \(C\) is an inverse for \(B\). (d) False. Consider the permutation matrix \[ P = \begin{bmatrix} 0 & 0 & 1 \\ 1 & 0 & 0 \\ 0 & 1 & 0 \end{bmatrix}. \] Then \[ P^2 = \begin{bmatrix} 0 & 0 & 1 \\ 1 & 0 & 0 \\ 0 & 1 & 0 \end{bmatrix} \begin{bmatrix} 0 & 0 & 1 \\ 1 & 0 & 0 \\ 0 & 1 & 0 \end{bmatrix} = \begin{bmatrix} 0 & 1 & 0 \\ 0 & 0 & 1 \\ 1 & 0 & 0 \end{bmatrix} \neq I. \]Keywords: invertibility, subspaces, permutation matrices, rank