Finding the rank of a projection of u onto v ?

In summary: R3- would map into the same two dimensional vector, so the rank would be 1 and the nullity would be 2.
  • #1
mohdhm
42
0
hello again,

I'm once again stumped, i was asked to find the rank and nullity of the projection u onto v so here is the given:

T(u)=ProjvU, where v = <2,4>

and this is what i did:

let u = <u1 , u2> and plugged everything in the projection formula and ended up with < 4 + 2(u1) , -16 + 4 (u2)> / sqrt(20)

how am i supposed to get the rank from that, it is not even a matrix! all i can think of is that a projection diagram looks like a right triangle and i would assosiate that with triangular matricies and triangular matricies have a pivot in every column, therefore the rank should be 2. and therefore nullity is 0 .

am i on the right track? thanks in advance.
 
Physics news on Phys.org
  • #2
mohdhm said:
hello again,

I'm once again stumped, i was asked to find the rank and nullity of the projection u onto v so here is the given:

T(u)=ProjvU, where v = <2,4>

and this is what i did:

let u = <u1 , u2> and plugged everything in the projection formula and ended up with < 4 + 2(u1) , -16 + 4 (u2)> / sqrt(20)

how am i supposed to get the rank from that, it is not even a matrix! all i can think of is that a projection diagram looks like a right triangle and i would assosiate that with triangular matricies and triangular matricies have a pivot in every column, therefore the rank should be 2. and therefore nullity is 0 .

am i on the right track? thanks in advance.

Hi mohdhm! :smile:

I'm not following you … what are the spaces U and V? :confused:
 
  • #3
i'm sorry mate, u and v are vectors. (and u1 is the x component of u, and u2 is the y component of u, etc.)

and the question was supposed to be:

find the rank and nullity of linear transformation T(u) = ProjvU where v is (1,5). i just assumed that u = < u1, u2>... how do we get a matrix out of that?
 
Last edited:
  • #4
That doesn't answer the question- vectors in what vector space? I suspect U and V are both R2 from the way you have written the vectors.

First, you haven't shown how you got those calculations but the result you give is now where near correct. In particular, NO linear transformation, in particular no projection can have numbers that are not multiplied by u1, u2, the components of the matrix. What I get for the projection of <u1, u2> is <u1+ 2u2, 2u1+ 4u2>/5.

Second, a projection is a linear transformation and any linear transformation can be written as a matrix. Using the standard basis, <1, 0> and <0, 1>, <1, 0> is projected to <1/5, 2/5> and <0, 1> is projected to <2/5, 4/5>. That corresponds to the matrix
[tex]\left[\begin{array}{cc}\frac{1}{5} & \frac{2}{5} \\ \frac{2}{5} & \frac{4}{5}\end{array}\right][/tex]
You idea about how a projection looks like a triangle so its matrix must be triangular makes no sense at all.

Finally, you don't need to do any of those calculations. the "rank" of a linear transformation, A, on vector space U, is just the dimension of its image, A(U). In the case of a projection onto a single line, that's trivial.
 
  • #5
one last question mate, why do you use the standard basis in this case?
 
  • #6
Because there was no reason to use any other basis. Another basis would give a matrix equivalent to that (A equivalent to B if and only if there exist an invertible matrix P such that A= PBP-1 or, equivalently, AP= PB. Two matrices are equivalent if and only if they represent the same linear transformation in two different bases.) If I had, for example, used v= <2,4> and <4, -2>, which is orthogonal to v as basis, since the projection of v is just itself and of <4, -2> is the 0 vector, the matrix in that basis is just
[tex]\left[\begin{array}{cc}1 & 0 \\ 0 & 0\end{array}\right][/tex]

Do you see that
[tex]\left[\begin{array}{cc}\frac{1}{5} & \frac{2}{5} \\ \frac{2}{5} & \frac{4}{5}\end{array}\right]\left[\begin{array}{cc}1 & -2 \\ 2 & 1\end{array}\right]= \left[\begin{array}{cc} 1 & -2 \\ 2 & 1\end{array}\right]\left[\begin{array}{cc}1 & 0 \\ 0 & 0\end{array}\right][/tex]

Can you now answer this: Suppose P(v) is the projection from from R[3] to the plane,through the origin, given by 3x+ 3y+ z= 0. What are the rank and nullity (dimension of kernel) of P?

You should be able to write them down immediately without doing any calculation.
 
  • #7
yup, solved it. thankyou.
 
  • #8
So, what was your answer?
 
  • #9
wait answered th wrong question
 
  • #10
the answer is rank = 1 and nullity = 2 for your question
 
  • #11
No, it's the other way around! Since the projection was onto a plane, the projection maps a 3 dimensional vector into a two dimensional vector. Any vector perpendicular to the plane- that is any vector on the line through (0,0,0) perpendicular to that plane is mapped into the 0 vector and so is in the kernel of the projection. The rank is 2 and the nullity is 1.

For your original problem, you had a projection from two dimensional space onto a one dimensional subspace, a line. Any vector perpendicular to that, that is any vector parallel to the line perpendicular to the vector <2, 4> is in the null space. Hopefully you got 1 for both rank and nullity.
 

Related to Finding the rank of a projection of u onto v ?

1. What is the definition of a projection?

A projection is a mathematical operation where a vector or point is mapped onto a lower-dimensional subspace or plane.

2. How do you find the rank of a projection?

The rank of a projection can be found by determining the number of linearly independent vectors in the subspace onto which the projection is being made.

3. What is the difference between a projection and an orthogonal projection?

An orthogonal projection is a type of projection where the projected vector is perpendicular to the subspace onto which it is being projected. This means that the dot product of the projected vector and any vector in the subspace is equal to 0.

4. Can the rank of a projection be greater than the dimension of the subspace onto which it is being projected?

No, the rank of a projection onto a subspace cannot be greater than the dimension of that subspace. This is because the rank represents the maximum number of linearly independent vectors that can exist in a subspace.

5. How is a projection matrix used to find the rank of a projection?

A projection matrix is a matrix that can be used to perform a projection onto a subspace. To find the rank of a projection, the projection matrix can be reduced to row-echelon form and the number of non-zero rows will correspond to the rank of the projection.

Similar threads

  • Engineering and Comp Sci Homework Help
Replies
4
Views
1K
  • Linear and Abstract Algebra
Replies
9
Views
4K
  • Calculus and Beyond Homework Help
Replies
12
Views
1K
  • Calculus and Beyond Homework Help
Replies
1
Views
2K
  • Engineering and Comp Sci Homework Help
Replies
1
Views
1K
  • Precalculus Mathematics Homework Help
Replies
2
Views
3K
  • Precalculus Mathematics Homework Help
Replies
4
Views
3K
  • Calculus and Beyond Homework Help
Replies
1
Views
991
Replies
1
Views
2K
Replies
7
Views
2K
Back
Top