Suppose the second column of Bis all zeros. What can you

say about the second column of AB?

Short Answer

Expert verified

If thethird column of Bis the sum of the first two columns,the third column of AB is the sum of the first two columns of AB.

Step by step solution

01

Definition of matrix multiplication

Consider two matrices P and Q of order\(m \times n\)and\(n \times p\), respectively. The order of the product PQ matrix is\(m \times p\).

Let\({{\bf{q}}_1},{{\bf{q}}_2},...,{{\bf{q}}_n}\)be the columns of the matrix Q. Then, the product PQ is obtained as shown below:

\(\begin{aligned}{c}PQ = P\left( {\begin{aligned}{*{20}{c}}{{{\bf{q}}_1}}&{{{\bf{q}}_2}}& \cdots &{{{\bf{q}}_n}}\end{aligned}} \right)\\ = \left( {\begin{aligned}{*{20}{c}}{P{{\bf{q}}_1}}&{P{{\bf{q}}_2}}& \cdots &{P{{\bf{q}}_n}}\end{aligned}} \right)\end{aligned}\)

02

The matrix product AB

It is given thatthe second column of Bis all zeros. So,\({{\bf{b}}_2} = {\bf{0}}\), and the matrix Bcan be represented as follows:

\(B = \left( {\begin{aligned}{*{20}{c}}{{{\bf{b}}_1}}&{\bf{0}}&{{{\bf{b}}_3}}& \cdots &{{{\bf{b}}_p}}\end{aligned}} \right)\)

Obtain the product AB as shown below:

\(\begin{aligned}{c}AB = A\left( {\begin{aligned}{*{20}{c}}{{{\bf{b}}_1}}&{\bf{0}}&{{{\bf{b}}_3}}& \cdots &{{{\bf{b}}_p}}\end{aligned}} \right)\\ = \left( {\begin{aligned}{*{20}{c}}{A{{\bf{b}}_1}}&{A\left( {\bf{0}} \right)}&{A{{\bf{b}}_3}}& \cdots &{A{{\bf{b}}_p}}\end{aligned}} \right)\\ = \left( {\begin{aligned}{*{20}{c}}{A{{\bf{b}}_1}}&{\bf{0}}&{A{{\bf{b}}_3}}& \cdots &{A{{\bf{b}}_p}}\end{aligned}} \right)\end{aligned}\)

So, if\({{\bf{b}}_2} = {\bf{0}}\), then\(A{{\bf{b}}_2} = {\bf{0}}\).

Thus, ifthe second column of Bis all zeros, thesecond column of the product AB is also zero.

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 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, B,and Care invertible \(n \times n\) matrices. Show that ABCis also invertible by producing a matrix Dsuch that \(\left( {ABC} \right)D = I\) and \(D\left( {ABC} \right) = I\).

Suppose the third column of Bis the sum of the first two columns. What can you say about the third column of AB? Why?

In Exercises 1–9, assume that the matrices are partitioned conformably for block multiplication. In Exercises 5–8, find formulas for X, Y, and Zin terms of A, B, and C, and justify your calculations. In some cases, you may need to make assumptions about the size of a matrix in order to produce a formula. [Hint:Compute the product on the left, and set it equal to the right side.]

6. \[\left[ {\begin{array}{*{20}{c}}X&{\bf{0}}\\Y&Z\end{array}} \right]\left[ {\begin{array}{*{20}{c}}A&{\bf{0}}\\B&C\end{array}} \right] = \left[ {\begin{array}{*{20}{c}}I&{\bf{0}}\\{\bf{0}}&I\end{array}} \right]\]

Prove Theorem 2(d). (Hint: The \(\left( {i,j} \right)\)- entry in \(\left( {rA} \right)B\) is \(\left( {r{a_{i1}}} \right){b_{1j}} + ... + \left( {r{a_{in}}} \right){b_{nj}}\).)

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