Unless otherwise specified, assume that all matrices in these exercises are \(n \times n\). Determine which of the matrices in Exercises 1-10 are invertible. Use a few calculations as possible. Justify your answer.

10. [M] \[\left[ {\begin{array}{*{20}{c}}5&3&1&7&9\\6&4&2&8&{ - 8}\\7&5&3&{10}&9\\9&6&4&{ - 9}&{ - 5}\\8&5&2&{11}&4\end{array}} \right]\]

Short Answer

Expert verified

The matrix \(\left[ {\begin{array}{*{20}{c}}5&3&1&7&9\\6&4&2&8&{ - 8}\\7&5&3&{10}&9\\9&6&4&{ - 9}&{ - 5}\\8&5&2&{11}&4\end{array}} \right]\) is invertible.

Step by step solution

01

State the invertible matrix theorem

Let Abe a square \(n \times n\) matrix. Then the following statements are equivalent.

For a given matrix A, all these statements are either true or false.

  1. Ais an invertible matrix.
  2. Ais row equivalent to the identity matrix of the \(n \times n\) matrix.
  3. Ahas n pivot positions.
  4. The equation Ax = 0 has only a trivial solution.
  5. The columns of A form a linearly independent set.
  6. The linear transformation \(x \mapsto Ax\) is one-to-one.
  7. The equation \(Ax = b\) has at least one solution for each b in \({\mathbb{R}^n}\).
  8. The columns of Aspan \({\mathbb{R}^n}\).
  9. The linear transformation \(x \mapsto Ax\) maps \({\mathbb{R}^n}\) onto \({\mathbb{R}^n}\).
  10. There is an \(n \times n\) matrix Csuch that CA = I.
  11. There is an \(n \times n\) matrix Dsuch that DA = I.
  12. \({A^T}\) is an invertible matrix.
02

Convert the matrix into row-reduced echelon form

Consider the matrix \(A = \left[ {\begin{array}{*{20}{c}}5&3&1&7&9\\6&4&2&8&{ - 8}\\7&5&3&{10}&9\\9&6&4&{ - 9}&{ - 5}\\8&5&2&{11}&4\end{array}} \right]\).

Use the code in MATLAB to obtain the row-reduced echelon form, as shown below:

\[\begin{array}{l} > > {\mathop{\rm A}\nolimits} \,\, = \,\,\left[ {5\,\,\,6\,\,\,7\,\,\,9\,\,\,8;\,3\,\,\,4\,\,\,5\,\,\,6\,\,\,5;\,1\,\,\,2\,\,\,3\,\,\,4\,\,\,2;\,\,7\,\,\,8\,\,\,10\,\,\, - 9\,\,\,11;\,\,9\,\,\, - 8\,\,\,9\,\,\, - 5\,\,\,4} \right]\\ > > {\mathop{\rm U}\nolimits} = {\mathop{\rm rref}\nolimits} \left( {\mathop{\rm A}\nolimits} \right)\end{array}\]

\[\left[ {\begin{array}{*{20}{c}}5&3&1&7&9\\6&4&2&8&{ - 8}\\7&5&3&{10}&9\\9&6&4&{ - 9}&{ - 5}\\8&5&2&{11}&4\end{array}} \right] \sim \left[ {\begin{array}{*{20}{c}}1&0&0&0&0\\0&1&0&0&0\\0&0&1&0&0\\0&0&0&1&0\\0&0&0&0&1\end{array}} \right]\]

03

Mark the pivot positions in the matrix

Mark the non-zero leading entries in columns 1, 2, 3, and 4.

There are five pivot positions in the matrix.

04

Determine whether the matrix is invertible

The matrix has five pivot positions. Thus, it is invertible according to part (c) of the invertible matrix theorem.

Thus, the matrix 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 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.]

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 \(A = \left( {\begin{aligned}{*{20}{c}}{\bf{1}}&{\bf{2}}\\{\bf{5}}&{{\bf{12}}}\end{aligned}} \right),{b_{\bf{1}}} = \left( {\begin{aligned}{*{20}{c}}{ - {\bf{1}}}\\{\bf{3}}\end{aligned}} \right),{b_{\bf{2}}} = \left( {\begin{aligned}{*{20}{c}}{\bf{1}}\\{ - {\bf{5}}}\end{aligned}} \right),{b_{\bf{3}}} = \left( {\begin{aligned}{*{20}{c}}{\bf{2}}\\{\bf{6}}\end{aligned}} \right),\) and \({b_{\bf{4}}} = \left( {\begin{aligned}{*{20}{c}}{\bf{3}}\\{\bf{5}}\end{aligned}} \right)\).

  1. Find \({A^{ - {\bf{1}}}}\), and use it to solve the four equations \(Ax = {b_{\bf{1}}},\)\(Ax = {b_2},\)\(Ax = {b_{\bf{3}}},\)\(Ax = {b_{\bf{4}}}\)\(\)
  2. The four equations in part (a) can be solved by the same set of row operations, since the coefficient matrix is the same in each case. Solve the four equations in part (a) by row reducing the augmented matrix \(\left( {\begin{aligned}{*{20}{c}}A&{{b_{\bf{1}}}}&{{b_{\bf{2}}}}&{{b_{\bf{3}}}}&{{b_{\bf{4}}}}\end{aligned}} \right)\).

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?

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

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