/*! 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} Q2.4-8Q In Exercises 1–9, assume that ... [FREE SOLUTION] | 91Ó°ÊÓ

91Ó°ÊÓ

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

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

Short Answer

Expert verified

The formulas are \(X = {A^{ - 1}}\), \(Y = 0\), and \[Z = - {A^{ - 1}}B\].

Step by step solution

01

State the row-column rule

If the sum of the products of matching entries from row\(i\)of matrix A and column\(j\)of matrix B equals the item in row\(i\)and column\(j\)of AB, then it can be said that product AB is defined.

The product is shown below:

\({\left( {AB} \right)_{ij}} = {a_{i1}}{b_{1j}} + {a_{i2}}{b_{2j}} + ... + {a_{in}}{b_{nj}}\)

02

Obtain the product

Compute the product of the left part of the given equation by using the row-column rule, as shown below:

\[\begin{array}{c}\left[ {\begin{array}{*{20}{c}}A&B\\0&I\end{array}} \right]\left[ {\begin{array}{*{20}{c}}X&Y&Z\\0&0&I\end{array}} \right] = \left[ {\begin{array}{*{20}{c}}{A\left( X \right) + B\left( 0 \right)}&{A\left( Y \right) + B\left( 0 \right)}&{A\left( Z \right) + B\left( I \right)}\\{0\left( X \right) + I\left( 0 \right)}&{0\left( Y \right) + I\left( 0 \right)}&{0\left( Z \right) + I\left( I \right)}\end{array}} \right]\\ = \left[ {\begin{array}{*{20}{c}}{AX + B \cdot 0}&{AY + B \cdot 0}&{AZ + B \cdot I}\\{0 \cdot X + I \cdot 0}&{0 \cdot Y + I \cdot 0}&{0 \cdot Z + I \cdot I}\end{array}} \right]\\ = \left[ {\begin{array}{*{20}{c}}{AX}&{AY}&{AZ + B}\\0&0&I\end{array}} \right]\end{array}\]

Use the matrix properties\(A \cdot I = A\),\(A \cdot 0 = 0\), and\({I^2} = I\).

\[\left[ {\begin{array}{*{20}{c}}A&B\\0&I\end{array}} \right]\left[ {\begin{array}{*{20}{c}}X&Y&Z\\0&0&I\end{array}} \right] = \left[ {\begin{array}{*{20}{c}}{AX}&{AY}&{AZ + B}\\0&0&I\end{array}} \right]\]

Thus, \[\left[ {\begin{array}{*{20}{c}}A&B\\0&I\end{array}} \right]\left[ {\begin{array}{*{20}{c}}X&Y&Z\\0&0&I\end{array}} \right] = \left[ {\begin{array}{*{20}{c}}{AX}&{AY}&{AZ + B}\\0&0&I\end{array}} \right]\].

03

Equate both the sides

Equate both the matrices as shown below:

\[\left[ {\begin{array}{*{20}{c}}{AX}&{AY}&{AZ + B}\\0&0&I\end{array}} \right] = \left[ {\begin{array}{*{20}{c}}I&0&0\\0&0&I\end{array}} \right]\]

By comparing, the formulas become

\[\begin{array}{c}AX = I\\\left( {{A^{ - 1}}A} \right)X = {A^{ - 1}}\left( I \right)\\I \cdot X = {A^{ - 1}} \cdot I\\X = {A^{ - 1}}\end{array}\]

\[\begin{array}{c}AY = 0\\\left( {{A^{ - 1}}A} \right)Y = {A^{ - 1}}\left( 0 \right)\\Y = 0\end{array}\]

and

\(\begin{array}{c}AZ + B = 0\\AZ = 0 - B\\AZ = - B.\end{array}\)

Solve further to get

\[\begin{array}{c}{A^{ - 1}}\left( {AZ} \right) = {A^{ - 1}}\left( { - B} \right)\\\left( {{A^{ - 1}}A} \right)Z = {A^{ - 1}}\left( { - B} \right)\\\left( {{A^{ - 1}}A} \right)Z = - {A^{ - 1}}B\\I \cdot Z = - {A^{ - 1}}B\\Z = - {A^{ - 1}}B.\end{array}\]

Therefore, the formulas are \(X = {A^{ - 1}}\), \(Y = 0\), and \[Z = - {A^{ - 1}}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

Suppose Tand U are linear transformations from \({\mathbb{R}^n}\) to \({\mathbb{R}^n}\) such that \(T\left( {U{\mathop{\rm x}\nolimits} } \right) = {\mathop{\rm x}\nolimits} \) for all x in \({\mathbb{R}^n}\) . Is it true that \(U\left( {T{\mathop{\rm x}\nolimits} } \right) = {\mathop{\rm x}\nolimits} \) for all x in \({\mathbb{R}^n}\)? Why or why not?

Use partitioned matrices to prove by induction that for \(n = 2,3,...\), the \(n \times n\) matrices \(A\) shown below is invertible and \(B\) is its inverse.

\[A = \left[ {\begin{array}{*{20}{c}}1&0&0& \cdots &0\\1&1&0&{}&0\\1&1&1&{}&0\\ \vdots &{}&{}& \ddots &{}\\1&1&1& \ldots &1\end{array}} \right]\]

\[B = \left[ {\begin{array}{*{20}{c}}1&0&0& \cdots &0\\{ - 1}&1&0&{}&0\\0&{ - 1}&1&{}&0\\ \vdots &{}& \ddots & \ddots &{}\\0&{}& \ldots &{ - 1}&1\end{array}} \right]\]

For the induction step, assume A and Bare \(\left( {k + 1} \right) \times \left( {k + 1} \right)\) matrices, and partition Aand B in a form similar to that displayed in Exercises 23.

[M] Suppose memory or size restrictions prevent your matrix program from working with matrices having more than 32 rows and 32 columns, and suppose some project involves \(50 \times 50\) matrices A and B. Describe the commands or operations of your program that accomplish the following tasks.

a. Compute \(A + B\)

b. Compute \(AB\)

c. Solve \(Ax = b\) for some vector b in \({\mathbb{R}^{50}}\), assuming that \(A\) can be partitioned into a \(2 \times 2\) block matrix \(\left[ {{A_{ij}}} \right]\), with \({A_{11}}\) an invertible \(20 \times 20\) matrix, \({A_{22}}\) an invertible \(30 \times 30\) matrix, and \({A_{12}}\) a zero matrix. [Hint: Describe appropriate smaller systems to solve, without using any matrix inverse.]

Suppose P is invertible and \(A = PB{P^{ - 1}}\). Solve for Bin terms of A.

Show that if the columns of Bare linearly dependent, then so are the columns of AB.

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.