Prove Property of Projection Matrices
Hey, lets say I have an orthogonal projection matrix $M(n)$ which is n x n so it depends on the number of observations $n$. Lets say I am projecting some vector $z(n)$, a n x 1 vector, on this space. I want to prove the following inequality holds (or not)? $$||M(n) z(n) || \leq ||M(n+1) z(n+1) ||$$ where $|| \cdot || $is Euclidean Distance. Note here, M(n+1) is M(n) with one new row appended. so its a (n+1) x (n+1) matrix. Similiarly z(n+1) is a (n+1) x 1 vector where we are simply appending a new observation to z(n). So as I add in new observations, changing my orthogonal projection matrix, I am increasing the sum of squared components. Very happy to give $10 for whoever solves this.
Answer
- The questioner was satisfied with and accepted the answer, or
- The answer was evaluated as being 100% correct by the judge.
Mathe
-
thanks for the response me be a bit clearer, so $z_{n+1}$ is $z_n$ with just one more element appended onto it, so we are adding new data.
-
so if it was the identity matrix, then we would be adding the square value of the new observation to the sumation increasing it as long its nonzero
-
A projection matrix has to be squared.
-
-
maybe I should change my notation, what I am trying to say is z_{n} is a n x 1 vector and z_{n+1} is an (n+1) x 1 vector. let me change that.
-
A projection matrix has to be squared, because it's a matrix that goes from $\mathbb{R}^m$ to $\mathbb{R}^m $
-
ok, hopefully that helps, so if M was an identity matrix, we would have ||I(n+1) z(n+1) || = || z(n+1) || = ||z(n) || + z_{n+1}^2
-
-
am I missing something still?
-
You are correct in the idea. But the formula is a little bit complicated. I will edit my response.
-
- answered
- 305 views
- $10.00
Related Questions
- Linear Algebra Exam
- Find $a,b,c$ so that $\begin{bmatrix} 0 & 1& 0 \\ 0 & 0 & 1\\ a & b & c \end{bmatrix} $ has the characteristic polynomial $-\lambda^3+4\lambda^2+5\lambda+6=0$
- Let $\mathbb{C} ^{2} $ a complex vector space over $\mathbb{C} $ . Find a complex subspace unidimensional $M$ $\subset \mathbb{C} ^{2} $ such that $\mathbb{C} ^{2} \cap M =\left \{ 0 \right \} $
- Consider the function, prove that it's bilinear, symmetric, and positive definite
- Suppose that $(ab)^3 = a^3 b^3$ for all $a, b \in G$. Prove that G must be an abelian goup [Group Theory].
- Questions about using matrices for finding best straight line by linear regression
- Find the values of a, for which the system is consistent. Give a geometric interpretation of the solution(s).
- Eigenvalues and eigenvectors of $\begin{bmatrix} 3 & 2 & 4 \\ 2 & 0 & 2 \\ 4 & 2 & 3 \end{bmatrix} $
