A conceptual Question on Diagonalization of Matrix












1












$begingroup$


Let S belong to F(m x n) and T belong to (n x m). Let ST be invertible. Prove that ST is diagonalizable if and only if TS is diagonalizable for: a) when n = m b) when n > m c) Can ST be invertible when n < m?



I tried a lot in different ways but couldn't get this done. Can anyone help me on this? Thanks in advance. :)










share|cite|improve this question









$endgroup$












  • $begingroup$
    I recommend for c) you interpret your matrices as morhpisms and use dimensions
    $endgroup$
    – Enkidu
    Dec 7 '18 at 9:09
















1












$begingroup$


Let S belong to F(m x n) and T belong to (n x m). Let ST be invertible. Prove that ST is diagonalizable if and only if TS is diagonalizable for: a) when n = m b) when n > m c) Can ST be invertible when n < m?



I tried a lot in different ways but couldn't get this done. Can anyone help me on this? Thanks in advance. :)










share|cite|improve this question









$endgroup$












  • $begingroup$
    I recommend for c) you interpret your matrices as morhpisms and use dimensions
    $endgroup$
    – Enkidu
    Dec 7 '18 at 9:09














1












1








1


0



$begingroup$


Let S belong to F(m x n) and T belong to (n x m). Let ST be invertible. Prove that ST is diagonalizable if and only if TS is diagonalizable for: a) when n = m b) when n > m c) Can ST be invertible when n < m?



I tried a lot in different ways but couldn't get this done. Can anyone help me on this? Thanks in advance. :)










share|cite|improve this question









$endgroup$




Let S belong to F(m x n) and T belong to (n x m). Let ST be invertible. Prove that ST is diagonalizable if and only if TS is diagonalizable for: a) when n = m b) when n > m c) Can ST be invertible when n < m?



I tried a lot in different ways but couldn't get this done. Can anyone help me on this? Thanks in advance. :)







linear-algebra diagonalization






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 7 '18 at 1:15









Ashis JanaAshis Jana

22




22












  • $begingroup$
    I recommend for c) you interpret your matrices as morhpisms and use dimensions
    $endgroup$
    – Enkidu
    Dec 7 '18 at 9:09


















  • $begingroup$
    I recommend for c) you interpret your matrices as morhpisms and use dimensions
    $endgroup$
    – Enkidu
    Dec 7 '18 at 9:09
















$begingroup$
I recommend for c) you interpret your matrices as morhpisms and use dimensions
$endgroup$
– Enkidu
Dec 7 '18 at 9:09




$begingroup$
I recommend for c) you interpret your matrices as morhpisms and use dimensions
$endgroup$
– Enkidu
Dec 7 '18 at 9:09










1 Answer
1






active

oldest

votes


















0












$begingroup$

Hints for (b). Denote the minimal polynomials of $ST$ and $TS$ by $m_{ST}$ and $m_{TS}$ respectively.



Suppose $ST$ is diagonalisable. Since $ST$ is invertible, $0$ is not a root of $m_{ST}$. Hence $p(x)=x,m_{ST}(x)$ is a product of distinct linear factors. Now, show that $p(TS)=0$ and hence $m_{TS}|p$.



Conversely, suppose $TS$ is diagonalisable, so that $m_{TS}$ is a product of distinct linear factors. By considering $S,m_{TS}(TS),T$ and by using the assumption that $ST$ is invertible, show that $m_{TS}(ST)=0$ and hence $m_{ST}|m_{TS}$.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Thanks a lot. :)
    $endgroup$
    – Ashis Jana
    Dec 8 '18 at 0:19











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%2f3029328%2fa-conceptual-question-on-diagonalization-of-matrix%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









0












$begingroup$

Hints for (b). Denote the minimal polynomials of $ST$ and $TS$ by $m_{ST}$ and $m_{TS}$ respectively.



Suppose $ST$ is diagonalisable. Since $ST$ is invertible, $0$ is not a root of $m_{ST}$. Hence $p(x)=x,m_{ST}(x)$ is a product of distinct linear factors. Now, show that $p(TS)=0$ and hence $m_{TS}|p$.



Conversely, suppose $TS$ is diagonalisable, so that $m_{TS}$ is a product of distinct linear factors. By considering $S,m_{TS}(TS),T$ and by using the assumption that $ST$ is invertible, show that $m_{TS}(ST)=0$ and hence $m_{ST}|m_{TS}$.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Thanks a lot. :)
    $endgroup$
    – Ashis Jana
    Dec 8 '18 at 0:19
















0












$begingroup$

Hints for (b). Denote the minimal polynomials of $ST$ and $TS$ by $m_{ST}$ and $m_{TS}$ respectively.



Suppose $ST$ is diagonalisable. Since $ST$ is invertible, $0$ is not a root of $m_{ST}$. Hence $p(x)=x,m_{ST}(x)$ is a product of distinct linear factors. Now, show that $p(TS)=0$ and hence $m_{TS}|p$.



Conversely, suppose $TS$ is diagonalisable, so that $m_{TS}$ is a product of distinct linear factors. By considering $S,m_{TS}(TS),T$ and by using the assumption that $ST$ is invertible, show that $m_{TS}(ST)=0$ and hence $m_{ST}|m_{TS}$.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Thanks a lot. :)
    $endgroup$
    – Ashis Jana
    Dec 8 '18 at 0:19














0












0








0





$begingroup$

Hints for (b). Denote the minimal polynomials of $ST$ and $TS$ by $m_{ST}$ and $m_{TS}$ respectively.



Suppose $ST$ is diagonalisable. Since $ST$ is invertible, $0$ is not a root of $m_{ST}$. Hence $p(x)=x,m_{ST}(x)$ is a product of distinct linear factors. Now, show that $p(TS)=0$ and hence $m_{TS}|p$.



Conversely, suppose $TS$ is diagonalisable, so that $m_{TS}$ is a product of distinct linear factors. By considering $S,m_{TS}(TS),T$ and by using the assumption that $ST$ is invertible, show that $m_{TS}(ST)=0$ and hence $m_{ST}|m_{TS}$.






share|cite|improve this answer









$endgroup$



Hints for (b). Denote the minimal polynomials of $ST$ and $TS$ by $m_{ST}$ and $m_{TS}$ respectively.



Suppose $ST$ is diagonalisable. Since $ST$ is invertible, $0$ is not a root of $m_{ST}$. Hence $p(x)=x,m_{ST}(x)$ is a product of distinct linear factors. Now, show that $p(TS)=0$ and hence $m_{TS}|p$.



Conversely, suppose $TS$ is diagonalisable, so that $m_{TS}$ is a product of distinct linear factors. By considering $S,m_{TS}(TS),T$ and by using the assumption that $ST$ is invertible, show that $m_{TS}(ST)=0$ and hence $m_{ST}|m_{TS}$.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Dec 7 '18 at 10:39









user1551user1551

72.4k566127




72.4k566127












  • $begingroup$
    Thanks a lot. :)
    $endgroup$
    – Ashis Jana
    Dec 8 '18 at 0:19


















  • $begingroup$
    Thanks a lot. :)
    $endgroup$
    – Ashis Jana
    Dec 8 '18 at 0:19
















$begingroup$
Thanks a lot. :)
$endgroup$
– Ashis Jana
Dec 8 '18 at 0:19




$begingroup$
Thanks a lot. :)
$endgroup$
– Ashis Jana
Dec 8 '18 at 0:19


















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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3029328%2fa-conceptual-question-on-diagonalization-of-matrix%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

Quarter-circle Tiles

build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

Mont Emei