How to compute the characteristic polynomial of a companion matrix to a polynomial with matrix-valued...











up vote
2
down vote

favorite












Consider we have a polynomial $p = z^m + b_{m-1}z^{m-1} + dotsb + b_0$ with matrix coefficients $b_i in M_n(mathbb{C})$. Then we might consider the companion matrix
$$T = left[
begin{matrix}
0_n & 0_n &dots & b_0 \
I_n & 0_n &dotsb & b_1 \
& ddots && vdots \
&&I_n & b_{m-1}
end{matrix}
right],
$$

where $I_n$ is the identity matrix, and $0_n$ is the zero matrix in $M_n(mathbb{C})$.



$T$ is a block matrix, so we might consider it as a complex-valued matrix of dimension $mcdot n times m cdot n$, and I want to show that its characteristic polynomial $chi_T(z) = det(zcdot I_{ncdot m} - T)$ equals $det(p(z))$, where we consider $p(z)$ as a matrix with polynomial-valued entries.



If we naively compute the characteristic polynomial of $T$ over the ring of matrices we simply obtain $p$, but I'm not shure if I can even apply the Laplace expansion theorem over non-commutative rings. And even then, computing block-wise determinants does and then the determinant of the resulting matrix does in general not yield the determinant of the matrix one started with.



Applying Laplace expansion directly to $zcdot I_{nm} - T$ yields rather ugly mixed terms that I don't know how to handle.



I also found this nice answer on how to show that the characteristic polynomial of the companion matrix equals the polynomial you started with, but I don't see if this generalizes: The claim that $chi_T = mu_T$ ($mu_T$ is the minimal polynomial) is wrong in my situation. For example if $b_i = 0$ for all $i$, then $T^m = 0$, so in general the minimal polynomial has lower degree.










share|cite|improve this question


























    up vote
    2
    down vote

    favorite












    Consider we have a polynomial $p = z^m + b_{m-1}z^{m-1} + dotsb + b_0$ with matrix coefficients $b_i in M_n(mathbb{C})$. Then we might consider the companion matrix
    $$T = left[
    begin{matrix}
    0_n & 0_n &dots & b_0 \
    I_n & 0_n &dotsb & b_1 \
    & ddots && vdots \
    &&I_n & b_{m-1}
    end{matrix}
    right],
    $$

    where $I_n$ is the identity matrix, and $0_n$ is the zero matrix in $M_n(mathbb{C})$.



    $T$ is a block matrix, so we might consider it as a complex-valued matrix of dimension $mcdot n times m cdot n$, and I want to show that its characteristic polynomial $chi_T(z) = det(zcdot I_{ncdot m} - T)$ equals $det(p(z))$, where we consider $p(z)$ as a matrix with polynomial-valued entries.



    If we naively compute the characteristic polynomial of $T$ over the ring of matrices we simply obtain $p$, but I'm not shure if I can even apply the Laplace expansion theorem over non-commutative rings. And even then, computing block-wise determinants does and then the determinant of the resulting matrix does in general not yield the determinant of the matrix one started with.



    Applying Laplace expansion directly to $zcdot I_{nm} - T$ yields rather ugly mixed terms that I don't know how to handle.



    I also found this nice answer on how to show that the characteristic polynomial of the companion matrix equals the polynomial you started with, but I don't see if this generalizes: The claim that $chi_T = mu_T$ ($mu_T$ is the minimal polynomial) is wrong in my situation. For example if $b_i = 0$ for all $i$, then $T^m = 0$, so in general the minimal polynomial has lower degree.










    share|cite|improve this question
























      up vote
      2
      down vote

      favorite









      up vote
      2
      down vote

      favorite











      Consider we have a polynomial $p = z^m + b_{m-1}z^{m-1} + dotsb + b_0$ with matrix coefficients $b_i in M_n(mathbb{C})$. Then we might consider the companion matrix
      $$T = left[
      begin{matrix}
      0_n & 0_n &dots & b_0 \
      I_n & 0_n &dotsb & b_1 \
      & ddots && vdots \
      &&I_n & b_{m-1}
      end{matrix}
      right],
      $$

      where $I_n$ is the identity matrix, and $0_n$ is the zero matrix in $M_n(mathbb{C})$.



      $T$ is a block matrix, so we might consider it as a complex-valued matrix of dimension $mcdot n times m cdot n$, and I want to show that its characteristic polynomial $chi_T(z) = det(zcdot I_{ncdot m} - T)$ equals $det(p(z))$, where we consider $p(z)$ as a matrix with polynomial-valued entries.



      If we naively compute the characteristic polynomial of $T$ over the ring of matrices we simply obtain $p$, but I'm not shure if I can even apply the Laplace expansion theorem over non-commutative rings. And even then, computing block-wise determinants does and then the determinant of the resulting matrix does in general not yield the determinant of the matrix one started with.



      Applying Laplace expansion directly to $zcdot I_{nm} - T$ yields rather ugly mixed terms that I don't know how to handle.



      I also found this nice answer on how to show that the characteristic polynomial of the companion matrix equals the polynomial you started with, but I don't see if this generalizes: The claim that $chi_T = mu_T$ ($mu_T$ is the minimal polynomial) is wrong in my situation. For example if $b_i = 0$ for all $i$, then $T^m = 0$, so in general the minimal polynomial has lower degree.










      share|cite|improve this question













      Consider we have a polynomial $p = z^m + b_{m-1}z^{m-1} + dotsb + b_0$ with matrix coefficients $b_i in M_n(mathbb{C})$. Then we might consider the companion matrix
      $$T = left[
      begin{matrix}
      0_n & 0_n &dots & b_0 \
      I_n & 0_n &dotsb & b_1 \
      & ddots && vdots \
      &&I_n & b_{m-1}
      end{matrix}
      right],
      $$

      where $I_n$ is the identity matrix, and $0_n$ is the zero matrix in $M_n(mathbb{C})$.



      $T$ is a block matrix, so we might consider it as a complex-valued matrix of dimension $mcdot n times m cdot n$, and I want to show that its characteristic polynomial $chi_T(z) = det(zcdot I_{ncdot m} - T)$ equals $det(p(z))$, where we consider $p(z)$ as a matrix with polynomial-valued entries.



      If we naively compute the characteristic polynomial of $T$ over the ring of matrices we simply obtain $p$, but I'm not shure if I can even apply the Laplace expansion theorem over non-commutative rings. And even then, computing block-wise determinants does and then the determinant of the resulting matrix does in general not yield the determinant of the matrix one started with.



      Applying Laplace expansion directly to $zcdot I_{nm} - T$ yields rather ugly mixed terms that I don't know how to handle.



      I also found this nice answer on how to show that the characteristic polynomial of the companion matrix equals the polynomial you started with, but I don't see if this generalizes: The claim that $chi_T = mu_T$ ($mu_T$ is the minimal polynomial) is wrong in my situation. For example if $b_i = 0$ for all $i$, then $T^m = 0$, so in general the minimal polynomial has lower degree.







      linear-algebra matrices block-matrices






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Nov 19 at 10:01









      red_trumpet

      779219




      779219






















          1 Answer
          1






          active

          oldest

          votes

















          up vote
          0
          down vote



          accepted










          We first note that any block matrix $ M =left[begin{matrix}
          A & B \C & D
          end{matrix}right],$

          where $A$ and $D$ are square matrices and $A$ is invertible, can be factorised in the form
          $$M =
          left[begin{matrix}
          A & B \
          C & D
          end{matrix}right]
          =
          left[begin{matrix}
          A & 0 \
          C & 1
          end{matrix}right]
          left[begin{matrix}
          1 & A^{-1}B \
          0 & D - CA^{-1}B
          end{matrix}right],
          $$

          so that $det M = det A cdot det(D - CA^{-1}B)$.



          If we now calculate formally in the function field $mathbb{C}(z)$, the upper-left block of $z cdot I_{nm} - T$ is just $A = zcdot I_n$, which is invertible over $mathbb{C}(z)$. Using the above notation, one calculates $$D - CA^{-1}B = left[begin{matrix}
          z cdot I_n & & & -b_1 - frac 1 z b_0\
          -I_n & ddots & &vdots\
          & ddots &zcdot I_n&-b_{m-2}\
          & &-I_n & z cdot I_n - b_{m-1}
          end{matrix}right].
          $$

          Now inductively we know that $det(D - CA^{-1}B) = det(I_n z^{m-1} - b_{m-1}z^{m-2} - dotsb - b_1 - frac 1 z b_0)$. Thus $det (z I - T) = z^n det(I_n z^{m-1} - b_{m-1}z^{m-2} - dotsb - b_1 - frac 1 z b_0) = det(I_n z^m - b_{m-1}z^{m-1} - dotsb - b_1 z - b_0)$.






          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: 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%2f3004731%2fhow-to-compute-the-characteristic-polynomial-of-a-companion-matrix-to-a-polynomi%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








            up vote
            0
            down vote



            accepted










            We first note that any block matrix $ M =left[begin{matrix}
            A & B \C & D
            end{matrix}right],$

            where $A$ and $D$ are square matrices and $A$ is invertible, can be factorised in the form
            $$M =
            left[begin{matrix}
            A & B \
            C & D
            end{matrix}right]
            =
            left[begin{matrix}
            A & 0 \
            C & 1
            end{matrix}right]
            left[begin{matrix}
            1 & A^{-1}B \
            0 & D - CA^{-1}B
            end{matrix}right],
            $$

            so that $det M = det A cdot det(D - CA^{-1}B)$.



            If we now calculate formally in the function field $mathbb{C}(z)$, the upper-left block of $z cdot I_{nm} - T$ is just $A = zcdot I_n$, which is invertible over $mathbb{C}(z)$. Using the above notation, one calculates $$D - CA^{-1}B = left[begin{matrix}
            z cdot I_n & & & -b_1 - frac 1 z b_0\
            -I_n & ddots & &vdots\
            & ddots &zcdot I_n&-b_{m-2}\
            & &-I_n & z cdot I_n - b_{m-1}
            end{matrix}right].
            $$

            Now inductively we know that $det(D - CA^{-1}B) = det(I_n z^{m-1} - b_{m-1}z^{m-2} - dotsb - b_1 - frac 1 z b_0)$. Thus $det (z I - T) = z^n det(I_n z^{m-1} - b_{m-1}z^{m-2} - dotsb - b_1 - frac 1 z b_0) = det(I_n z^m - b_{m-1}z^{m-1} - dotsb - b_1 z - b_0)$.






            share|cite|improve this answer

























              up vote
              0
              down vote



              accepted










              We first note that any block matrix $ M =left[begin{matrix}
              A & B \C & D
              end{matrix}right],$

              where $A$ and $D$ are square matrices and $A$ is invertible, can be factorised in the form
              $$M =
              left[begin{matrix}
              A & B \
              C & D
              end{matrix}right]
              =
              left[begin{matrix}
              A & 0 \
              C & 1
              end{matrix}right]
              left[begin{matrix}
              1 & A^{-1}B \
              0 & D - CA^{-1}B
              end{matrix}right],
              $$

              so that $det M = det A cdot det(D - CA^{-1}B)$.



              If we now calculate formally in the function field $mathbb{C}(z)$, the upper-left block of $z cdot I_{nm} - T$ is just $A = zcdot I_n$, which is invertible over $mathbb{C}(z)$. Using the above notation, one calculates $$D - CA^{-1}B = left[begin{matrix}
              z cdot I_n & & & -b_1 - frac 1 z b_0\
              -I_n & ddots & &vdots\
              & ddots &zcdot I_n&-b_{m-2}\
              & &-I_n & z cdot I_n - b_{m-1}
              end{matrix}right].
              $$

              Now inductively we know that $det(D - CA^{-1}B) = det(I_n z^{m-1} - b_{m-1}z^{m-2} - dotsb - b_1 - frac 1 z b_0)$. Thus $det (z I - T) = z^n det(I_n z^{m-1} - b_{m-1}z^{m-2} - dotsb - b_1 - frac 1 z b_0) = det(I_n z^m - b_{m-1}z^{m-1} - dotsb - b_1 z - b_0)$.






              share|cite|improve this answer























                up vote
                0
                down vote



                accepted







                up vote
                0
                down vote



                accepted






                We first note that any block matrix $ M =left[begin{matrix}
                A & B \C & D
                end{matrix}right],$

                where $A$ and $D$ are square matrices and $A$ is invertible, can be factorised in the form
                $$M =
                left[begin{matrix}
                A & B \
                C & D
                end{matrix}right]
                =
                left[begin{matrix}
                A & 0 \
                C & 1
                end{matrix}right]
                left[begin{matrix}
                1 & A^{-1}B \
                0 & D - CA^{-1}B
                end{matrix}right],
                $$

                so that $det M = det A cdot det(D - CA^{-1}B)$.



                If we now calculate formally in the function field $mathbb{C}(z)$, the upper-left block of $z cdot I_{nm} - T$ is just $A = zcdot I_n$, which is invertible over $mathbb{C}(z)$. Using the above notation, one calculates $$D - CA^{-1}B = left[begin{matrix}
                z cdot I_n & & & -b_1 - frac 1 z b_0\
                -I_n & ddots & &vdots\
                & ddots &zcdot I_n&-b_{m-2}\
                & &-I_n & z cdot I_n - b_{m-1}
                end{matrix}right].
                $$

                Now inductively we know that $det(D - CA^{-1}B) = det(I_n z^{m-1} - b_{m-1}z^{m-2} - dotsb - b_1 - frac 1 z b_0)$. Thus $det (z I - T) = z^n det(I_n z^{m-1} - b_{m-1}z^{m-2} - dotsb - b_1 - frac 1 z b_0) = det(I_n z^m - b_{m-1}z^{m-1} - dotsb - b_1 z - b_0)$.






                share|cite|improve this answer












                We first note that any block matrix $ M =left[begin{matrix}
                A & B \C & D
                end{matrix}right],$

                where $A$ and $D$ are square matrices and $A$ is invertible, can be factorised in the form
                $$M =
                left[begin{matrix}
                A & B \
                C & D
                end{matrix}right]
                =
                left[begin{matrix}
                A & 0 \
                C & 1
                end{matrix}right]
                left[begin{matrix}
                1 & A^{-1}B \
                0 & D - CA^{-1}B
                end{matrix}right],
                $$

                so that $det M = det A cdot det(D - CA^{-1}B)$.



                If we now calculate formally in the function field $mathbb{C}(z)$, the upper-left block of $z cdot I_{nm} - T$ is just $A = zcdot I_n$, which is invertible over $mathbb{C}(z)$. Using the above notation, one calculates $$D - CA^{-1}B = left[begin{matrix}
                z cdot I_n & & & -b_1 - frac 1 z b_0\
                -I_n & ddots & &vdots\
                & ddots &zcdot I_n&-b_{m-2}\
                & &-I_n & z cdot I_n - b_{m-1}
                end{matrix}right].
                $$

                Now inductively we know that $det(D - CA^{-1}B) = det(I_n z^{m-1} - b_{m-1}z^{m-2} - dotsb - b_1 - frac 1 z b_0)$. Thus $det (z I - T) = z^n det(I_n z^{m-1} - b_{m-1}z^{m-2} - dotsb - b_1 - frac 1 z b_0) = det(I_n z^m - b_{m-1}z^{m-1} - dotsb - b_1 z - b_0)$.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Nov 23 at 8:06









                red_trumpet

                779219




                779219






























                    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%2f3004731%2fhow-to-compute-the-characteristic-polynomial-of-a-companion-matrix-to-a-polynomi%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 change which sound is reproduced for terminal bell?

                    Can I use Tabulator js library in my java Spring + Thymeleaf project?

                    Title Spacing in Bjornstrup Chapter, Removing Chapter Number From Contents