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

Exercise 31 reveal an important connection between linear independence and linear transformations and provide practice using the definition of linear dependence. Let V and W be vector spaces, let \(T:V \to W\) be a linear transformation, and let \(\left\{ {{v_{\bf{1}}},...,{v_p}} \right\}\) be a subset of V.

31. Show that if \(\left\{ {{v_{\bf{1}}},...,{v_p}} \right\}\) is linearly dependent in V, then the set of images, \(\left\{ {T\left( {{v_{\bf{1}}}} \right),...,T\left( {{v_p}} \right)} \right\}\), is linearly dependent in W. This fact shows that if a linear transformation maps a set \(\left\{ {{v_{\bf{1}}},...,{v_p}} \right\}\) onto a linearly independent set \(\left\{ {T\left( {{v_{\bf{1}}}} \right),...,T\left( {{v_p}} \right)} \right\}\), then the original set is linearly independent, too (because it cannot be linearly dependent).

Short Answer

Expert verified

The set \(\left\{ {T\left( {{v_1}} \right),...,T\left( {{v_p}} \right)} \right\}\) is linearly dependent.

Step by step solution

01

Write the given statement

Suppose \(\left\{ {{v_1},...,{v_p}} \right\}\) is linearly dependent.

02

Use the definition of linear dependence

There exist scalars \({c_1},...,{c_p}\) that are not all zeros, such that

\({c_1}{v_1} + ... + {c_p}{v_p} = 0\).

Take T on both sides.

\(\begin{array}{c}T\left( {{c_1}{v_1} + ... + {c_p}{v_p}} \right) = T\left( 0 \right)\\{c_1}T\left( {{v_1}} \right) + ... + {c_p}T\left( {{v_p}} \right) = 0\end{array}\)

(Since not all \({c_i}\)s are zeros)

03

Draw a conclusion

Thus, \(\left\{ {T\left( {{v_1}} \right),...,T\left( {{v_p}} \right)} \right\}\) is linearly dependent.

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

Is it possible that all solutions of a homogeneous system of ten linear equations in twelve variables are multiples of one fixed nonzero solution? Discuss.

In Exercise 4, find the vector x determined by the given coordinate vector \({\left( x \right)_{\rm B}}\) and the given basis \({\rm B}\).

4. \({\rm B} = \left\{ {\left( {\begin{array}{*{20}{c}}{ - {\bf{1}}}\\{\bf{2}}\\{\bf{0}}\end{array}} \right),\left( {\begin{array}{*{20}{c}}{\bf{3}}\\{ - {\bf{5}}}\\{\bf{2}}\end{array}} \right),\left( {\begin{array}{*{20}{c}}{\bf{4}}\\{ - {\bf{7}}}\\{\bf{3}}\end{array}} \right)} \right\},{\left( x \right)_{\rm B}} = \left( {\begin{array}{*{20}{c}}{ - {\bf{4}}}\\{\bf{8}}\\{ - {\bf{7}}}\end{array}} \right)\)

Exercises 23-26 concern a vector space V, a basis \(B = \left\{ {{{\bf{b}}_{\bf{1}}},....,{{\bf{b}}_n}\,} \right\}\) and the coordinate mapping \({\bf{x}} \mapsto {\left( {\bf{x}} \right)_B}\).

Show the coordinate mapping is one to one. (Hint: Suppose \({\left( {\bf{u}} \right)_B} = {\left( {\bf{w}} \right)_B}\) for some u and w in V, and show that \({\bf{u}} = {\bf{w}}\)).

In statistical theory, a common requirement is that a matrix be of full rank. That is, the rank should be as large as possible. Explain why an m n matrix with more rows than columns has full rank if and only if its columns are linearly independent.

Question: Exercises 12-17 develop properties of rank that are sometimes needed in applications. Assume the matrix \(A\) is \(m \times n\).

16. If \(A\) is an \(m \times n\) matrix of rank\(r\), then a rank factorization of \(A\) is an equation of the form \(A = CR\), where \(C\) is an \(m \times r\) matrix of rank\(r\) and \(R\) is an \(r \times n\) matrix of rank \(r\). Such a factorization always exists (Exercise 38 in Section 4.6). Given any two \(m \times n\) matrices \(A\) and \(B\), use rank factorizations of \(A\) and \(B\) to prove that rank\(\left( {A + B} \right) \le {\mathop{\rm rank}\nolimits} A + {\mathop{\rm rank}\nolimits} B\).

(Hint: Write \(A + B\) as the product of two partitioned matrices.)

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