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

Let B be an \(n \times n\) symmetric matrix such that \({B^{\bf{2}}} = B\). Any such matrix is called a projection matrix (or an orthogonal projection matrix.) Given any y in \({\mathbb{R}^n}\), let \({\bf{\hat y}} = B{\bf{y}}\)and\({\bf{z}} = {\bf{y}} - {\bf{\hat y}}\).

a) Show that z is orthogonal to \({\bf{\hat y}}\).

b) Let W be the column space of B. Show that y is the sum of a vector in W and a vector in \({W^ \bot }\). Why does this prove that By is the orthogonal projection of y onto the column space of B?

Short Answer

Expert verified

a. It is proved that z is orthogonal to \({\bf{\hat y}}\).

b. It is proved that \({\bf{y}} - {\bf{\hat y}}\) is in \({W^ \bot }\), and decomposition \({\bf{y}} = {\bf{\hat y}} + \left( {{\bf{y}} - {\bf{\hat y}}} \right)\) expresses y as the sum of vector in W and another vector in \({W^ \bot }\).

Step by step solution

01

Step 1:Find an answer for part (a)

Find the product of z and \({\bf{\hat y}}\).

\(\begin{aligned}{}{\bf{z\hat y}} &= \left( {{\bf{y}} - {\bf{\hat y}}} \right)\left( {B{\bf{y}}} \right)\\ & = {\bf{y}}\left( {B{\bf{y}}} \right) - \left( {B{\bf{y}}} \right)\left( {B{\bf{y}}} \right)\\ & = {\bf{y}}\left( {B{\bf{y}}} \right) - B\left( {{\bf{y}}B} \right){\bf{y}}\\ & = {\bf{y}}\left( {B{\bf{y}}} \right) - {\bf{y}}\left( {BB} \right){\bf{y}}\\ & = {\bf{y}}\left( {B{\bf{y}}} \right) - {\bf{y}}\left( {B{\bf{y}}} \right)\\& = 0\end{aligned}\)

Thus, z is orthogonal to \({\bf{\hat y}}\).

02

Step 2:Find an answer for part (b)

As W is a column space of B, therefore;

\(\begin{aligned}{}\left( {{\bf{y}} - {\bf{\hat y}}} \right) \cdot \left( {B{\bf{u}}} \right) & = \left[ {B\left( {{\bf{y}} - {\bf{\hat y}}} \right)} \right] \cdot {\bf{u}}\\ & = \left[ {B{\bf{y}} - BB{\bf{y}}} \right] \cdot {\bf{u}}\\ & = \left[ {B{\bf{y}} - B{\bf{y}}} \right] \cdot {\bf{u}}\\ & = 0\end{aligned}\)

Thus, \({\bf{y}} - {\bf{\hat y}}\) is in \({W^ \bot }\), and decomposition \({\bf{y}} = {\bf{\hat y}} + \left( {{\bf{y}} - {\bf{\hat y}}} \right)\) express y as the sum of vector in W and another vector in \({W^ \bot }\).

According to Orthogonal Decomposition Theorem, the decomposition \({\bf{y}} = {\bf{\hat y}} + \left( {{\bf{y}} - {\bf{\hat y}}} \right)\) is unique.Thus, \({\bf{\hat y}}\) must be the projection of y.

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

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}}\)

Question: In Exercises 15 and 16, construct the pseudo-inverse of \(A\). Begin by using a matrix program to produce the SVD of \(A\), or, if that is not available, begin with an orthogonal diagonalization of \({A^T}A\). Use the pseudo-inverse to solve \(A{\rm{x}} = {\rm{b}}\), for \({\rm{b}} = \left( {6, - 1, - 4,6} \right)\) and let \(\mathop {\rm{x}}\limits^\^ \)be the solution. Make a calculation to verify that \(\mathop {\rm{x}}\limits^\^ \) is in Row \(A\). Find a nonzero vector \({\rm{u}}\) in Nul\(A\), and verify that \(\left\| {\mathop {\rm{x}}\limits^\^ } \right\| < \left\| {\mathop {\rm{x}}\limits^\^ + {\rm{u}}} \right\|\), which must be true by Exercise 13(c).

16. \(A = \left( {\begin{array}{*{20}{c}}4&0&{ - 1}&{ - 2}&0\\{ - 5}&0&3&5&0\\{\,\,\,2}&{\,\,0}&{ - 1}&{ - 2}&0\\{\,\,\,6}&{\,\,0}&{ - 3}&{ - 6}&0\end{array}} \right)\)

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.

20. \(\left( {\begin{aligned}{{}}5&8&{ - 4}\\8&5&{ - 4}\\{ - 4}&{ - 4}&{ - 1}\end{aligned}} \right)\)

Question: 3. Let A be an \(n \times n\) symmetric matrix of rank r. Explain why the spectral decomposition of A represents A as the sum of r rank 1 matrices.

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

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