Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

13. For A as in exercise 11 i.e., \[A = \left[ {\begin{array}{*{20}{c}}{\bf{3}}&{\bf{2}}&{\bf{1}}&{ - {\bf{5}}}\\{ - {\bf{9}}}&{ - {\bf{4}}}&{\bf{1}}&{\bf{7}}\\{\bf{9}}&{\bf{2}}&{ - {\bf{5}}}&{\bf{1}}\end{array}} \right]\], find a nonzero vector in Nul A and a nonzero vector in Col A.

Short Answer

Expert verified

One of the nonzero vectors in Nul A is \[\left( {1,2, - 1,6} \right)\], and one of the nonzero vectors in Col A is \[\left( {3, - 9,9} \right)\].

Step by step solution

01

Use row reduction

First, solve the equation \[Ax = 0\].

Its augmented matrix is:

\[\left[ {\begin{array}{*{20}{c}}A&0\end{array}} \right] \sim \left[ {\begin{array}{*{20}{c}}3&2&1&{ - 5}&0\\{ - 9}&{ - 4}&1&7&0\\9&2&{ - 5}&1&0\end{array}} \right]\]

At row 2, multiply row 1 by 3 and add it to row 2, i.e., , and at row 3, multiply row 1 by 3 and subtract it from row 3, i.e., \[{R_3} \to {R_3} - 3{R_1}\]. Then,

\[ \sim \left[ {\begin{array}{*{20}{c}}3&2&1&{ - 5}&0\\0&2&4&{ - 8}&0\\0&{ - 4}&{ - 8}&{16}&0\end{array}} \right]\]

At row 3, multiply row 2 by 2 and add it to row 3, i.e., \[{R_3} \to {R_3} + 2{R_2}\].

\[ \sim \left[ {\begin{array}{*{20}{c}}3&2&1&{ - 5}&0\\0&2&4&{ - 8}&0\\0&0&0&0&0\end{array}} \right]\]

At row 1, subtract row 2 from row 1, i.e., \[{R_1} \to {R_1} - {R_2}\].

\[ \sim \left[ {\begin{array}{*{20}{c}}3&0&{ - 3}&3&0\\0&2&4&{ - 8}&0\\0&0&0&0&0\end{array}} \right]\]

At row 1, divide row 1 by 3, and at row 2, divide row 2 by 2.

\[\left[ {\begin{array}{*{20}{c}}A&0\end{array}} \right] \sim \left[ {\begin{array}{*{20}{c}}1&0&{ - 1}&1&0\\0&1&2&{ - 4}&0\\0&0&0&0&0\end{array}} \right]\]

This implies that

\[\begin{array}{c}{x_1} - {x_3} + {x_4} = 0\\{x_2} + 2{x_3} - 4{x_4} = 0\\0 = 0\end{array}\]

Thus, the system is consistent.

02

Find a nonzero vector in Nul A

The general solution is \[{x_1} = {x_3} - {x_4}\], and with \[{x_3},\] and are free. So, the nonzero vector in Nul A is given by \[{x_3},\] and .

Choose and then , and \[{x_2} = 6\] to obtain a nonzero vector \[\left( {1,2, - 1,6} \right)\] in Nul A.

03

Find a nonzero vector in Col A

By definition of column space, Col A is the span of \[\left\{ {\left( {3, - 9,9} \right),\left( {2, - 4,2} \right),\left( {1,1, - 5} \right),\left( { - 5,7,1} \right)} \right\}\].

So, every column of A belongs to Col A. Choose any nonzero column of A. So, is a nonzero vector in Col A.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Suppose AB = AC, where Band Care \(n \times p\) matrices and A is invertible. Show that B = C. Is this true, in general, when A is not invertible.

Suppose block matrix \(A\) on the left side of (7) is invertible and \({A_{{\bf{11}}}}\) is invertible. Show that the Schur component \(S\) of \({A_{{\bf{11}}}}\) is invertible. [Hint: The outside factors on the right side of (7) are always invertible. Verify this.] When \(A\) and \({A_{{\bf{11}}}}\) are invertible, (7) leads to a formula for \({A^{ - {\bf{1}}}}\), using \({S^{ - {\bf{1}}}}\) \(A_{{\bf{11}}}^{ - {\bf{1}}}\), and the other entries in \(A\).

Suppose a linear transformation \(T:{\mathbb{R}^n} \to {\mathbb{R}^n}\) has the property that \(T\left( {\mathop{\rm u}\nolimits} \right) = T\left( {\mathop{\rm v}\nolimits} \right)\) for some pair of distinct vectors u and v in \({\mathbb{R}^n}\). Can Tmap \({\mathbb{R}^n}\) onto \({\mathbb{R}^n}\)? Why or why not?

Let \(X\) be \(m \times n\) data matrix such that \({X^T}X\) is invertible., and let \(M = {I_m} - X{\left( {{X^T}X} \right)^{ - {\bf{1}}}}{X^T}\). Add a column \({x_{\bf{0}}}\) to the data and form

\(W = \left[ {\begin{array}{*{20}{c}}X&{{x_{\bf{0}}}}\end{array}} \right]\)

Compute \({W^T}W\). The \(\left( {{\bf{1}},{\bf{1}}} \right)\) entry is \({X^T}X\). Show that the Schur complement (Exercise 15) of \({X^T}X\) can be written in the form \({\bf{x}}_{\bf{0}}^TM{{\bf{x}}_{\bf{0}}}\). It can be shown that the quantity \({\left( {{\bf{x}}_{\bf{0}}^TM{{\bf{x}}_{\bf{0}}}} \right)^{ - {\bf{1}}}}\) is the \(\left( {{\bf{2}},{\bf{2}}} \right)\)-entry in \({\left( {{W^T}W} \right)^{ - {\bf{1}}}}\). This entry has a useful statistical interpretation, under appropriate hypotheses.

In the study of engineering control of physical systems, a standard set of differential equations is transformed by Laplace transforms into the following system of linear equations:

\(\left[ {\begin{array}{*{20}{c}}{A - s{I_n}}&B\\C&{{I_m}}\end{array}} \right]\left[ {\begin{array}{*{20}{c}}{\bf{x}}\\{\bf{u}}\end{array}} \right] = \left[ {\begin{array}{*{20}{c}}{\bf{0}}\\{\bf{y}}\end{array}} \right]\)

Where \(A\) is \(n \times n\), \(B\) is \(n \times m\), \(C\) is \(m \times n\), and \(s\) is a variable. The vector \({\bf{u}}\) in \({\mathbb{R}^m}\) is the โ€œinputโ€ to the system, \({\bf{y}}\) in \({\mathbb{R}^m}\) is the โ€œoutputโ€ and \({\bf{x}}\) in \({\mathbb{R}^n}\) is the โ€œstateโ€ vector. (Actually, the vectors \({\bf{x}}\), \({\bf{u}}\) and \({\bf{v}}\) are functions of \(s\), but we suppress this fact because it does not affect the algebraic calculations in Exercises 19 and 20.)

Let \(A = \left( {\begin{aligned}{*{20}{c}}3&{ - 6}\\{ - 1}&2\end{aligned}} \right)\). Construct a \({\bf{2}} \times {\bf{2}}\) matrix Bsuch that ABis the zero matrix. Use two different nonzero columns for B.

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free