Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Show that block upper triangular matrix \(A\) in Example 5is invertible if and only if both \({A_{{\bf{11}}}}\) and \({A_{{\bf{12}}}}\) are invertible. [Hint: If \({A_{{\bf{11}}}}\) and \({A_{{\bf{12}}}}\) are invertible, the formula for \({A^{ - {\bf{1}}}}\) given in Example 5 actually works as the inverse of \(A\).] This fact about \(A\) is an important part of several computer algorithims that estimates eigenvalues of matrices. Eigenvalues are discussed in chapter 5.

Short Answer

Expert verified

\(A\) is invertible.

Step by step solution

01

Analyze \({A_{{\bf{11}}}}\) and \({A_{{\bf{12}}}}\)

From Example 5, matrix \(A\) is invertible if and only if \({A_{11}}\) and \({A_{12}}\) are invertible. This condition can be used for theif part.

02

Find the product \(A{A^{ - {\bf{1}}}}\)

Find the product \(A{A^{ - 1}}\).

\(\begin{array}{c}A{A^{ - 1}} = \left[ {\begin{array}{*{20}{c}}{{A_{11}}}&{{A_{12}}}\\0&{{A_{22}}}\end{array}} \right]\left[ {\begin{array}{*{20}{c}}{A_{11}^{ - 1}}&{ - A_{11}^{ - 1}{A_{12}}A_{22}^{ - 1}}\\0&{A_{22}^{ - 1}}\end{array}} \right]\\ = \left[ {\begin{array}{*{20}{c}}{{A_{11}}A_{11}^{ - 1}}&{{A_{11}}\left( { - A_{11}^{ - 1}} \right){A_{12}}A_{22}^{ - 1} + {A_{12}}A_{22}^{ - 1}}\\0&{0\left( { - A_{11}^{ - 1}} \right){A_{12}}A_{22}^{ - 1} + {A_{22}}A_{22}^{ - 1}}\end{array}} \right]\\ = \left[ {\begin{array}{*{20}{c}}I&{ - {A_{12}}A_{22}^{ - 1} + {A_{12}}A_{22}^{ - 1}}\\0&I\end{array}} \right]\\ = \left[ {\begin{array}{*{20}{c}}I&0\\0&I\end{array}} \right]\end{array}\)

As \(A\) is a square matrix, it is invertible.

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 the last column of ABis entirely zero but Bitself has no column of zeros. What can you sayaboutthe columns of A?

In Exercises 1–9, assume that the matrices are partitioned conformably for block multiplication. Compute the products shown in Exercises 1–4.

2. \[\left[ {\begin{array}{*{20}{c}}E&{\bf{0}}\\{\bf{0}}&F\end{array}} \right]\left[ {\begin{array}{*{20}{c}}A&B\\C&D\end{array}} \right]\]

In exercises 11 and 12, mark each statement True or False. Justify each answer.

a. The definition of the matrix-vector product \(A{\bf{x}}\) is a special case of block multiplication.

b. If \({A_{\bf{1}}}\), \({A_{\bf{2}}}\), \({B_{\bf{1}}}\), and \({B_{\bf{2}}}\) are \(n \times n\) matrices, \[A = \left[ {\begin{array}{*{20}{c}}{{A_{\bf{1}}}}\\{{A_{\bf{2}}}}\end{array}} \right]\] and \(B = \left[ {\begin{array}{*{20}{c}}{{B_{\bf{1}}}}&{{B_{\bf{2}}}}\end{array}} \right]\), then the product \(BA\) is defined, but \(AB\) is not.

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

Let \(T:{\mathbb{R}^n} \to {\mathbb{R}^n}\) be an invertible linear transformation, and let Sand U be functions from \({\mathbb{R}^n}\) into \({\mathbb{R}^n}\) such that \(S\left( {T\left( {\mathop{\rm x}\nolimits} \right)} \right) = {\mathop{\rm x}\nolimits} \) and \(\)\(U\left( {T\left( {\mathop{\rm x}\nolimits} \right)} \right) = {\mathop{\rm x}\nolimits} \) for all x in \({\mathbb{R}^n}\). Show that \(U\left( v \right) = S\left( v \right)\) for all v in \({\mathbb{R}^n}\). This will show that Thas a unique inverse, as asserted in theorem 9. [Hint: Given any v in \({\mathbb{R}^n}\), we can write \({\mathop{\rm v}\nolimits} = T\left( {\mathop{\rm x}\nolimits} \right)\) for some x. Why? Compute \(S\left( {\mathop{\rm v}\nolimits} \right)\) and \(U\left( {\mathop{\rm v}\nolimits} \right)\)].

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