/*! 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} Q34Q Repeat the strategy of Exercise ... [FREE SOLUTION] | 91Ó°ÊÓ

91Ó°ÊÓ

Repeat the strategy of Exercise 33 to guess the inverse of \(A = \left( {\begin{aligned}{*{20}{c}}1&0&0& \cdots &0\\1&2&0&{}&0\\1&2&3&{}&0\\ \vdots &{}&{}& \ddots & \vdots \\1&2&3& \cdots &n\end{aligned}} \right)\). Prove that your guess is correct.

Short Answer

Expert verified

\(\left( {\begin{aligned}{*{20}{c}}1&0&0& \cdots &0\\{ - \frac{1}{2}}&{\frac{1}{2}}&0&{}&{}\\0&{ - \frac{1}{3}}&{\frac{1}{3}}&{}&{}\\ \vdots &{}& \ddots & \ddots & \vdots \\0&0& \cdots &{ - \frac{1}{n}}&{\frac{1}{n}}\end{aligned}} \right)\)

Step by step solution

01

Guess matrix \(B\)

Suppose the inverse matrix of \(A\) is \(B\). Matrix \(B\) of order \(n \times n\) can be expressed as

\(B = \left( {\begin{aligned}{*{20}{c}}1&0&0& \cdots &0\\{ - \frac{1}{2}}&{\frac{1}{2}}&0&{}&{}\\0&{ - \frac{1}{3}}&{\frac{1}{3}}&{}&{}\\ \vdots &{}& \ddots & \ddots & \vdots \\0&0& \cdots &{ - \frac{1}{n}}&{\frac{1}{n}}\end{aligned}} \right)\).

For \(j = 1,...,n\), let \({{\bf{a}}_j}\), \({{\bf{b}}_j}\) and \({{\bf{e}}_j}\) denote the \(j\)th columns of \(A\), \(B\) and \(I\), respectively.

For \(j = 1,...,n - 1\),

\({{\bf{a}}_j} = j\left( {{{\bf{e}}_j} + ....... + {{\bf{e}}_n}} \right)\),

\({{\bf{b}}_j} = \frac{1}{j}{{\bf{e}}_j} - \frac{1}{{j + 1}}{{\bf{e}}_{j + 1}}\), and

\({{\bf{b}}_n} = \frac{1}{n}{{\bf{e}}_n}\).

02

Find the value of \(A{{\bf{b}}_j}\)

\(\begin{aligned}{c}A{b_j} = A\left( {\frac{1}{j}{{\bf{e}}_j} - \frac{1}{{j + 1}}{{\bf{e}}_{j + 1}}} \right)\\ = \frac{1}{j}{{\bf{a}}_j} - \frac{1}{{j + 1}}{{\bf{a}}_{j + 1}}\\ = \left( {{{\bf{e}}_j} + ..... + {{\bf{e}}_n}} \right) - \left( {{{\bf{e}}_{j + 1}} + .... + {{\bf{e}}_n}} \right)\\ = {{\bf{e}}_j}\end{aligned}\)

So, \(AB = I\).

03

Find the value of \(B{{\bf{a}}_j}\)

As \(\frac{1}{n}{a_n} = {e_n}\),

\(\begin{aligned}{c}B{{\bf{a}}_j} = j\left( {B{{\bf{e}}_j} + ..... + B{{\bf{e}}_n}} \right)\\ = j\left( {{{\bf{b}}_j} + ..... + {{\bf{b}}_n}} \right)\\ = j\left( {\frac{1}{j}{{\bf{e}}_j}} \right)\\ = {{\bf{e}}_j}.\end{aligned}\)

So, \(BA = I\).

The inverse of matrix \(A\) is \(\left( {\begin{aligned}{*{20}{c}}1&0&0& \cdots &0\\{ - \frac{1}{2}}&{\frac{1}{2}}&0&{}&{}\\0&{ - \frac{1}{3}}&{\frac{1}{3}}&{}&{}\\ \vdots &{}& \ddots & \ddots & \vdots \\0&0& \cdots &{ - \frac{1}{n}}&{\frac{1}{n}}\end{aligned}} \right)\) for which \(AB = BA = I\).

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

Let T be a linear transformation that maps \({\mathbb{R}^n}\) onto \({\mathbb{R}^n}\). Is \({T^{ - 1}}\) also one-to-one?

Suppose \(AD = {I_m}\) (the \(m \times m\) identity matrix). Show that for any b in \({\mathbb{R}^m}\), the equation \(A{\mathop{\rm x}\nolimits} = {\mathop{\rm b}\nolimits} \) has a solution. (Hint: Think about the equation \(AD{\mathop{\rm b}\nolimits} = {\mathop{\rm b}\nolimits} \).) Explain why Acannot have more rows than columns.

When a deep space probe launched, corrections may be necessary to place the probe on a precisely calculated trajectory. Radio elementary provides a stream of vectors, \({{\bf{x}}_{\bf{1}}},....,{{\bf{x}}_k}\), giving information at different times about how the probe’s position compares with its planned trajectory. Let \({X_k}\) be the matrix \(\left[ {{x_{\bf{1}}}.....{x_k}} \right]\). The matrix \({G_k} = {X_k}X_k^T\) is computed as the radar data are analyzed. When \({x_{k + {\bf{1}}}}\) arrives, a new \({G_{k + {\bf{1}}}}\) must be computed. Since the data vector arrive at high speed, the computational burden could be serve. But partitioned matrix multiplication helps tremendously. Compute the column-row expansions of \({G_k}\) and \({G_{k + {\bf{1}}}}\) and describe what must be computed in order to update \({G_k}\) to \({G_{k + {\bf{1}}}}\).

Use the inverse found in Exercise 1 to solve the system

\(\begin{aligned}{l}{\bf{8}}{{\bf{x}}_{\bf{1}}} + {\bf{6}}{{\bf{x}}_{\bf{2}}} = {\bf{2}}\\{\bf{5}}{{\bf{x}}_{\bf{1}}} + {\bf{4}}{{\bf{x}}_{\bf{2}}} = - {\bf{1}}\end{aligned}\)

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

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.