Are these square matrices always diagonalisable? Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30 pm US/Eastern)Conditions for diagonalizability of $ntimes n$ anti-diagonal matricesFinding eigenvalues/vectors of a matrix and proving it is not diagonalisable.Finding if a linear transformation is diagonalisableThe diagonalisation of the two matricesIf $A in K^n times n$ is diagonalisable, the dimension of the subspace of its commuting matrices is $geq n$ nCalculating the eigenvalues of a diagonalisable linear operator $L$.How to find eigenvalues for mod 2 field?Find for which real parameter a matrix is diagonalisableSquare Roots of a Matrix: Diagonalisable Solutions.eigenvalues and eigenvectors of Diagonalisable matrices

Is it accepted to use working hours to read general interest books?

What helicopter has the most rotor blades?

false 'Security alert' from Google - every login generates mails from 'no-reply@accounts.google.com'

What were wait-states, and why was it only an issue for PCs?

Israeli soda type drink

What *exactly* is electrical current, voltage, and resistance?

In search of the origins of term censor, I hit a dead end stuck with the greek term, to censor, λογοκρίνω

Does a Draconic Bloodline sorcerer's doubled proficiency bonus for Charisma checks against dragons apply to all dragon types or only the chosen one?

Does Prince Arnaud cause someone holding the Princess to lose?

How to keep bees out of canned beverages?

Protagonist's race is hidden - should I reveal it?

What is the evidence that custom checks in Northern Ireland are going to result in violence?

My admission is revoked after accepting the admission offer

Has a Nobel Peace laureate ever been accused of war crimes?

Why is water being consumed when my shutoff valve is closed?

Why aren't road bicycle wheels tiny?

Co-worker works way more than he should

Is it appropriate to mention a relatable company blog post when you're asked about the company?

/bin/ls sorts differently than just ls

Why did Israel vote against lifting the American embargo on Cuba?

Are there existing rules/lore for MTG planeswalkers?

What's parked in Mil Moscow helicopter plant?

What does the black goddess statue do and what is it?

Will I lose my paid in full property



Are these square matrices always diagonalisable?



Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30 pm US/Eastern)Conditions for diagonalizability of $ntimes n$ anti-diagonal matricesFinding eigenvalues/vectors of a matrix and proving it is not diagonalisable.Finding if a linear transformation is diagonalisableThe diagonalisation of the two matricesIf $A in K^n times n$ is diagonalisable, the dimension of the subspace of its commuting matrices is $geq n$ nCalculating the eigenvalues of a diagonalisable linear operator $L$.How to find eigenvalues for mod 2 field?Find for which real parameter a matrix is diagonalisableSquare Roots of a Matrix: Diagonalisable Solutions.eigenvalues and eigenvectors of Diagonalisable matrices










3












$begingroup$


When trying to solve a physics problem on decoupling a system of ODEs, I found myself needing to address the following problem:




Let $A_nin M_n(mathbb R)$ be the matrix with all $1$s above its main diagonal, all $-1$s below its diagonal, and $0$s everywhere else. Is $A_n$ always diagonalisable? If so, what is its diagonalisation (equivalently: what are its eigenvalues and corresponding eigenvectors)?




For example,
$$A_3=beginbmatrix0&1&0\-1&0&1\0&-1&0endbmatrix,quad A_5beginbmatrix0&1&0&0&0\-1&0&1&0&0\0&-1&0&1&0\0&0&-1&0&1\0&0&0&-1&0endbmatrix.$$




Assuming my code is correct, Mathematica has been able to verify that $A_n$ is always diagonalisable up to $n=1000$. If we use $chi_n(t)inmathbb Z[t]$ to denote the characteristic polynomial of $A_n$, a straightforward evaluation also shows that
$$chi_n(t)=-tchi_n-1(t)+chi_n-2(t)tag1$$
for all $ngeq4$. Furthermore, note that $A_n=-A_n^t$ so that, in the case where the dimension is even,
$$det(A_2n-lambda I)=det(A_2n^t-lambda I)=det(-A_2n-lambda I)=det(A_2n+lambda I).$$
This implies that whenever $lambda$ is an eigenvalue of $A_2n$, so is $-lambda$. In other words, $chi_2n(t)$ is always of the form $(t^2-lambda _1^2)(t^2-lambda_2^2)dotsm(t^2-lambda_n^2)$ for some $lambda_i$.



And this is where I am stuck. In order for $A_n$ to be diagonalisable, we must have that all the eigenvalues are distinct, but trying to use the recurrence $(1)$ and strong induction, or trying to use the formula for the even case have not helped at all. It seems like the most probable line of attack would be to somehow show that
$$chi_2n'(t)=2tsum_k=1^nfracchi_2n(t)t^2-lambda_k^2$$
never shares a common zero with $chi_2n$ (which would resolve the even case), though I don't see how to make this work.




Note: I do not have any clue how to actually find the eigenvalues/eigenvectors even in the case where the $A_n$ are diagonalisable. As such even if someone cannot answer the second part of the question, but can prove that the $A_n$ are diagonalisable, I would appreciate that as an answer as well. Above I tried to look at the special case where the dimension is even, though of course the proof for all odd and even $n$ is more valuable. Even if this is not possible, for my purposes I just need an unbounded subset $Ssubseteqmathbb Z$ for which the conclusion is proven for $nin S$, so any such approach is welcome too.



Thank you in advance!










share|cite|improve this question









$endgroup$











  • $begingroup$
    All eigenvalues distinct is a sufficient but not necessary condition for a matrix to be diagonalizable.
    $endgroup$
    – Henning Makholm
    2 hours ago















3












$begingroup$


When trying to solve a physics problem on decoupling a system of ODEs, I found myself needing to address the following problem:




Let $A_nin M_n(mathbb R)$ be the matrix with all $1$s above its main diagonal, all $-1$s below its diagonal, and $0$s everywhere else. Is $A_n$ always diagonalisable? If so, what is its diagonalisation (equivalently: what are its eigenvalues and corresponding eigenvectors)?




For example,
$$A_3=beginbmatrix0&1&0\-1&0&1\0&-1&0endbmatrix,quad A_5beginbmatrix0&1&0&0&0\-1&0&1&0&0\0&-1&0&1&0\0&0&-1&0&1\0&0&0&-1&0endbmatrix.$$




Assuming my code is correct, Mathematica has been able to verify that $A_n$ is always diagonalisable up to $n=1000$. If we use $chi_n(t)inmathbb Z[t]$ to denote the characteristic polynomial of $A_n$, a straightforward evaluation also shows that
$$chi_n(t)=-tchi_n-1(t)+chi_n-2(t)tag1$$
for all $ngeq4$. Furthermore, note that $A_n=-A_n^t$ so that, in the case where the dimension is even,
$$det(A_2n-lambda I)=det(A_2n^t-lambda I)=det(-A_2n-lambda I)=det(A_2n+lambda I).$$
This implies that whenever $lambda$ is an eigenvalue of $A_2n$, so is $-lambda$. In other words, $chi_2n(t)$ is always of the form $(t^2-lambda _1^2)(t^2-lambda_2^2)dotsm(t^2-lambda_n^2)$ for some $lambda_i$.



And this is where I am stuck. In order for $A_n$ to be diagonalisable, we must have that all the eigenvalues are distinct, but trying to use the recurrence $(1)$ and strong induction, or trying to use the formula for the even case have not helped at all. It seems like the most probable line of attack would be to somehow show that
$$chi_2n'(t)=2tsum_k=1^nfracchi_2n(t)t^2-lambda_k^2$$
never shares a common zero with $chi_2n$ (which would resolve the even case), though I don't see how to make this work.




Note: I do not have any clue how to actually find the eigenvalues/eigenvectors even in the case where the $A_n$ are diagonalisable. As such even if someone cannot answer the second part of the question, but can prove that the $A_n$ are diagonalisable, I would appreciate that as an answer as well. Above I tried to look at the special case where the dimension is even, though of course the proof for all odd and even $n$ is more valuable. Even if this is not possible, for my purposes I just need an unbounded subset $Ssubseteqmathbb Z$ for which the conclusion is proven for $nin S$, so any such approach is welcome too.



Thank you in advance!










share|cite|improve this question









$endgroup$











  • $begingroup$
    All eigenvalues distinct is a sufficient but not necessary condition for a matrix to be diagonalizable.
    $endgroup$
    – Henning Makholm
    2 hours ago













3












3








3





$begingroup$


When trying to solve a physics problem on decoupling a system of ODEs, I found myself needing to address the following problem:




Let $A_nin M_n(mathbb R)$ be the matrix with all $1$s above its main diagonal, all $-1$s below its diagonal, and $0$s everywhere else. Is $A_n$ always diagonalisable? If so, what is its diagonalisation (equivalently: what are its eigenvalues and corresponding eigenvectors)?




For example,
$$A_3=beginbmatrix0&1&0\-1&0&1\0&-1&0endbmatrix,quad A_5beginbmatrix0&1&0&0&0\-1&0&1&0&0\0&-1&0&1&0\0&0&-1&0&1\0&0&0&-1&0endbmatrix.$$




Assuming my code is correct, Mathematica has been able to verify that $A_n$ is always diagonalisable up to $n=1000$. If we use $chi_n(t)inmathbb Z[t]$ to denote the characteristic polynomial of $A_n$, a straightforward evaluation also shows that
$$chi_n(t)=-tchi_n-1(t)+chi_n-2(t)tag1$$
for all $ngeq4$. Furthermore, note that $A_n=-A_n^t$ so that, in the case where the dimension is even,
$$det(A_2n-lambda I)=det(A_2n^t-lambda I)=det(-A_2n-lambda I)=det(A_2n+lambda I).$$
This implies that whenever $lambda$ is an eigenvalue of $A_2n$, so is $-lambda$. In other words, $chi_2n(t)$ is always of the form $(t^2-lambda _1^2)(t^2-lambda_2^2)dotsm(t^2-lambda_n^2)$ for some $lambda_i$.



And this is where I am stuck. In order for $A_n$ to be diagonalisable, we must have that all the eigenvalues are distinct, but trying to use the recurrence $(1)$ and strong induction, or trying to use the formula for the even case have not helped at all. It seems like the most probable line of attack would be to somehow show that
$$chi_2n'(t)=2tsum_k=1^nfracchi_2n(t)t^2-lambda_k^2$$
never shares a common zero with $chi_2n$ (which would resolve the even case), though I don't see how to make this work.




Note: I do not have any clue how to actually find the eigenvalues/eigenvectors even in the case where the $A_n$ are diagonalisable. As such even if someone cannot answer the second part of the question, but can prove that the $A_n$ are diagonalisable, I would appreciate that as an answer as well. Above I tried to look at the special case where the dimension is even, though of course the proof for all odd and even $n$ is more valuable. Even if this is not possible, for my purposes I just need an unbounded subset $Ssubseteqmathbb Z$ for which the conclusion is proven for $nin S$, so any such approach is welcome too.



Thank you in advance!










share|cite|improve this question









$endgroup$




When trying to solve a physics problem on decoupling a system of ODEs, I found myself needing to address the following problem:




Let $A_nin M_n(mathbb R)$ be the matrix with all $1$s above its main diagonal, all $-1$s below its diagonal, and $0$s everywhere else. Is $A_n$ always diagonalisable? If so, what is its diagonalisation (equivalently: what are its eigenvalues and corresponding eigenvectors)?




For example,
$$A_3=beginbmatrix0&1&0\-1&0&1\0&-1&0endbmatrix,quad A_5beginbmatrix0&1&0&0&0\-1&0&1&0&0\0&-1&0&1&0\0&0&-1&0&1\0&0&0&-1&0endbmatrix.$$




Assuming my code is correct, Mathematica has been able to verify that $A_n$ is always diagonalisable up to $n=1000$. If we use $chi_n(t)inmathbb Z[t]$ to denote the characteristic polynomial of $A_n$, a straightforward evaluation also shows that
$$chi_n(t)=-tchi_n-1(t)+chi_n-2(t)tag1$$
for all $ngeq4$. Furthermore, note that $A_n=-A_n^t$ so that, in the case where the dimension is even,
$$det(A_2n-lambda I)=det(A_2n^t-lambda I)=det(-A_2n-lambda I)=det(A_2n+lambda I).$$
This implies that whenever $lambda$ is an eigenvalue of $A_2n$, so is $-lambda$. In other words, $chi_2n(t)$ is always of the form $(t^2-lambda _1^2)(t^2-lambda_2^2)dotsm(t^2-lambda_n^2)$ for some $lambda_i$.



And this is where I am stuck. In order for $A_n$ to be diagonalisable, we must have that all the eigenvalues are distinct, but trying to use the recurrence $(1)$ and strong induction, or trying to use the formula for the even case have not helped at all. It seems like the most probable line of attack would be to somehow show that
$$chi_2n'(t)=2tsum_k=1^nfracchi_2n(t)t^2-lambda_k^2$$
never shares a common zero with $chi_2n$ (which would resolve the even case), though I don't see how to make this work.




Note: I do not have any clue how to actually find the eigenvalues/eigenvectors even in the case where the $A_n$ are diagonalisable. As such even if someone cannot answer the second part of the question, but can prove that the $A_n$ are diagonalisable, I would appreciate that as an answer as well. Above I tried to look at the special case where the dimension is even, though of course the proof for all odd and even $n$ is more valuable. Even if this is not possible, for my purposes I just need an unbounded subset $Ssubseteqmathbb Z$ for which the conclusion is proven for $nin S$, so any such approach is welcome too.



Thank you in advance!







linear-algebra eigenvalues-eigenvectors determinant diagonalization






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked 4 hours ago









YiFanYiFan

5,6252829




5,6252829











  • $begingroup$
    All eigenvalues distinct is a sufficient but not necessary condition for a matrix to be diagonalizable.
    $endgroup$
    – Henning Makholm
    2 hours ago
















  • $begingroup$
    All eigenvalues distinct is a sufficient but not necessary condition for a matrix to be diagonalizable.
    $endgroup$
    – Henning Makholm
    2 hours ago















$begingroup$
All eigenvalues distinct is a sufficient but not necessary condition for a matrix to be diagonalizable.
$endgroup$
– Henning Makholm
2 hours ago




$begingroup$
All eigenvalues distinct is a sufficient but not necessary condition for a matrix to be diagonalizable.
$endgroup$
– Henning Makholm
2 hours ago










3 Answers
3






active

oldest

votes


















5












$begingroup$

The matrix $A_n$ is a tridiagonal Toeplitz matrix with diagonal entries $delta = 0$ and off-diagonal entries $tau = 1$ and $sigma = -1$. Hence, we can use the formula in this paper to show that the eigenvalues are $$lambda_k = 2icosleft(dfrackpin+1right),$$ for $k = 1,ldots,n$, and the corresponding eigenvectors $v_1,ldots,v_n$ have entries $$v_k[m] = i^msinleft(dfracmkpin+1right).$$






share|cite|improve this answer











$endgroup$




















    5












    $begingroup$

    All those matrices are anti-symmetric and therefore they are normal matrices. And every normal matrix is diagonalizable over $mathbb C$, by the spectral theorem.






    share|cite|improve this answer









    $endgroup$












    • $begingroup$
      Thank you very much for the quick response! I hope you don't mind that I accepted JimmyK4542's answer, since it also gives explicitly the eigenvectors and eigenvalues.
      $endgroup$
      – YiFan
      3 hours ago






    • 2




      $begingroup$
      I would have been surprised if you had not accepted that answer, since it provides more information than mine.
      $endgroup$
      – José Carlos Santos
      3 hours ago


















    5












    $begingroup$

    Using that your matrices are skew symmetric, you get that these matrices are diagonalizable. See the section spectral theory on this Wikipedia article.






    share|cite|improve this answer








    New contributor




    gcousin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
    Check out our Code of Conduct.






    $endgroup$












    • $begingroup$
      Thank you very much for the quick response! I hope you don't mind that I accepted JimmyK4542's answer, since it also gives explicitly the eigenvectors and eigenvalues.
      $endgroup$
      – YiFan
      3 hours ago











    Your Answer








    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%2f3198918%2fare-these-square-matrices-always-diagonalisable%23new-answer', 'question_page');

    );

    Post as a guest















    Required, but never shown

























    3 Answers
    3






    active

    oldest

    votes








    3 Answers
    3






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    5












    $begingroup$

    The matrix $A_n$ is a tridiagonal Toeplitz matrix with diagonal entries $delta = 0$ and off-diagonal entries $tau = 1$ and $sigma = -1$. Hence, we can use the formula in this paper to show that the eigenvalues are $$lambda_k = 2icosleft(dfrackpin+1right),$$ for $k = 1,ldots,n$, and the corresponding eigenvectors $v_1,ldots,v_n$ have entries $$v_k[m] = i^msinleft(dfracmkpin+1right).$$






    share|cite|improve this answer











    $endgroup$

















      5












      $begingroup$

      The matrix $A_n$ is a tridiagonal Toeplitz matrix with diagonal entries $delta = 0$ and off-diagonal entries $tau = 1$ and $sigma = -1$. Hence, we can use the formula in this paper to show that the eigenvalues are $$lambda_k = 2icosleft(dfrackpin+1right),$$ for $k = 1,ldots,n$, and the corresponding eigenvectors $v_1,ldots,v_n$ have entries $$v_k[m] = i^msinleft(dfracmkpin+1right).$$






      share|cite|improve this answer











      $endgroup$















        5












        5








        5





        $begingroup$

        The matrix $A_n$ is a tridiagonal Toeplitz matrix with diagonal entries $delta = 0$ and off-diagonal entries $tau = 1$ and $sigma = -1$. Hence, we can use the formula in this paper to show that the eigenvalues are $$lambda_k = 2icosleft(dfrackpin+1right),$$ for $k = 1,ldots,n$, and the corresponding eigenvectors $v_1,ldots,v_n$ have entries $$v_k[m] = i^msinleft(dfracmkpin+1right).$$






        share|cite|improve this answer











        $endgroup$



        The matrix $A_n$ is a tridiagonal Toeplitz matrix with diagonal entries $delta = 0$ and off-diagonal entries $tau = 1$ and $sigma = -1$. Hence, we can use the formula in this paper to show that the eigenvalues are $$lambda_k = 2icosleft(dfrackpin+1right),$$ for $k = 1,ldots,n$, and the corresponding eigenvectors $v_1,ldots,v_n$ have entries $$v_k[m] = i^msinleft(dfracmkpin+1right).$$







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited 3 hours ago

























        answered 3 hours ago









        JimmyK4542JimmyK4542

        41.5k246108




        41.5k246108





















            5












            $begingroup$

            All those matrices are anti-symmetric and therefore they are normal matrices. And every normal matrix is diagonalizable over $mathbb C$, by the spectral theorem.






            share|cite|improve this answer









            $endgroup$












            • $begingroup$
              Thank you very much for the quick response! I hope you don't mind that I accepted JimmyK4542's answer, since it also gives explicitly the eigenvectors and eigenvalues.
              $endgroup$
              – YiFan
              3 hours ago






            • 2




              $begingroup$
              I would have been surprised if you had not accepted that answer, since it provides more information than mine.
              $endgroup$
              – José Carlos Santos
              3 hours ago















            5












            $begingroup$

            All those matrices are anti-symmetric and therefore they are normal matrices. And every normal matrix is diagonalizable over $mathbb C$, by the spectral theorem.






            share|cite|improve this answer









            $endgroup$












            • $begingroup$
              Thank you very much for the quick response! I hope you don't mind that I accepted JimmyK4542's answer, since it also gives explicitly the eigenvectors and eigenvalues.
              $endgroup$
              – YiFan
              3 hours ago






            • 2




              $begingroup$
              I would have been surprised if you had not accepted that answer, since it provides more information than mine.
              $endgroup$
              – José Carlos Santos
              3 hours ago













            5












            5








            5





            $begingroup$

            All those matrices are anti-symmetric and therefore they are normal matrices. And every normal matrix is diagonalizable over $mathbb C$, by the spectral theorem.






            share|cite|improve this answer









            $endgroup$



            All those matrices are anti-symmetric and therefore they are normal matrices. And every normal matrix is diagonalizable over $mathbb C$, by the spectral theorem.







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered 3 hours ago









            José Carlos SantosJosé Carlos Santos

            177k24138250




            177k24138250











            • $begingroup$
              Thank you very much for the quick response! I hope you don't mind that I accepted JimmyK4542's answer, since it also gives explicitly the eigenvectors and eigenvalues.
              $endgroup$
              – YiFan
              3 hours ago






            • 2




              $begingroup$
              I would have been surprised if you had not accepted that answer, since it provides more information than mine.
              $endgroup$
              – José Carlos Santos
              3 hours ago
















            • $begingroup$
              Thank you very much for the quick response! I hope you don't mind that I accepted JimmyK4542's answer, since it also gives explicitly the eigenvectors and eigenvalues.
              $endgroup$
              – YiFan
              3 hours ago






            • 2




              $begingroup$
              I would have been surprised if you had not accepted that answer, since it provides more information than mine.
              $endgroup$
              – José Carlos Santos
              3 hours ago















            $begingroup$
            Thank you very much for the quick response! I hope you don't mind that I accepted JimmyK4542's answer, since it also gives explicitly the eigenvectors and eigenvalues.
            $endgroup$
            – YiFan
            3 hours ago




            $begingroup$
            Thank you very much for the quick response! I hope you don't mind that I accepted JimmyK4542's answer, since it also gives explicitly the eigenvectors and eigenvalues.
            $endgroup$
            – YiFan
            3 hours ago




            2




            2




            $begingroup$
            I would have been surprised if you had not accepted that answer, since it provides more information than mine.
            $endgroup$
            – José Carlos Santos
            3 hours ago




            $begingroup$
            I would have been surprised if you had not accepted that answer, since it provides more information than mine.
            $endgroup$
            – José Carlos Santos
            3 hours ago











            5












            $begingroup$

            Using that your matrices are skew symmetric, you get that these matrices are diagonalizable. See the section spectral theory on this Wikipedia article.






            share|cite|improve this answer








            New contributor




            gcousin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
            Check out our Code of Conduct.






            $endgroup$












            • $begingroup$
              Thank you very much for the quick response! I hope you don't mind that I accepted JimmyK4542's answer, since it also gives explicitly the eigenvectors and eigenvalues.
              $endgroup$
              – YiFan
              3 hours ago















            5












            $begingroup$

            Using that your matrices are skew symmetric, you get that these matrices are diagonalizable. See the section spectral theory on this Wikipedia article.






            share|cite|improve this answer








            New contributor




            gcousin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
            Check out our Code of Conduct.






            $endgroup$












            • $begingroup$
              Thank you very much for the quick response! I hope you don't mind that I accepted JimmyK4542's answer, since it also gives explicitly the eigenvectors and eigenvalues.
              $endgroup$
              – YiFan
              3 hours ago













            5












            5








            5





            $begingroup$

            Using that your matrices are skew symmetric, you get that these matrices are diagonalizable. See the section spectral theory on this Wikipedia article.






            share|cite|improve this answer








            New contributor




            gcousin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
            Check out our Code of Conduct.






            $endgroup$



            Using that your matrices are skew symmetric, you get that these matrices are diagonalizable. See the section spectral theory on this Wikipedia article.







            share|cite|improve this answer








            New contributor




            gcousin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
            Check out our Code of Conduct.









            share|cite|improve this answer



            share|cite|improve this answer






            New contributor




            gcousin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
            Check out our Code of Conduct.









            answered 3 hours ago









            gcousingcousin

            1312




            1312




            New contributor




            gcousin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
            Check out our Code of Conduct.





            New contributor





            gcousin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
            Check out our Code of Conduct.






            gcousin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
            Check out our Code of Conduct.











            • $begingroup$
              Thank you very much for the quick response! I hope you don't mind that I accepted JimmyK4542's answer, since it also gives explicitly the eigenvectors and eigenvalues.
              $endgroup$
              – YiFan
              3 hours ago
















            • $begingroup$
              Thank you very much for the quick response! I hope you don't mind that I accepted JimmyK4542's answer, since it also gives explicitly the eigenvectors and eigenvalues.
              $endgroup$
              – YiFan
              3 hours ago















            $begingroup$
            Thank you very much for the quick response! I hope you don't mind that I accepted JimmyK4542's answer, since it also gives explicitly the eigenvectors and eigenvalues.
            $endgroup$
            – YiFan
            3 hours ago




            $begingroup$
            Thank you very much for the quick response! I hope you don't mind that I accepted JimmyK4542's answer, since it also gives explicitly the eigenvectors and eigenvalues.
            $endgroup$
            – YiFan
            3 hours ago

















            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%2f3198918%2fare-these-square-matrices-always-diagonalisable%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

            How to create a command for the “strange m” symbol in latex? Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)How do you make your own symbol when Detexify fails?Writing bold small caps with mathpazo packageplus-minus symbol with parenthesis around the minus signGreek character in Beamer document titleHow to create dashed right arrow over symbol?Currency symbol: Turkish LiraDouble prec as a single symbol?Plus Sign Too Big; How to Call adfbullet?Is there a TeX macro for three-legged pi?How do I get my integral-like symbol to align like the integral?How to selectively substitute a letter with another symbol representing the same letterHow do I generate a less than symbol and vertical bar that are the same height?

            Българска екзархия Съдържание История | Български екзарси | Вижте също | Външни препратки | Литература | Бележки | НавигацияУстав за управлението на българската екзархия. Цариград, 1870Слово на Ловешкия митрополит Иларион при откриването на Българския народен събор в Цариград на 23. II. 1870 г.Българската правда и гръцката кривда. От С. М. (= Софийски Мелетий). Цариград, 1872Предстоятели на Българската екзархияПодмененият ВеликденИнформационна агенция „Фокус“Димитър Ризов. Българите в техните исторически, етнографически и политически граници (Атлас съдържащ 40 карти). Berlin, Königliche Hoflithographie, Hof-Buch- und -Steindruckerei Wilhelm Greve, 1917Report of the International Commission to Inquire into the Causes and Conduct of the Balkan Wars

            Чепеларе Съдържание География | История | Население | Спортни и природни забележителности | Културни и исторически обекти | Религии | Обществени институции | Известни личности | Редовни събития | Галерия | Източници | Литература | Външни препратки | Навигация41°43′23.99″ с. ш. 24°41′09.99″ и. д. / 41.723333° с. ш. 24.686111° и. д.*ЧепелареЧепеларски Linux fest 2002Начало на Зимен сезон 2005/06Национални хайдушки празници „Капитан Петко Войвода“Град ЧепелареЧепеларе – народният ски курортbgrod.orgwww.terranatura.hit.bgСправка за населението на гр. Исперих, общ. Исперих, обл. РазградМузей на родопския карстМузей на спорта и скитеЧепеларебългарскибългарскианглийскитукИстория на градаСки писти в ЧепелареВремето в ЧепелареРадио и телевизия в ЧепелареЧепеларе мами с родопски чар и добри пистиЕвтин туризъм и снежни атракции в ЧепелареМестоположениеИнформация и снимки от музея на родопския карст3D панорами от ЧепелареЧепелареррр