Skip to content

2.2-exam1-2001

Quiz 1, 2001 · Section 2.2: Elimination Matrices and Inverse Matrices Source: exam1_1.pdf, p. 46

Problem

2 (36 pts.) (a) Suppose \(A^n = 0\). Show that \((I - A)^{-1} = I + A + A^2 + \dots + A^{n-1}\). (10)

(b) Assume \(A\) and \(B\) are commuting matrices (that is, \(AB = BA\)). If they both are also nonsingular, show that \(A^{-1}\) and \(B^{-1}\) commute. (10)

(c) Which are true and which false. (Give a good reason!!!) Let \(A\) be an \(m\)-by-\(n\) matrix. Then \(Ax = 0\) has always a non-zero solution if (i) \(rank(A) < m\) (5) (ii) \(rank(A) < n\) (5) (iii) \(m = n\) and \(A^2 = 0\) (6)

Solution (a) Multiply by \(I - A\): \[ (I - A)(I + A + A^2 + \dots + A^{n-1}) = I - A^n = I, \] because the intermediate products \(A - A, A^2 - A^2, \dots\) telescope and cancel. So \(I - A\) is invertible with the stated inverse. (b) For any invertible \(A, B\), \((AB)^{-1} = B^{-1}A^{-1}\). Since \(AB = BA\), \[ A^{-1}B^{-1} = (BA)^{-1} = (AB)^{-1} = B^{-1}A^{-1}, \] so \(A^{-1}\) and \(B^{-1}\) commute. (c) (i) FALSE. Counterexample: \(A = \begin{bmatrix} 1 & 0 \\ 0 & 1 \\ 0 & 0 \end{bmatrix}\) (3 by 2) has rank \(2 < 3 = m\), but \(Ax = 0\) has only the solution \(x = 0\) (no free variables since \(rank(A) = n\)). (ii) TRUE. If \(rank(A) < n\), there are \(n - r \ge 1\) free variables, so \(Ax = 0\) has \(n - r \ge 1\) independent nonzero special solutions. (iii) TRUE. If \(A^2 = 0\) and \(A\) were invertible, then \(A^2 = AA\) would be a product of invertible matrices and hence invertible — contradiction. Equivalently, \(\det(A^2) = (\det A)^2 = 0\) forces \(\det A = 0\). So \(A\) is singular and \(Ax = 0\) has a nonzero solution.

Keywords: inverse matrix, commuting matrices, nilpotent matrix, rank