Playing with projection matrices: How did A^3 become the identity matrix?

Lifprasir
Messages
16
Reaction score
0
*new question, playing with projection matrix.

Homework Statement


This is the first problem of our practice exam.
http://puu.sh/1jReL

And here's the solution.
http://puu.sh/1jRg3


Homework Equations



The standard matrix has to be 2x2 to be compatible u v w, so this must be the reason why he limited the matrix to A (u v) = (v w) instead of A (u v w) = (v w u).

And then he used matrix properties to solve for A, and got it.

However what I don't understand is the part where it says "Observe that A^3u = u, A^3 u = v.


The Attempt at a Solution



I've tried doing,

(u v) = D
(v w) = X

so, AD = X
A = XD^-1

Then I tried to reverse the observation by doing,

A^3u = u
A^3 = I
(XD^-1)(XD^-1)(XD^-1)=I, but that's as far as I'm able to go.

I really don't understand how he was able to see how A^3 was I..

Well I have a new question about the A(ATA)-1AT matrix.

http://puu.sh/1jXT6

I was able to show that BT was idempotent, but my manipulation was a bit different from the teacher for B2

Let B2 = (A(ATA)-1AT)(A(ATA)-1AT)

I did (AA-1(AT)-1AT)A(ATA)-1AT = IA(ATA)-1AT=A(ATA)-1AT=B

The teacher did it in another method and I don't think my method is correct because it doesn't make sense that B = I.
 
Last edited by a moderator:
Physics news on Phys.org
Hi Lifprasir! :smile:

(try using the X2 button just above the Reply box :wink:)
Lifprasir said:
However what I don't understand is the part where it says "Observe that A^3u = u, A^3 u = v.

Because S3(u) = u, S3(v) = v :wink:
 
Ooooooooooooooooooooh. Thank you so much!
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top