/*! 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} Q2SE Question: 2. Let \(\left\{ {{{\b... [FREE SOLUTION] | 91Ó°ÊÓ

91Ó°ÊÓ

Question: 2. Let \(\left\{ {{{\bf{u}}_1},{{\bf{u}}_2},....,{{\bf{u}}_n}} \right\}\) be an orthonormal basis for \({\mathbb{R}_n}\) , and let \({\lambda _1},....{\lambda _n}\) be any real scalars. Define

\(A = {\lambda _1}{{\bf{u}}_1}{\bf{u}}_1^T + ..... + {\lambda _n}{\bf{u}}_n^T\)

a. Show that A is symmetric.

b. Show that \({\lambda _1},....{\lambda _n}\) are the eigenvalues of A

Short Answer

Expert verified

(a) It is proved that \(A\) is a symmetric matrix.

(b) It is proved that \({\lambda _1},{\lambda _2}, \cdots ,{\lambda _n}\) are eigenvalues of \(A\).

Step by step solution

01

(a) Find the transpose of the matrix

The matrix A is shown below:

\(A = {\lambda _1}{{\bf{u}}_1}{\bf{u}}_1^T + {\lambda _2}{{\bf{u}}_2}{\bf{u}}_2^T + \cdots + {\lambda _n}{{\bf{u}}_n}{\bf{u}}_n^T\)

The transpose of matrix A is shown below:

\(\begin{array}{c}{A^T} = \left( {{\lambda _1}{u_1}u_1^T + {\lambda _2}{u_2}u_2^T + \cdots + {\lambda _j}{u_j}u_j^T + {\lambda _n}{u_n}u_n^T} \right){u_j}\\ = \left( {{\lambda _1}{u_1}u_1^T} \right){u_j} + \left( {{\lambda _2}{u_2}u_2^T} \right){u_j} + ..... + \left( {{\lambda _j}{u_j}u_j^T} \right){u_j} + .... + \left( {{\lambda _n}{u_n}u_n^T} \right){u_j}\\ = {\lambda _1}\left( {{u_j}u_1^T} \right){u_j} + {\lambda _2}\left( {{u_j}u_2^T} \right){u_j} + ..... + {\lambda _j}\left( {{u_j}u_j^T} \right){u_j} + ... + {\lambda _n}\left( {{u_n}u_n^T} \right){u_j}\\ = {\lambda _1}\left( 0 \right)\left( {{u_1}} \right) + {\lambda _2}\left( 0 \right)\left( {{u_2}} \right) + .... + {\lambda _j}\left( 1 \right)\left( {{u_j}} \right) + .... + {\lambda _n}\left( 0 \right)\left( {u_n^T} \right)\\ = {\lambda _j}{u_j}\end{array}\)

Next step;

\(\)

\(\begin{array}{l}{A^T} = {\lambda _1}{u_1}u_1^T + {\lambda _2}{u_2}u_2^T + \cdots + {\lambda _n}{u_n}u_n^T\\{A^T} = A\end{array}\)

That’s why the matrix is symmetric

02

(b) The condition to solve the matrix

Since the set\(\left\{ {{{\bf{u}}_1},{{\bf{u}}_2},....,{{\bf{u}}_n}} \right\}\)is an orthogonal basis, so\({\bf{u}}_i^T{{\bf{u}}_j} = \left\{ {\begin{array}{*{20}{c}}{1{\rm{ for }}i = j}\\{0{\rm{ for }}i \ne j}\end{array}} \right.\).

For the product\(A{u_j}\):

\(\begin{array}{c}{A^T} = {\left( {{\lambda _1}{u_1}u_1^T + {\lambda _2}{u_2}u_2^T + \cdots + {\lambda _n}{u_n}u_n^T} \right)^T}\\ = {\left( {{\lambda _1}{u_1}u_1^T} \right)^T} + {\left( {{\lambda _2}{u_2}u_2^T} \right)^T} + ..... + {\left( {{\lambda _n}{u_n}u_n^T} \right)^T}\\ = {\lambda _1}{\left( {{u_1}u_1^T} \right)^T} + {\lambda _2}{\left( {{u_2}u_2^T} \right)^T} + ..... + {\lambda _n}{\left( {{u_n}u_n^T} \right)^T}\\ = {\lambda _1}{\left( {u_1^T} \right)^T}{\left( {{u_1}} \right)^T} + {\lambda _2}{\left( {u_2^T} \right)^T}{\left( {{u_2}} \right)^T} + .... + {\lambda _n}\left( {{u_n}} \right){\left( {u_n^T} \right)^T}\end{array}\)

Hence,\(A{u_j} = {\lambda _j}{u_j}\).

Therefore, \({\lambda _1},{\lambda _2}, \cdots ,{\lambda _n}\) are the eigenvalues of \(A\).

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

Orthogonally diagonalize the matrices in Exercises 13–22, giving an orthogonal matrix\(P\)and a diagonal matrix\(D\). To save you time, the eigenvalues in Exercises 17–22 are: (17)\( - {\bf{4}}\), 4, 7; (18)\( - {\bf{3}}\),\( - {\bf{6}}\), 9; (19)\( - {\bf{2}}\), 7; (20)\( - {\bf{3}}\), 15; (21) 1, 5, 9; (22) 3, 5.

17. \(\left( {\begin{aligned}{{}}1&{ - 6}&4\\{ - 6}&2&{ - 2}\\4&{ - 2}&{ - 3}\end{aligned}} \right)\)

Classify the quadratic forms in Exercises 9–18. Then make a change of variable, \({\bf{x}} = P{\bf{y}}\), that transforms the quadratic form into one with no cross-product term. Write the new quadratic form. Construct \(P\) using the methods of Section 7.1.

11. \({\bf{2}}x_{\bf{1}}^{\bf{2}} - {\bf{4}}{x_{\bf{1}}}{x_{\bf{2}}} - x_{\bf{2}}^{\bf{2}}\)

Question 8: Use Exercise 7 to show that if A is positive definite, then A has a LU factorization, \(A = LU\), where U has positive pivots on its diagonal. (The converse is true, too).

Orthogonally diagonalize the matrices in Exercises 13–22, giving an orthogonal matrix \(P\) and a diagonal matrix \(D\). To save you time, the eigenvalues in Exercises 17–22 are: (17) \( - {\bf{4}}\), 4, 7; (18) \( - {\bf{3}}\), \( - {\bf{6}}\), 9; (19) \( - {\bf{2}}\), 7; (20) \( - {\bf{3}}\), 15; (21) 1, 5, 9; (22) 3, 5.

21. \(\left( {\begin{aligned}{{}}4&3&1&1\\3&4&1&1\\1&1&4&3\\1&1&3&4\end{aligned}} \right)\)

Determine which of the matrices in Exercises 7–12 are orthogonal. If orthogonal, find the inverse.

9. \(\left[ {\begin{aligned}{{}}{ - 4/5}&{\,\,\,3/5}\\{3/5}&{\,\,4/5}\end{aligned}} \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.