Question: 12. 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\).

Verify the properties of\({A^ + }\):

a. For each\({\rm{y}}\)in\({\mathbb{R}^m}\),\(A{A^ + }{\rm{y}}\)is the orthogonal projection of\({\rm{y}}\)onto\({\rm{Col}}\,A\).

b. For each\({\rm{x}}\)in\({\mathbb{R}^n}\),\({A^ + }A{\rm{x}}\)is the orthogonal projection of\({\rm{x}}\)onto\({\rm{Row}}\,A\).

c. \(A{A^ + }A = A\)and \({A^ + }A{A^ + } = {A^ + }\).

Short Answer

Expert verified
  1. It is verified that \(A{A^ + }{\rm{y}}\) is the orthogonal projection of \({\rm{y}}\)onto \({\rm{Col}}\,\,A\).
  2. It is verified that\(A{A^ + }{\rm{x}}\)is the orthogonal projection of\({\rm{x}}\)onto\({\rm{Row}}\,\,A\).
  3. It is verified that \(A{A^ + }A = A\) and \({A^ + }A{A^ + } = {A^ + }\).

Step by step solution

01

(a) Step 1: Simplify \(A{A^ + }{\rm{y}}\)

As the matrix\({V_r}\)has orthonormal columns, the matrix\(A{A^ + }{\rm{y}}\)can be written in terms of\({U_r}\),as shown below:

\(\begin{array}{c}A{A^ + }{\rm{y}} = \left( {{U_r}D{V_r}^T} \right)\left( {{V_r}{D^{ - 1}}{U_r}^T} \right){\rm{y}}\\ = \left( {{U_r}D{D^{ - 1}}{U_r}^T} \right){\rm{y}}\\ = \left( {{U_r}{U_r}^T} \right){\rm{y}}\end{array}\)

According to theorem 10, the matrix \(\left( {{U_r}{U_r}^T} \right){\rm{y}}\) is the orthogonal projection of \({\rm{y}}\) onto \({\rm{Col}}\,\,{U_r}\), which is equal to \({\rm{Col}}\,\,A\). Thus, \(A{A^ + }{\rm{y}}\) is the orthogonal projection of \({\rm{y}}\) onto \({\rm{Col}}\,\,A\).

02

(b) Step 2: Simplify \(A{A^ + }{\rm{x}}\)

As the matrix\({U_r}\)has orthonormal columns, the matrix\(A{A^ + }{\rm{x}}\)can be written in terms of\({V_r}\),as shown below:

\(\begin{array}{c}A{A^ + }{\rm{x}} = \left( {{V_r}D{U_r}^T} \right)\left( {{U_r}{D^{ - 1}}{V_r}^T} \right){\rm{y}}\\ = \left( {{V_r}D{D^{ - 1}}{V_r}^T} \right){\rm{y}}\\ = \left( {{V_r}{V_r}^T} \right){\rm{y}}\end{array}\)

According to theorem 10, the matrix \(\left( {{V_r}{V_r}^T} \right){\rm{x}}\) is the orthogonal projection of \({\rm{x}}\) onto \({\rm{Col}}\,\,{V_r}\), which is equal to \({\rm{Row}}\,A\). Thus, \(A{A^ + }{\rm{y}}\) is the orthogonal projection of \({\rm{x}}\) onto \({\rm{Row}}\,A\).

03

(c) Step 3: Simplify \(A{A^ + }A\) and \({A^ + }A{A^ + }\)

Apply the reduced singular value decomposition, definition of\({A^ + }\), and the associativity of matrix multiplication to simplify\(A{A^ + }A\)and\({A^ + }A{A^ + }\), as shown below:

\(\begin{array}{c}A{A^ + }A = \left( {{U_r}D{V_r}^T} \right)\left( {{V_r}{D^{ - 1}}{U_r}^T} \right)\left( {{U_r}D{V_r}^T} \right)\\ = \left( {{U_r}D{D^{ - 1}}{U_r}^T} \right)\left( {{U_r}D{V_r}^T} \right)\\ = {U_r}D{D^{ - 1}}{V_r}^T\\ = {U_r}D{V_r}^T\\ = A\end{array}\)

And,

\(\begin{array}{c}{A^ + }A{A^ + } = \left( {{V_r}{D^{ - 1}}{U_r}^T} \right)\left( {{U_r}D{V_r}^T} \right)\left( {{V_r}{D^{ - 1}}{U_r}^T} \right)\\ = \left( {{V_r}{D^{ - 1}}D{U_r}^T} \right)\left( {{V_r}D{U_r}^T} \right)\\ = {V_r}D{D^{ - 1}}{U_r}^T\\ = {V_r}D{U_r}^T\\ = {A^ + }\end{array}\)

Thus, it is verified that \(A{A^ + }A = A\) and \({A^ + }A{A^ + } = {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?

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.

14. \(\left( {\begin{aligned}{{}}{\,1}&{ - 5}\\{ - 5}&{\,\,1}\end{aligned}} \right)\)

Question: 13. 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\).

Suppose the equation\(A{\rm{x}} = {\rm{b}}\)is consistent, and let\({{\rm{x}}^ + } = {A^ + }{\rm{b}}\). By Exercise 23 in Section 6.3, there is exactly one vector\({\rm{p}}\)in Row\(A\)such that\(A{\rm{p}} = {\rm{b}}\). The following steps prove that\({{\rm{x}}^ + } = {\rm{p}}\)and\({{\rm{x}}^ + }\)is the minimum length solution of\(A{\rm{x}} = {\rm{b}}\).

  1. Show that \({{\rm{x}}^ + }\) is in Row \(A\). (Hint: Write \({\rm{b}}\) as \(A{\rm{x}}\) for some \({\rm{x}}\), and use Exercise 12.)
  2. Show that\({{\rm{x}}^ + }\)is a solution of\(A{\rm{x}} = {\rm{b}}\).
  3. Show that if \({\rm{u}}\) is any solution of \(A{\rm{x}} = {\rm{b}}\), then \(\left\| {{{\rm{x}}^ + }} \right\| \le \left\| {\rm{u}} \right\|\), with equality only if \({\rm{u}} = {{\rm{x}}^ + }\).

Suppose\(A = PR{P^{ - {\bf{1}}}}\), where P is orthogonal and R is upper triangular. Show that if A is symmetric, then R is symmetric and hence is actually a diagonal matrix.

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.

14. \({\bf{3}}x_{\bf{1}}^{\bf{2}} + {\bf{4}}{x_{\bf{1}}}{x_{\bf{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