Mixing
Are the eigenvalues of a matrix and just its diagonal related?
$begingroup$
I have a matrix $textbf{A}$ and form the diagonal matrix $bar{textbf{A}}$ from the diagonal entries of $textbf{A}$. Is there a relationship between the eigenvalues of $textbf{A}$ and $bar{textbf{A}}$, or at least between their spectral norms $||textbf{A}||_2$ and $||bar{textbf{A}}||_2$?
linear-algebra matrices eigenvalues-eigenvectors spectral-norm
asked Jan 22 at 8:18
UndertherainbowUndertherainbow
319417
$endgroup$
|
show 1 more comment
$begingroup$
I have a matrix $textbf{A}$ and form the diagonal matrix $bar{textbf{A}}$ from the diagonal entries of $textbf{A}$. Is there a relationship between the eigenvalues of $textbf{A}$ and $bar{textbf{A}}$, or at least between their spectral norms $||textbf{A}||_2$ and $||bar{textbf{A}}||_2$?
linear-algebra matrices eigenvalues-eigenvectors spectral-norm
asked Jan 22 at 8:18
UndertherainbowUndertherainbow
319417
$endgroup$
3
$begingroup$
The sum of eigenvalues is equal to the trace, which is the sum of diagonal elements. Without further information it's impossible to deduce more.
$endgroup$
– user376343
Jan 22 at 9:07
$begingroup$
@user376343 What if $textbf{A}$ is also positive definite? Does that have any implications on the eigenvalues of $bar{textbf{A}}$?
$endgroup$
– Undertherainbow
Jan 22 at 9:10
1
$begingroup$
I very much doubt that there’s anything beyond the trace that @user376343 mentioned. The only eigenvalue of $I_2$ is $1$, but the eigenvalues of a $2times2$ matrix with $1$s on its main diagonal can be any two numbers that add up to $2$. The eigenvalues of $small{begin{bmatrix}1&1\-1&1end{bmatrix}}$ aren’t even real numbers.
$endgroup$
– amd
Jan 22 at 19:34
1
$begingroup$
@amd it is exactly what I sayd - from the trace we know the sum of eigenvalues and nothing else.
$endgroup$
– user376343
Jan 22 at 19:58
1
$begingroup$
@amd It might be interesting to you that the answers prove your suspicion wrong, both about the spectral norm (there is a strict inequality according to the OPs answer) and about all other eigenvalues (they are close to each other according to the Gershgorin circle theorem, depending on the size of the non-diagonal entries)
$endgroup$
– Bananach
Feb 2 at 21:54
|
show 1 more comment
$begingroup$
I have a matrix $textbf{A}$ and form the diagonal matrix $bar{textbf{A}}$ from the diagonal entries of $textbf{A}$. Is there a relationship between the eigenvalues of $textbf{A}$ and $bar{textbf{A}}$, or at least between their spectral norms $||textbf{A}||_2$ and $||bar{textbf{A}}||_2$?
linear-algebra matrices eigenvalues-eigenvectors spectral-norm
asked Jan 22 at 8:18
UndertherainbowUndertherainbow
319417
$endgroup$
I have a matrix $textbf{A}$ and form the diagonal matrix $bar{textbf{A}}$ from the diagonal entries of $textbf{A}$. Is there a relationship between the eigenvalues of $textbf{A}$ and $bar{textbf{A}}$, or at least between their spectral norms $||textbf{A}||_2$ and $||bar{textbf{A}}||_2$?
linear-algebra matrices eigenvalues-eigenvectors spectral-norm
linear-algebra matrices eigenvalues-eigenvectors spectral-norm
asked Jan 22 at 8:18
UndertherainbowUndertherainbow
319417
asked Jan 22 at 8:18
UndertherainbowUndertherainbow
319417
asked Jan 22 at 8:18
UndertherainbowUndertherainbow
319417
asked Jan 22 at 8:18
UndertherainbowUndertherainbow
319417
asked Jan 22 at 8:18
UndertherainbowUndertherainbow
319417
319417
3
$begingroup$
The sum of eigenvalues is equal to the trace, which is the sum of diagonal elements. Without further information it's impossible to deduce more.
$endgroup$
– user376343
Jan 22 at 9:07
$begingroup$
@user376343 What if $textbf{A}$ is also positive definite? Does that have any implications on the eigenvalues of $bar{textbf{A}}$?
$endgroup$
– Undertherainbow
Jan 22 at 9:10
1
$begingroup$
I very much doubt that there’s anything beyond the trace that @user376343 mentioned. The only eigenvalue of $I_2$ is $1$, but the eigenvalues of a $2times2$ matrix with $1$s on its main diagonal can be any two numbers that add up to $2$. The eigenvalues of $small{begin{bmatrix}1&1\-1&1end{bmatrix}}$ aren’t even real numbers.
$endgroup$
– amd
Jan 22 at 19:34
1
$begingroup$
@amd it is exactly what I sayd - from the trace we know the sum of eigenvalues and nothing else.
$endgroup$
– user376343
Jan 22 at 19:58
1
$begingroup$
@amd It might be interesting to you that the answers prove your suspicion wrong, both about the spectral norm (there is a strict inequality according to the OPs answer) and about all other eigenvalues (they are close to each other according to the Gershgorin circle theorem, depending on the size of the non-diagonal entries)
$endgroup$
– Bananach
Feb 2 at 21:54
|
show 1 more comment
3
$begingroup$
The sum of eigenvalues is equal to the trace, which is the sum of diagonal elements. Without further information it's impossible to deduce more.
$endgroup$
– user376343
Jan 22 at 9:07
$begingroup$
@user376343 What if $textbf{A}$ is also positive definite? Does that have any implications on the eigenvalues of $bar{textbf{A}}$?
$endgroup$
– Undertherainbow
Jan 22 at 9:10
1
$begingroup$
I very much doubt that there’s anything beyond the trace that @user376343 mentioned. The only eigenvalue of $I_2$ is $1$, but the eigenvalues of a $2times2$ matrix with $1$s on its main diagonal can be any two numbers that add up to $2$. The eigenvalues of $small{begin{bmatrix}1&1\-1&1end{bmatrix}}$ aren’t even real numbers.
$endgroup$
– amd
Jan 22 at 19:34
1
$begingroup$
@amd it is exactly what I sayd - from the trace we know the sum of eigenvalues and nothing else.
$endgroup$
– user376343
Jan 22 at 19:58
1
$begingroup$
@amd It might be interesting to you that the answers prove your suspicion wrong, both about the spectral norm (there is a strict inequality according to the OPs answer) and about all other eigenvalues (they are close to each other according to the Gershgorin circle theorem, depending on the size of the non-diagonal entries)
$endgroup$
– Bananach
Feb 2 at 21:54
3
3
$begingroup$
The sum of eigenvalues is equal to the trace, which is the sum of diagonal elements. Without further information it's impossible to deduce more.
$endgroup$
– user376343
Jan 22 at 9:07
$begingroup$
The sum of eigenvalues is equal to the trace, which is the sum of diagonal elements. Without further information it's impossible to deduce more.
$endgroup$
– user376343
Jan 22 at 9:07
$begingroup$
@user376343 What if $textbf{A}$ is also positive definite? Does that have any implications on the eigenvalues of $bar{textbf{A}}$?
$endgroup$
– Undertherainbow
Jan 22 at 9:10
$begingroup$
@user376343 What if $textbf{A}$ is also positive definite? Does that have any implications on the eigenvalues of $bar{textbf{A}}$?
$endgroup$
– Undertherainbow
Jan 22 at 9:10
1
1
$begingroup$
I very much doubt that there’s anything beyond the trace that @user376343 mentioned. The only eigenvalue of $I_2$ is $1$, but the eigenvalues of a $2times2$ matrix with $1$s on its main diagonal can be any two numbers that add up to $2$. The eigenvalues of $small{begin{bmatrix}1&1\-1&1end{bmatrix}}$ aren’t even real numbers.
$endgroup$
– amd
Jan 22 at 19:34
$begingroup$
I very much doubt that there’s anything beyond the trace that @user376343 mentioned. The only eigenvalue of $I_2$ is $1$, but the eigenvalues of a $2times2$ matrix with $1$s on its main diagonal can be any two numbers that add up to $2$. The eigenvalues of $small{begin{bmatrix}1&1\-1&1end{bmatrix}}$ aren’t even real numbers.
$endgroup$
– amd
Jan 22 at 19:34
1
1
$begingroup$
@amd it is exactly what I sayd - from the trace we know the sum of eigenvalues and nothing else.
$endgroup$
– user376343
Jan 22 at 19:58
$begingroup$
@amd it is exactly what I sayd - from the trace we know the sum of eigenvalues and nothing else.
$endgroup$
– user376343
Jan 22 at 19:58
1
1
$begingroup$
@amd It might be interesting to you that the answers prove your suspicion wrong, both about the spectral norm (there is a strict inequality according to the OPs answer) and about all other eigenvalues (they are close to each other according to the Gershgorin circle theorem, depending on the size of the non-diagonal entries)
$endgroup$
– Bananach
Feb 2 at 21:54
$begingroup$
@amd It might be interesting to you that the answers prove your suspicion wrong, both about the spectral norm (there is a strict inequality according to the OPs answer) and about all other eigenvalues (they are close to each other according to the Gershgorin circle theorem, depending on the size of the non-diagonal entries)
$endgroup$
– Bananach
Feb 2 at 21:54
|
show 1 more comment
2 Answers
2
active
oldest
votes
$begingroup$
The Gershgorin circle theorem bounds the distance of the eigenvalues to the diagonal elements
answered Jan 31 at 7:25
BananachBananach
3,86711429
$endgroup$
$begingroup$
Take that, delete-voter. The OP seems to disagree with you about the usefulness of this answer
$endgroup$
– Bananach
Mar 1 at 22:49
add a comment |
$begingroup$
There actually is a relationship between their spectral norms. In general, the spectral norm of $textbf{A}$ is greater than any of the entries of $textbf{A}$, i.e.
$$||textbf{A}||_2getextbf{A}_{ij}, forall i,j$$
The proof for this is as follows:
begin{align*}
||textbf{A}||_2&=sqrt{underset{textbf{x}}{text{sup}}frac{textbf{x}^Ttextbf{A}textbf{A}^Ttextbf{x}}{||textbf{x}||_2^2}}\
&=underset{||textbf{y}||_2=1}{text{sup}}underset{||textbf{x}||_2=1}{text{sup}}textbf{x}^Ttextbf{A}textbf{y}\
&getextbf{e}_i^Ttextbf{A}textbf{e}_j\
&=textbf{A}_{ij}
end{align*}
where $textbf{e}_i$ is a zero vector with a single $1$ in the $i$th entry. It follows that
$$||bar{textbf{A}}||_2=maxlimits_{i}|A_{ii}|le||textbf{A}||_2$$
answered Jan 31 at 7:21
UndertherainbowUndertherainbow
319417
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
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%2f3082880%2fare-the-eigenvalues-of-a-matrix-and-just-its-diagonal-related%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
The Gershgorin circle theorem bounds the distance of the eigenvalues to the diagonal elements
answered Jan 31 at 7:25
BananachBananach
3,86711429
$endgroup$
$begingroup$
Take that, delete-voter. The OP seems to disagree with you about the usefulness of this answer
$endgroup$
– Bananach
Mar 1 at 22:49
add a comment |
$begingroup$
The Gershgorin circle theorem bounds the distance of the eigenvalues to the diagonal elements
answered Jan 31 at 7:25
BananachBananach
3,86711429
$endgroup$
$begingroup$
Take that, delete-voter. The OP seems to disagree with you about the usefulness of this answer
$endgroup$
– Bananach
Mar 1 at 22:49
add a comment |
$begingroup$
The Gershgorin circle theorem bounds the distance of the eigenvalues to the diagonal elements
answered Jan 31 at 7:25
BananachBananach
3,86711429
$endgroup$
The Gershgorin circle theorem bounds the distance of the eigenvalues to the diagonal elements
answered Jan 31 at 7:25
BananachBananach
3,86711429
answered Jan 31 at 7:25
BananachBananach
3,86711429
answered Jan 31 at 7:25
BananachBananach
3,86711429
answered Jan 31 at 7:25
BananachBananach
3,86711429
3,86711429
$begingroup$
Take that, delete-voter. The OP seems to disagree with you about the usefulness of this answer
$endgroup$
– Bananach
Mar 1 at 22:49
add a comment |
$begingroup$
Take that, delete-voter. The OP seems to disagree with you about the usefulness of this answer
$endgroup$
– Bananach
Mar 1 at 22:49
$begingroup$
Take that, delete-voter. The OP seems to disagree with you about the usefulness of this answer
$endgroup$
– Bananach
Mar 1 at 22:49
$begingroup$
Take that, delete-voter. The OP seems to disagree with you about the usefulness of this answer
$endgroup$
– Bananach
Mar 1 at 22:49
add a comment |
$begingroup$
There actually is a relationship between their spectral norms. In general, the spectral norm of $textbf{A}$ is greater than any of the entries of $textbf{A}$, i.e.
$$||textbf{A}||_2getextbf{A}_{ij}, forall i,j$$
The proof for this is as follows:
begin{align*}
||textbf{A}||_2&=sqrt{underset{textbf{x}}{text{sup}}frac{textbf{x}^Ttextbf{A}textbf{A}^Ttextbf{x}}{||textbf{x}||_2^2}}\
&=underset{||textbf{y}||_2=1}{text{sup}}underset{||textbf{x}||_2=1}{text{sup}}textbf{x}^Ttextbf{A}textbf{y}\
&getextbf{e}_i^Ttextbf{A}textbf{e}_j\
&=textbf{A}_{ij}
end{align*}
where $textbf{e}_i$ is a zero vector with a single $1$ in the $i$th entry. It follows that
$$||bar{textbf{A}}||_2=maxlimits_{i}|A_{ii}|le||textbf{A}||_2$$
answered Jan 31 at 7:21
UndertherainbowUndertherainbow
319417
$endgroup$
add a comment |
$begingroup$
There actually is a relationship between their spectral norms. In general, the spectral norm of $textbf{A}$ is greater than any of the entries of $textbf{A}$, i.e.
$$||textbf{A}||_2getextbf{A}_{ij}, forall i,j$$
The proof for this is as follows:
begin{align*}
||textbf{A}||_2&=sqrt{underset{textbf{x}}{text{sup}}frac{textbf{x}^Ttextbf{A}textbf{A}^Ttextbf{x}}{||textbf{x}||_2^2}}\
&=underset{||textbf{y}||_2=1}{text{sup}}underset{||textbf{x}||_2=1}{text{sup}}textbf{x}^Ttextbf{A}textbf{y}\
&getextbf{e}_i^Ttextbf{A}textbf{e}_j\
&=textbf{A}_{ij}
end{align*}
where $textbf{e}_i$ is a zero vector with a single $1$ in the $i$th entry. It follows that
$$||bar{textbf{A}}||_2=maxlimits_{i}|A_{ii}|le||textbf{A}||_2$$
answered Jan 31 at 7:21
UndertherainbowUndertherainbow
319417
$endgroup$
add a comment |
$begingroup$
There actually is a relationship between their spectral norms. In general, the spectral norm of $textbf{A}$ is greater than any of the entries of $textbf{A}$, i.e.
$$||textbf{A}||_2getextbf{A}_{ij}, forall i,j$$
The proof for this is as follows:
begin{align*}
||textbf{A}||_2&=sqrt{underset{textbf{x}}{text{sup}}frac{textbf{x}^Ttextbf{A}textbf{A}^Ttextbf{x}}{||textbf{x}||_2^2}}\
&=underset{||textbf{y}||_2=1}{text{sup}}underset{||textbf{x}||_2=1}{text{sup}}textbf{x}^Ttextbf{A}textbf{y}\
&getextbf{e}_i^Ttextbf{A}textbf{e}_j\
&=textbf{A}_{ij}
end{align*}
where $textbf{e}_i$ is a zero vector with a single $1$ in the $i$th entry. It follows that
$$||bar{textbf{A}}||_2=maxlimits_{i}|A_{ii}|le||textbf{A}||_2$$
answered Jan 31 at 7:21
UndertherainbowUndertherainbow
319417
$endgroup$
There actually is a relationship between their spectral norms. In general, the spectral norm of $textbf{A}$ is greater than any of the entries of $textbf{A}$, i.e.
$$||textbf{A}||_2getextbf{A}_{ij}, forall i,j$$
The proof for this is as follows:
begin{align*}
||textbf{A}||_2&=sqrt{underset{textbf{x}}{text{sup}}frac{textbf{x}^Ttextbf{A}textbf{A}^Ttextbf{x}}{||textbf{x}||_2^2}}\
&=underset{||textbf{y}||_2=1}{text{sup}}underset{||textbf{x}||_2=1}{text{sup}}textbf{x}^Ttextbf{A}textbf{y}\
&getextbf{e}_i^Ttextbf{A}textbf{e}_j\
&=textbf{A}_{ij}
end{align*}
where $textbf{e}_i$ is a zero vector with a single $1$ in the $i$th entry. It follows that
$$||bar{textbf{A}}||_2=maxlimits_{i}|A_{ii}|le||textbf{A}||_2$$
answered Jan 31 at 7:21
UndertherainbowUndertherainbow
319417
answered Jan 31 at 7:21
UndertherainbowUndertherainbow
319417
answered Jan 31 at 7:21
UndertherainbowUndertherainbow
319417
answered Jan 31 at 7:21
UndertherainbowUndertherainbow
319417
319417
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%2f3082880%2fare-the-eigenvalues-of-a-matrix-and-just-its-diagonal-related%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
3
$begingroup$
The sum of eigenvalues is equal to the trace, which is the sum of diagonal elements. Without further information it's impossible to deduce more.
$endgroup$
– user376343
Jan 22 at 9:07
$begingroup$
@user376343 What if $textbf{A}$ is also positive definite? Does that have any implications on the eigenvalues of $bar{textbf{A}}$?
$endgroup$
– Undertherainbow
Jan 22 at 9:10
1
$begingroup$
I very much doubt that there’s anything beyond the trace that @user376343 mentioned. The only eigenvalue of $I_2$ is $1$, but the eigenvalues of a $2times2$ matrix with $1$s on its main diagonal can be any two numbers that add up to $2$. The eigenvalues of $small{begin{bmatrix}1&1\-1&1end{bmatrix}}$ aren’t even real numbers.
$endgroup$
– amd
Jan 22 at 19:34
1
$begingroup$
@amd it is exactly what I sayd - from the trace we know the sum of eigenvalues and nothing else.
$endgroup$
– user376343
Jan 22 at 19:58
1
$begingroup$
@amd It might be interesting to you that the answers prove your suspicion wrong, both about the spectral norm (there is a strict inequality according to the OPs answer) and about all other eigenvalues (they are close to each other according to the Gershgorin circle theorem, depending on the size of the non-diagonal entries)
$endgroup$
– Bananach
Feb 2 at 21:54