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.

19. Show that the columns of\(V\)are eigenvectors of\({A^T}A\), the columns of\(U\)are eigenvectors of\(A{A^T}\), and the diagonal entries of\({\bf{\Sigma }}\)are the singular values of \(A\). (Hint: Use the SVD to compute \({A^T}A\) and \(A{A^T}\).)

Short Answer

Expert verified

It is verified that, \(V\) and \(U\) are eigenvectors of \({A^T}A\) and \(A{A^T}\) respectively, and the columns of \(U\) re eigenvectors of \(A{A^T}\) and the diagonal elements of \(\Sigma \) are the singular values of \(A\).

Step by step solution

01

Find the product of \({A^T}\) and \(A\)

As singular value decomposition of\(A\)is \(A = U\Sigma {V^T}\), then

\(\begin{array}{c}{A^T}A = {\left( {U\Sigma {V^T}} \right)^T}U\Sigma {V^T}\\ = V\mathop \Sigma \limits^T {U^T}\Sigma {V^T}\\ = V\left( {\mathop \Sigma \limits^T \Sigma } \right){V^T}\\ = V\left( {\mathop \Sigma \limits^T \Sigma {V^{ - 1}}} \right)\end{array}\)

Therefore, from the Diagonalization theorem. Singular values are the diagonal entries in \(\Sigma \) matrix. The columns of matrix \(V\) are the eigenvectors of \({A^T}A\).

02

Find the product of \(A\) and \({A^T}\)

Now, find the product of \(A = U\Sigma {V^T}\) and its transpose.

\(\begin{array}{c}A{A^T} = U\Sigma {V^T}{\left( {U\Sigma {V^T}} \right)^T}\\ = U\mathop \Sigma \limits^T {V^T}V\mathop \Sigma \limits^T {U^T}\\ = U\left( {\Sigma \mathop \Sigma \limits^T } \right){U^T}\\ = U\left( {\Sigma \mathop \Sigma \limits^T } \right){U^{ - 1}}\end{array}\)

Thus, it can be observed that\(U\)diagonalizes\(A{A^T}\)and the columns of\(U\)must be eigenvectors of\(A{A^T}\).

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

Question 11: Prove that any \(n \times n\) matrix A admits a polar decomposition of the form \(A = PQ\), where P is a \(n \times n\) positive semidefinite matrix with the same rank as A and where Q is an \(n \times n\) orthogonal matrix. (Hint: Use a singular value decomposition, \(A = U\sum {V^T}\), and observe that \(A = \left( {U\sum {U^T}} \right)\left( {U{V^T}} \right)\).) This decomposition is used, for instance, in mechanical engineering to model the deformation of a material. The matrix P describe the stretching or compression of the material (in the directions of the eigenvectors of P), and Q describes the rotation of the material in space.

Question: 14. Exercises 12–14 concern an \(m \times n\) matrix \(A\) with a reduced singular value decomposition, \(A = {U_r}D{V_r}^T\), and the pseudoinverse \({A^ + } = {U_r}{D^{ - 1}}{V_r}^T\).

Given any \({\rm{b}}\) in \({\mathbb{R}^m}\), adapt Exercise 13 to show that \({A^ + }{\rm{b}}\) is the least-squares solution of minimum length. [Hint: Consider the equation \(A{\rm{x}} = {\rm{b}}\), where \(\mathop {\rm{b}}\limits^\^ \) is the orthogonal projection of \({\rm{b}}\) onto Col \(A\).

In Exercises 25 and 26, mark each statement True or False. Justify each answer.

26.

  1. There are symmetric matrices that are not orthogonally diagonizable.
  2. b. If \(B = PD{P^T}\), where \({P^T} = {P^{ - {\bf{1}}}}\) and D is a diagonal matrix, then B is a symmetric matrix.
  3. c. An orthogonal matrix is orthogonally diagonizable.
  4. d. The dimension of an eigenspace of a symmetric matrix is sometimes less than the multiplicity of the corresponding eigenvalue.

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

Find the matrix of the quadratic form. Assume x is in \({\mathbb{R}^2}\).

a. \(5x_1^2 + 16{x_1}{x_2} - 5x_2^2\)

b. \(2{x_1}{x_2}\)

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