$f^n+g^n=h^2implies f,g,h$ all constant












4












$begingroup$


Let $k$ be a field with char$(k)=0$ and suppose for $f,g,hin k[x]$ having gcd$(f,g,h)=1$ and $ninmathbb{N}_{geqslant4}$ it holds that $f^n+g^n=h^2$. I want to show that $f,g,h$ are all constant. Of course, we go the Mason Stothers-way. Quick note: by gcd $1$ and the equation, we have that $f,g,h$ are pairwise co-prime.



For the sake of contradiction, suppose that $f,g,h$ are not all constant. By the other conditions listed above, we can apply Mason-Stothers like so:
$$max(deg f^n,deg g^n,deg h^2)leqslantdeg(text{rad}(fgh))-1.$$
Now let's look at two cases:



1. $f^n$ has maximal degree (and is non-constant).



2. $h^2$ has maximal degree.



A contradiction should appear in both cases. Let's begin with 1.:
Since $f^n$ has max degree and the polynomials are pairwise co-prime, we can say $$begin{align*}4leqslantdeg(f^n)=ndeg(f)&<deg({text{rad}(fgh)})\
&= deg(text{rad}(f)text{rad}(g)text{rad}(h))\
&=deg(text{rad}(f))+deg(text{rad}(g))+deg(text{rad}(h))\
&leqslant3deg(f).
end{align*}$$
Now since $n>3$, this is an immediate contradiction.



Thanks for all the fast help!






number-theory polynomials field-theory radicals







share|cite|improve this question











$endgroup$

















    4












    $begingroup$


    Let $k$ be a field with char$(k)=0$ and suppose for $f,g,hin k[x]$ having gcd$(f,g,h)=1$ and $ninmathbb{N}_{geqslant4}$ it holds that $f^n+g^n=h^2$. I want to show that $f,g,h$ are all constant. Of course, we go the Mason Stothers-way. Quick note: by gcd $1$ and the equation, we have that $f,g,h$ are pairwise co-prime.



    For the sake of contradiction, suppose that $f,g,h$ are not all constant. By the other conditions listed above, we can apply Mason-Stothers like so:
    $$max(deg f^n,deg g^n,deg h^2)leqslantdeg(text{rad}(fgh))-1.$$
    Now let's look at two cases:



    1. $f^n$ has maximal degree (and is non-constant).



    2. $h^2$ has maximal degree.



    A contradiction should appear in both cases. Let's begin with 1.:
    Since $f^n$ has max degree and the polynomials are pairwise co-prime, we can say $$begin{align*}4leqslantdeg(f^n)=ndeg(f)&<deg({text{rad}(fgh)})\
    &= deg(text{rad}(f)text{rad}(g)text{rad}(h))\
    &=deg(text{rad}(f))+deg(text{rad}(g))+deg(text{rad}(h))\
    &leqslant3deg(f).
    end{align*}$$
    Now since $n>3$, this is an immediate contradiction.



    Thanks for all the fast help!






    number-theory polynomials field-theory radicals







    share|cite|improve this question











    $endgroup$















      4












      4








      4


      3



      $begingroup$


      Let $k$ be a field with char$(k)=0$ and suppose for $f,g,hin k[x]$ having gcd$(f,g,h)=1$ and $ninmathbb{N}_{geqslant4}$ it holds that $f^n+g^n=h^2$. I want to show that $f,g,h$ are all constant. Of course, we go the Mason Stothers-way. Quick note: by gcd $1$ and the equation, we have that $f,g,h$ are pairwise co-prime.



      For the sake of contradiction, suppose that $f,g,h$ are not all constant. By the other conditions listed above, we can apply Mason-Stothers like so:
      $$max(deg f^n,deg g^n,deg h^2)leqslantdeg(text{rad}(fgh))-1.$$
      Now let's look at two cases:



      1. $f^n$ has maximal degree (and is non-constant).



      2. $h^2$ has maximal degree.



      A contradiction should appear in both cases. Let's begin with 1.:
      Since $f^n$ has max degree and the polynomials are pairwise co-prime, we can say $$begin{align*}4leqslantdeg(f^n)=ndeg(f)&<deg({text{rad}(fgh)})\
      &= deg(text{rad}(f)text{rad}(g)text{rad}(h))\
      &=deg(text{rad}(f))+deg(text{rad}(g))+deg(text{rad}(h))\
      &leqslant3deg(f).
      end{align*}$$
      Now since $n>3$, this is an immediate contradiction.



      Thanks for all the fast help!






      number-theory polynomials field-theory radicals







      share|cite|improve this question











      $endgroup$




      Let $k$ be a field with char$(k)=0$ and suppose for $f,g,hin k[x]$ having gcd$(f,g,h)=1$ and $ninmathbb{N}_{geqslant4}$ it holds that $f^n+g^n=h^2$. I want to show that $f,g,h$ are all constant. Of course, we go the Mason Stothers-way. Quick note: by gcd $1$ and the equation, we have that $f,g,h$ are pairwise co-prime.



      For the sake of contradiction, suppose that $f,g,h$ are not all constant. By the other conditions listed above, we can apply Mason-Stothers like so:
      $$max(deg f^n,deg g^n,deg h^2)leqslantdeg(text{rad}(fgh))-1.$$
      Now let's look at two cases:



      1. $f^n$ has maximal degree (and is non-constant).



      2. $h^2$ has maximal degree.



      A contradiction should appear in both cases. Let's begin with 1.:
      Since $f^n$ has max degree and the polynomials are pairwise co-prime, we can say $$begin{align*}4leqslantdeg(f^n)=ndeg(f)&<deg({text{rad}(fgh)})\
      &= deg(text{rad}(f)text{rad}(g)text{rad}(h))\
      &=deg(text{rad}(f))+deg(text{rad}(g))+deg(text{rad}(h))\
      &leqslant3deg(f).
      end{align*}$$
      Now since $n>3$, this is an immediate contradiction.



      Thanks for all the fast help!






      number-theory polynomials field-theory radicals




      number-theory polynomials field-theory radicals






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Dec 15 '18 at 22:49







      Algebear

















      asked Dec 15 '18 at 21:56









      AlgebearAlgebear

      704419




      704419






















          2 Answers
          2






          active

          oldest

          votes


















          2












          $begingroup$

          We don't know anything useful about $deg(text{rad}(f))$, but we do know that it's at most $deg(f)$.



          Similarly, $deg(text{rad}(g)) le deg(g)$, and since $f^n$ has maximal degree, we know $deg(g) le deg(f)$.



          Finally, $deg(text{rad}(h)) le deg(h)$. We know that $deg(h^2) le deg (f^n)$, so $deg(h) le frac n2 deg(h)$.



          (Be careful: we don't know $deg(h) le deg(f)$ just from $deg(h^2) le deg(f^n)$.)



          In the end, we get $$n deg(f) < deg(f) + deg(f) + frac n2 deg(f)$$ from which we have $n < 4$.



          The second case is similar, except instead we have $deg(f^n) le deg(h^2)$, so $deg (f) le frac 2n deg (h)$. The inequality we get is $2deg(h) < frac2n deg(h) + frac2n deg(h) + deg(h)$ which also implies $n<4$.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Ahh, okay. That second case caused the most trouble. Excuse the fact that I added the proof of case 1 after the post. Anyways, your proof is more detailed, thanks.
            $endgroup$
            – Algebear
            Dec 15 '18 at 22:47





















          1












          $begingroup$

          Since $f^n$ has maximal degree, it follows that $deg(g)leqdeg(f)$. Moreover,
          $$
          2deg(h)leq ndeg(f).
          $$
          Since $operatorname{rad}$ only lowers the degree, the RHS is at most
          $$
          left(2+frac n2right)deg(f),
          $$
          Which is at most $ndeg(f)$ since $ngeq4$.






          share|cite|improve this answer









          $endgroup$













            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%2f3042003%2ffngn-h2-implies-f-g-h-all-constant%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









            2












            $begingroup$

            We don't know anything useful about $deg(text{rad}(f))$, but we do know that it's at most $deg(f)$.



            Similarly, $deg(text{rad}(g)) le deg(g)$, and since $f^n$ has maximal degree, we know $deg(g) le deg(f)$.



            Finally, $deg(text{rad}(h)) le deg(h)$. We know that $deg(h^2) le deg (f^n)$, so $deg(h) le frac n2 deg(h)$.



            (Be careful: we don't know $deg(h) le deg(f)$ just from $deg(h^2) le deg(f^n)$.)



            In the end, we get $$n deg(f) < deg(f) + deg(f) + frac n2 deg(f)$$ from which we have $n < 4$.



            The second case is similar, except instead we have $deg(f^n) le deg(h^2)$, so $deg (f) le frac 2n deg (h)$. The inequality we get is $2deg(h) < frac2n deg(h) + frac2n deg(h) + deg(h)$ which also implies $n<4$.






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              Ahh, okay. That second case caused the most trouble. Excuse the fact that I added the proof of case 1 after the post. Anyways, your proof is more detailed, thanks.
              $endgroup$
              – Algebear
              Dec 15 '18 at 22:47


















            2












            $begingroup$

            We don't know anything useful about $deg(text{rad}(f))$, but we do know that it's at most $deg(f)$.



            Similarly, $deg(text{rad}(g)) le deg(g)$, and since $f^n$ has maximal degree, we know $deg(g) le deg(f)$.



            Finally, $deg(text{rad}(h)) le deg(h)$. We know that $deg(h^2) le deg (f^n)$, so $deg(h) le frac n2 deg(h)$.



            (Be careful: we don't know $deg(h) le deg(f)$ just from $deg(h^2) le deg(f^n)$.)



            In the end, we get $$n deg(f) < deg(f) + deg(f) + frac n2 deg(f)$$ from which we have $n < 4$.



            The second case is similar, except instead we have $deg(f^n) le deg(h^2)$, so $deg (f) le frac 2n deg (h)$. The inequality we get is $2deg(h) < frac2n deg(h) + frac2n deg(h) + deg(h)$ which also implies $n<4$.






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              Ahh, okay. That second case caused the most trouble. Excuse the fact that I added the proof of case 1 after the post. Anyways, your proof is more detailed, thanks.
              $endgroup$
              – Algebear
              Dec 15 '18 at 22:47
















            2












            2








            2





            $begingroup$

            We don't know anything useful about $deg(text{rad}(f))$, but we do know that it's at most $deg(f)$.



            Similarly, $deg(text{rad}(g)) le deg(g)$, and since $f^n$ has maximal degree, we know $deg(g) le deg(f)$.



            Finally, $deg(text{rad}(h)) le deg(h)$. We know that $deg(h^2) le deg (f^n)$, so $deg(h) le frac n2 deg(h)$.



            (Be careful: we don't know $deg(h) le deg(f)$ just from $deg(h^2) le deg(f^n)$.)



            In the end, we get $$n deg(f) < deg(f) + deg(f) + frac n2 deg(f)$$ from which we have $n < 4$.



            The second case is similar, except instead we have $deg(f^n) le deg(h^2)$, so $deg (f) le frac 2n deg (h)$. The inequality we get is $2deg(h) < frac2n deg(h) + frac2n deg(h) + deg(h)$ which also implies $n<4$.






            share|cite|improve this answer









            $endgroup$



            We don't know anything useful about $deg(text{rad}(f))$, but we do know that it's at most $deg(f)$.



            Similarly, $deg(text{rad}(g)) le deg(g)$, and since $f^n$ has maximal degree, we know $deg(g) le deg(f)$.



            Finally, $deg(text{rad}(h)) le deg(h)$. We know that $deg(h^2) le deg (f^n)$, so $deg(h) le frac n2 deg(h)$.



            (Be careful: we don't know $deg(h) le deg(f)$ just from $deg(h^2) le deg(f^n)$.)



            In the end, we get $$n deg(f) < deg(f) + deg(f) + frac n2 deg(f)$$ from which we have $n < 4$.



            The second case is similar, except instead we have $deg(f^n) le deg(h^2)$, so $deg (f) le frac 2n deg (h)$. The inequality we get is $2deg(h) < frac2n deg(h) + frac2n deg(h) + deg(h)$ which also implies $n<4$.







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Dec 15 '18 at 22:39









            Misha LavrovMisha Lavrov

            47.4k657107




            47.4k657107












            • $begingroup$
              Ahh, okay. That second case caused the most trouble. Excuse the fact that I added the proof of case 1 after the post. Anyways, your proof is more detailed, thanks.
              $endgroup$
              – Algebear
              Dec 15 '18 at 22:47




















            • $begingroup$
              Ahh, okay. That second case caused the most trouble. Excuse the fact that I added the proof of case 1 after the post. Anyways, your proof is more detailed, thanks.
              $endgroup$
              – Algebear
              Dec 15 '18 at 22:47


















            $begingroup$
            Ahh, okay. That second case caused the most trouble. Excuse the fact that I added the proof of case 1 after the post. Anyways, your proof is more detailed, thanks.
            $endgroup$
            – Algebear
            Dec 15 '18 at 22:47






            $begingroup$
            Ahh, okay. That second case caused the most trouble. Excuse the fact that I added the proof of case 1 after the post. Anyways, your proof is more detailed, thanks.
            $endgroup$
            – Algebear
            Dec 15 '18 at 22:47













            1












            $begingroup$

            Since $f^n$ has maximal degree, it follows that $deg(g)leqdeg(f)$. Moreover,
            $$
            2deg(h)leq ndeg(f).
            $$
            Since $operatorname{rad}$ only lowers the degree, the RHS is at most
            $$
            left(2+frac n2right)deg(f),
            $$
            Which is at most $ndeg(f)$ since $ngeq4$.






            share|cite|improve this answer









            $endgroup$


















              1












              $begingroup$

              Since $f^n$ has maximal degree, it follows that $deg(g)leqdeg(f)$. Moreover,
              $$
              2deg(h)leq ndeg(f).
              $$
              Since $operatorname{rad}$ only lowers the degree, the RHS is at most
              $$
              left(2+frac n2right)deg(f),
              $$
              Which is at most $ndeg(f)$ since $ngeq4$.






              share|cite|improve this answer









              $endgroup$
















                1












                1








                1





                $begingroup$

                Since $f^n$ has maximal degree, it follows that $deg(g)leqdeg(f)$. Moreover,
                $$
                2deg(h)leq ndeg(f).
                $$
                Since $operatorname{rad}$ only lowers the degree, the RHS is at most
                $$
                left(2+frac n2right)deg(f),
                $$
                Which is at most $ndeg(f)$ since $ngeq4$.






                share|cite|improve this answer









                $endgroup$



                Since $f^n$ has maximal degree, it follows that $deg(g)leqdeg(f)$. Moreover,
                $$
                2deg(h)leq ndeg(f).
                $$
                Since $operatorname{rad}$ only lowers the degree, the RHS is at most
                $$
                left(2+frac n2right)deg(f),
                $$
                Which is at most $ndeg(f)$ since $ngeq4$.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Dec 15 '18 at 22:43









                Michael BurrMichael Burr

                26.9k23262




                26.9k23262






























                    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%2f3042003%2ffngn-h2-implies-f-g-h-all-constant%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

                    Plaza Victoria

                    Image
                    Plaza Victoria Plaza Victoria en 2017 Otros nombres Plaza de La Victoria Localización El Almendral, Valparaíso, Chile Vías adyacentes Chacabuco, Molina, Plaza Victoria y Edwards Creación 1841 Metro Bellavista Ubicación 33°02′46″S 71°37′11″O  /  -33.04624167, -71.61980833 Coordenadas: 33°02′46″S 71°37′11″O  /  -33.04624167, -71.61980833 [editar datos en Wikidata] La Plaza Victoria , también llamada Plaza de la Victoria , [ 1 ] ​ es una plaza ubicada en el sector El Almendral del plan de la ciudad de Valparaíso, Chile, de importancia patrimonial, que incluye valiosas estatuas y especies vegetales. [ 2 ] ​ La plaza se creó como tal en la primera mitad del siglo XIX, tomando previamente los nombres de Plaza Nueva y Plaza de Orrego . Si bien desde sus inicios tuvo relevancia histórica, no fue sino a partir de fines de los años 1860 cuando comenzó a cobrar mayor importancia y se convirtió en uno de los principales centros sociales de l
                    Read more

                    Puebla de Zaragoza

                    Image
                    Para otros usos de este término, véase Puebla (desambiguación). Heroica Puebla de Zaragoza Localidad De arriba a abajo de izquierda a derecha: Estrella de Puebla, Volcán Popocatépetl, Catedral de Puebla, Monumento a Ignacio Zaragoza, Estadio Cuauhtémoc, Angelópolis y Vista panorámica de la ciudad. Escudo Otros nombres: El relicario de América/ La ciudad de los Ángeles/ La Angelópolis Lema: Muy noble y muy leal ciudad de Puebla de los Ángeles Heroica Puebla de Zaragoza Localización de Heroica Puebla de Zaragoza en México Heroica Puebla de Zaragoza Localización de Heroica Puebla de Zaragoza en Puebla Mapa interactivo Coordenadas 19°03′05″N 98°13′04″O  /  19.051388888889, -98.217777777778 Coordenadas: 19°03′05″N 98°13′04″O  /  19.051388888889, -98.217777777778 Idioma oficial Español Entidad Localidad  • País   México  • Estado Puebla  • Municipio Puebla Presidente municipal Claudia Rivera Vivanc
                    Read more

                    Musa

                    Image
                    Para el género de plantas, véase Musa (planta). Apolo y la Nueve Musas En la mitología griega, las musas (en griego antiguo μοῦσαι « mousai» ) son, según los escritores más antiguos, las divinidades inspiradoras de las Artes: cada una de ellas está relacionada con ramas artísticas y del conocimiento. Son hijas de Zeus y de Mnemósine, compañeras del séquito de Apolo, dios olímpico de la música y patrón de las bellas artes, quien tuvo romances con cada una de ellas, dejando descendientes. Bajaban a la tierra a susurrar ideas e inspirar a aquellos mortales que las invocaran. En la época más arcaica eran las ninfas inspiradoras de las fuentes, en las cuales eran adoradas. Finalmente, alrededor de los siglos VIII-VII a. C. [ 1 ] ​ prevaleció en todo el territorio de la Hélade la adoración de las nueve Musas, que son Calíope, Clío, Erato, Euterpe, Melpómene, Polimnia, Talía, Terpsícore y Urania. El culto a las musas era originalmente de Tracia y Beocia, y fueron de vital impo
                    Read more