Proving two matrices are similar using the characteristic polynomial

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
0
down vote

favorite












Let
$$
B
= beginbmatrix
a & 1 & & & \
& ddots & ddots & \
& & ddots & 1 \
& & & a
endbmatrix
qquadtextandqquad
A =
beginbmatrix
a & & & \
1 & ddots & & \
& ddots & ddots & \
& & 1 & a
endbmatrix.
$$
I need to prove they are similar. I was thinking using the characteristic polynomial which is as definition $p(A) = t^n - t(operatornametrA) + det A$ and $p(B) = t^n - t(operatornametrA) + det B$ and then both have the same trace and same determinant so their characteristic polynomial is the same so they are similar to the same matrix and hence similar to each other?



Yet I came across another solution suggesting $A ,B$ are both same transformation matrices for different bases of $mathbb R^n$. So I’m not sure if my solution is ok.







share|cite|improve this question


















  • 1




    That isn't the characteristic polynomial.
    – Lord Shark the Unknown
    Aug 26 at 14:16






  • 1




    As transformation matrix use the one that maps $e_k$ to $e_n-k+1$, $k=1,ldots,n$.
    – amsmath
    Aug 26 at 14:21














up vote
0
down vote

favorite












Let
$$
B
= beginbmatrix
a & 1 & & & \
& ddots & ddots & \
& & ddots & 1 \
& & & a
endbmatrix
qquadtextandqquad
A =
beginbmatrix
a & & & \
1 & ddots & & \
& ddots & ddots & \
& & 1 & a
endbmatrix.
$$
I need to prove they are similar. I was thinking using the characteristic polynomial which is as definition $p(A) = t^n - t(operatornametrA) + det A$ and $p(B) = t^n - t(operatornametrA) + det B$ and then both have the same trace and same determinant so their characteristic polynomial is the same so they are similar to the same matrix and hence similar to each other?



Yet I came across another solution suggesting $A ,B$ are both same transformation matrices for different bases of $mathbb R^n$. So I’m not sure if my solution is ok.







share|cite|improve this question


















  • 1




    That isn't the characteristic polynomial.
    – Lord Shark the Unknown
    Aug 26 at 14:16






  • 1




    As transformation matrix use the one that maps $e_k$ to $e_n-k+1$, $k=1,ldots,n$.
    – amsmath
    Aug 26 at 14:21












up vote
0
down vote

favorite









up vote
0
down vote

favorite











Let
$$
B
= beginbmatrix
a & 1 & & & \
& ddots & ddots & \
& & ddots & 1 \
& & & a
endbmatrix
qquadtextandqquad
A =
beginbmatrix
a & & & \
1 & ddots & & \
& ddots & ddots & \
& & 1 & a
endbmatrix.
$$
I need to prove they are similar. I was thinking using the characteristic polynomial which is as definition $p(A) = t^n - t(operatornametrA) + det A$ and $p(B) = t^n - t(operatornametrA) + det B$ and then both have the same trace and same determinant so their characteristic polynomial is the same so they are similar to the same matrix and hence similar to each other?



Yet I came across another solution suggesting $A ,B$ are both same transformation matrices for different bases of $mathbb R^n$. So I’m not sure if my solution is ok.







share|cite|improve this question














Let
$$
B
= beginbmatrix
a & 1 & & & \
& ddots & ddots & \
& & ddots & 1 \
& & & a
endbmatrix
qquadtextandqquad
A =
beginbmatrix
a & & & \
1 & ddots & & \
& ddots & ddots & \
& & 1 & a
endbmatrix.
$$
I need to prove they are similar. I was thinking using the characteristic polynomial which is as definition $p(A) = t^n - t(operatornametrA) + det A$ and $p(B) = t^n - t(operatornametrA) + det B$ and then both have the same trace and same determinant so their characteristic polynomial is the same so they are similar to the same matrix and hence similar to each other?



Yet I came across another solution suggesting $A ,B$ are both same transformation matrices for different bases of $mathbb R^n$. So I’m not sure if my solution is ok.









share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Aug 26 at 17:44

























asked Aug 26 at 14:09









bm1125

38016




38016







  • 1




    That isn't the characteristic polynomial.
    – Lord Shark the Unknown
    Aug 26 at 14:16






  • 1




    As transformation matrix use the one that maps $e_k$ to $e_n-k+1$, $k=1,ldots,n$.
    – amsmath
    Aug 26 at 14:21












  • 1




    That isn't the characteristic polynomial.
    – Lord Shark the Unknown
    Aug 26 at 14:16






  • 1




    As transformation matrix use the one that maps $e_k$ to $e_n-k+1$, $k=1,ldots,n$.
    – amsmath
    Aug 26 at 14:21







1




1




That isn't the characteristic polynomial.
– Lord Shark the Unknown
Aug 26 at 14:16




That isn't the characteristic polynomial.
– Lord Shark the Unknown
Aug 26 at 14:16




1




1




As transformation matrix use the one that maps $e_k$ to $e_n-k+1$, $k=1,ldots,n$.
– amsmath
Aug 26 at 14:21




As transformation matrix use the one that maps $e_k$ to $e_n-k+1$, $k=1,ldots,n$.
– amsmath
Aug 26 at 14:21










3 Answers
3






active

oldest

votes

















up vote
2
down vote



accepted










Your approach is wrong. For instance, the matrices $left(beginsmallmatrix0&1\0&0endsmallmatrixright)$ and $left(beginsmallmatrix0&0\0&0endsmallmatrixright)$ have the same characteristic polynomials ($lambda^2$). However, they are not similar.



Of course, you can always use the fact that every matrix is similar to its transpose. But, in this case, the approach that you suggest at the end of your question (same transformation, different bases) is perhaps the best one.






share|cite|improve this answer




















  • Isn't being the same transformation in different bases the very definition of similarity?
    – i try
    Aug 26 at 14:43










  • No. Two $ntimes n$ matrices $A$ and $B$ are similar if there is an invertible $ntimes n$ matrix $P$ such that $B=P^-1AP$.
    – José Carlos Santos
    Aug 26 at 14:45










  • Which says they are the same linear transformation in different bases; $P$ being the basis change marix.
    – i try
    Aug 26 at 14:46










  • @itry I know. Nevertheless, the definition of similarity is not the one that you mentioned.
    – José Carlos Santos
    Aug 26 at 14:54










  • So can you show how to prove it? According the the solution they chose $ T(v) = Av $ and then $ B_0 = (e_1,...,e_n) $ and $ B_1 = (e_n,...,e_1)$ and then $ [T]_B_0 = A $ and $ [T]_B_1 = B $ but clearly $ [T]_B_1 not = B $
    – bm1125
    Aug 26 at 15:08

















up vote
2
down vote













Similar matrices have the same characteristic polynomial, but matrices with the same characteristic polynomial are not necessarily similar.



They will have the same spectrum but the geometric multiplicities of the Eigenvalues can be different.






share|cite|improve this answer



























    up vote
    1
    down vote













    Your approach of equality of characteristic polynomials to prove similarity is true for diagonalisable matrices. Here it is 'easy' to find the permutation matrix such that $P^tAP=B$.






    share|cite|improve this answer






















      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',
      convertImagesToLinks: true,
      noModals: false,
      showLowRepImageUploadWarning: true,
      reputationToPostImages: 10,
      bindNavPrevention: true,
      postfix: "",
      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%2f2895071%2fproving-two-matrices-are-similar-using-the-characteristic-polynomial%23new-answer', 'question_page');

      );

      Post as a guest






























      3 Answers
      3






      active

      oldest

      votes








      3 Answers
      3






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes








      up vote
      2
      down vote



      accepted










      Your approach is wrong. For instance, the matrices $left(beginsmallmatrix0&1\0&0endsmallmatrixright)$ and $left(beginsmallmatrix0&0\0&0endsmallmatrixright)$ have the same characteristic polynomials ($lambda^2$). However, they are not similar.



      Of course, you can always use the fact that every matrix is similar to its transpose. But, in this case, the approach that you suggest at the end of your question (same transformation, different bases) is perhaps the best one.






      share|cite|improve this answer




















      • Isn't being the same transformation in different bases the very definition of similarity?
        – i try
        Aug 26 at 14:43










      • No. Two $ntimes n$ matrices $A$ and $B$ are similar if there is an invertible $ntimes n$ matrix $P$ such that $B=P^-1AP$.
        – José Carlos Santos
        Aug 26 at 14:45










      • Which says they are the same linear transformation in different bases; $P$ being the basis change marix.
        – i try
        Aug 26 at 14:46










      • @itry I know. Nevertheless, the definition of similarity is not the one that you mentioned.
        – José Carlos Santos
        Aug 26 at 14:54










      • So can you show how to prove it? According the the solution they chose $ T(v) = Av $ and then $ B_0 = (e_1,...,e_n) $ and $ B_1 = (e_n,...,e_1)$ and then $ [T]_B_0 = A $ and $ [T]_B_1 = B $ but clearly $ [T]_B_1 not = B $
        – bm1125
        Aug 26 at 15:08














      up vote
      2
      down vote



      accepted










      Your approach is wrong. For instance, the matrices $left(beginsmallmatrix0&1\0&0endsmallmatrixright)$ and $left(beginsmallmatrix0&0\0&0endsmallmatrixright)$ have the same characteristic polynomials ($lambda^2$). However, they are not similar.



      Of course, you can always use the fact that every matrix is similar to its transpose. But, in this case, the approach that you suggest at the end of your question (same transformation, different bases) is perhaps the best one.






      share|cite|improve this answer




















      • Isn't being the same transformation in different bases the very definition of similarity?
        – i try
        Aug 26 at 14:43










      • No. Two $ntimes n$ matrices $A$ and $B$ are similar if there is an invertible $ntimes n$ matrix $P$ such that $B=P^-1AP$.
        – José Carlos Santos
        Aug 26 at 14:45










      • Which says they are the same linear transformation in different bases; $P$ being the basis change marix.
        – i try
        Aug 26 at 14:46










      • @itry I know. Nevertheless, the definition of similarity is not the one that you mentioned.
        – José Carlos Santos
        Aug 26 at 14:54










      • So can you show how to prove it? According the the solution they chose $ T(v) = Av $ and then $ B_0 = (e_1,...,e_n) $ and $ B_1 = (e_n,...,e_1)$ and then $ [T]_B_0 = A $ and $ [T]_B_1 = B $ but clearly $ [T]_B_1 not = B $
        – bm1125
        Aug 26 at 15:08












      up vote
      2
      down vote



      accepted







      up vote
      2
      down vote



      accepted






      Your approach is wrong. For instance, the matrices $left(beginsmallmatrix0&1\0&0endsmallmatrixright)$ and $left(beginsmallmatrix0&0\0&0endsmallmatrixright)$ have the same characteristic polynomials ($lambda^2$). However, they are not similar.



      Of course, you can always use the fact that every matrix is similar to its transpose. But, in this case, the approach that you suggest at the end of your question (same transformation, different bases) is perhaps the best one.






      share|cite|improve this answer












      Your approach is wrong. For instance, the matrices $left(beginsmallmatrix0&1\0&0endsmallmatrixright)$ and $left(beginsmallmatrix0&0\0&0endsmallmatrixright)$ have the same characteristic polynomials ($lambda^2$). However, they are not similar.



      Of course, you can always use the fact that every matrix is similar to its transpose. But, in this case, the approach that you suggest at the end of your question (same transformation, different bases) is perhaps the best one.







      share|cite|improve this answer












      share|cite|improve this answer



      share|cite|improve this answer










      answered Aug 26 at 14:14









      José Carlos Santos

      119k16101182




      119k16101182











      • Isn't being the same transformation in different bases the very definition of similarity?
        – i try
        Aug 26 at 14:43










      • No. Two $ntimes n$ matrices $A$ and $B$ are similar if there is an invertible $ntimes n$ matrix $P$ such that $B=P^-1AP$.
        – José Carlos Santos
        Aug 26 at 14:45










      • Which says they are the same linear transformation in different bases; $P$ being the basis change marix.
        – i try
        Aug 26 at 14:46










      • @itry I know. Nevertheless, the definition of similarity is not the one that you mentioned.
        – José Carlos Santos
        Aug 26 at 14:54










      • So can you show how to prove it? According the the solution they chose $ T(v) = Av $ and then $ B_0 = (e_1,...,e_n) $ and $ B_1 = (e_n,...,e_1)$ and then $ [T]_B_0 = A $ and $ [T]_B_1 = B $ but clearly $ [T]_B_1 not = B $
        – bm1125
        Aug 26 at 15:08
















      • Isn't being the same transformation in different bases the very definition of similarity?
        – i try
        Aug 26 at 14:43










      • No. Two $ntimes n$ matrices $A$ and $B$ are similar if there is an invertible $ntimes n$ matrix $P$ such that $B=P^-1AP$.
        – José Carlos Santos
        Aug 26 at 14:45










      • Which says they are the same linear transformation in different bases; $P$ being the basis change marix.
        – i try
        Aug 26 at 14:46










      • @itry I know. Nevertheless, the definition of similarity is not the one that you mentioned.
        – José Carlos Santos
        Aug 26 at 14:54










      • So can you show how to prove it? According the the solution they chose $ T(v) = Av $ and then $ B_0 = (e_1,...,e_n) $ and $ B_1 = (e_n,...,e_1)$ and then $ [T]_B_0 = A $ and $ [T]_B_1 = B $ but clearly $ [T]_B_1 not = B $
        – bm1125
        Aug 26 at 15:08















      Isn't being the same transformation in different bases the very definition of similarity?
      – i try
      Aug 26 at 14:43




      Isn't being the same transformation in different bases the very definition of similarity?
      – i try
      Aug 26 at 14:43












      No. Two $ntimes n$ matrices $A$ and $B$ are similar if there is an invertible $ntimes n$ matrix $P$ such that $B=P^-1AP$.
      – José Carlos Santos
      Aug 26 at 14:45




      No. Two $ntimes n$ matrices $A$ and $B$ are similar if there is an invertible $ntimes n$ matrix $P$ such that $B=P^-1AP$.
      – José Carlos Santos
      Aug 26 at 14:45












      Which says they are the same linear transformation in different bases; $P$ being the basis change marix.
      – i try
      Aug 26 at 14:46




      Which says they are the same linear transformation in different bases; $P$ being the basis change marix.
      – i try
      Aug 26 at 14:46












      @itry I know. Nevertheless, the definition of similarity is not the one that you mentioned.
      – José Carlos Santos
      Aug 26 at 14:54




      @itry I know. Nevertheless, the definition of similarity is not the one that you mentioned.
      – José Carlos Santos
      Aug 26 at 14:54












      So can you show how to prove it? According the the solution they chose $ T(v) = Av $ and then $ B_0 = (e_1,...,e_n) $ and $ B_1 = (e_n,...,e_1)$ and then $ [T]_B_0 = A $ and $ [T]_B_1 = B $ but clearly $ [T]_B_1 not = B $
      – bm1125
      Aug 26 at 15:08




      So can you show how to prove it? According the the solution they chose $ T(v) = Av $ and then $ B_0 = (e_1,...,e_n) $ and $ B_1 = (e_n,...,e_1)$ and then $ [T]_B_0 = A $ and $ [T]_B_1 = B $ but clearly $ [T]_B_1 not = B $
      – bm1125
      Aug 26 at 15:08










      up vote
      2
      down vote













      Similar matrices have the same characteristic polynomial, but matrices with the same characteristic polynomial are not necessarily similar.



      They will have the same spectrum but the geometric multiplicities of the Eigenvalues can be different.






      share|cite|improve this answer
























        up vote
        2
        down vote













        Similar matrices have the same characteristic polynomial, but matrices with the same characteristic polynomial are not necessarily similar.



        They will have the same spectrum but the geometric multiplicities of the Eigenvalues can be different.






        share|cite|improve this answer






















          up vote
          2
          down vote










          up vote
          2
          down vote









          Similar matrices have the same characteristic polynomial, but matrices with the same characteristic polynomial are not necessarily similar.



          They will have the same spectrum but the geometric multiplicities of the Eigenvalues can be different.






          share|cite|improve this answer












          Similar matrices have the same characteristic polynomial, but matrices with the same characteristic polynomial are not necessarily similar.



          They will have the same spectrum but the geometric multiplicities of the Eigenvalues can be different.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Aug 26 at 14:42









          i try

          527112




          527112




















              up vote
              1
              down vote













              Your approach of equality of characteristic polynomials to prove similarity is true for diagonalisable matrices. Here it is 'easy' to find the permutation matrix such that $P^tAP=B$.






              share|cite|improve this answer


























                up vote
                1
                down vote













                Your approach of equality of characteristic polynomials to prove similarity is true for diagonalisable matrices. Here it is 'easy' to find the permutation matrix such that $P^tAP=B$.






                share|cite|improve this answer
























                  up vote
                  1
                  down vote










                  up vote
                  1
                  down vote









                  Your approach of equality of characteristic polynomials to prove similarity is true for diagonalisable matrices. Here it is 'easy' to find the permutation matrix such that $P^tAP=B$.






                  share|cite|improve this answer














                  Your approach of equality of characteristic polynomials to prove similarity is true for diagonalisable matrices. Here it is 'easy' to find the permutation matrix such that $P^tAP=B$.







                  share|cite|improve this answer














                  share|cite|improve this answer



                  share|cite|improve this answer








                  edited Aug 26 at 16:36

























                  answered Aug 26 at 14:34









                  Toni Mhax

                  7119




                  7119



























                       

                      draft saved


                      draft discarded















































                       


                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function ()
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2895071%2fproving-two-matrices-are-similar-using-the-characteristic-polynomial%23new-answer', 'question_page');

                      );

                      Post as a guest













































































                      這個網誌中的熱門文章

                      How to combine Bézier curves to a surface?

                      Mutual Information Always Non-negative

                      Why am i infinitely getting the same tweet with the Twitter Search API?