'Solving' $y=(AF+BG)y+(Au+Bv)(x-alpha)(x-beta)$












0












$begingroup$


Let $A,B,F,G in mathbb{C}[x,y]$, $u,v in mathbb{C}[x]$, $alpha,beta in mathbb{C}$, $alpha neq beta$.
Assume that $u$ and $v$ have no common zero,
and that ${alpha,beta}$ are not zeros of $u$ or $v$.
(I am not sure if I wish to assume that $F$ and $G$ are relatively prime or not).



Further assume that the following equation holds: $y=(AF+BG)y+(Au+Bv)(x-alpha)(x-beta)$.




What can be said about $A,B,F,G,u,v$? I do not know exactly what exactly I am looking for; I wish to obtain 'simpler' (= of a specific form/ with less variables/ a connection between) $A,B,F,G,u,v$.
Perhaps this equation leads to some contradiction?




Taking $y=0$, we get that: $(A(x,0)u+B(x,0)v)(x-alpha)(x-beta)=0$.
This shows that, for every $gamma notin {alpha,beta}$:
$A(gamma,0)u(gamma)+B(gamma,0)v(gamma)=0$.
In other words, the polynomial $A(x,0)u(x)+B(x,0)v(x)$ has infinitely many zeros,
which is impossible unless it is the zero polynomial; is it true that then $A(x,0)=v(x)$ and $B(x,0)=-u(x)$?



Taking $x=alpha$, we get that:
$y=(A(alpha,y)F(alpha,y)+B(alpha,y)G(alpha,y))y$.
Then,
$A(alpha,y)F(alpha,y)+B(alpha,y)G(alpha,y)=1$.



Similarly, taking $x=beta$ we get that:
$A(beta,y)F(beta,y)+B(beta,y)G(beta,y)=1$.





By this question,
$A=a_ny^n+cdots+a_1y+ v tilde{v}=tilde{A}y+vtilde{v}$
and
$B=b_my^m+cdots+b_1y- u tilde{v}=tilde{B}y-utilde{v}$,
for some $tilde{A},tilde{B} in k[x,y]$.



Therefore, $y=((tilde{A}y+vtilde{v})F+(tilde{B}y-utilde{v})G)y+((tilde{A}y+vtilde{v})u+(tilde{B}y-utilde{v})v)(x-alpha)(x-beta)$
becomes
$y=((tilde{A}y+vtilde{v})F+(tilde{B}y-utilde{v})G)y+(tilde{A}yu+tilde{B}yv)(x-alpha)(x-beta)$.



Then, $1=((tilde{A}y+vtilde{v})F+(tilde{B}y-utilde{v})G)+(tilde{A}u+tilde{B}v)(x-alpha)(x-beta)$.





I think that more can be said, and actually $AF+BG=Cy+D$, where $C,D in k[x]$
(by differentiating with respect to $y$); I will add the details later.





(I really apologize if this equation seems a little peculiar, it is just that I have encountered it in a calculation I did, and wish to understand it better).



Any comments are welcome!










share|cite|improve this question











$endgroup$

















    0












    $begingroup$


    Let $A,B,F,G in mathbb{C}[x,y]$, $u,v in mathbb{C}[x]$, $alpha,beta in mathbb{C}$, $alpha neq beta$.
    Assume that $u$ and $v$ have no common zero,
    and that ${alpha,beta}$ are not zeros of $u$ or $v$.
    (I am not sure if I wish to assume that $F$ and $G$ are relatively prime or not).



    Further assume that the following equation holds: $y=(AF+BG)y+(Au+Bv)(x-alpha)(x-beta)$.




    What can be said about $A,B,F,G,u,v$? I do not know exactly what exactly I am looking for; I wish to obtain 'simpler' (= of a specific form/ with less variables/ a connection between) $A,B,F,G,u,v$.
    Perhaps this equation leads to some contradiction?




    Taking $y=0$, we get that: $(A(x,0)u+B(x,0)v)(x-alpha)(x-beta)=0$.
    This shows that, for every $gamma notin {alpha,beta}$:
    $A(gamma,0)u(gamma)+B(gamma,0)v(gamma)=0$.
    In other words, the polynomial $A(x,0)u(x)+B(x,0)v(x)$ has infinitely many zeros,
    which is impossible unless it is the zero polynomial; is it true that then $A(x,0)=v(x)$ and $B(x,0)=-u(x)$?



    Taking $x=alpha$, we get that:
    $y=(A(alpha,y)F(alpha,y)+B(alpha,y)G(alpha,y))y$.
    Then,
    $A(alpha,y)F(alpha,y)+B(alpha,y)G(alpha,y)=1$.



    Similarly, taking $x=beta$ we get that:
    $A(beta,y)F(beta,y)+B(beta,y)G(beta,y)=1$.





    By this question,
    $A=a_ny^n+cdots+a_1y+ v tilde{v}=tilde{A}y+vtilde{v}$
    and
    $B=b_my^m+cdots+b_1y- u tilde{v}=tilde{B}y-utilde{v}$,
    for some $tilde{A},tilde{B} in k[x,y]$.



    Therefore, $y=((tilde{A}y+vtilde{v})F+(tilde{B}y-utilde{v})G)y+((tilde{A}y+vtilde{v})u+(tilde{B}y-utilde{v})v)(x-alpha)(x-beta)$
    becomes
    $y=((tilde{A}y+vtilde{v})F+(tilde{B}y-utilde{v})G)y+(tilde{A}yu+tilde{B}yv)(x-alpha)(x-beta)$.



    Then, $1=((tilde{A}y+vtilde{v})F+(tilde{B}y-utilde{v})G)+(tilde{A}u+tilde{B}v)(x-alpha)(x-beta)$.





    I think that more can be said, and actually $AF+BG=Cy+D$, where $C,D in k[x]$
    (by differentiating with respect to $y$); I will add the details later.





    (I really apologize if this equation seems a little peculiar, it is just that I have encountered it in a calculation I did, and wish to understand it better).



    Any comments are welcome!










    share|cite|improve this question











    $endgroup$















      0












      0








      0





      $begingroup$


      Let $A,B,F,G in mathbb{C}[x,y]$, $u,v in mathbb{C}[x]$, $alpha,beta in mathbb{C}$, $alpha neq beta$.
      Assume that $u$ and $v$ have no common zero,
      and that ${alpha,beta}$ are not zeros of $u$ or $v$.
      (I am not sure if I wish to assume that $F$ and $G$ are relatively prime or not).



      Further assume that the following equation holds: $y=(AF+BG)y+(Au+Bv)(x-alpha)(x-beta)$.




      What can be said about $A,B,F,G,u,v$? I do not know exactly what exactly I am looking for; I wish to obtain 'simpler' (= of a specific form/ with less variables/ a connection between) $A,B,F,G,u,v$.
      Perhaps this equation leads to some contradiction?




      Taking $y=0$, we get that: $(A(x,0)u+B(x,0)v)(x-alpha)(x-beta)=0$.
      This shows that, for every $gamma notin {alpha,beta}$:
      $A(gamma,0)u(gamma)+B(gamma,0)v(gamma)=0$.
      In other words, the polynomial $A(x,0)u(x)+B(x,0)v(x)$ has infinitely many zeros,
      which is impossible unless it is the zero polynomial; is it true that then $A(x,0)=v(x)$ and $B(x,0)=-u(x)$?



      Taking $x=alpha$, we get that:
      $y=(A(alpha,y)F(alpha,y)+B(alpha,y)G(alpha,y))y$.
      Then,
      $A(alpha,y)F(alpha,y)+B(alpha,y)G(alpha,y)=1$.



      Similarly, taking $x=beta$ we get that:
      $A(beta,y)F(beta,y)+B(beta,y)G(beta,y)=1$.





      By this question,
      $A=a_ny^n+cdots+a_1y+ v tilde{v}=tilde{A}y+vtilde{v}$
      and
      $B=b_my^m+cdots+b_1y- u tilde{v}=tilde{B}y-utilde{v}$,
      for some $tilde{A},tilde{B} in k[x,y]$.



      Therefore, $y=((tilde{A}y+vtilde{v})F+(tilde{B}y-utilde{v})G)y+((tilde{A}y+vtilde{v})u+(tilde{B}y-utilde{v})v)(x-alpha)(x-beta)$
      becomes
      $y=((tilde{A}y+vtilde{v})F+(tilde{B}y-utilde{v})G)y+(tilde{A}yu+tilde{B}yv)(x-alpha)(x-beta)$.



      Then, $1=((tilde{A}y+vtilde{v})F+(tilde{B}y-utilde{v})G)+(tilde{A}u+tilde{B}v)(x-alpha)(x-beta)$.





      I think that more can be said, and actually $AF+BG=Cy+D$, where $C,D in k[x]$
      (by differentiating with respect to $y$); I will add the details later.





      (I really apologize if this equation seems a little peculiar, it is just that I have encountered it in a calculation I did, and wish to understand it better).



      Any comments are welcome!










      share|cite|improve this question











      $endgroup$




      Let $A,B,F,G in mathbb{C}[x,y]$, $u,v in mathbb{C}[x]$, $alpha,beta in mathbb{C}$, $alpha neq beta$.
      Assume that $u$ and $v$ have no common zero,
      and that ${alpha,beta}$ are not zeros of $u$ or $v$.
      (I am not sure if I wish to assume that $F$ and $G$ are relatively prime or not).



      Further assume that the following equation holds: $y=(AF+BG)y+(Au+Bv)(x-alpha)(x-beta)$.




      What can be said about $A,B,F,G,u,v$? I do not know exactly what exactly I am looking for; I wish to obtain 'simpler' (= of a specific form/ with less variables/ a connection between) $A,B,F,G,u,v$.
      Perhaps this equation leads to some contradiction?




      Taking $y=0$, we get that: $(A(x,0)u+B(x,0)v)(x-alpha)(x-beta)=0$.
      This shows that, for every $gamma notin {alpha,beta}$:
      $A(gamma,0)u(gamma)+B(gamma,0)v(gamma)=0$.
      In other words, the polynomial $A(x,0)u(x)+B(x,0)v(x)$ has infinitely many zeros,
      which is impossible unless it is the zero polynomial; is it true that then $A(x,0)=v(x)$ and $B(x,0)=-u(x)$?



      Taking $x=alpha$, we get that:
      $y=(A(alpha,y)F(alpha,y)+B(alpha,y)G(alpha,y))y$.
      Then,
      $A(alpha,y)F(alpha,y)+B(alpha,y)G(alpha,y)=1$.



      Similarly, taking $x=beta$ we get that:
      $A(beta,y)F(beta,y)+B(beta,y)G(beta,y)=1$.





      By this question,
      $A=a_ny^n+cdots+a_1y+ v tilde{v}=tilde{A}y+vtilde{v}$
      and
      $B=b_my^m+cdots+b_1y- u tilde{v}=tilde{B}y-utilde{v}$,
      for some $tilde{A},tilde{B} in k[x,y]$.



      Therefore, $y=((tilde{A}y+vtilde{v})F+(tilde{B}y-utilde{v})G)y+((tilde{A}y+vtilde{v})u+(tilde{B}y-utilde{v})v)(x-alpha)(x-beta)$
      becomes
      $y=((tilde{A}y+vtilde{v})F+(tilde{B}y-utilde{v})G)y+(tilde{A}yu+tilde{B}yv)(x-alpha)(x-beta)$.



      Then, $1=((tilde{A}y+vtilde{v})F+(tilde{B}y-utilde{v})G)+(tilde{A}u+tilde{B}v)(x-alpha)(x-beta)$.





      I think that more can be said, and actually $AF+BG=Cy+D$, where $C,D in k[x]$
      (by differentiating with respect to $y$); I will add the details later.





      (I really apologize if this equation seems a little peculiar, it is just that I have encountered it in a calculation I did, and wish to understand it better).



      Any comments are welcome!







      algebraic-geometry polynomials commutative-algebra






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Jan 7 at 4:59







      user237522

















      asked Jan 5 at 22:12









      user237522user237522

      2,1631617




      2,1631617






















          0






          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',
          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%2f3063249%2fsolving-y-afbgyaubvx-alphax-beta%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          0






          active

          oldest

          votes








          0






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes
















          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%2f3063249%2fsolving-y-afbgyaubvx-alphax-beta%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

          Quarter-circle Tiles

          build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

          Mont Emei