Does the Cayley–Hamilton theorem work in the opposite direction?
$begingroup$
The Cayley–Hamilton theorem states that every square matrix satisfies its own characteristic equation.
But does it work in the opposite direction?
If for example for a certain matrix $A$ we know that
$ A^2-6A+9I=0, $
does that mean that the characteristic equation of $A$ is
$
lambda^2-6lambda+9=0
$
?
linear-algebra cayley-hamilton
New contributor
$endgroup$
add a comment |
$begingroup$
The Cayley–Hamilton theorem states that every square matrix satisfies its own characteristic equation.
But does it work in the opposite direction?
If for example for a certain matrix $A$ we know that
$ A^2-6A+9I=0, $
does that mean that the characteristic equation of $A$ is
$
lambda^2-6lambda+9=0
$
?
linear-algebra cayley-hamilton
New contributor
$endgroup$
$begingroup$
Yes there's an “opposite direction” that works, namely that the minimal polynomial (which divides the characteristic polynomial and often equals it) of $A$ divides (rather than necessarily equals) $lambda^2 - 6lambda + 9 = 0$. See en.wikipedia.org/wiki/Minimal_polynomial_(linear_algebra)
$endgroup$
– ShreevatsaR
5 hours ago
$begingroup$
The answers would be a lot more instructive if the question had a condition that the degree of the polynomial is the same as the size of the matrix. Too late now, I'm afraid.
$endgroup$
– JiK
2 hours ago
add a comment |
$begingroup$
The Cayley–Hamilton theorem states that every square matrix satisfies its own characteristic equation.
But does it work in the opposite direction?
If for example for a certain matrix $A$ we know that
$ A^2-6A+9I=0, $
does that mean that the characteristic equation of $A$ is
$
lambda^2-6lambda+9=0
$
?
linear-algebra cayley-hamilton
New contributor
$endgroup$
The Cayley–Hamilton theorem states that every square matrix satisfies its own characteristic equation.
But does it work in the opposite direction?
If for example for a certain matrix $A$ we know that
$ A^2-6A+9I=0, $
does that mean that the characteristic equation of $A$ is
$
lambda^2-6lambda+9=0
$
?
linear-algebra cayley-hamilton
linear-algebra cayley-hamilton
New contributor
New contributor
edited 4 hours ago
J. W. Tanner
1,470114
1,470114
New contributor
asked 6 hours ago
IdoIdo
693
693
New contributor
New contributor
$begingroup$
Yes there's an “opposite direction” that works, namely that the minimal polynomial (which divides the characteristic polynomial and often equals it) of $A$ divides (rather than necessarily equals) $lambda^2 - 6lambda + 9 = 0$. See en.wikipedia.org/wiki/Minimal_polynomial_(linear_algebra)
$endgroup$
– ShreevatsaR
5 hours ago
$begingroup$
The answers would be a lot more instructive if the question had a condition that the degree of the polynomial is the same as the size of the matrix. Too late now, I'm afraid.
$endgroup$
– JiK
2 hours ago
add a comment |
$begingroup$
Yes there's an “opposite direction” that works, namely that the minimal polynomial (which divides the characteristic polynomial and often equals it) of $A$ divides (rather than necessarily equals) $lambda^2 - 6lambda + 9 = 0$. See en.wikipedia.org/wiki/Minimal_polynomial_(linear_algebra)
$endgroup$
– ShreevatsaR
5 hours ago
$begingroup$
The answers would be a lot more instructive if the question had a condition that the degree of the polynomial is the same as the size of the matrix. Too late now, I'm afraid.
$endgroup$
– JiK
2 hours ago
$begingroup$
Yes there's an “opposite direction” that works, namely that the minimal polynomial (which divides the characteristic polynomial and often equals it) of $A$ divides (rather than necessarily equals) $lambda^2 - 6lambda + 9 = 0$. See en.wikipedia.org/wiki/Minimal_polynomial_(linear_algebra)
$endgroup$
– ShreevatsaR
5 hours ago
$begingroup$
Yes there's an “opposite direction” that works, namely that the minimal polynomial (which divides the characteristic polynomial and often equals it) of $A$ divides (rather than necessarily equals) $lambda^2 - 6lambda + 9 = 0$. See en.wikipedia.org/wiki/Minimal_polynomial_(linear_algebra)
$endgroup$
– ShreevatsaR
5 hours ago
$begingroup$
The answers would be a lot more instructive if the question had a condition that the degree of the polynomial is the same as the size of the matrix. Too late now, I'm afraid.
$endgroup$
– JiK
2 hours ago
$begingroup$
The answers would be a lot more instructive if the question had a condition that the degree of the polynomial is the same as the size of the matrix. Too late now, I'm afraid.
$endgroup$
– JiK
2 hours ago
add a comment |
4 Answers
4
active
oldest
votes
$begingroup$
Even without counterexamples it is obvious that your statement can't be true because if $A$ is a root of the polynomial $p(x)$ then it must be the root of $p(x)q(x)$ for any polynomial $q$. So that way we would get the matrix $A$ has infinitely many characteristic polynomials.
$endgroup$
$begingroup$
True, thank you
$endgroup$
– Ido
6 hours ago
$begingroup$
Are all counterexamples of this form?
$endgroup$
– PyRulez
2 hours ago
1
$begingroup$
@PyRulez, the set of polynomials $p$ such that $p(A)=0$ is ${mq$: q is a polynomial$}$ when $m$ is the minimal polynomial of $A$. So all such polynomials are multiples of the minimal polynomial.
$endgroup$
– Mark
2 hours ago
add a comment |
$begingroup$
No, the $ntimes n$ matrix $A=3I$ satisfies the given equation but it has a different characteristic polynomial for $nnot=2$.
$endgroup$
$begingroup$
If $P(A)=0$ then the minimal polynomial of $A$ divides $Q$. See en.wikipedia.org/wiki/Minimal_polynomial_(linear_algebra) If the characteristic poynomial has distict roots then it divides $P$.
$endgroup$
– Robert Z
6 hours ago
add a comment |
$begingroup$
No. For example, $I-1=0$, but the characteristic polynomial of $I$ is $(x-1)^n$.
$endgroup$
add a comment |
$begingroup$
For any $n times n$ matrix $A$, the $(2n) times (2n)$ matrix $pmatrix{A & 0cr 0 & Acr}$ satisfies the characteristic polynomial of $A$, but its own characteristic polynomial is the square of that of $A$.
$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
});
}
});
Ido is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3101640%2fdoes-the-cayley-hamilton-theorem-work-in-the-opposite-direction%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Even without counterexamples it is obvious that your statement can't be true because if $A$ is a root of the polynomial $p(x)$ then it must be the root of $p(x)q(x)$ for any polynomial $q$. So that way we would get the matrix $A$ has infinitely many characteristic polynomials.
$endgroup$
$begingroup$
True, thank you
$endgroup$
– Ido
6 hours ago
$begingroup$
Are all counterexamples of this form?
$endgroup$
– PyRulez
2 hours ago
1
$begingroup$
@PyRulez, the set of polynomials $p$ such that $p(A)=0$ is ${mq$: q is a polynomial$}$ when $m$ is the minimal polynomial of $A$. So all such polynomials are multiples of the minimal polynomial.
$endgroup$
– Mark
2 hours ago
add a comment |
$begingroup$
Even without counterexamples it is obvious that your statement can't be true because if $A$ is a root of the polynomial $p(x)$ then it must be the root of $p(x)q(x)$ for any polynomial $q$. So that way we would get the matrix $A$ has infinitely many characteristic polynomials.
$endgroup$
$begingroup$
True, thank you
$endgroup$
– Ido
6 hours ago
$begingroup$
Are all counterexamples of this form?
$endgroup$
– PyRulez
2 hours ago
1
$begingroup$
@PyRulez, the set of polynomials $p$ such that $p(A)=0$ is ${mq$: q is a polynomial$}$ when $m$ is the minimal polynomial of $A$. So all such polynomials are multiples of the minimal polynomial.
$endgroup$
– Mark
2 hours ago
add a comment |
$begingroup$
Even without counterexamples it is obvious that your statement can't be true because if $A$ is a root of the polynomial $p(x)$ then it must be the root of $p(x)q(x)$ for any polynomial $q$. So that way we would get the matrix $A$ has infinitely many characteristic polynomials.
$endgroup$
Even without counterexamples it is obvious that your statement can't be true because if $A$ is a root of the polynomial $p(x)$ then it must be the root of $p(x)q(x)$ for any polynomial $q$. So that way we would get the matrix $A$ has infinitely many characteristic polynomials.
answered 6 hours ago
MarkMark
6,998416
6,998416
$begingroup$
True, thank you
$endgroup$
– Ido
6 hours ago
$begingroup$
Are all counterexamples of this form?
$endgroup$
– PyRulez
2 hours ago
1
$begingroup$
@PyRulez, the set of polynomials $p$ such that $p(A)=0$ is ${mq$: q is a polynomial$}$ when $m$ is the minimal polynomial of $A$. So all such polynomials are multiples of the minimal polynomial.
$endgroup$
– Mark
2 hours ago
add a comment |
$begingroup$
True, thank you
$endgroup$
– Ido
6 hours ago
$begingroup$
Are all counterexamples of this form?
$endgroup$
– PyRulez
2 hours ago
1
$begingroup$
@PyRulez, the set of polynomials $p$ such that $p(A)=0$ is ${mq$: q is a polynomial$}$ when $m$ is the minimal polynomial of $A$. So all such polynomials are multiples of the minimal polynomial.
$endgroup$
– Mark
2 hours ago
$begingroup$
True, thank you
$endgroup$
– Ido
6 hours ago
$begingroup$
True, thank you
$endgroup$
– Ido
6 hours ago
$begingroup$
Are all counterexamples of this form?
$endgroup$
– PyRulez
2 hours ago
$begingroup$
Are all counterexamples of this form?
$endgroup$
– PyRulez
2 hours ago
1
1
$begingroup$
@PyRulez, the set of polynomials $p$ such that $p(A)=0$ is ${mq$: q is a polynomial$}$ when $m$ is the minimal polynomial of $A$. So all such polynomials are multiples of the minimal polynomial.
$endgroup$
– Mark
2 hours ago
$begingroup$
@PyRulez, the set of polynomials $p$ such that $p(A)=0$ is ${mq$: q is a polynomial$}$ when $m$ is the minimal polynomial of $A$. So all such polynomials are multiples of the minimal polynomial.
$endgroup$
– Mark
2 hours ago
add a comment |
$begingroup$
No, the $ntimes n$ matrix $A=3I$ satisfies the given equation but it has a different characteristic polynomial for $nnot=2$.
$endgroup$
$begingroup$
If $P(A)=0$ then the minimal polynomial of $A$ divides $Q$. See en.wikipedia.org/wiki/Minimal_polynomial_(linear_algebra) If the characteristic poynomial has distict roots then it divides $P$.
$endgroup$
– Robert Z
6 hours ago
add a comment |
$begingroup$
No, the $ntimes n$ matrix $A=3I$ satisfies the given equation but it has a different characteristic polynomial for $nnot=2$.
$endgroup$
$begingroup$
If $P(A)=0$ then the minimal polynomial of $A$ divides $Q$. See en.wikipedia.org/wiki/Minimal_polynomial_(linear_algebra) If the characteristic poynomial has distict roots then it divides $P$.
$endgroup$
– Robert Z
6 hours ago
add a comment |
$begingroup$
No, the $ntimes n$ matrix $A=3I$ satisfies the given equation but it has a different characteristic polynomial for $nnot=2$.
$endgroup$
No, the $ntimes n$ matrix $A=3I$ satisfies the given equation but it has a different characteristic polynomial for $nnot=2$.
answered 6 hours ago
Robert ZRobert Z
96.3k1065136
96.3k1065136
$begingroup$
If $P(A)=0$ then the minimal polynomial of $A$ divides $Q$. See en.wikipedia.org/wiki/Minimal_polynomial_(linear_algebra) If the characteristic poynomial has distict roots then it divides $P$.
$endgroup$
– Robert Z
6 hours ago
add a comment |
$begingroup$
If $P(A)=0$ then the minimal polynomial of $A$ divides $Q$. See en.wikipedia.org/wiki/Minimal_polynomial_(linear_algebra) If the characteristic poynomial has distict roots then it divides $P$.
$endgroup$
– Robert Z
6 hours ago
$begingroup$
If $P(A)=0$ then the minimal polynomial of $A$ divides $Q$. See en.wikipedia.org/wiki/Minimal_polynomial_(linear_algebra) If the characteristic poynomial has distict roots then it divides $P$.
$endgroup$
– Robert Z
6 hours ago
$begingroup$
If $P(A)=0$ then the minimal polynomial of $A$ divides $Q$. See en.wikipedia.org/wiki/Minimal_polynomial_(linear_algebra) If the characteristic poynomial has distict roots then it divides $P$.
$endgroup$
– Robert Z
6 hours ago
add a comment |
$begingroup$
No. For example, $I-1=0$, but the characteristic polynomial of $I$ is $(x-1)^n$.
$endgroup$
add a comment |
$begingroup$
No. For example, $I-1=0$, but the characteristic polynomial of $I$ is $(x-1)^n$.
$endgroup$
add a comment |
$begingroup$
No. For example, $I-1=0$, but the characteristic polynomial of $I$ is $(x-1)^n$.
$endgroup$
No. For example, $I-1=0$, but the characteristic polynomial of $I$ is $(x-1)^n$.
answered 6 hours ago
MicappsMicapps
89137
89137
add a comment |
add a comment |
$begingroup$
For any $n times n$ matrix $A$, the $(2n) times (2n)$ matrix $pmatrix{A & 0cr 0 & Acr}$ satisfies the characteristic polynomial of $A$, but its own characteristic polynomial is the square of that of $A$.
$endgroup$
add a comment |
$begingroup$
For any $n times n$ matrix $A$, the $(2n) times (2n)$ matrix $pmatrix{A & 0cr 0 & Acr}$ satisfies the characteristic polynomial of $A$, but its own characteristic polynomial is the square of that of $A$.
$endgroup$
add a comment |
$begingroup$
For any $n times n$ matrix $A$, the $(2n) times (2n)$ matrix $pmatrix{A & 0cr 0 & Acr}$ satisfies the characteristic polynomial of $A$, but its own characteristic polynomial is the square of that of $A$.
$endgroup$
For any $n times n$ matrix $A$, the $(2n) times (2n)$ matrix $pmatrix{A & 0cr 0 & Acr}$ satisfies the characteristic polynomial of $A$, but its own characteristic polynomial is the square of that of $A$.
answered 6 hours ago
Robert IsraelRobert Israel
322k23212465
322k23212465
add a comment |
add a comment |
Ido is a new contributor. Be nice, and check out our Code of Conduct.
Ido is a new contributor. Be nice, and check out our Code of Conduct.
Ido is a new contributor. Be nice, and check out our Code of Conduct.
Ido is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3101640%2fdoes-the-cayley-hamilton-theorem-work-in-the-opposite-direction%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$
Yes there's an “opposite direction” that works, namely that the minimal polynomial (which divides the characteristic polynomial and often equals it) of $A$ divides (rather than necessarily equals) $lambda^2 - 6lambda + 9 = 0$. See en.wikipedia.org/wiki/Minimal_polynomial_(linear_algebra)
$endgroup$
– ShreevatsaR
5 hours ago
$begingroup$
The answers would be a lot more instructive if the question had a condition that the degree of the polynomial is the same as the size of the matrix. Too late now, I'm afraid.
$endgroup$
– JiK
2 hours ago