If $g(x)in mathbb{Z} [x]$, $g(x)=a^{k}$ for all $xinmathbb{Z}$ and a fixed $kinmathbb{N}$ then...











up vote
5
down vote

favorite
1












I've been trying to prove this using Hilbert's Irreducibility Theorem for a while now. I have proved the case for $k=2$ as follows:
Suppose $g(x)inmathbb{Z}[x]$ is a perfect square for all integer values $x$. Let $f(x,t)=y^{2}-g(x)$. Note that we either have that $f$ is irreducible, in which case we have $$f(x,y)=y^{2}-g(x)$$ or $f$ is reducible, giving $$f(x,y)=(y-A(x))(y-B(x))$$ for some functions $A(x),B(x)inmathbb{Z}[x]$. Expanding out the latter case we get the following:
begin{equation*}
begin{split}
y^{2}-g(x) & = (y-A(x))(y-B(x)) \
& = y^{2}-(A(x)+B(x))y+A(x)B(x).
end{split}
end{equation*}

Comparing $y$ coefficients we deduce that $A(x)=-B(x)$, thus
begin{equation*}
begin{split}
y^{2}-g(x) & = (y-A(x))(y-A(x)) \
& = y^{2}+A^{2}(x)
end{split}
end{equation*}

$$implies g(x)=A^{2}(x)$$
Now suppose $f(x,y)=y^{2}-g(x)$ is irreducible. Then by Hilbert's Irreducibility Theorem there exist infinite $x_{0}$ such that $f(x_{0},y)=y^{2}-g(x_{0})$ is irreducible in $mathbb{Q}[y]$. By definition of $g(x)$ we have that $g(x_{0})=a_{0}^{2}$ for some $a_{0} in mathbb{Z}$ and hence $$f(x_{0},y)=y^{2}-a_{0}^{2}=(y-a_{0})(y+a_{0})$$ which is reducible in $mathbb{Z}[y]$ giving a contradiction. Thus $g(x)=h^{2}(x)$ for some $h(x)in mathbb{Z}[x]$



When trying to generalise this to higher $k$, I can only seem to get a result if $y^{k}-g(x)$ has a linear factor in $y$, i.e.
$$f(x,y)=(y-h(x))(y^{k-1}+g_{k-2}(x)y^{k-2}+ldots+g_{1}(x)y+g_{0}(x))$$ for some $h(x),g_{i}(x)in mathbb{Z}[x]$. We can then use induction to find $g(x)=h^{k}(x)$. My arguement seems to break down for $k=4$ as if $$y-g(x)=(y^{2}+A(x)y+B(x))(y^{2}+C(x)y+D(x))$$
Then we find $g(x)=B^{2}(x)$ but this does not seem to show that $g(x)$ is a 4th power of another polynomial. Is my method too specific to generalise this for $k=5$ and above or am I just missing a trick to make the whole proof fit together?
Other answers on here have refered to the paper "Polynomials of certain special types" by Davenport, Lewis, Schinzel but the results in this are slightly too general to help with my understanding of this problem.










share|cite|improve this question




























    up vote
    5
    down vote

    favorite
    1












    I've been trying to prove this using Hilbert's Irreducibility Theorem for a while now. I have proved the case for $k=2$ as follows:
    Suppose $g(x)inmathbb{Z}[x]$ is a perfect square for all integer values $x$. Let $f(x,t)=y^{2}-g(x)$. Note that we either have that $f$ is irreducible, in which case we have $$f(x,y)=y^{2}-g(x)$$ or $f$ is reducible, giving $$f(x,y)=(y-A(x))(y-B(x))$$ for some functions $A(x),B(x)inmathbb{Z}[x]$. Expanding out the latter case we get the following:
    begin{equation*}
    begin{split}
    y^{2}-g(x) & = (y-A(x))(y-B(x)) \
    & = y^{2}-(A(x)+B(x))y+A(x)B(x).
    end{split}
    end{equation*}

    Comparing $y$ coefficients we deduce that $A(x)=-B(x)$, thus
    begin{equation*}
    begin{split}
    y^{2}-g(x) & = (y-A(x))(y-A(x)) \
    & = y^{2}+A^{2}(x)
    end{split}
    end{equation*}

    $$implies g(x)=A^{2}(x)$$
    Now suppose $f(x,y)=y^{2}-g(x)$ is irreducible. Then by Hilbert's Irreducibility Theorem there exist infinite $x_{0}$ such that $f(x_{0},y)=y^{2}-g(x_{0})$ is irreducible in $mathbb{Q}[y]$. By definition of $g(x)$ we have that $g(x_{0})=a_{0}^{2}$ for some $a_{0} in mathbb{Z}$ and hence $$f(x_{0},y)=y^{2}-a_{0}^{2}=(y-a_{0})(y+a_{0})$$ which is reducible in $mathbb{Z}[y]$ giving a contradiction. Thus $g(x)=h^{2}(x)$ for some $h(x)in mathbb{Z}[x]$



    When trying to generalise this to higher $k$, I can only seem to get a result if $y^{k}-g(x)$ has a linear factor in $y$, i.e.
    $$f(x,y)=(y-h(x))(y^{k-1}+g_{k-2}(x)y^{k-2}+ldots+g_{1}(x)y+g_{0}(x))$$ for some $h(x),g_{i}(x)in mathbb{Z}[x]$. We can then use induction to find $g(x)=h^{k}(x)$. My arguement seems to break down for $k=4$ as if $$y-g(x)=(y^{2}+A(x)y+B(x))(y^{2}+C(x)y+D(x))$$
    Then we find $g(x)=B^{2}(x)$ but this does not seem to show that $g(x)$ is a 4th power of another polynomial. Is my method too specific to generalise this for $k=5$ and above or am I just missing a trick to make the whole proof fit together?
    Other answers on here have refered to the paper "Polynomials of certain special types" by Davenport, Lewis, Schinzel but the results in this are slightly too general to help with my understanding of this problem.










    share|cite|improve this question


























      up vote
      5
      down vote

      favorite
      1









      up vote
      5
      down vote

      favorite
      1






      1





      I've been trying to prove this using Hilbert's Irreducibility Theorem for a while now. I have proved the case for $k=2$ as follows:
      Suppose $g(x)inmathbb{Z}[x]$ is a perfect square for all integer values $x$. Let $f(x,t)=y^{2}-g(x)$. Note that we either have that $f$ is irreducible, in which case we have $$f(x,y)=y^{2}-g(x)$$ or $f$ is reducible, giving $$f(x,y)=(y-A(x))(y-B(x))$$ for some functions $A(x),B(x)inmathbb{Z}[x]$. Expanding out the latter case we get the following:
      begin{equation*}
      begin{split}
      y^{2}-g(x) & = (y-A(x))(y-B(x)) \
      & = y^{2}-(A(x)+B(x))y+A(x)B(x).
      end{split}
      end{equation*}

      Comparing $y$ coefficients we deduce that $A(x)=-B(x)$, thus
      begin{equation*}
      begin{split}
      y^{2}-g(x) & = (y-A(x))(y-A(x)) \
      & = y^{2}+A^{2}(x)
      end{split}
      end{equation*}

      $$implies g(x)=A^{2}(x)$$
      Now suppose $f(x,y)=y^{2}-g(x)$ is irreducible. Then by Hilbert's Irreducibility Theorem there exist infinite $x_{0}$ such that $f(x_{0},y)=y^{2}-g(x_{0})$ is irreducible in $mathbb{Q}[y]$. By definition of $g(x)$ we have that $g(x_{0})=a_{0}^{2}$ for some $a_{0} in mathbb{Z}$ and hence $$f(x_{0},y)=y^{2}-a_{0}^{2}=(y-a_{0})(y+a_{0})$$ which is reducible in $mathbb{Z}[y]$ giving a contradiction. Thus $g(x)=h^{2}(x)$ for some $h(x)in mathbb{Z}[x]$



      When trying to generalise this to higher $k$, I can only seem to get a result if $y^{k}-g(x)$ has a linear factor in $y$, i.e.
      $$f(x,y)=(y-h(x))(y^{k-1}+g_{k-2}(x)y^{k-2}+ldots+g_{1}(x)y+g_{0}(x))$$ for some $h(x),g_{i}(x)in mathbb{Z}[x]$. We can then use induction to find $g(x)=h^{k}(x)$. My arguement seems to break down for $k=4$ as if $$y-g(x)=(y^{2}+A(x)y+B(x))(y^{2}+C(x)y+D(x))$$
      Then we find $g(x)=B^{2}(x)$ but this does not seem to show that $g(x)$ is a 4th power of another polynomial. Is my method too specific to generalise this for $k=5$ and above or am I just missing a trick to make the whole proof fit together?
      Other answers on here have refered to the paper "Polynomials of certain special types" by Davenport, Lewis, Schinzel but the results in this are slightly too general to help with my understanding of this problem.










      share|cite|improve this question















      I've been trying to prove this using Hilbert's Irreducibility Theorem for a while now. I have proved the case for $k=2$ as follows:
      Suppose $g(x)inmathbb{Z}[x]$ is a perfect square for all integer values $x$. Let $f(x,t)=y^{2}-g(x)$. Note that we either have that $f$ is irreducible, in which case we have $$f(x,y)=y^{2}-g(x)$$ or $f$ is reducible, giving $$f(x,y)=(y-A(x))(y-B(x))$$ for some functions $A(x),B(x)inmathbb{Z}[x]$. Expanding out the latter case we get the following:
      begin{equation*}
      begin{split}
      y^{2}-g(x) & = (y-A(x))(y-B(x)) \
      & = y^{2}-(A(x)+B(x))y+A(x)B(x).
      end{split}
      end{equation*}

      Comparing $y$ coefficients we deduce that $A(x)=-B(x)$, thus
      begin{equation*}
      begin{split}
      y^{2}-g(x) & = (y-A(x))(y-A(x)) \
      & = y^{2}+A^{2}(x)
      end{split}
      end{equation*}

      $$implies g(x)=A^{2}(x)$$
      Now suppose $f(x,y)=y^{2}-g(x)$ is irreducible. Then by Hilbert's Irreducibility Theorem there exist infinite $x_{0}$ such that $f(x_{0},y)=y^{2}-g(x_{0})$ is irreducible in $mathbb{Q}[y]$. By definition of $g(x)$ we have that $g(x_{0})=a_{0}^{2}$ for some $a_{0} in mathbb{Z}$ and hence $$f(x_{0},y)=y^{2}-a_{0}^{2}=(y-a_{0})(y+a_{0})$$ which is reducible in $mathbb{Z}[y]$ giving a contradiction. Thus $g(x)=h^{2}(x)$ for some $h(x)in mathbb{Z}[x]$



      When trying to generalise this to higher $k$, I can only seem to get a result if $y^{k}-g(x)$ has a linear factor in $y$, i.e.
      $$f(x,y)=(y-h(x))(y^{k-1}+g_{k-2}(x)y^{k-2}+ldots+g_{1}(x)y+g_{0}(x))$$ for some $h(x),g_{i}(x)in mathbb{Z}[x]$. We can then use induction to find $g(x)=h^{k}(x)$. My arguement seems to break down for $k=4$ as if $$y-g(x)=(y^{2}+A(x)y+B(x))(y^{2}+C(x)y+D(x))$$
      Then we find $g(x)=B^{2}(x)$ but this does not seem to show that $g(x)$ is a 4th power of another polynomial. Is my method too specific to generalise this for $k=5$ and above or am I just missing a trick to make the whole proof fit together?
      Other answers on here have refered to the paper "Polynomials of certain special types" by Davenport, Lewis, Schinzel but the results in this are slightly too general to help with my understanding of this problem.







      abstract-algebra number-theory polynomials algebraic-number-theory






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited yesterday









      user26857

      39k123882




      39k123882










      asked yesterday









      user562804

      293




      293



























          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: 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%2f2995208%2fif-gx-in-mathbbz-x-gx-ak-for-all-x-in-mathbbz-and-a-fixed%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%2f2995208%2fif-gx-in-mathbbz-x-gx-ak-for-all-x-in-mathbbz-and-a-fixed%23new-answer', 'question_page');
          }
          );

          Post as a guest




















































































          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