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

Let u be a unit vector in \({\mathbb{R}^n}\), and let \(B = {\bf{u}}{{\bf{u}}^T}\).

  1. Given any x in \({\mathbb{R}^n}\), compute Bx and show that Bx is the orthogonal projection of x onto u, as described in Section 6.2.
  2. Show that B is a symmetric matrix and \({B^{\bf{2}}} = B\).
  3. Show that u is an eigenvector of B. What is the corresponding eigenvalue?

In Exercises 17–24, \(A\) is an \(m \times n\) matrix with a singular value decomposition \(A = U\Sigma {V^T}\) ,

\(\)

where \(U\) is an \(m \times m\) orthogonal matrix, \({\bf{\Sigma }}\) is an \(m \times n\) “diagonal” matrix with \(r\) positive entries and no negative entries, and \(V\) is an \(n \times n\) orthogonal matrix. Justify each answer.

18. Suppose \(A\) is square and invertible. Find a singular value decomposition of \({A^{ - 1}}\)

Determine which of the matrices in Exercises 1–6 are symmetric.

2. \(\left( {\begin{aligned}{{}}3&{\,\, - 5}\\{ - 5}&{ - 3}\end{aligned}} \right)\)

Question: Mark Each statement True or False. Justify each answer. In each part, A represents an \(n \times n\) matrix.

  1. If A is orthogonally diagonizable, then A is symmetric.
  2. If A is an orthogonal matrix, then A is symmetric.
  3. If A is an orthogonal matrix, then \(\left\| {A{\bf{x}}} \right\| = \left\| {\bf{x}} \right\|\) for all x in \({\mathbb{R}^n}\).
  4. The principal axes of a quadratic from \({{\bf{x}}^T}A{\bf{x}}\) can be the columns of any matrix P that diagonalizes A.
  5. If P is an \(n \times n\) matrix with orthogonal columns, then \({P^T} = {P^{ - {\bf{1}}}}\).
  6. If every coefficient in a quadratic form is positive, then the quadratic form is positive definite.
  7. If \({{\bf{x}}^T}A{\bf{x}} > {\bf{0}}\) for some x, then the quadratic form \({{\bf{x}}^T}A{\bf{x}}\) is positive definite.
  8. By a suitable change of variable, any quadratic form can be changed into one with no cross-product term.
  9. The largest value of a quadratic form \({{\bf{x}}^T}A{\bf{x}}\), for \(\left\| {\bf{x}} \right\| = {\bf{1}}\) is the largest entery on the diagonal A.
  10. The maximum value of a positive definite quadratic form \({{\bf{x}}^T}A{\bf{x}}\) is the greatest eigenvalue of A.
  11. A positive definite quadratic form can be changed into a negative definite form by a suitable change of variable \({\bf{x}} = P{\bf{u}}\), for some orthogonal matrix P.
  12. An indefinite quadratic form is one whose eigenvalues are not definite.
  13. If P is an \(n \times n\) orthogonal matrix, then the change of variable \({\bf{x}} = P{\bf{u}}\) transforms \({{\bf{x}}^T}A{\bf{x}}\) into a quadratic form whose matrix is \({P^{ - {\bf{1}}}}AP\).
  14. If U is \(m \times n\) with orthogonal columns, then \(U{U^T}{\bf{x}}\) is the orthogonal projection of x onto ColU.
  15. If B is \(m \times n\) and x is a unit vector in \({\mathbb{R}^n}\), then \(\left\| {B{\bf{x}}} \right\| \le {\sigma _{\bf{1}}}\), where \({\sigma _{\bf{1}}}\) is the first singular value of B.
  16. A singular value decomposition of an \(m \times n\) matrix B can be written as \(B = P\Sigma Q\), where P is an \(m \times n\) orthogonal matrix and \(\Sigma \) is an \(m \times n\) diagonal matrix.
  17. If A is \(n \times n\), then A and \({A^T}A\) have the same singular values.

Determine which of the matrices in Exercises 1–6 are symmetric.

5. \(\left( {\begin{aligned}{{}{}}{ - 6}&2&0\\2&{ - 6}&2\\0&2&{ - 6}\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.

Sign-up for free