Intuition behind subtraction of diagonal matrices build from eigenvalues
$begingroup$
Suppose we have a matrix A:
begin{array}{ccc}
3 & 1 & 1 \
3 & 2 & 3 \
3 & 2 & 1 \
end{array}
It's eigenvalues are:
{6, -1, 1}
If I make a diagonal matrix out of any of them for example:
begin{array}{ccc}
6 & 0 & 0 \
0 & 6 & 0 \
0 & 0 & 6 \
end{array}
And subtract it from A
the rank of the resulting matrix is one less than the rank of matrix A. Why is that? What role does the eigenvalue play here? I'd be very thankful for any intuition.
linear-algebra abstract-algebra eigenvalues-eigenvectors
$endgroup$
add a comment |
$begingroup$
Suppose we have a matrix A:
begin{array}{ccc}
3 & 1 & 1 \
3 & 2 & 3 \
3 & 2 & 1 \
end{array}
It's eigenvalues are:
{6, -1, 1}
If I make a diagonal matrix out of any of them for example:
begin{array}{ccc}
6 & 0 & 0 \
0 & 6 & 0 \
0 & 0 & 6 \
end{array}
And subtract it from A
the rank of the resulting matrix is one less than the rank of matrix A. Why is that? What role does the eigenvalue play here? I'd be very thankful for any intuition.
linear-algebra abstract-algebra eigenvalues-eigenvectors
$endgroup$
add a comment |
$begingroup$
Suppose we have a matrix A:
begin{array}{ccc}
3 & 1 & 1 \
3 & 2 & 3 \
3 & 2 & 1 \
end{array}
It's eigenvalues are:
{6, -1, 1}
If I make a diagonal matrix out of any of them for example:
begin{array}{ccc}
6 & 0 & 0 \
0 & 6 & 0 \
0 & 0 & 6 \
end{array}
And subtract it from A
the rank of the resulting matrix is one less than the rank of matrix A. Why is that? What role does the eigenvalue play here? I'd be very thankful for any intuition.
linear-algebra abstract-algebra eigenvalues-eigenvectors
$endgroup$
Suppose we have a matrix A:
begin{array}{ccc}
3 & 1 & 1 \
3 & 2 & 3 \
3 & 2 & 1 \
end{array}
It's eigenvalues are:
{6, -1, 1}
If I make a diagonal matrix out of any of them for example:
begin{array}{ccc}
6 & 0 & 0 \
0 & 6 & 0 \
0 & 0 & 6 \
end{array}
And subtract it from A
the rank of the resulting matrix is one less than the rank of matrix A. Why is that? What role does the eigenvalue play here? I'd be very thankful for any intuition.
linear-algebra abstract-algebra eigenvalues-eigenvectors
linear-algebra abstract-algebra eigenvalues-eigenvectors
edited Jan 14 at 12:10
wklm
asked Jan 14 at 12:04
wklmwklm
1105
1105
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Hint: Because $det(A-lambda I) = 0$ by the definition of the eigenvalue. Also, as there three distinct eigenvalues for $A$ there two distinct eigenvalues for $B = A-6I$ too. ${-5, -7}$ are eigenvalues of $B$ as $B+5I = A-I$ and $B+7I = A+I$.
$endgroup$
$begingroup$
thanks a lot! Could you also please enlighten me why do A and B have the same eigenvectors?
$endgroup$
– wklm
Jan 14 at 12:22
1
$begingroup$
@wklm my pleasure. as I mentioned $B+5I = A-I$ and $B+7I = A+I$, and $1, -1$ are eigenvalues of $A$. Hence, $A$ and $B$ have two eigenvectors in common.
$endgroup$
– OmG
Jan 14 at 12:25
1
$begingroup$
@wklm You can check that for yourself: If $Av=lambda v$, then what does $Bv$ equal?
$endgroup$
– amd
Jan 14 at 20:06
add a comment |
$begingroup$
Remember: $Av= lambda v$, then you can rewrite this as: $(A - lambda I)v = 0$, which means that $det(A-lambda I) = 0$ (assuming $v$ is not 0, $v$ is the eigenvector corresponding to $lambda$).
$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%2f3073160%2fintuition-behind-subtraction-of-diagonal-matrices-build-from-eigenvalues%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$
Hint: Because $det(A-lambda I) = 0$ by the definition of the eigenvalue. Also, as there three distinct eigenvalues for $A$ there two distinct eigenvalues for $B = A-6I$ too. ${-5, -7}$ are eigenvalues of $B$ as $B+5I = A-I$ and $B+7I = A+I$.
$endgroup$
$begingroup$
thanks a lot! Could you also please enlighten me why do A and B have the same eigenvectors?
$endgroup$
– wklm
Jan 14 at 12:22
1
$begingroup$
@wklm my pleasure. as I mentioned $B+5I = A-I$ and $B+7I = A+I$, and $1, -1$ are eigenvalues of $A$. Hence, $A$ and $B$ have two eigenvectors in common.
$endgroup$
– OmG
Jan 14 at 12:25
1
$begingroup$
@wklm You can check that for yourself: If $Av=lambda v$, then what does $Bv$ equal?
$endgroup$
– amd
Jan 14 at 20:06
add a comment |
$begingroup$
Hint: Because $det(A-lambda I) = 0$ by the definition of the eigenvalue. Also, as there three distinct eigenvalues for $A$ there two distinct eigenvalues for $B = A-6I$ too. ${-5, -7}$ are eigenvalues of $B$ as $B+5I = A-I$ and $B+7I = A+I$.
$endgroup$
$begingroup$
thanks a lot! Could you also please enlighten me why do A and B have the same eigenvectors?
$endgroup$
– wklm
Jan 14 at 12:22
1
$begingroup$
@wklm my pleasure. as I mentioned $B+5I = A-I$ and $B+7I = A+I$, and $1, -1$ are eigenvalues of $A$. Hence, $A$ and $B$ have two eigenvectors in common.
$endgroup$
– OmG
Jan 14 at 12:25
1
$begingroup$
@wklm You can check that for yourself: If $Av=lambda v$, then what does $Bv$ equal?
$endgroup$
– amd
Jan 14 at 20:06
add a comment |
$begingroup$
Hint: Because $det(A-lambda I) = 0$ by the definition of the eigenvalue. Also, as there three distinct eigenvalues for $A$ there two distinct eigenvalues for $B = A-6I$ too. ${-5, -7}$ are eigenvalues of $B$ as $B+5I = A-I$ and $B+7I = A+I$.
$endgroup$
Hint: Because $det(A-lambda I) = 0$ by the definition of the eigenvalue. Also, as there three distinct eigenvalues for $A$ there two distinct eigenvalues for $B = A-6I$ too. ${-5, -7}$ are eigenvalues of $B$ as $B+5I = A-I$ and $B+7I = A+I$.
edited Jan 14 at 12:16
answered Jan 14 at 12:08


OmGOmG
2,502822
2,502822
$begingroup$
thanks a lot! Could you also please enlighten me why do A and B have the same eigenvectors?
$endgroup$
– wklm
Jan 14 at 12:22
1
$begingroup$
@wklm my pleasure. as I mentioned $B+5I = A-I$ and $B+7I = A+I$, and $1, -1$ are eigenvalues of $A$. Hence, $A$ and $B$ have two eigenvectors in common.
$endgroup$
– OmG
Jan 14 at 12:25
1
$begingroup$
@wklm You can check that for yourself: If $Av=lambda v$, then what does $Bv$ equal?
$endgroup$
– amd
Jan 14 at 20:06
add a comment |
$begingroup$
thanks a lot! Could you also please enlighten me why do A and B have the same eigenvectors?
$endgroup$
– wklm
Jan 14 at 12:22
1
$begingroup$
@wklm my pleasure. as I mentioned $B+5I = A-I$ and $B+7I = A+I$, and $1, -1$ are eigenvalues of $A$. Hence, $A$ and $B$ have two eigenvectors in common.
$endgroup$
– OmG
Jan 14 at 12:25
1
$begingroup$
@wklm You can check that for yourself: If $Av=lambda v$, then what does $Bv$ equal?
$endgroup$
– amd
Jan 14 at 20:06
$begingroup$
thanks a lot! Could you also please enlighten me why do A and B have the same eigenvectors?
$endgroup$
– wklm
Jan 14 at 12:22
$begingroup$
thanks a lot! Could you also please enlighten me why do A and B have the same eigenvectors?
$endgroup$
– wklm
Jan 14 at 12:22
1
1
$begingroup$
@wklm my pleasure. as I mentioned $B+5I = A-I$ and $B+7I = A+I$, and $1, -1$ are eigenvalues of $A$. Hence, $A$ and $B$ have two eigenvectors in common.
$endgroup$
– OmG
Jan 14 at 12:25
$begingroup$
@wklm my pleasure. as I mentioned $B+5I = A-I$ and $B+7I = A+I$, and $1, -1$ are eigenvalues of $A$. Hence, $A$ and $B$ have two eigenvectors in common.
$endgroup$
– OmG
Jan 14 at 12:25
1
1
$begingroup$
@wklm You can check that for yourself: If $Av=lambda v$, then what does $Bv$ equal?
$endgroup$
– amd
Jan 14 at 20:06
$begingroup$
@wklm You can check that for yourself: If $Av=lambda v$, then what does $Bv$ equal?
$endgroup$
– amd
Jan 14 at 20:06
add a comment |
$begingroup$
Remember: $Av= lambda v$, then you can rewrite this as: $(A - lambda I)v = 0$, which means that $det(A-lambda I) = 0$ (assuming $v$ is not 0, $v$ is the eigenvector corresponding to $lambda$).
$endgroup$
add a comment |
$begingroup$
Remember: $Av= lambda v$, then you can rewrite this as: $(A - lambda I)v = 0$, which means that $det(A-lambda I) = 0$ (assuming $v$ is not 0, $v$ is the eigenvector corresponding to $lambda$).
$endgroup$
add a comment |
$begingroup$
Remember: $Av= lambda v$, then you can rewrite this as: $(A - lambda I)v = 0$, which means that $det(A-lambda I) = 0$ (assuming $v$ is not 0, $v$ is the eigenvector corresponding to $lambda$).
$endgroup$
Remember: $Av= lambda v$, then you can rewrite this as: $(A - lambda I)v = 0$, which means that $det(A-lambda I) = 0$ (assuming $v$ is not 0, $v$ is the eigenvector corresponding to $lambda$).
answered Jan 14 at 12:11
lightxbulblightxbulb
900211
900211
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%2f3073160%2fintuition-behind-subtraction-of-diagonal-matrices-build-from-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