Chapter 1, Problem 1CTA

This chapter test consists of true−or−false questions. In each case, answer true if the statement is always true and false otherwise. In the case of a true statement, explain or prose your answer. In the case of a false statement, give an example to show that the statement is not always true. For example, consider the following statements about $n\times n$matrices A and B:

(i) $A+B=B+A$

(ii) $AB=BA$

Statement (i) is always true. Explanation: The (i, j) entry of $A+B$ is $a_{ij}+b_{ij}$ and the (i, j) entry of $B+A$ is $b_{ij}+a_{ij}$ . Since $a_{ij}+b_{ij}=b_{ij}+a_{ij}$ for each i and j, it follows that $A+B=B+A$ .

The answer to statement (ii) is false. Although the statement may be true in some cases, it is not always true. To show this, we need only exhibit one instance in which equality fails to hold. For example, if

$B=\left[\begin{array}{cc}2& 3\\ 1& 1\end{array}\right]$  and   $B=\left[\begin{array}{cc}2& 3\\ 1& 1\end{array}\right]$

then

$AB=\left[\begin{array}{cc}4& 5\\ 7& 10\end{array}\right]$  and   $BA=\left[\begin{array}{cc}11& 7\\ 4& 3\end{array}\right]$

Then proves that statement (ii) is false.

1. If the row reduced echelon form of A involves free variables, then the system $Ax=b$ will have infinitely many solutions.