What is the real characteristic equation? [duplicate]
$begingroup$
This question already has an answer here:
$|A-lambda I|$ and $|lambda I-A|$
1 answer
My book says that you form the character equation as
$begin{vmatrix}
lambda I - A
end{vmatrix}$. However I see occasionally on stack exchange and other resources that define the character equation as $begin{vmatrix}A - lambda Iend{vmatrix}$. Why does this appear to be such a trivial matter? Here are some examples below where I have found the latter being used.
Geometric multiplicity of repeated Eigenvalues
https://en.wikipedia.org/wiki/Eigenvalues_and_eigenvectors (under "Eigenvalues and the characteristic polynomial"
linear-algebra eigenvalues-eigenvectors
$endgroup$
marked as duplicate by amWhy
StackExchange.ready(function() {
if (StackExchange.options.isMobile) return;
$('.dupe-hammer-message-hover:not(.hover-bound)').each(function() {
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');
$hover.hover(
function() {
$hover.showInfoMessage('', {
messageElement: $msg.clone().show(),
transient: false,
position: { my: 'bottom left', at: 'top center', offsetTop: -7 },
dismissable: false,
relativeToBody: true
});
},
function() {
StackExchange.helpers.removeMessages();
}
);
});
});
Dec 11 '18 at 1:21
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
add a comment |
$begingroup$
This question already has an answer here:
$|A-lambda I|$ and $|lambda I-A|$
1 answer
My book says that you form the character equation as
$begin{vmatrix}
lambda I - A
end{vmatrix}$. However I see occasionally on stack exchange and other resources that define the character equation as $begin{vmatrix}A - lambda Iend{vmatrix}$. Why does this appear to be such a trivial matter? Here are some examples below where I have found the latter being used.
Geometric multiplicity of repeated Eigenvalues
https://en.wikipedia.org/wiki/Eigenvalues_and_eigenvectors (under "Eigenvalues and the characteristic polynomial"
linear-algebra eigenvalues-eigenvectors
$endgroup$
marked as duplicate by amWhy
StackExchange.ready(function() {
if (StackExchange.options.isMobile) return;
$('.dupe-hammer-message-hover:not(.hover-bound)').each(function() {
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');
$hover.hover(
function() {
$hover.showInfoMessage('', {
messageElement: $msg.clone().show(),
transient: false,
position: { my: 'bottom left', at: 'top center', offsetTop: -7 },
dismissable: false,
relativeToBody: true
});
},
function() {
StackExchange.helpers.removeMessages();
}
);
});
});
Dec 11 '18 at 1:21
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
add a comment |
$begingroup$
This question already has an answer here:
$|A-lambda I|$ and $|lambda I-A|$
1 answer
My book says that you form the character equation as
$begin{vmatrix}
lambda I - A
end{vmatrix}$. However I see occasionally on stack exchange and other resources that define the character equation as $begin{vmatrix}A - lambda Iend{vmatrix}$. Why does this appear to be such a trivial matter? Here are some examples below where I have found the latter being used.
Geometric multiplicity of repeated Eigenvalues
https://en.wikipedia.org/wiki/Eigenvalues_and_eigenvectors (under "Eigenvalues and the characteristic polynomial"
linear-algebra eigenvalues-eigenvectors
$endgroup$
This question already has an answer here:
$|A-lambda I|$ and $|lambda I-A|$
1 answer
My book says that you form the character equation as
$begin{vmatrix}
lambda I - A
end{vmatrix}$. However I see occasionally on stack exchange and other resources that define the character equation as $begin{vmatrix}A - lambda Iend{vmatrix}$. Why does this appear to be such a trivial matter? Here are some examples below where I have found the latter being used.
Geometric multiplicity of repeated Eigenvalues
https://en.wikipedia.org/wiki/Eigenvalues_and_eigenvectors (under "Eigenvalues and the characteristic polynomial"
This question already has an answer here:
$|A-lambda I|$ and $|lambda I-A|$
1 answer
linear-algebra eigenvalues-eigenvectors
linear-algebra eigenvalues-eigenvectors
asked Dec 11 '18 at 1:15
Evan KimEvan Kim
3658
3658
marked as duplicate by amWhy
StackExchange.ready(function() {
if (StackExchange.options.isMobile) return;
$('.dupe-hammer-message-hover:not(.hover-bound)').each(function() {
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');
$hover.hover(
function() {
$hover.showInfoMessage('', {
messageElement: $msg.clone().show(),
transient: false,
position: { my: 'bottom left', at: 'top center', offsetTop: -7 },
dismissable: false,
relativeToBody: true
});
},
function() {
StackExchange.helpers.removeMessages();
}
);
});
});
Dec 11 '18 at 1:21
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
marked as duplicate by amWhy
StackExchange.ready(function() {
if (StackExchange.options.isMobile) return;
$('.dupe-hammer-message-hover:not(.hover-bound)').each(function() {
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');
$hover.hover(
function() {
$hover.showInfoMessage('', {
messageElement: $msg.clone().show(),
transient: false,
position: { my: 'bottom left', at: 'top center', offsetTop: -7 },
dismissable: false,
relativeToBody: true
});
},
function() {
StackExchange.helpers.removeMessages();
}
);
});
});
Dec 11 '18 at 1:21
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
The two only differ by a factor of $(-1)^n$, so it's not a big deal. In my opinion, the better convention is $det (lambda I - A)$, because that guarantees that the characteristic polynomial is always monic (has leading coefficient $1$). But it is a convention; both conventions are basically fine.
$endgroup$
add a comment |
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
The two only differ by a factor of $(-1)^n$, so it's not a big deal. In my opinion, the better convention is $det (lambda I - A)$, because that guarantees that the characteristic polynomial is always monic (has leading coefficient $1$). But it is a convention; both conventions are basically fine.
$endgroup$
add a comment |
$begingroup$
The two only differ by a factor of $(-1)^n$, so it's not a big deal. In my opinion, the better convention is $det (lambda I - A)$, because that guarantees that the characteristic polynomial is always monic (has leading coefficient $1$). But it is a convention; both conventions are basically fine.
$endgroup$
add a comment |
$begingroup$
The two only differ by a factor of $(-1)^n$, so it's not a big deal. In my opinion, the better convention is $det (lambda I - A)$, because that guarantees that the characteristic polynomial is always monic (has leading coefficient $1$). But it is a convention; both conventions are basically fine.
$endgroup$
The two only differ by a factor of $(-1)^n$, so it's not a big deal. In my opinion, the better convention is $det (lambda I - A)$, because that guarantees that the characteristic polynomial is always monic (has leading coefficient $1$). But it is a convention; both conventions are basically fine.
answered Dec 11 '18 at 1:18
Qiaochu YuanQiaochu Yuan
279k32590935
279k32590935
add a comment |
add a comment |