If $A$ is symmetric matrix and $P$ is matrix of orthogonal projection,what is then matrix $Pcdot A$?
$begingroup$
Let $A$ be symmetric matrix, and $P$ be matrix of orthogonal projection on null space of matrix $A$. What can you say about matrix $Pcdot A$ ?
$$ $$
The fact is that symmetric matrices have $n$ different eigenvalues, and $n$ different independent eigenvectors. That means that rank of symmetric matrix is full. Because of that, null space of symmetric matrix will be only zero-vector.I can conclude then that P can't be calculate on null space. Am I right?
$$ $$But if my P was matrix of orthogonal projection on column space of symmetric matrix $A$, I would say that P is identity matrix $(P=A(A^{T}A)^{-1}A^{T})$. So,matrix $PA$ will be only matrix $A$.
If someone wanted to find orthogonal projection of some vector on fundamental subspaces, that vector will be in column space of matrix $A$, because $v_p=Pv$ gives exactly that given vector, and null space of $A^{T}$ will be $v_p=(I-P)v=0$. I would like if someone correct me if I do something wrong..
linear-algebra
$endgroup$
add a comment |
$begingroup$
Let $A$ be symmetric matrix, and $P$ be matrix of orthogonal projection on null space of matrix $A$. What can you say about matrix $Pcdot A$ ?
$$ $$
The fact is that symmetric matrices have $n$ different eigenvalues, and $n$ different independent eigenvectors. That means that rank of symmetric matrix is full. Because of that, null space of symmetric matrix will be only zero-vector.I can conclude then that P can't be calculate on null space. Am I right?
$$ $$But if my P was matrix of orthogonal projection on column space of symmetric matrix $A$, I would say that P is identity matrix $(P=A(A^{T}A)^{-1}A^{T})$. So,matrix $PA$ will be only matrix $A$.
If someone wanted to find orthogonal projection of some vector on fundamental subspaces, that vector will be in column space of matrix $A$, because $v_p=Pv$ gives exactly that given vector, and null space of $A^{T}$ will be $v_p=(I-P)v=0$. I would like if someone correct me if I do something wrong..
linear-algebra
$endgroup$
$begingroup$
The $0$ matrix is symmetric and not of full rank.
$endgroup$
– kimchi lover
Feb 2 at 18:18
$begingroup$
Yes,you're right. But in generally, what can I say about matrix $PA$ ?
$endgroup$
– Figgaro
Feb 2 at 18:40
add a comment |
$begingroup$
Let $A$ be symmetric matrix, and $P$ be matrix of orthogonal projection on null space of matrix $A$. What can you say about matrix $Pcdot A$ ?
$$ $$
The fact is that symmetric matrices have $n$ different eigenvalues, and $n$ different independent eigenvectors. That means that rank of symmetric matrix is full. Because of that, null space of symmetric matrix will be only zero-vector.I can conclude then that P can't be calculate on null space. Am I right?
$$ $$But if my P was matrix of orthogonal projection on column space of symmetric matrix $A$, I would say that P is identity matrix $(P=A(A^{T}A)^{-1}A^{T})$. So,matrix $PA$ will be only matrix $A$.
If someone wanted to find orthogonal projection of some vector on fundamental subspaces, that vector will be in column space of matrix $A$, because $v_p=Pv$ gives exactly that given vector, and null space of $A^{T}$ will be $v_p=(I-P)v=0$. I would like if someone correct me if I do something wrong..
linear-algebra
$endgroup$
Let $A$ be symmetric matrix, and $P$ be matrix of orthogonal projection on null space of matrix $A$. What can you say about matrix $Pcdot A$ ?
$$ $$
The fact is that symmetric matrices have $n$ different eigenvalues, and $n$ different independent eigenvectors. That means that rank of symmetric matrix is full. Because of that, null space of symmetric matrix will be only zero-vector.I can conclude then that P can't be calculate on null space. Am I right?
$$ $$But if my P was matrix of orthogonal projection on column space of symmetric matrix $A$, I would say that P is identity matrix $(P=A(A^{T}A)^{-1}A^{T})$. So,matrix $PA$ will be only matrix $A$.
If someone wanted to find orthogonal projection of some vector on fundamental subspaces, that vector will be in column space of matrix $A$, because $v_p=Pv$ gives exactly that given vector, and null space of $A^{T}$ will be $v_p=(I-P)v=0$. I would like if someone correct me if I do something wrong..
linear-algebra
linear-algebra
asked Feb 2 at 18:16
FiggaroFiggaro
406
406
$begingroup$
The $0$ matrix is symmetric and not of full rank.
$endgroup$
– kimchi lover
Feb 2 at 18:18
$begingroup$
Yes,you're right. But in generally, what can I say about matrix $PA$ ?
$endgroup$
– Figgaro
Feb 2 at 18:40
add a comment |
$begingroup$
The $0$ matrix is symmetric and not of full rank.
$endgroup$
– kimchi lover
Feb 2 at 18:18
$begingroup$
Yes,you're right. But in generally, what can I say about matrix $PA$ ?
$endgroup$
– Figgaro
Feb 2 at 18:40
$begingroup$
The $0$ matrix is symmetric and not of full rank.
$endgroup$
– kimchi lover
Feb 2 at 18:18
$begingroup$
The $0$ matrix is symmetric and not of full rank.
$endgroup$
– kimchi lover
Feb 2 at 18:18
$begingroup$
Yes,you're right. But in generally, what can I say about matrix $PA$ ?
$endgroup$
– Figgaro
Feb 2 at 18:40
$begingroup$
Yes,you're right. But in generally, what can I say about matrix $PA$ ?
$endgroup$
– Figgaro
Feb 2 at 18:40
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
The fact is that the symmetric matrices have $n$ linearly independent eigenvectors, but not $n$ distinct eigenvalues. Note that diagonal matrix is a special form of symmetric matrix. To each $i$-th diagonal entry, we can assign value $lambda_i$ to make any set of reals ${lambda_1,lambda_2,cdots,lambda_n}$, counted with multiplicity, as a set of eigenvalues of $A$. Accordingly, $ker A$ (the $0$ eigenspace) does not have to be trivial.
The answer to your problem is quite simple: $PA = O$ whenever $P$ is an orthogonal projection onto $ker A$. To see this, note that for all $y=Ax in mathcal R (A)$ (the range of $A$) and $zin ker A$, it holds that
$$
langle y,zrangle =langle Ax,zrangle = langle x,A^T zrangle = langle x,A zrangle=langle x, 0rangle=0.
$$ This shows $mathcal R(A)perp ker A$, which implies that $Py=PAx=0$ for all $x$. Thus $PA=O$.
$endgroup$
add a comment |
Your Answer
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3097592%2fif-a-is-symmetric-matrix-and-p-is-matrix-of-orthogonal-projection-what-is-th%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
The fact is that the symmetric matrices have $n$ linearly independent eigenvectors, but not $n$ distinct eigenvalues. Note that diagonal matrix is a special form of symmetric matrix. To each $i$-th diagonal entry, we can assign value $lambda_i$ to make any set of reals ${lambda_1,lambda_2,cdots,lambda_n}$, counted with multiplicity, as a set of eigenvalues of $A$. Accordingly, $ker A$ (the $0$ eigenspace) does not have to be trivial.
The answer to your problem is quite simple: $PA = O$ whenever $P$ is an orthogonal projection onto $ker A$. To see this, note that for all $y=Ax in mathcal R (A)$ (the range of $A$) and $zin ker A$, it holds that
$$
langle y,zrangle =langle Ax,zrangle = langle x,A^T zrangle = langle x,A zrangle=langle x, 0rangle=0.
$$ This shows $mathcal R(A)perp ker A$, which implies that $Py=PAx=0$ for all $x$. Thus $PA=O$.
$endgroup$
add a comment |
$begingroup$
The fact is that the symmetric matrices have $n$ linearly independent eigenvectors, but not $n$ distinct eigenvalues. Note that diagonal matrix is a special form of symmetric matrix. To each $i$-th diagonal entry, we can assign value $lambda_i$ to make any set of reals ${lambda_1,lambda_2,cdots,lambda_n}$, counted with multiplicity, as a set of eigenvalues of $A$. Accordingly, $ker A$ (the $0$ eigenspace) does not have to be trivial.
The answer to your problem is quite simple: $PA = O$ whenever $P$ is an orthogonal projection onto $ker A$. To see this, note that for all $y=Ax in mathcal R (A)$ (the range of $A$) and $zin ker A$, it holds that
$$
langle y,zrangle =langle Ax,zrangle = langle x,A^T zrangle = langle x,A zrangle=langle x, 0rangle=0.
$$ This shows $mathcal R(A)perp ker A$, which implies that $Py=PAx=0$ for all $x$. Thus $PA=O$.
$endgroup$
add a comment |
$begingroup$
The fact is that the symmetric matrices have $n$ linearly independent eigenvectors, but not $n$ distinct eigenvalues. Note that diagonal matrix is a special form of symmetric matrix. To each $i$-th diagonal entry, we can assign value $lambda_i$ to make any set of reals ${lambda_1,lambda_2,cdots,lambda_n}$, counted with multiplicity, as a set of eigenvalues of $A$. Accordingly, $ker A$ (the $0$ eigenspace) does not have to be trivial.
The answer to your problem is quite simple: $PA = O$ whenever $P$ is an orthogonal projection onto $ker A$. To see this, note that for all $y=Ax in mathcal R (A)$ (the range of $A$) and $zin ker A$, it holds that
$$
langle y,zrangle =langle Ax,zrangle = langle x,A^T zrangle = langle x,A zrangle=langle x, 0rangle=0.
$$ This shows $mathcal R(A)perp ker A$, which implies that $Py=PAx=0$ for all $x$. Thus $PA=O$.
$endgroup$
The fact is that the symmetric matrices have $n$ linearly independent eigenvectors, but not $n$ distinct eigenvalues. Note that diagonal matrix is a special form of symmetric matrix. To each $i$-th diagonal entry, we can assign value $lambda_i$ to make any set of reals ${lambda_1,lambda_2,cdots,lambda_n}$, counted with multiplicity, as a set of eigenvalues of $A$. Accordingly, $ker A$ (the $0$ eigenspace) does not have to be trivial.
The answer to your problem is quite simple: $PA = O$ whenever $P$ is an orthogonal projection onto $ker A$. To see this, note that for all $y=Ax in mathcal R (A)$ (the range of $A$) and $zin ker A$, it holds that
$$
langle y,zrangle =langle Ax,zrangle = langle x,A^T zrangle = langle x,A zrangle=langle x, 0rangle=0.
$$ This shows $mathcal R(A)perp ker A$, which implies that $Py=PAx=0$ for all $x$. Thus $PA=O$.
answered Feb 2 at 18:40


SongSong
18.6k21651
18.6k21651
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3097592%2fif-a-is-symmetric-matrix-and-p-is-matrix-of-orthogonal-projection-what-is-th%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
The $0$ matrix is symmetric and not of full rank.
$endgroup$
– kimchi lover
Feb 2 at 18:18
$begingroup$
Yes,you're right. But in generally, what can I say about matrix $PA$ ?
$endgroup$
– Figgaro
Feb 2 at 18:40