If $m_1,m_2$ are the minimal polynomials of $ST$ and $TS$ prove $m_2(x)=x^im_1(x)$ where $i=-1,0$ or $1$












2














Let V be a finite dimensional vector space, and let $S,T:V rightarrow V$ be linear transformations. Let $m_1,m_2$ denote the minimal polynomials of $ST$ and $TS$ respectively how would you prove:



$m_2(x)=x^im_1(x)$ where $i=-1,0$ or $1$ and $a$ is an eigenvalue of $ST$ iff a is an eigenvalue of $TS$?






linear-algebra matrices eigenvalues-eigenvectors minimal-polynomials







share|cite|improve this question
























  • I think one of those $m_1$s is supposed to be an $m_2$.
    – Arturo Magidin
    Oct 31 '11 at 18:30










  • @ArturoMagidin: Thanks -typo!
    – Freeman
    Oct 31 '11 at 18:31
















2














Let V be a finite dimensional vector space, and let $S,T:V rightarrow V$ be linear transformations. Let $m_1,m_2$ denote the minimal polynomials of $ST$ and $TS$ respectively how would you prove:



$m_2(x)=x^im_1(x)$ where $i=-1,0$ or $1$ and $a$ is an eigenvalue of $ST$ iff a is an eigenvalue of $TS$?






linear-algebra matrices eigenvalues-eigenvectors minimal-polynomials







share|cite|improve this question
























  • I think one of those $m_1$s is supposed to be an $m_2$.
    – Arturo Magidin
    Oct 31 '11 at 18:30










  • @ArturoMagidin: Thanks -typo!
    – Freeman
    Oct 31 '11 at 18:31














2












2








2


3





Let V be a finite dimensional vector space, and let $S,T:V rightarrow V$ be linear transformations. Let $m_1,m_2$ denote the minimal polynomials of $ST$ and $TS$ respectively how would you prove:



$m_2(x)=x^im_1(x)$ where $i=-1,0$ or $1$ and $a$ is an eigenvalue of $ST$ iff a is an eigenvalue of $TS$?






linear-algebra matrices eigenvalues-eigenvectors minimal-polynomials







share|cite|improve this question















Let V be a finite dimensional vector space, and let $S,T:V rightarrow V$ be linear transformations. Let $m_1,m_2$ denote the minimal polynomials of $ST$ and $TS$ respectively how would you prove:



$m_2(x)=x^im_1(x)$ where $i=-1,0$ or $1$ and $a$ is an eigenvalue of $ST$ iff a is an eigenvalue of $TS$?






linear-algebra matrices eigenvalues-eigenvectors minimal-polynomials




linear-algebra matrices eigenvalues-eigenvectors minimal-polynomials






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 9 at 8:00









Martin Sleziak

44.7k7115270




44.7k7115270










asked Oct 31 '11 at 18:27









Freeman

88082163




88082163












  • I think one of those $m_1$s is supposed to be an $m_2$.
    – Arturo Magidin
    Oct 31 '11 at 18:30










  • @ArturoMagidin: Thanks -typo!
    – Freeman
    Oct 31 '11 at 18:31


















  • I think one of those $m_1$s is supposed to be an $m_2$.
    – Arturo Magidin
    Oct 31 '11 at 18:30










  • @ArturoMagidin: Thanks -typo!
    – Freeman
    Oct 31 '11 at 18:31
















I think one of those $m_1$s is supposed to be an $m_2$.
– Arturo Magidin
Oct 31 '11 at 18:30




I think one of those $m_1$s is supposed to be an $m_2$.
– Arturo Magidin
Oct 31 '11 at 18:30












@ArturoMagidin: Thanks -typo!
– Freeman
Oct 31 '11 at 18:31




@ArturoMagidin: Thanks -typo!
– Freeman
Oct 31 '11 at 18:31










1 Answer
1






active

oldest

votes


















3














Suppose that $a$ is an eigenvalue of $ST$. If $mathbf{v}in E_a$, the eigenspace of $ST$ associated to $a$, then

$$TSBigl(T(mathbf{v})Bigr) = TBigl(ST(mathbf{v})Bigr) = T(amathbf{v}) = aT(mathbf{v}),$$
so either $T(mathbf{v})=mathbf{0}$, or else $a$ is also an eigenvalue of $TS$.



So you have two cases: if $T(mathbf{v})=mathbf{0}$ for every $mathbf{v}in E_a$, then $T$ is not invertible; what can you conclude $a$ and about $TS$ in that case?



The other case is that there exists $mathbf{v}in E_a$ with $T(mathbf{v})neqmathbf{0}$. What can you conclude about $TS$ in that case?



Can you apply the same argument starting with $TS$ instead of with $ST$?



For the minimal polynomials, notice that for any $ngt 0$,
$$T(ST)^nS = (TS)^{n+1}.$$



If $m_1(x) = x^k + a_{k-1}x^{k-1}+cdots + a_1x + a_0$ is the minimal polynomial of $ST$, then
$$begin{align*}
(ST)^k + a_{k-1}(ST)^{k-1}+cdots + a_1(ST) + a_0I &= 0\
TBigl((ST)^k + a_{k-1}(ST)^{k-1}+cdots + a_1(ST) + a_0IBigr)S &= 0\
T(ST)^kS + a_{k-1}T(ST)^{k-1}S + cdots + a_1T(ST)S + a_0TS &= 0\
(TS)^{k+1} + a_{k-1}(TS)^k + cdots + a_1(TS)^2 + a_0(TS) & = 0,
end{align*}$$
so $TS$ satisfies $xm_1(x)$. Hence $m_2(x)$ divides $xm_1(x)$. By a symmetric argument, $m_2(x)$ divides $xm_1(x)$.



If $0$ is not an eigenvalue of $ST$ nor of $TS$, then $x$ cannot be a factor of the minimal polynomials; what can you conclude then?



If $0$ is an eigenvalue of $ST$ and of $TS$, then you cannot simply "take them out"; but it does tell you that every irreducible factor, except perhaps for the irreducible factor $x$, must be the same (and raised to the same degree) in $m_1(x)$ and in $m_2(x)$. Now you just need to deal with $x$, and show that the degree to which it shows in $m_1(x)$ and in $m_2(x)$ can differ by at most $1$, which will give you the result you want.






share|cite|improve this answer





















  • Thank you Arturo, this is an incredibly helpful response, just sad I can't vote it up more than once ;)
    – Freeman
    Oct 31 '11 at 19:39











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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f77576%2fif-m-1-m-2-are-the-minimal-polynomials-of-st-and-ts-prove-m-2x-xim-1x%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









3














Suppose that $a$ is an eigenvalue of $ST$. If $mathbf{v}in E_a$, the eigenspace of $ST$ associated to $a$, then

$$TSBigl(T(mathbf{v})Bigr) = TBigl(ST(mathbf{v})Bigr) = T(amathbf{v}) = aT(mathbf{v}),$$
so either $T(mathbf{v})=mathbf{0}$, or else $a$ is also an eigenvalue of $TS$.



So you have two cases: if $T(mathbf{v})=mathbf{0}$ for every $mathbf{v}in E_a$, then $T$ is not invertible; what can you conclude $a$ and about $TS$ in that case?



The other case is that there exists $mathbf{v}in E_a$ with $T(mathbf{v})neqmathbf{0}$. What can you conclude about $TS$ in that case?



Can you apply the same argument starting with $TS$ instead of with $ST$?



For the minimal polynomials, notice that for any $ngt 0$,
$$T(ST)^nS = (TS)^{n+1}.$$



If $m_1(x) = x^k + a_{k-1}x^{k-1}+cdots + a_1x + a_0$ is the minimal polynomial of $ST$, then
$$begin{align*}
(ST)^k + a_{k-1}(ST)^{k-1}+cdots + a_1(ST) + a_0I &= 0\
TBigl((ST)^k + a_{k-1}(ST)^{k-1}+cdots + a_1(ST) + a_0IBigr)S &= 0\
T(ST)^kS + a_{k-1}T(ST)^{k-1}S + cdots + a_1T(ST)S + a_0TS &= 0\
(TS)^{k+1} + a_{k-1}(TS)^k + cdots + a_1(TS)^2 + a_0(TS) & = 0,
end{align*}$$
so $TS$ satisfies $xm_1(x)$. Hence $m_2(x)$ divides $xm_1(x)$. By a symmetric argument, $m_2(x)$ divides $xm_1(x)$.



If $0$ is not an eigenvalue of $ST$ nor of $TS$, then $x$ cannot be a factor of the minimal polynomials; what can you conclude then?



If $0$ is an eigenvalue of $ST$ and of $TS$, then you cannot simply "take them out"; but it does tell you that every irreducible factor, except perhaps for the irreducible factor $x$, must be the same (and raised to the same degree) in $m_1(x)$ and in $m_2(x)$. Now you just need to deal with $x$, and show that the degree to which it shows in $m_1(x)$ and in $m_2(x)$ can differ by at most $1$, which will give you the result you want.






share|cite|improve this answer





















  • Thank you Arturo, this is an incredibly helpful response, just sad I can't vote it up more than once ;)
    – Freeman
    Oct 31 '11 at 19:39
















3














Suppose that $a$ is an eigenvalue of $ST$. If $mathbf{v}in E_a$, the eigenspace of $ST$ associated to $a$, then

$$TSBigl(T(mathbf{v})Bigr) = TBigl(ST(mathbf{v})Bigr) = T(amathbf{v}) = aT(mathbf{v}),$$
so either $T(mathbf{v})=mathbf{0}$, or else $a$ is also an eigenvalue of $TS$.



So you have two cases: if $T(mathbf{v})=mathbf{0}$ for every $mathbf{v}in E_a$, then $T$ is not invertible; what can you conclude $a$ and about $TS$ in that case?



The other case is that there exists $mathbf{v}in E_a$ with $T(mathbf{v})neqmathbf{0}$. What can you conclude about $TS$ in that case?



Can you apply the same argument starting with $TS$ instead of with $ST$?



For the minimal polynomials, notice that for any $ngt 0$,
$$T(ST)^nS = (TS)^{n+1}.$$



If $m_1(x) = x^k + a_{k-1}x^{k-1}+cdots + a_1x + a_0$ is the minimal polynomial of $ST$, then
$$begin{align*}
(ST)^k + a_{k-1}(ST)^{k-1}+cdots + a_1(ST) + a_0I &= 0\
TBigl((ST)^k + a_{k-1}(ST)^{k-1}+cdots + a_1(ST) + a_0IBigr)S &= 0\
T(ST)^kS + a_{k-1}T(ST)^{k-1}S + cdots + a_1T(ST)S + a_0TS &= 0\
(TS)^{k+1} + a_{k-1}(TS)^k + cdots + a_1(TS)^2 + a_0(TS) & = 0,
end{align*}$$
so $TS$ satisfies $xm_1(x)$. Hence $m_2(x)$ divides $xm_1(x)$. By a symmetric argument, $m_2(x)$ divides $xm_1(x)$.



If $0$ is not an eigenvalue of $ST$ nor of $TS$, then $x$ cannot be a factor of the minimal polynomials; what can you conclude then?



If $0$ is an eigenvalue of $ST$ and of $TS$, then you cannot simply "take them out"; but it does tell you that every irreducible factor, except perhaps for the irreducible factor $x$, must be the same (and raised to the same degree) in $m_1(x)$ and in $m_2(x)$. Now you just need to deal with $x$, and show that the degree to which it shows in $m_1(x)$ and in $m_2(x)$ can differ by at most $1$, which will give you the result you want.






share|cite|improve this answer





















  • Thank you Arturo, this is an incredibly helpful response, just sad I can't vote it up more than once ;)
    – Freeman
    Oct 31 '11 at 19:39














3












3








3






Suppose that $a$ is an eigenvalue of $ST$. If $mathbf{v}in E_a$, the eigenspace of $ST$ associated to $a$, then

$$TSBigl(T(mathbf{v})Bigr) = TBigl(ST(mathbf{v})Bigr) = T(amathbf{v}) = aT(mathbf{v}),$$
so either $T(mathbf{v})=mathbf{0}$, or else $a$ is also an eigenvalue of $TS$.



So you have two cases: if $T(mathbf{v})=mathbf{0}$ for every $mathbf{v}in E_a$, then $T$ is not invertible; what can you conclude $a$ and about $TS$ in that case?



The other case is that there exists $mathbf{v}in E_a$ with $T(mathbf{v})neqmathbf{0}$. What can you conclude about $TS$ in that case?



Can you apply the same argument starting with $TS$ instead of with $ST$?



For the minimal polynomials, notice that for any $ngt 0$,
$$T(ST)^nS = (TS)^{n+1}.$$



If $m_1(x) = x^k + a_{k-1}x^{k-1}+cdots + a_1x + a_0$ is the minimal polynomial of $ST$, then
$$begin{align*}
(ST)^k + a_{k-1}(ST)^{k-1}+cdots + a_1(ST) + a_0I &= 0\
TBigl((ST)^k + a_{k-1}(ST)^{k-1}+cdots + a_1(ST) + a_0IBigr)S &= 0\
T(ST)^kS + a_{k-1}T(ST)^{k-1}S + cdots + a_1T(ST)S + a_0TS &= 0\
(TS)^{k+1} + a_{k-1}(TS)^k + cdots + a_1(TS)^2 + a_0(TS) & = 0,
end{align*}$$
so $TS$ satisfies $xm_1(x)$. Hence $m_2(x)$ divides $xm_1(x)$. By a symmetric argument, $m_2(x)$ divides $xm_1(x)$.



If $0$ is not an eigenvalue of $ST$ nor of $TS$, then $x$ cannot be a factor of the minimal polynomials; what can you conclude then?



If $0$ is an eigenvalue of $ST$ and of $TS$, then you cannot simply "take them out"; but it does tell you that every irreducible factor, except perhaps for the irreducible factor $x$, must be the same (and raised to the same degree) in $m_1(x)$ and in $m_2(x)$. Now you just need to deal with $x$, and show that the degree to which it shows in $m_1(x)$ and in $m_2(x)$ can differ by at most $1$, which will give you the result you want.






share|cite|improve this answer












Suppose that $a$ is an eigenvalue of $ST$. If $mathbf{v}in E_a$, the eigenspace of $ST$ associated to $a$, then

$$TSBigl(T(mathbf{v})Bigr) = TBigl(ST(mathbf{v})Bigr) = T(amathbf{v}) = aT(mathbf{v}),$$
so either $T(mathbf{v})=mathbf{0}$, or else $a$ is also an eigenvalue of $TS$.



So you have two cases: if $T(mathbf{v})=mathbf{0}$ for every $mathbf{v}in E_a$, then $T$ is not invertible; what can you conclude $a$ and about $TS$ in that case?



The other case is that there exists $mathbf{v}in E_a$ with $T(mathbf{v})neqmathbf{0}$. What can you conclude about $TS$ in that case?



Can you apply the same argument starting with $TS$ instead of with $ST$?



For the minimal polynomials, notice that for any $ngt 0$,
$$T(ST)^nS = (TS)^{n+1}.$$



If $m_1(x) = x^k + a_{k-1}x^{k-1}+cdots + a_1x + a_0$ is the minimal polynomial of $ST$, then
$$begin{align*}
(ST)^k + a_{k-1}(ST)^{k-1}+cdots + a_1(ST) + a_0I &= 0\
TBigl((ST)^k + a_{k-1}(ST)^{k-1}+cdots + a_1(ST) + a_0IBigr)S &= 0\
T(ST)^kS + a_{k-1}T(ST)^{k-1}S + cdots + a_1T(ST)S + a_0TS &= 0\
(TS)^{k+1} + a_{k-1}(TS)^k + cdots + a_1(TS)^2 + a_0(TS) & = 0,
end{align*}$$
so $TS$ satisfies $xm_1(x)$. Hence $m_2(x)$ divides $xm_1(x)$. By a symmetric argument, $m_2(x)$ divides $xm_1(x)$.



If $0$ is not an eigenvalue of $ST$ nor of $TS$, then $x$ cannot be a factor of the minimal polynomials; what can you conclude then?



If $0$ is an eigenvalue of $ST$ and of $TS$, then you cannot simply "take them out"; but it does tell you that every irreducible factor, except perhaps for the irreducible factor $x$, must be the same (and raised to the same degree) in $m_1(x)$ and in $m_2(x)$. Now you just need to deal with $x$, and show that the degree to which it shows in $m_1(x)$ and in $m_2(x)$ can differ by at most $1$, which will give you the result you want.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Oct 31 '11 at 19:03









Arturo Magidin

260k32584904




260k32584904












  • Thank you Arturo, this is an incredibly helpful response, just sad I can't vote it up more than once ;)
    – Freeman
    Oct 31 '11 at 19:39


















  • Thank you Arturo, this is an incredibly helpful response, just sad I can't vote it up more than once ;)
    – Freeman
    Oct 31 '11 at 19:39
















Thank you Arturo, this is an incredibly helpful response, just sad I can't vote it up more than once ;)
– Freeman
Oct 31 '11 at 19:39




Thank you Arturo, this is an incredibly helpful response, just sad I can't vote it up more than once ;)
– Freeman
Oct 31 '11 at 19:39


















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f77576%2fif-m-1-m-2-are-the-minimal-polynomials-of-st-and-ts-prove-m-2x-xim-1x%23new-answer', 'question_page');
}
);

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







-

Popular posts from this blog

Bressuire

Image
.mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output .infobox.bordered .mergedrow td,.mw-parser-output .infobox.bordered .mergedrow th{border:0;border-right:1px solid ...
Read more

Cabo Verde

Image
  Nota: Cabo-verdiano redireciona para este artigo. Para a língua falada em Cabo Verde, veja crioulo cabo-verdiano. Para outros significados, veja Cabo Verde (desambiguação). Coordenadas: 14° 55' N 23° 31' O Cabo Verde República de Cabo Verde Bandeira Brasão de Armas Lema: Unidade, Trabalho, Progresso Hino nacional: Cântico da Liberdade Gentílico: cabo-verdiano [ 1 ] Capital Praia 14° 55' N 23° 31' O Cidade mais populosa Praia Língua oficial Português Governo República unitária semipresidencialista [ 2 ]  - Presidente Jorge Carlos Fonseca  - Primeiro-ministro Ulisses Correia e Silva História    - Descoberta 1460   - Independência 00 • de Portugal 5 de Julho de 1975   - Multipartidarismo 13 de Janeiro de 1990  Área    - Total 4 033 km² (146.º)  - Água (%) 0,08 População    - Estimativa para 2017 560 899 [ 3 ] hab. (173.º) ...
Read more

Gyllenstierna

Image
.mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output .infobox.bordered .mergedrow td,.mw-parser-output .infobox.bordered .mergedrow th{border:0;border-right:1px solid ...
Read more