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

13. Show that if \(P\) is an invertible \(m \times m\) matrix, then rank\(PA\)=rank\(A\).(Hint: Apply Exercise12 to \(PA\) and \({P^{ - 1}}\left( {PA} \right)\).)

Short Answer

Expert verified

It is proved that \({\mathop{\rm rank}\nolimits} PA = {\mathop{\rm rank}\nolimits} A\).

Step by step solution

01

Show that \({\mathop{\rm rank}\nolimits} PA = {\mathop{\rm rank}\nolimits} A\)

Exercise 12 states that if \(B\) is \(n \times p\), then rank\(AB \le {\mathop{\rm rank}\nolimits} A\).

According to Exercise 12, \({\mathop{\rm rank}\nolimits} AB \le {\mathop{\rm rank}\nolimits} A\).

\(\begin{array}{c}{\mathop{\rm rank}\nolimits} A = {\mathop{\rm rank}\nolimits} \left( {{P^{ - 1}}P} \right)A\\ = {\mathop{\rm rank}\nolimits} {P^{ - 1}}\left( {PA} \right)\\ \le {\mathop{\rm rank}\nolimits} PA\\ = {\mathop{\rm rank}\nolimits} PA\end{array}\)

Thus, it is proved that \({\mathop{\rm rank}\nolimits} PA = {\mathop{\rm rank}\nolimits} 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

Consider the following two systems of equations:

\(\begin{array}{c}5{x_1} + {x_2} - 3{x_3} = 0\\ - 9{x_1} + 2{x_2} + 5{x_3} = 1\\4{x_1} + {x_2} - 6{x_3} = 9\end{array}\) \(\begin{array}{c}5{x_1} + {x_2} - 3{x_3} = 0\\ - 9{x_1} + 2{x_2} + 5{x_3} = 5\\4{x_1} + {x_2} - 6{x_3} = 45\end{array}\)

It can be shown that the first system of a solution. Use this fact and the theory from this section to explain why the second system must also have a solution. (Make no row operations.)

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

14. Show that if \(Q\) is an invertible, then \({\mathop{\rm rank}\nolimits} AQ = {\mathop{\rm rank}\nolimits} A\). (Hint: Use Exercise 13 to study \({\mathop{\rm rank}\nolimits} {\left( {AQ} \right)^T}\).)

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: Determine if the matrix pairs in Exercises 19-22 are controllable.

20. \(A = \left( {\begin{array}{*{20}{c}}{.8}&{ - .3}&0\\{.2}&{.5}&1\\0&0&{ - .5}\end{array}} \right),B = \left( {\begin{array}{*{20}{c}}1\\1\\0\end{array}} \right)\).

Define a linear transformation by \(T\left( {\mathop{\rm p}\nolimits} \right) = \left( {\begin{array}{*{20}{c}}{{\mathop{\rm p}\nolimits} \left( 0 \right)}\\{{\mathop{\rm p}\nolimits} \left( 0 \right)}\end{array}} \right)\). Find \(T:{{\mathop{\rm P}\nolimits} _2} \to {\mathbb{R}^2}\)polynomials \({{\mathop{\rm p}\nolimits} _1}\) and \({{\mathop{\rm p}\nolimits} _2}\) in \({{\mathop{\rm P}\nolimits} _2}\) that span the kernel of T, and describe the range of T.

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