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

19–23 concern the polynomial \(p\left( t \right) = {a_{\bf{0}}} + {a_{\bf{1}}}t + ... + {a_{n - {\bf{1}}}}{t^{n - {\bf{1}}}} + {t^n}\) and \(n \times n\) matrix \({C_p}\) called the companion matrix of \(p\): \({C_p} = \left( {\begin{aligned}{*{20}{c}}{\bf{0}}&{\bf{1}}&{\bf{0}}&{...}&{\bf{0}}\\{\bf{0}}&{\bf{0}}&{\bf{1}}&{}&{\bf{0}}\\:&{}&{}&{}&:\\{\bf{0}}&{\bf{0}}&{\bf{0}}&{}&{\bf{1}}\\{ - {a_{\bf{0}}}}&{ - {a_{\bf{1}}}}&{ - {a_{\bf{2}}}}&{...}&{ - {a_{n - {\bf{1}}}}}\end{aligned}} \right)\).

23. Let \(p\) be the polynomial in Exercise \({\bf{22}}\), and suppose the equation \(p\left( t \right) = {\bf{0}}\) has distinct roots \({\lambda _{\bf{1}}},{\lambda _{\bf{2}}},{\lambda _{\bf{3}}}\). Let \(V\) be the Vandermonde matrix

\(V{\bf{ = }}\left( {\begin{aligned}{*{20}{c}}{\bf{1}}&{\bf{1}}&{\bf{1}}\\{{\lambda _{\bf{1}}}}&{{\lambda _{\bf{2}}}}&{{\lambda _{\bf{3}}}}\\{\lambda _{\bf{1}}^{\bf{2}}}&{\lambda _{\bf{2}}^{\bf{2}}}&{\lambda _{\bf{3}}^{\bf{2}}}\end{aligned}} \right)\)

(The transpose of \(V\) was considered in Supplementary Exercise \({\bf{11}}\) in Chapter \({\bf{2}}\).) Use Exercise \({\bf{22}}\) and a theorem from this chapter to deduce that \(V\) is invertible (but do not compute \({V^{{\bf{ - 1}}}}\)). Then explain why \({V^{{\bf{ - 1}}}}{C_p}V\) is a diagonal matrix.

Short Answer

Expert verified

All the columns of \(V\) are linearly independent and \(V\) is invertible. Therefore, the matrix \({C_p}\) is diagonalizable and \({V^{ - 1}}{C_p}V\) is a diagonal matrix.

Step by step solution

01

Step 1: Write the companion matrix for \(p\)

Considerthe polynomial \(p\left( t \right) = {a_0} + {a_1}t + ... + {a_{n - 1}}{t^{n - 1}} + {t^n}\).

The general companion matrix is\({C_p} = \left( {\begin{aligned}{*{20}{c}}0&1&0\\0&0&1\\{ - {a_0}}&{ - {a_1}}&{ - {a_2}}\end{aligned}} \right)\).

As \(p\left( t \right) = {a_0} + {a_1}t + {a_2}{t^2} + {t^3}\) and \({\lambda _1},{\lambda _2},{\lambda _3}\) are the distinct roots of the equation \(p\left( t \right) = 0\).

Consider \(V = \left( {\begin{aligned}{*{20}{c}}1&1&1\\{{\lambda _1}}&{{\lambda _2}}&{{\lambda _3}}\\{\lambda _1^2}&{\lambda _2^2}&{\lambda _3^2}\end{aligned}} \right)\).

Therefore, the companion matrix is \({C_p} = \left( {\begin{aligned}{*{20}{c}}0&1&0\\0&0&1\\{ - {a_0}}&{ - {a_1}}&{ - {a_2}}\end{aligned}} \right)\).

As \(\lambda \) is a zero of \(p\left( t \right)\), then we get,

\(\begin{aligned}{c}{a_0} + {a_1}\lambda + {a_2}{\lambda ^2} + {\lambda ^3} = 0\\ - {a_0} - {a_1}\lambda - {a_2}{\lambda ^2} = {\lambda ^3}\end{aligned}\)

02

Step 2: Check whether \(\left( {{\bf{1}},\lambda ,{\lambda ^{\bf{2}}}} \right)\) is an eigenvector of \({C_p}\)

\(\begin{aligned}{c}{C_p} &= \left( {\begin{aligned}{*{20}{c}}1\\\lambda \\{{\lambda ^2}}\end{aligned}} \right)\\ &= \left( {\begin{aligned}{*{20}{c}}0&1&0\\0&0&1\\{ - {a_0}}&{ - {a_1}}&{ - {a_2}}\end{aligned}} \right)\left( {\begin{aligned}{*{20}{c}}1\\\lambda \\{{\lambda ^2}}\end{aligned}} \right)\\ &= \left( {\begin{aligned}{*{20}{c}}\lambda \\{{\lambda ^2}}\\{ - {a_0} - {a_1}\lambda - {a_2}{\lambda ^2}}\end{aligned}} \right)\\ &= \left( {\begin{aligned}{*{20}{c}}\lambda \\{{\lambda ^2}}\\{{\lambda ^3}}\end{aligned}} \right)\\ &= \lambda \left( {\begin{aligned}{*{20}{c}}1\\\lambda \\{{\lambda ^2}}\end{aligned}} \right)\end{aligned}\)

Thus, \(\left( {1,\lambda ,{\lambda ^2}} \right)\) is an eigenvector of \({C_p}\).

Since all eigenvalues \({\lambda _1},{\lambda _2},{\lambda _3}\) are distinct the eigenvectors of \({C_p}\) are linearly independent.

Thus, all the columns of\(V\)are linearly independent and\(V\)is invertible. Therefore, the matrix\({C_p}\)is diagonalizable and\({V^{ - 1}}{C_p}V\) is a diagonal matrix.

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

Consider the growth of a lilac bush. The state of this lilac bush for several years (at year’s end) is shown in the accompanying sketch. Let n(t) be the number of new branches (grown in the year t) and a(t) the number of old branches. In the sketch, the new branches are represented by shorter lines. Each old branch will grow two new branches in the following year. We assume that no branches ever die.

(a) Find the matrix A such that [nt+1at+1]=A[ntat]

(b) Verify that [11]and [2-1] are eigenvectors of A. Find the associated eigenvalues.

(c) Find closed formulas for n(t) and a(t).

Use mathematical induction to show that if \(\lambda \) is an eigenvalue of an \(n \times n\) matrix \(A\), with a corresponding eigenvector, then, for each positive integer \(m\), \({\lambda ^m}\)is an eigenvalue of \({A^m}\), with \({\rm{x}}\) a corresponding eigenvector.

Suppose \({\bf{x}}\) is an eigenvector of \(A\) corresponding to an eigenvalue \(\lambda \).

a. Show that \(x\) is an eigenvector of \(5I - A\). What is the corresponding eigenvalue?

b. Show that \(x\) is an eigenvector of \(5I - 3A + {A^2}\). What is the corresponding eigenvalue?

Question: Find the characteristic polynomial and the eigenvalues of the matrices in Exercises 1-8.

5. \(\left[ {\begin{array}{*{20}{c}}2&1\\-1&4\end{array}} \right]\)

a. Let \(A\) be a diagonalizable \(n \times n\) matrix. Show that if the multiplicity of an eigenvalue \(\lambda \) is \(n\), then \(A = \lambda I\).

b. Use part (a) to show that the matrix \(A =\left({\begin{aligned}{*{20}{l}}3&1\\0&3\end{aligned}}\right)\) is not diagonalizable.

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