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

Use partitioned matrices to prove by induction that the product of two lower triangular matrices is also lower triangular. [Hint: \(A\left( {k + 1} \right) \times \left( {k + 1} \right)\) matrix \({A_1}\) can be written in the form below, where \[a\] is a scalar, v is in \({\mathbb{R}^k}\), and Ais a \(k \times k\) lower triangular matrix. See the study guide for help with induction.]

\({A_1} = \left[ {\begin{array}{*{20}{c}}a&{{0^T}}\\0&A\end{array}} \right]\).

Short Answer

Expert verified

It is proved that by induction, the product of two lower triangular matrices is also lower triangular.

Step by step solution

01

Show the product of two lower triangular matrices

It is given that the product of two \(1 \times 1\) lower triangular matrices is lower triangular.

Suppose for \({\mathop{\rm n}\nolimits} = k\), the product of two \(k \times k\) lower triangular matrices is also lower triangular and take \({A_1}\) and \({B_1}\)as \(\left( {k + 1} \right) \times \left( {k + 1} \right)\) matrices. The partition matrices are in the form

\({A_1} = \left[ {\begin{array}{*{20}{c}}a&{{0^T}}\\0&A\end{array}} \right],{B_1} = \left[ {\begin{array}{*{20}{c}}b&{{0^T}}\\0&A\end{array}} \right]\).

Here v and w are in \({\mathbb{R}^k}\); \(A\) and B are \(k \times k\) lower triangular matrices, and \(a\), \(b\) are scalars.

02

Show by induction that the product of two lower triangular matrices is lower triangular

\(A\)and \(B\) must be lower triangular matrices since \({A_1}\) and \({B_1}\) are lower triangular.

\(\begin{array}{c}{A_1}{B_1} = \left[ {\begin{array}{*{20}{c}}a&{{0^T}}\\{\mathop{\rm v}\nolimits} &B\end{array}} \right]\left[ {\begin{array}{*{20}{c}}b&{{0^T}}\\{\mathop{\rm v}\nolimits} &B\end{array}} \right]\\ = \left[ {\begin{array}{*{20}{c}}{ab + {0^T}{\mathop{\rm w}\nolimits} }&{a{0^T} + {0^T}B}\\{{\mathop{\rm v}\nolimits} b + A{\mathop{\rm w}\nolimits} }&{{\mathop{\rm v}\nolimits} {0^T} + AB}\end{array}} \right]\\ = \left[ {\begin{array}{*{20}{c}}{ab}&{{0^T}}\\{b{\mathop{\rm v}\nolimits} + A{\mathop{\rm w}\nolimits} }&{AB}\end{array}} \right]\end{array}\)

ABis a lower triangular matrix because A and B are \(k \times k\) lower triangular matrices. The form \({A_1}{B_1}\) also indicates lower triangular. Therefore, the statement that lower triangular matrices hold for \(n = k + 1\) is true when \(n = k\).

According to the principle of induction, the statement is true for all \(n \ge 1\).

Thus, it is proved that by induction, the product of two lower triangular matrices is also lower triangular.

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

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

If a matrix \(A\) is \({\bf{5}} \times {\bf{3}}\) and the product \(AB\)is \({\bf{5}} \times {\bf{7}}\), what is the size of \(B\)?

Let \(A = \left( {\begin{aligned}{*{20}{c}}1&1&1\\1&2&3\\1&4&5\end{aligned}} \right)\), and \(D = \left( {\begin{aligned}{*{20}{c}}2&0&0\\0&3&0\\0&0&5\end{aligned}} \right)\). Compute \(AD\) and \(DA\). Explain how the columns or rows of A change when A is multiplied by D on the right or on the left. Find a \(3 \times 3\) matrix B, not the identity matrix or the zero matrix, such that \(AB = BA\).

Let Abe an invertible \(n \times n\) matrix, and let \(B\) be an \(n \times p\) matrix. Explain why \({A^{ - 1}}B\) can be computed by row reduction: If\(\left( {\begin{aligned}{*{20}{c}}A&B\end{aligned}} \right) \sim ... \sim \left( {\begin{aligned}{*{20}{c}}I&X\end{aligned}} \right)\), then \(X = {A^{ - 1}}B\).

If Ais larger than \(2 \times 2\), then row reduction of \(\left( {\begin{aligned}{*{20}{c}}A&B\end{aligned}} \right)\) is much faster than computing both \({A^{ - 1}}\) and \({A^{ - 1}}B\).

Let \({{\bf{r}}_1} \ldots ,{{\bf{r}}_p}\) be vectors in \({\mathbb{R}^{\bf{n}}}\), and let Qbe an\(m \times n\)matrix. Write the matrix\(\left( {\begin{aligned}{*{20}{c}}{Q{{\bf{r}}_1}}& \cdots &{Q{{\bf{r}}_p}}\end{aligned}} \right)\)as a productof two matrices (neither of which is an identity matrix).

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