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

Short Answer

Expert verified

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

Step by step solution

01

State the rank theorem

The rank theoremstates that the dimensions of the column space and the row space of an \(m \times n\) matrix \(A\) are equal. This common dimension, the rank of \(A\), also equals the number of pivot positions in \(A\) and satisfies the equation \({\mathop{\rm rank}\nolimits} A + \dim {\mathop{\rm Nul}\nolimits} A = n\).

02

Show that if \(Q\) is invertible, then \({\mathop{\rm rank}\nolimits} AQ = {\mathop{\rm rank}\nolimits} A\)

Note that \({\left( {AQ} \right)^T} = {Q^T}{A^T}\).

Suppose \({Q^T}\) is invertible. Use Exercise 13 as shown below:

\(\begin{array}{c}{\mathop{\rm rank}\nolimits} {\left( {AQ} \right)^T} = {\mathop{\rm rank}\nolimits} {Q^T}{A^T}\\ = {\mathop{\rm rank}\nolimits} {A^T}\end{array}\)

The rank of a matrix and its transpose are equal according to the rank theorem, so \({\mathop{\rm rank}\nolimits} AQ = {\mathop{\rm rank}\nolimits} A\).

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

Let \(B = \left\{ {\left( {\begin{array}{*{20}{c}}{\bf{1}}\\{ - {\bf{4}}}\end{array}} \right),\,\left( {\begin{array}{*{20}{c}}{ - {\bf{2}}}\\{\bf{9}}\end{array}} \right)\,} \right\}\). Since the coordinate mapping determined by B is a linear transformation from \({\mathbb{R}^{\bf{2}}}\) into \({\mathbb{R}^{\bf{2}}}\), this mapping must be implemented by some \({\bf{2}} \times {\bf{2}}\) matrix A. Find it. (Hint: Multiplication by A should transform a vector x into its coordinate vector \({\left( {\bf{x}} \right)_B}\)).

Find a basis for the set of vectors in\({\mathbb{R}^{\bf{2}}}\)on the line\(y = {\bf{5}}x\).

Suppose a nonhomogeneous system of six linear equations in eight unknowns has a solution, with two free variables. Is it possible to change some constants on the equations’ right sides to make the new system inconsistent? Explain.

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

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