Skip to content

3.4-final-2009

Final Exam, 2009 · Section 3.4: Independence, Basis, and Dimension Source: finalexam_1.pdf, p. 227

Problem

Problem 3: True or false. Give a counter-example if false. (You need not provide a reason if true.)

(a) If \(Q\) is an orthogonal matrix, then det \(Q = 1\).

(b) If \(A\) is a Markov matrix, then \(du/dt = Au\) approaches some finite constant vector (a "steady state") for any initial condition \(u(0)\).

(c) If \(S\) and \(T\) are subspaces of \(R^2\), then their intersection (points in both \(S\) and \(T\)) is also a subspace.

(d) If \(S\) and \(T\) are subspaces of \(R^2\), then their union (points in either \(S\) or \(T\)) is also a subspace.

(e) The rank of \(AB\) is less than or equal to the ranks of \(A\) and \(B\) for any \(A\) and \(B\).

(f) The rank of \(A + B\) is less than or equal to the ranks of \(A\) and \(B\) for any \(A\) and \(B\).

Solution (12 points = 2 + 2 + 2 + 2 + 2 + 2) (a) False. For example, \(Q = (-1)\) is an orthogonal matrix: \(Q^TQ = (-1)(-1) = (1)\). REMARK: In general, for a real orthogonal matrix \(Q\), det \(Q = \pm 1\). This is because \(\det(Q^TQ) = \det(I) = 1 \Rightarrow \det(Q)^2 = \det(Q^T)\det(Q) = 1\). (b) False. Be careful here that we are discussing differential equations but not the powers of \(A\). For example, \(A = (1)\), the differential equation has solution \(u = ce^t\) for some constant \(c\), which does not approach any finite constant vector. REMARK: It is true that for the Markov process \(u_{k+1} = Au_k\), \(u_k\) approaches some finite constant vector (a "steady state") for any initial condition \(u_0\). (c) True. Intersections of subspaces are always subspaces. (d) False. For example, \(S\) and \(T\) are the \(x\)- and \(y\)-axes. Then \((1, 1) = (1, 0) + (0, 1)\) is a linear combination of points in the union of \(S\) and \(T\), but does not lie in the union itself. So the union of \(S\) and \(T\) is not a subspace. (e) True. One may see this by arguing as follows. Since the column space of \(AB\) is a subspace of the column space of \(A\), the rank of \(AB\) is less than or equal to the rank of \(A\). Similarly, since the row space of \(AB\) is a subspace of the row space of \(B\), the rank of \(AB\) is less than or equal to the rank of \(B\). (f) False. \(A = \begin{bmatrix} 0 & 0 \\ 0 & 1 \end{bmatrix}\), \(B = \begin{bmatrix} 1 & 0 \\ 0 & 0 \end{bmatrix}\) both have rank 1. But \(A + B = \begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix}\) has rank 2. REMARK: It is true that \(\text{rank}(A + B) \le \text{rank}(A) + \text{rank}(B)\).

Keywords: orthogonal matrices, Markov matrices, subspaces, rank