/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Q 16SE Question: Exercises 12-17 develo... [FREE SOLUTION] | 91影视

91影视

Log out

Learning Materials

Features

Discover

Chapter 4: Q 16SE (page 191)

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.)

Short Answer

Expert verified

It is proved that \({\mathop{\rm rank}\nolimits} \left( {A + B} \right) \le {\mathop{\rm rank}\nolimits} A + {\mathop{\rm rank}\nolimits} B\).

Step by step solution

01

Show that \({\mathop{\rm rank}\nolimits} \left( {A + B} \right) \le {\mathop{\rm rank}\nolimits} A + {\mathop{\rm rank}\nolimits} B\)

Consider rank\(A = {r_1}\) and rank\(B = {r_2}\). Rank factorization of \(A\) and \(B\) are \(A = {C_1}{R_1}\) and \(B = {C_2}{R_2}\), where \({C_1}\) is \(m \times {r_1}\) with rank\({r_1}\), \({C_2}\) is \(m \times {r_2}\) with rank\({r_2}\), \({R_1}\) is \({r_1} \times n\) with rank\({r_1}\), \({R_2}\) is \({r_2} \times n\) with rank\({r_2}\).

By stacking \({R_1}\) over \({R_2}\), create a \(m \times \left( {{r_1} + {r_2}} \right)\) matrix \(C = \left( {\begin{array}{*{20}{c}}{{C_1}}&{{C_2}}\end{array}} \right)\) and a \(\left( {{r_1} + {r_2}} \right) \times n\) matrix \(R\).

\(\begin{array}{c}A + B = {C_1}{R_1} + {C_2}{R_2}\\ = \left( {\begin{array}{*{20}{c}}{{C_1}}&{{C_2}}\end{array}} \right)\left( {\begin{array}{*{20}{c}}{{R_1}}\\{{R_2}}\end{array}} \right)\\ = CR\end{array}\)

The matrix \(CR\) is a product, so according to exercise 12, its rank cannot exceed the rank of either of its factors. The rank of \(C\) cannot exceed \({r_1} + {r_2}\) because \(C\) has \({r_1} + {r_2}\). Similarly, as matrix \(R\) has \({r_1} + {r_2}\) rows, then its rank cannot exceed \({r_1} + {r_2}\).

Therefore, the rank of \(A + B\) cannot exceed \({r_1} + {r_2} = {\mathop{\rm rank}\nolimits} A + {\mathop{\rm rank}\nolimits} B\), or \({\mathop{\rm rank}\nolimits} \left( {A + B} \right) \le {\mathop{\rm rank}\nolimits} A + {\mathop{\rm rank}\nolimits} B\).

Thus, it is proved that \({\mathop{\rm rank}\nolimits} \left( {A + B} \right) \le {\mathop{\rm rank}\nolimits} A + {\mathop{\rm rank}\nolimits} B\).

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 91影视!

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

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

1. \({\rm B} = \left\{ {\left( {\begin{array}{*{20}{c}}{\bf{3}}\\{ - {\bf{5}}}\end{array}} \right),\left( {\begin{array}{*{20}{c}}{ - {\bf{4}}}\\{\bf{6}}\end{array}} \right)} \right\},{\left( x \right)_{\rm B}} = \left( {\begin{array}{*{20}{c}}{\bf{5}}\\{\bf{3}}\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 that a subset \(\left\{ {{{\bf{u}}_1},...,{{\bf{u}}_p}} \right\}\) in V is linearly independent if and only if the set of coordinate vectors \(\left\{ {{{\left( {{{\bf{u}}_{\bf{1}}}} \right)}_B},.....,{{\left( {{{\bf{u}}_p}} \right)}_B}} \right\}\) is linearly independent in \({\mathbb{R}^n}\)(Hint: Since the coordinate mapping is one-to-one, the following equations have the same solutions, \({c_{\bf{1}}}\),鈥�.,\({c_p}\))

\({c_{\bf{1}}}{{\bf{u}}_{\bf{1}}} + ..... + {c_p}{{\bf{u}}_p} = {\bf{0}}\) The zero vector V

\({\left( {{c_{\bf{1}}}{{\bf{u}}_{\bf{1}}} + ..... + {c_p}{{\bf{u}}_p}} \right)_B} = {\left( {\bf{0}} \right)_B}\) The zero vector in \({\mathbb{R}^n}\)a

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.

In Exercises 27-30, use coordinate vectors to test the linear independence of the sets of polynomials. Explain your work.

\({\left( {{\bf{2}} - t} \right)^{\bf{3}}}\), \({\left( {{\bf{3}} - t} \right)^2}\), \({\bf{1}} + {\bf{6}}t - {\bf{5}}{t^{\bf{2}}} + {t^{\bf{3}}}\)

Question: Determine if the matrix pairs in Exercises 19-22 are controllable.

21. (M) \(A = \left( {\begin{array}{*{20}{c}}0&1&0&0\\0&0&1&0\\0&0&0&1\\{ - 2}&{ - 4.2}&{ - 4.8}&{ - 3.6}\end{array}} \right),B = \left( {\begin{array}{*{20}{c}}1\\0\\0\\{ - 1}\end{array}} \right)\).
See all solutions

Recommended explanations on Math Textbooks

Logic and Functions

Read Explanation

Geometry

Read Explanation

Mechanics Maths

Read Explanation

Probability and Statistics

Read Explanation

Pure Maths

Read Explanation

Discrete Mathematics

Read Explanation
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.