Are matrices which yield a given characteristic polynomial and have specified structure connected?

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











up vote
3
down vote

favorite
2












Let us consider a subset $S$ of $M_4(mathbb R)$ which has following form
beginalign*
beginpmatrix
0 & * & 0 & * \
1 & * & 0 & * \
0 & * & 0 & * \
0 & * & 1 & *
endpmatrix,
endalign*
where $*$ can assume any real number. It is also clear for any monic $4^th$ degree real polynomial, we can at least find one realization in $S$ since the upper left block and lower right block can be considered as in companion form. Let $f: S to mathbb R^n$ be the map sending the coefficients of characteristic polynomial to $mathbb R^n$.



My question is: suppose we have a square-free polynomial $p(t) = t^4 + a_3 t^3 + a_2 t^2 + a_1 t + a_0$, is $f^-1(a)$ a connected set in $M_n(mathbb R)$ where $a=(a_3, a_2, a_1, a_0)$? If we let $C$ denote the companion form of $p(t)$, which is an element of $S$, then $$f^-1(a) = V C V^-1: V in GL_4(mathbb R), V C V^-1 text is in above form .$$
I have a feeling we can first choose a realization in block form,
beginalign*
beginpmatrix
0 & * & 0 & 0 \
1 & * & 0 & 0 \
0 & 0 & 0 & * \
0 & 0 & 1 & *
endpmatrix,
endalign*
and then continuously change everything in $f^-1(a)$ into this form without changing the characteristic polynomial. Indeed, if we consider a matrix
beginalign*
A = beginpmatrix
0 & -b_1 & 0 & -c_1 \
1 & -b_2 & 0 & -c_2 \
0 & -b_3 & 0 & -c_3 \
0 & -b_4 & 1 & -c_4 \
endpmatrix,
endalign*
then the charateristic polynomial is
beginalign*
t^4 + (c_4+b_2)t^3 + (c_3 + b_1 + b_2c_4 - b_4 c_3)t^2 + (b_1 c_4 - b_3 c_3 + b_2 c_3 - b_4 c_1) t + (b_1 c_3 - b_3 c_1).
endalign*
I am thinking we should be able to continuously decrease $b_3, b_4, c_1, c_2$ to $0$ while keeping the polynomial unchanged by changing $b_1, b_2, c_3, c_4$ accordingly.



Edit: Many thanks to user9527 for putting bounty on my question.







share|cite|improve this question















This question has an open bounty worth +100
reputation from user9527 ending ending at 2018-08-12 06:45:27Z">in 4 days.


This question has not received enough attention.



















    up vote
    3
    down vote

    favorite
    2












    Let us consider a subset $S$ of $M_4(mathbb R)$ which has following form
    beginalign*
    beginpmatrix
    0 & * & 0 & * \
    1 & * & 0 & * \
    0 & * & 0 & * \
    0 & * & 1 & *
    endpmatrix,
    endalign*
    where $*$ can assume any real number. It is also clear for any monic $4^th$ degree real polynomial, we can at least find one realization in $S$ since the upper left block and lower right block can be considered as in companion form. Let $f: S to mathbb R^n$ be the map sending the coefficients of characteristic polynomial to $mathbb R^n$.



    My question is: suppose we have a square-free polynomial $p(t) = t^4 + a_3 t^3 + a_2 t^2 + a_1 t + a_0$, is $f^-1(a)$ a connected set in $M_n(mathbb R)$ where $a=(a_3, a_2, a_1, a_0)$? If we let $C$ denote the companion form of $p(t)$, which is an element of $S$, then $$f^-1(a) = V C V^-1: V in GL_4(mathbb R), V C V^-1 text is in above form .$$
    I have a feeling we can first choose a realization in block form,
    beginalign*
    beginpmatrix
    0 & * & 0 & 0 \
    1 & * & 0 & 0 \
    0 & 0 & 0 & * \
    0 & 0 & 1 & *
    endpmatrix,
    endalign*
    and then continuously change everything in $f^-1(a)$ into this form without changing the characteristic polynomial. Indeed, if we consider a matrix
    beginalign*
    A = beginpmatrix
    0 & -b_1 & 0 & -c_1 \
    1 & -b_2 & 0 & -c_2 \
    0 & -b_3 & 0 & -c_3 \
    0 & -b_4 & 1 & -c_4 \
    endpmatrix,
    endalign*
    then the charateristic polynomial is
    beginalign*
    t^4 + (c_4+b_2)t^3 + (c_3 + b_1 + b_2c_4 - b_4 c_3)t^2 + (b_1 c_4 - b_3 c_3 + b_2 c_3 - b_4 c_1) t + (b_1 c_3 - b_3 c_1).
    endalign*
    I am thinking we should be able to continuously decrease $b_3, b_4, c_1, c_2$ to $0$ while keeping the polynomial unchanged by changing $b_1, b_2, c_3, c_4$ accordingly.



    Edit: Many thanks to user9527 for putting bounty on my question.







    share|cite|improve this question















    This question has an open bounty worth +100
    reputation from user9527 ending ending at 2018-08-12 06:45:27Z">in 4 days.


    This question has not received enough attention.

















      up vote
      3
      down vote

      favorite
      2









      up vote
      3
      down vote

      favorite
      2






      2





      Let us consider a subset $S$ of $M_4(mathbb R)$ which has following form
      beginalign*
      beginpmatrix
      0 & * & 0 & * \
      1 & * & 0 & * \
      0 & * & 0 & * \
      0 & * & 1 & *
      endpmatrix,
      endalign*
      where $*$ can assume any real number. It is also clear for any monic $4^th$ degree real polynomial, we can at least find one realization in $S$ since the upper left block and lower right block can be considered as in companion form. Let $f: S to mathbb R^n$ be the map sending the coefficients of characteristic polynomial to $mathbb R^n$.



      My question is: suppose we have a square-free polynomial $p(t) = t^4 + a_3 t^3 + a_2 t^2 + a_1 t + a_0$, is $f^-1(a)$ a connected set in $M_n(mathbb R)$ where $a=(a_3, a_2, a_1, a_0)$? If we let $C$ denote the companion form of $p(t)$, which is an element of $S$, then $$f^-1(a) = V C V^-1: V in GL_4(mathbb R), V C V^-1 text is in above form .$$
      I have a feeling we can first choose a realization in block form,
      beginalign*
      beginpmatrix
      0 & * & 0 & 0 \
      1 & * & 0 & 0 \
      0 & 0 & 0 & * \
      0 & 0 & 1 & *
      endpmatrix,
      endalign*
      and then continuously change everything in $f^-1(a)$ into this form without changing the characteristic polynomial. Indeed, if we consider a matrix
      beginalign*
      A = beginpmatrix
      0 & -b_1 & 0 & -c_1 \
      1 & -b_2 & 0 & -c_2 \
      0 & -b_3 & 0 & -c_3 \
      0 & -b_4 & 1 & -c_4 \
      endpmatrix,
      endalign*
      then the charateristic polynomial is
      beginalign*
      t^4 + (c_4+b_2)t^3 + (c_3 + b_1 + b_2c_4 - b_4 c_3)t^2 + (b_1 c_4 - b_3 c_3 + b_2 c_3 - b_4 c_1) t + (b_1 c_3 - b_3 c_1).
      endalign*
      I am thinking we should be able to continuously decrease $b_3, b_4, c_1, c_2$ to $0$ while keeping the polynomial unchanged by changing $b_1, b_2, c_3, c_4$ accordingly.



      Edit: Many thanks to user9527 for putting bounty on my question.







      share|cite|improve this question













      Let us consider a subset $S$ of $M_4(mathbb R)$ which has following form
      beginalign*
      beginpmatrix
      0 & * & 0 & * \
      1 & * & 0 & * \
      0 & * & 0 & * \
      0 & * & 1 & *
      endpmatrix,
      endalign*
      where $*$ can assume any real number. It is also clear for any monic $4^th$ degree real polynomial, we can at least find one realization in $S$ since the upper left block and lower right block can be considered as in companion form. Let $f: S to mathbb R^n$ be the map sending the coefficients of characteristic polynomial to $mathbb R^n$.



      My question is: suppose we have a square-free polynomial $p(t) = t^4 + a_3 t^3 + a_2 t^2 + a_1 t + a_0$, is $f^-1(a)$ a connected set in $M_n(mathbb R)$ where $a=(a_3, a_2, a_1, a_0)$? If we let $C$ denote the companion form of $p(t)$, which is an element of $S$, then $$f^-1(a) = V C V^-1: V in GL_4(mathbb R), V C V^-1 text is in above form .$$
      I have a feeling we can first choose a realization in block form,
      beginalign*
      beginpmatrix
      0 & * & 0 & 0 \
      1 & * & 0 & 0 \
      0 & 0 & 0 & * \
      0 & 0 & 1 & *
      endpmatrix,
      endalign*
      and then continuously change everything in $f^-1(a)$ into this form without changing the characteristic polynomial. Indeed, if we consider a matrix
      beginalign*
      A = beginpmatrix
      0 & -b_1 & 0 & -c_1 \
      1 & -b_2 & 0 & -c_2 \
      0 & -b_3 & 0 & -c_3 \
      0 & -b_4 & 1 & -c_4 \
      endpmatrix,
      endalign*
      then the charateristic polynomial is
      beginalign*
      t^4 + (c_4+b_2)t^3 + (c_3 + b_1 + b_2c_4 - b_4 c_3)t^2 + (b_1 c_4 - b_3 c_3 + b_2 c_3 - b_4 c_1) t + (b_1 c_3 - b_3 c_1).
      endalign*
      I am thinking we should be able to continuously decrease $b_3, b_4, c_1, c_2$ to $0$ while keeping the polynomial unchanged by changing $b_1, b_2, c_3, c_4$ accordingly.



      Edit: Many thanks to user9527 for putting bounty on my question.









      share|cite|improve this question












      share|cite|improve this question




      share|cite|improve this question








      edited yesterday
























      asked Aug 2 at 18:07









      MyCindy2012

      335




      335






      This question has an open bounty worth +100
      reputation from user9527 ending ending at 2018-08-12 06:45:27Z">in 4 days.


      This question has not received enough attention.








      This question has an open bounty worth +100
      reputation from user9527 ending ending at 2018-08-12 06:45:27Z">in 4 days.


      This question has not received enough attention.



























          active

          oldest

          votes











          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%2f2870336%2fare-matrices-which-yield-a-given-characteristic-polynomial-and-have-specified-st%23new-answer', 'question_page');

          );

          Post as a guest



































          active

          oldest

          votes













          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes










           

          draft saved


          draft discarded


























           


          draft saved


          draft discarded














          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2870336%2fare-matrices-which-yield-a-given-characteristic-polynomial-and-have-specified-st%23new-answer', 'question_page');

          );

          Post as a guest













































































          Comments

          Popular posts from this blog

          What is the equation of a 3D cone with generalised tilt?

          Color the edges and diagonals of a regular polygon

          Relationship between determinant of matrix and determinant of adjoint?