Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I'm stuck on a review problem.

Consider the matrix:

$$\left[ \begin{array}{ccc} -1 & 1 \\ 1 & 1\\ 2 & 1 \end{array} \right] $$

I'm asked to find a matrix $P$ which projects onto the range of $A$, with respect to the standard basis.

I'm not actually sure how to tackle this problem. I know that if you want to project a vector $u$ onto a vector $v$, you do $\operatorname{proj}_v u = \frac{\langle u,v\rangle}{\langle v.v\rangle}v$. Does a similar procedure exist if you want to project a matrix onto another matrix?

Also, what do they mean by range of $A$? By googling, it appears to refer to the column space, but if that's true, then what is the domain of a matrix? Does it even exist?

So it's easy to see that the two columns of $A$ are linearly independent, so they form a basis for $C(A)$. How should I go about solving the given problem? Also, what if I have to do it with respect to a non-standard basis?

Thanks for your help.

share|improve this question

2 Answers 2

up vote 2 down vote accepted

Let your matrix be $A$. Then the projection matrix onto $R(A)$ is $P_{R(A)}=A(A^TA)^{-1}A^T$.

Indeed, the range of $A$, denoted $R(A)$, is the column space of $A$.

For a non-standard basis, express $A$ in the new basis, and then apply the above formula.

Edited: The intuition on the structure of the projection matrix $P$ is as follows. The defining property of $P$ is that for any vector $x$ we must have that $x-Px \perp R(A)$ or equivalently that $x-Px \in R(A)^{\perp}$ and since $R(A)^{\perp}=N(A^T)$, this yields $x-Px \in N(A^T)$. So $A^T (x-Px)=0$ for all $x$. Selecting $x=e_1, e_2, ..., e_n$, the standard basis yields $n$ equations, $A^T P e_i = A^T e_i, i=1, ...,n$. Now, the minimum norm solution of the $i^{th}$ system with respect to $Pe_i$ is $Pe_i = A (A^T A)^{-1}A^T e_i$. Grouping all these equations in matrix notation yields $P=A (A^T A)^{-1}A^T$.

share|improve this answer
    
Thanks. What is the intuition behind that i.e. how do you derive that formulation for the projection matrix? –  John Doe Dec 14 '11 at 0:25
    
@JohnDoe: I added how can one construct the projection matrix. –  Manos Dec 14 '11 at 3:34

Manos posted $A(A^TA)^{-1}A^T$. Since the proof is so simple, I'll add it here.

Any vector can be written as $u+v$, where $u$ is in the column space of $A$ and $v$ is orthogonal to the column space of $A$. What must be proved is then that $A(A^TA)^{-1}A^T(u+v)= u$. Notice that $A^Tv = 0$, so we must only consider $A(A^TA)^{-1}A^Tu$. Since $u$ is in the column space of $A$, we have $u=Aw$ (where, in this case, $w$ is in $\mathbb{R}^2$). So $$ A(A^TA)^{-1}A^T u = \Big(A(A^TA)^{-1}A^T \Big) Aw = A(A^TA)^{-1} \Big( A^T A\Big)w. $$ Do the obvious cancelation and get $Aw$ and remember that $Aw=u$.

share|improve this answer
    
Makes sense, thanks. –  John Doe Dec 14 '11 at 0:50

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.