Question

In: Statistics and Probability

3. Let P be an nxn projection matrix (which means that it satisfies P2=P and PT=P)....

3. Let P be an nxn projection matrix (which means that it satisfies P2=P and PT=P). The goal of this problem is to show that P as a linear transformation is the orthogonal projection onto the range of P.

(a) Show that if v is in the range of P, then Pv=v.

(b) Show that if v is orthogonal to the range of P then Pv=0. (Hint: PPv lies in the range of P, hence is orthogonal to v. Study the dot product of v with PPv.)

(c) The previous parts show that P and the projection map act the same way on vectors that lie either in the range of P or the orthogonal complement of it. Why does this imply that P and the projection map agree on all vectors?

Solutions

Expert Solution


a) Let , then such that

                                              

b) Let be orthogonal to the Range(P), then: <.> (denotes dot product)

                                    

For each . This we already proved.

Then,

Now, in particular :

                            

Rewriting the dot product:

So,

This is only possible if .

This completes the proof.

c) If two linear transformations map a basis to the same image then they are equal!!

We can write any vector as a sum of a vector in Range(P) and in the Nullspace of P. This is true from the Rank-Nullity theorem.

                                Orthogonal complement of Range(P)

The projection map maps this to w. And:

                           

Hence, the projection matrix and map agree on all vectors.

                                          


Related Solutions

1) Let A be nxn matrix and Ax=b, if we need change A to Upper triangular...
1) Let A be nxn matrix and Ax=b, if we need change A to Upper triangular matrix using Gaussian Elimination, how many additions/subtraction operations are involved? how many multiplication/division operations are involved? 2) Once we got the upper triangular matrix, now we need to apply back-substitution, how many additions/subtraction operations are involved? how many multiplication/division operations are involved?
Let A be an m × n matrix and B be an m × p matrix....
Let A be an m × n matrix and B be an m × p matrix. Let C =[A | B] be an m×(n + p) matrix. (a) Show that R(C) = R(A) + R(B), where R(·) denotes the range of a matrix. (b) Show that rank(C) = rank(A) + rank(B)−dim(R(A)∩R(B)).
Let A be a diagonalizable n × n matrix and let P be an invertible n...
Let A be a diagonalizable n × n matrix and let P be an invertible n × n matrix such that B = P−1AP is the diagonal form of A. Prove that Ak = PBkP−1, where k is a positive integer. Use the result above to find the indicated power of A. A = 6 0 −4 7 −1 −4 6 0 −4 , A5 A5 =
Let A be a diagonalizable n × n matrix and let P be an invertible n...
Let A be a diagonalizable n × n matrix and let P be an invertible n × n matrix such that B = P−1AP is the diagonal form of A. Prove that Ak = PBkP−1, where k is a positive integer. Use the result above to find A5 A = 4 0 −4 5 −1 −4 6 0 −6
Find an orthogonal matrix P that diagonalizes the following matrix A: A is 3 by 3...
Find an orthogonal matrix P that diagonalizes the following matrix A: A is 3 by 3 matrix: (3 1 0 1 -1 1 0 0 2)
Problem 4. Let P be the orthogonal projection associated with a closed subspace S in a...
Problem 4. Let P be the orthogonal projection associated with a closed subspace S in a Hilbert space H, that is P is a linear operator such that P(f) = f if f ∈ S and P(f) = 0 if f ∈ S⊥. (a) Show that P2 = P and P∗ = P. (b) Conversely, if P is any bounded operator satisfying P2 = P and P∗ = P, prove that P is the orthogonal projection for some closed subspace...
Let W be a subspace of R^n, and P the orthogonal projection onto W. Then Ker...
Let W be a subspace of R^n, and P the orthogonal projection onto W. Then Ker P is W^perp.
Let pi = P(X = i) and suppose that p1 + p2 + p3 + p4...
Let pi = P(X = i) and suppose that p1 + p2 + p3 + p4 = 1. Suppose that E(X) = 2.5. (a) What values of p1, p2, p3, and p4 maximize Var(X)? (b) What values of p1, p2, p3, and p4 minimize Var(X)?
Let A be an n × n matrix which is not 0 but A2 = 0....
Let A be an n × n matrix which is not 0 but A2 = 0. Let I be the identity matrix. a)Show that A is not diagonalizable. b)Show that A is not invertible. c)Show that I-A is invertible and find its inverse.
solve for matrix B Let I be Identity matrix (I-2B)-1= 1 -3 3 -2 2 -5...
solve for matrix B Let I be Identity matrix (I-2B)-1= 1 -3 3 -2 2 -5 3 -8 9
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT