Solution to this problem is incorrect about a diagonalizable matrix A?












1














I have this matrix A



$$ begin{bmatrix}
1 & c & 0 & 0 & 0 \
0 & 1 & c & 0 & 0 \
0 & 0 & 1 & a & 0\
0 & 0 & 0 & b & c\
0 & 0 & 0 & 0 & b
end{bmatrix}
$$




(d) (4 points) Find all values of a, b, c, if any, such that A is
diagonalizable but not orthogonally diagonalizable. Justify your
answer.



Solution: By spectral theorem, we know that A is orthogonally
diagonalizable iff A is symmetric. So we know that at least one of a
or c must be nonzero so that A is not symmetric. If b !=1, we know
by part (c) that c=0 for the matrix to be diagonalizable. Therefore, a != 0.
If b = 1, then the matrix is only diagonalizable iff a = c = 0 which
is a contradiction as then A will be symmetric. Therefore, the
requirements are the b != 1, c = 0, and a != 0.




However, b must be 0. For example, you cannot have b = 2. If b = 2, then the dimension of the kernel of this matrix is only $1$, so the eigenvalue $1$ has $gemu(1) < almu(1)$, so this matrix would not be diagonalizable. Is there anything wrong with my reasoning?










share|cite|improve this question





























    1














    I have this matrix A



    $$ begin{bmatrix}
    1 & c & 0 & 0 & 0 \
    0 & 1 & c & 0 & 0 \
    0 & 0 & 1 & a & 0\
    0 & 0 & 0 & b & c\
    0 & 0 & 0 & 0 & b
    end{bmatrix}
    $$




    (d) (4 points) Find all values of a, b, c, if any, such that A is
    diagonalizable but not orthogonally diagonalizable. Justify your
    answer.



    Solution: By spectral theorem, we know that A is orthogonally
    diagonalizable iff A is symmetric. So we know that at least one of a
    or c must be nonzero so that A is not symmetric. If b !=1, we know
    by part (c) that c=0 for the matrix to be diagonalizable. Therefore, a != 0.
    If b = 1, then the matrix is only diagonalizable iff a = c = 0 which
    is a contradiction as then A will be symmetric. Therefore, the
    requirements are the b != 1, c = 0, and a != 0.




    However, b must be 0. For example, you cannot have b = 2. If b = 2, then the dimension of the kernel of this matrix is only $1$, so the eigenvalue $1$ has $gemu(1) < almu(1)$, so this matrix would not be diagonalizable. Is there anything wrong with my reasoning?










    share|cite|improve this question



























      1












      1








      1







      I have this matrix A



      $$ begin{bmatrix}
      1 & c & 0 & 0 & 0 \
      0 & 1 & c & 0 & 0 \
      0 & 0 & 1 & a & 0\
      0 & 0 & 0 & b & c\
      0 & 0 & 0 & 0 & b
      end{bmatrix}
      $$




      (d) (4 points) Find all values of a, b, c, if any, such that A is
      diagonalizable but not orthogonally diagonalizable. Justify your
      answer.



      Solution: By spectral theorem, we know that A is orthogonally
      diagonalizable iff A is symmetric. So we know that at least one of a
      or c must be nonzero so that A is not symmetric. If b !=1, we know
      by part (c) that c=0 for the matrix to be diagonalizable. Therefore, a != 0.
      If b = 1, then the matrix is only diagonalizable iff a = c = 0 which
      is a contradiction as then A will be symmetric. Therefore, the
      requirements are the b != 1, c = 0, and a != 0.




      However, b must be 0. For example, you cannot have b = 2. If b = 2, then the dimension of the kernel of this matrix is only $1$, so the eigenvalue $1$ has $gemu(1) < almu(1)$, so this matrix would not be diagonalizable. Is there anything wrong with my reasoning?










      share|cite|improve this question















      I have this matrix A



      $$ begin{bmatrix}
      1 & c & 0 & 0 & 0 \
      0 & 1 & c & 0 & 0 \
      0 & 0 & 1 & a & 0\
      0 & 0 & 0 & b & c\
      0 & 0 & 0 & 0 & b
      end{bmatrix}
      $$




      (d) (4 points) Find all values of a, b, c, if any, such that A is
      diagonalizable but not orthogonally diagonalizable. Justify your
      answer.



      Solution: By spectral theorem, we know that A is orthogonally
      diagonalizable iff A is symmetric. So we know that at least one of a
      or c must be nonzero so that A is not symmetric. If b !=1, we know
      by part (c) that c=0 for the matrix to be diagonalizable. Therefore, a != 0.
      If b = 1, then the matrix is only diagonalizable iff a = c = 0 which
      is a contradiction as then A will be symmetric. Therefore, the
      requirements are the b != 1, c = 0, and a != 0.




      However, b must be 0. For example, you cannot have b = 2. If b = 2, then the dimension of the kernel of this matrix is only $1$, so the eigenvalue $1$ has $gemu(1) < almu(1)$, so this matrix would not be diagonalizable. Is there anything wrong with my reasoning?







      linear-algebra matrices diagonalization






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Dec 6 at 9:25









      José Carlos Santos

      148k22117218




      148k22117218










      asked Apr 18 at 23:13









      Goldname

      1,450928




      1,450928






















          2 Answers
          2






          active

          oldest

          votes


















          1














          Why do you think that $b$ must be $0$? That's not true. Take, for instance this case:$$A=begin{pmatrix}1 & 0 & 0 & 0 & 0 \ 0 & 1 & 0 & 0 & 0 \ 0 & 0 & 1 & 1 & 0 \ 0 & 0 & 0 & 2 & 0 \ 0 & 0 & 0 & 0 & 2end{pmatrix}.$$It is diagonalizable: for instance, the vectors $(1,0,0,0,0)$, $(0,1,0,0,0)$, and $(0,0,1,0,0)$ are eigenvalues with eigenvalue $1$ and $(0,0,1,1,0)$ and $(0,0,0,0,1)$ are eigenvectors with eigenvalue $2$.






          share|cite|improve this answer





















          • Ah I made mistake. I forgot c = 0.
            – Goldname
            Apr 19 at 1:11



















          1














          With the given constraints on $a$ and $c$, $det A=b^2$, so its kernel is always trivial for $bne0$. If instead by the first “this matrix” you mean $$A-bI = begin{bmatrix}1&0&0&0&0\0&1&0&0&0\0&0&1&a&0\0&0&0&0&0\0&0&0&0&0end{bmatrix},$$ its null space is quite clearly two-dimensional regardless of the value of $a$.






          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',
            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%2f2743847%2fsolution-to-this-problem-is-incorrect-about-a-diagonalizable-matrix-a%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown

























            2 Answers
            2






            active

            oldest

            votes








            2 Answers
            2






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            1














            Why do you think that $b$ must be $0$? That's not true. Take, for instance this case:$$A=begin{pmatrix}1 & 0 & 0 & 0 & 0 \ 0 & 1 & 0 & 0 & 0 \ 0 & 0 & 1 & 1 & 0 \ 0 & 0 & 0 & 2 & 0 \ 0 & 0 & 0 & 0 & 2end{pmatrix}.$$It is diagonalizable: for instance, the vectors $(1,0,0,0,0)$, $(0,1,0,0,0)$, and $(0,0,1,0,0)$ are eigenvalues with eigenvalue $1$ and $(0,0,1,1,0)$ and $(0,0,0,0,1)$ are eigenvectors with eigenvalue $2$.






            share|cite|improve this answer





















            • Ah I made mistake. I forgot c = 0.
              – Goldname
              Apr 19 at 1:11
















            1














            Why do you think that $b$ must be $0$? That's not true. Take, for instance this case:$$A=begin{pmatrix}1 & 0 & 0 & 0 & 0 \ 0 & 1 & 0 & 0 & 0 \ 0 & 0 & 1 & 1 & 0 \ 0 & 0 & 0 & 2 & 0 \ 0 & 0 & 0 & 0 & 2end{pmatrix}.$$It is diagonalizable: for instance, the vectors $(1,0,0,0,0)$, $(0,1,0,0,0)$, and $(0,0,1,0,0)$ are eigenvalues with eigenvalue $1$ and $(0,0,1,1,0)$ and $(0,0,0,0,1)$ are eigenvectors with eigenvalue $2$.






            share|cite|improve this answer





















            • Ah I made mistake. I forgot c = 0.
              – Goldname
              Apr 19 at 1:11














            1












            1








            1






            Why do you think that $b$ must be $0$? That's not true. Take, for instance this case:$$A=begin{pmatrix}1 & 0 & 0 & 0 & 0 \ 0 & 1 & 0 & 0 & 0 \ 0 & 0 & 1 & 1 & 0 \ 0 & 0 & 0 & 2 & 0 \ 0 & 0 & 0 & 0 & 2end{pmatrix}.$$It is diagonalizable: for instance, the vectors $(1,0,0,0,0)$, $(0,1,0,0,0)$, and $(0,0,1,0,0)$ are eigenvalues with eigenvalue $1$ and $(0,0,1,1,0)$ and $(0,0,0,0,1)$ are eigenvectors with eigenvalue $2$.






            share|cite|improve this answer












            Why do you think that $b$ must be $0$? That's not true. Take, for instance this case:$$A=begin{pmatrix}1 & 0 & 0 & 0 & 0 \ 0 & 1 & 0 & 0 & 0 \ 0 & 0 & 1 & 1 & 0 \ 0 & 0 & 0 & 2 & 0 \ 0 & 0 & 0 & 0 & 2end{pmatrix}.$$It is diagonalizable: for instance, the vectors $(1,0,0,0,0)$, $(0,1,0,0,0)$, and $(0,0,1,0,0)$ are eigenvalues with eigenvalue $1$ and $(0,0,1,1,0)$ and $(0,0,0,0,1)$ are eigenvectors with eigenvalue $2$.







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Apr 18 at 23:34









            José Carlos Santos

            148k22117218




            148k22117218












            • Ah I made mistake. I forgot c = 0.
              – Goldname
              Apr 19 at 1:11


















            • Ah I made mistake. I forgot c = 0.
              – Goldname
              Apr 19 at 1:11
















            Ah I made mistake. I forgot c = 0.
            – Goldname
            Apr 19 at 1:11




            Ah I made mistake. I forgot c = 0.
            – Goldname
            Apr 19 at 1:11











            1














            With the given constraints on $a$ and $c$, $det A=b^2$, so its kernel is always trivial for $bne0$. If instead by the first “this matrix” you mean $$A-bI = begin{bmatrix}1&0&0&0&0\0&1&0&0&0\0&0&1&a&0\0&0&0&0&0\0&0&0&0&0end{bmatrix},$$ its null space is quite clearly two-dimensional regardless of the value of $a$.






            share|cite|improve this answer


























              1














              With the given constraints on $a$ and $c$, $det A=b^2$, so its kernel is always trivial for $bne0$. If instead by the first “this matrix” you mean $$A-bI = begin{bmatrix}1&0&0&0&0\0&1&0&0&0\0&0&1&a&0\0&0&0&0&0\0&0&0&0&0end{bmatrix},$$ its null space is quite clearly two-dimensional regardless of the value of $a$.






              share|cite|improve this answer
























                1












                1








                1






                With the given constraints on $a$ and $c$, $det A=b^2$, so its kernel is always trivial for $bne0$. If instead by the first “this matrix” you mean $$A-bI = begin{bmatrix}1&0&0&0&0\0&1&0&0&0\0&0&1&a&0\0&0&0&0&0\0&0&0&0&0end{bmatrix},$$ its null space is quite clearly two-dimensional regardless of the value of $a$.






                share|cite|improve this answer












                With the given constraints on $a$ and $c$, $det A=b^2$, so its kernel is always trivial for $bne0$. If instead by the first “this matrix” you mean $$A-bI = begin{bmatrix}1&0&0&0&0\0&1&0&0&0\0&0&1&a&0\0&0&0&0&0\0&0&0&0&0end{bmatrix},$$ its null space is quite clearly two-dimensional regardless of the value of $a$.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Apr 18 at 23:50









                amd

                29k21050




                29k21050






























                    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%2f2743847%2fsolution-to-this-problem-is-incorrect-about-a-diagonalizable-matrix-a%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

                    Cabo Verde

                    Gyllenstierna