Trace of symmetric matrix equals sum eigenvalues
up vote
3
down vote
favorite
I need to show that if $mathbf{S}$ is symmetric, then it's trace sums to the sum of the eigenvalues. But I don't know how to show this. Can anybody give me a hint?
P.S. Shame on my google skills, buy I really can't find any pages on this specific issue. Not with the assumption that $mathbf{S}$ is symmetric, and no proofs.
eigenvalues-eigenvectors trace symmetric-matrices
add a comment |
up vote
3
down vote
favorite
I need to show that if $mathbf{S}$ is symmetric, then it's trace sums to the sum of the eigenvalues. But I don't know how to show this. Can anybody give me a hint?
P.S. Shame on my google skills, buy I really can't find any pages on this specific issue. Not with the assumption that $mathbf{S}$ is symmetric, and no proofs.
eigenvalues-eigenvectors trace symmetric-matrices
2
This is true of any square matrix.
– amd
Nov 29 at 20:16
add a comment |
up vote
3
down vote
favorite
up vote
3
down vote
favorite
I need to show that if $mathbf{S}$ is symmetric, then it's trace sums to the sum of the eigenvalues. But I don't know how to show this. Can anybody give me a hint?
P.S. Shame on my google skills, buy I really can't find any pages on this specific issue. Not with the assumption that $mathbf{S}$ is symmetric, and no proofs.
eigenvalues-eigenvectors trace symmetric-matrices
I need to show that if $mathbf{S}$ is symmetric, then it's trace sums to the sum of the eigenvalues. But I don't know how to show this. Can anybody give me a hint?
P.S. Shame on my google skills, buy I really can't find any pages on this specific issue. Not with the assumption that $mathbf{S}$ is symmetric, and no proofs.
eigenvalues-eigenvectors trace symmetric-matrices
eigenvalues-eigenvectors trace symmetric-matrices
asked Nov 29 at 13:28
Casper Thalen
1678
1678
2
This is true of any square matrix.
– amd
Nov 29 at 20:16
add a comment |
2
This is true of any square matrix.
– amd
Nov 29 at 20:16
2
2
This is true of any square matrix.
– amd
Nov 29 at 20:16
This is true of any square matrix.
– amd
Nov 29 at 20:16
add a comment |
4 Answers
4
active
oldest
votes
up vote
4
down vote
accepted
If $S$ is a symmetric matrix then $S$ has a spectral decomposition as $S=PDP'$ where $D$ is the diagonal matrix consisting the eigenvalues of $S$ and $P$ is orthogonal. Then $tr(S)=tr(PDP')=tr(DP'P)=tr(D)=sum text{eigen values of } S.$
1
Yes, I litterally just figured this out! I came across this multiple times, but the step $tr(PDP')=tr(DP'P)$ seemed like a strech, as I've learned that order of multiplication matters in matrix algebra. However, when you realize that $tr(AB) = tr(BA)$ this step is easily shown to be justified! Thank you for your fast reply!
– Casper Thalen
Nov 29 at 13:37
add a comment |
up vote
3
down vote
The trace can be expressed as
$$
operatorname{Tr}A=sum_ke_k'Ae_k,
$$
where $e_k$ are any orthonormal vectors. Since we assume that the matrix $A$ is symmetric, its eigenvectors are orthogonal. Suppose that $v_k$ are eigenvectors of $A$ with their corresponding eigenvalues $lambda_k$. Then
$$
operatorname{Tr}A=sum_kv_k'Av_k=sum_kv_k'lambda_kv_k=sum_klambda_kv_k'v_k=sum_klambda_k.
$$
This is a very interesting approach, i didn't consider, thank you for this contribution!
– Casper Thalen
Nov 29 at 13:45
add a comment |
up vote
2
down vote
Every symmetric real matrix $M$ is diagonalizable (spectral theorem). So, $M$ is similar to a diagonal matrix $D$ and thereforebegin{align}operatorname{tr}M&=operatorname{tr}D\&=sumtext{ eigenvalues of }\&=sumtext{ eigenvalues of }M.end{align}
add a comment |
up vote
1
down vote
As the coefficient of $lambda^{n-1}$ in characteristic polynomial of $A$ is
$(-1)^{n-1}cdotoperatorname{Tr}(A)$
and $A$ is diagonalizable, the claim follows by Vieta.
add a comment |
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
4
down vote
accepted
If $S$ is a symmetric matrix then $S$ has a spectral decomposition as $S=PDP'$ where $D$ is the diagonal matrix consisting the eigenvalues of $S$ and $P$ is orthogonal. Then $tr(S)=tr(PDP')=tr(DP'P)=tr(D)=sum text{eigen values of } S.$
1
Yes, I litterally just figured this out! I came across this multiple times, but the step $tr(PDP')=tr(DP'P)$ seemed like a strech, as I've learned that order of multiplication matters in matrix algebra. However, when you realize that $tr(AB) = tr(BA)$ this step is easily shown to be justified! Thank you for your fast reply!
– Casper Thalen
Nov 29 at 13:37
add a comment |
up vote
4
down vote
accepted
If $S$ is a symmetric matrix then $S$ has a spectral decomposition as $S=PDP'$ where $D$ is the diagonal matrix consisting the eigenvalues of $S$ and $P$ is orthogonal. Then $tr(S)=tr(PDP')=tr(DP'P)=tr(D)=sum text{eigen values of } S.$
1
Yes, I litterally just figured this out! I came across this multiple times, but the step $tr(PDP')=tr(DP'P)$ seemed like a strech, as I've learned that order of multiplication matters in matrix algebra. However, when you realize that $tr(AB) = tr(BA)$ this step is easily shown to be justified! Thank you for your fast reply!
– Casper Thalen
Nov 29 at 13:37
add a comment |
up vote
4
down vote
accepted
up vote
4
down vote
accepted
If $S$ is a symmetric matrix then $S$ has a spectral decomposition as $S=PDP'$ where $D$ is the diagonal matrix consisting the eigenvalues of $S$ and $P$ is orthogonal. Then $tr(S)=tr(PDP')=tr(DP'P)=tr(D)=sum text{eigen values of } S.$
If $S$ is a symmetric matrix then $S$ has a spectral decomposition as $S=PDP'$ where $D$ is the diagonal matrix consisting the eigenvalues of $S$ and $P$ is orthogonal. Then $tr(S)=tr(PDP')=tr(DP'P)=tr(D)=sum text{eigen values of } S.$
answered Nov 29 at 13:34
John_Wick
1,134111
1,134111
1
Yes, I litterally just figured this out! I came across this multiple times, but the step $tr(PDP')=tr(DP'P)$ seemed like a strech, as I've learned that order of multiplication matters in matrix algebra. However, when you realize that $tr(AB) = tr(BA)$ this step is easily shown to be justified! Thank you for your fast reply!
– Casper Thalen
Nov 29 at 13:37
add a comment |
1
Yes, I litterally just figured this out! I came across this multiple times, but the step $tr(PDP')=tr(DP'P)$ seemed like a strech, as I've learned that order of multiplication matters in matrix algebra. However, when you realize that $tr(AB) = tr(BA)$ this step is easily shown to be justified! Thank you for your fast reply!
– Casper Thalen
Nov 29 at 13:37
1
1
Yes, I litterally just figured this out! I came across this multiple times, but the step $tr(PDP')=tr(DP'P)$ seemed like a strech, as I've learned that order of multiplication matters in matrix algebra. However, when you realize that $tr(AB) = tr(BA)$ this step is easily shown to be justified! Thank you for your fast reply!
– Casper Thalen
Nov 29 at 13:37
Yes, I litterally just figured this out! I came across this multiple times, but the step $tr(PDP')=tr(DP'P)$ seemed like a strech, as I've learned that order of multiplication matters in matrix algebra. However, when you realize that $tr(AB) = tr(BA)$ this step is easily shown to be justified! Thank you for your fast reply!
– Casper Thalen
Nov 29 at 13:37
add a comment |
up vote
3
down vote
The trace can be expressed as
$$
operatorname{Tr}A=sum_ke_k'Ae_k,
$$
where $e_k$ are any orthonormal vectors. Since we assume that the matrix $A$ is symmetric, its eigenvectors are orthogonal. Suppose that $v_k$ are eigenvectors of $A$ with their corresponding eigenvalues $lambda_k$. Then
$$
operatorname{Tr}A=sum_kv_k'Av_k=sum_kv_k'lambda_kv_k=sum_klambda_kv_k'v_k=sum_klambda_k.
$$
This is a very interesting approach, i didn't consider, thank you for this contribution!
– Casper Thalen
Nov 29 at 13:45
add a comment |
up vote
3
down vote
The trace can be expressed as
$$
operatorname{Tr}A=sum_ke_k'Ae_k,
$$
where $e_k$ are any orthonormal vectors. Since we assume that the matrix $A$ is symmetric, its eigenvectors are orthogonal. Suppose that $v_k$ are eigenvectors of $A$ with their corresponding eigenvalues $lambda_k$. Then
$$
operatorname{Tr}A=sum_kv_k'Av_k=sum_kv_k'lambda_kv_k=sum_klambda_kv_k'v_k=sum_klambda_k.
$$
This is a very interesting approach, i didn't consider, thank you for this contribution!
– Casper Thalen
Nov 29 at 13:45
add a comment |
up vote
3
down vote
up vote
3
down vote
The trace can be expressed as
$$
operatorname{Tr}A=sum_ke_k'Ae_k,
$$
where $e_k$ are any orthonormal vectors. Since we assume that the matrix $A$ is symmetric, its eigenvectors are orthogonal. Suppose that $v_k$ are eigenvectors of $A$ with their corresponding eigenvalues $lambda_k$. Then
$$
operatorname{Tr}A=sum_kv_k'Av_k=sum_kv_k'lambda_kv_k=sum_klambda_kv_k'v_k=sum_klambda_k.
$$
The trace can be expressed as
$$
operatorname{Tr}A=sum_ke_k'Ae_k,
$$
where $e_k$ are any orthonormal vectors. Since we assume that the matrix $A$ is symmetric, its eigenvectors are orthogonal. Suppose that $v_k$ are eigenvectors of $A$ with their corresponding eigenvalues $lambda_k$. Then
$$
operatorname{Tr}A=sum_kv_k'Av_k=sum_kv_k'lambda_kv_k=sum_klambda_kv_k'v_k=sum_klambda_k.
$$
answered Nov 29 at 13:44
Cm7F7Bb
12.3k32142
12.3k32142
This is a very interesting approach, i didn't consider, thank you for this contribution!
– Casper Thalen
Nov 29 at 13:45
add a comment |
This is a very interesting approach, i didn't consider, thank you for this contribution!
– Casper Thalen
Nov 29 at 13:45
This is a very interesting approach, i didn't consider, thank you for this contribution!
– Casper Thalen
Nov 29 at 13:45
This is a very interesting approach, i didn't consider, thank you for this contribution!
– Casper Thalen
Nov 29 at 13:45
add a comment |
up vote
2
down vote
Every symmetric real matrix $M$ is diagonalizable (spectral theorem). So, $M$ is similar to a diagonal matrix $D$ and thereforebegin{align}operatorname{tr}M&=operatorname{tr}D\&=sumtext{ eigenvalues of }\&=sumtext{ eigenvalues of }M.end{align}
add a comment |
up vote
2
down vote
Every symmetric real matrix $M$ is diagonalizable (spectral theorem). So, $M$ is similar to a diagonal matrix $D$ and thereforebegin{align}operatorname{tr}M&=operatorname{tr}D\&=sumtext{ eigenvalues of }\&=sumtext{ eigenvalues of }M.end{align}
add a comment |
up vote
2
down vote
up vote
2
down vote
Every symmetric real matrix $M$ is diagonalizable (spectral theorem). So, $M$ is similar to a diagonal matrix $D$ and thereforebegin{align}operatorname{tr}M&=operatorname{tr}D\&=sumtext{ eigenvalues of }\&=sumtext{ eigenvalues of }M.end{align}
Every symmetric real matrix $M$ is diagonalizable (spectral theorem). So, $M$ is similar to a diagonal matrix $D$ and thereforebegin{align}operatorname{tr}M&=operatorname{tr}D\&=sumtext{ eigenvalues of }\&=sumtext{ eigenvalues of }M.end{align}
edited Nov 29 at 21:33
Glorfindel
3,38471730
3,38471730
answered Nov 29 at 13:33
José Carlos Santos
143k20112211
143k20112211
add a comment |
add a comment |
up vote
1
down vote
As the coefficient of $lambda^{n-1}$ in characteristic polynomial of $A$ is
$(-1)^{n-1}cdotoperatorname{Tr}(A)$
and $A$ is diagonalizable, the claim follows by Vieta.
add a comment |
up vote
1
down vote
As the coefficient of $lambda^{n-1}$ in characteristic polynomial of $A$ is
$(-1)^{n-1}cdotoperatorname{Tr}(A)$
and $A$ is diagonalizable, the claim follows by Vieta.
add a comment |
up vote
1
down vote
up vote
1
down vote
As the coefficient of $lambda^{n-1}$ in characteristic polynomial of $A$ is
$(-1)^{n-1}cdotoperatorname{Tr}(A)$
and $A$ is diagonalizable, the claim follows by Vieta.
As the coefficient of $lambda^{n-1}$ in characteristic polynomial of $A$ is
$(-1)^{n-1}cdotoperatorname{Tr}(A)$
and $A$ is diagonalizable, the claim follows by Vieta.
edited Nov 29 at 20:05
answered Nov 29 at 16:05
Michael Hoppe
10.6k31733
10.6k31733
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3018616%2ftrace-of-symmetric-matrix-equals-sum-eigenvalues%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
2
This is true of any square matrix.
– amd
Nov 29 at 20:16