Proving that $f(x)$ divides $x^p^n - x$ iff $deg f(x)$ divides $n$

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











up vote
2
down vote

favorite
1













Prove that $f(x)$ divides $x^p^n - x$ if and only if $d := deg f(x)$ divides $n$.




I believe that I have the backward direction covered: Let $d mid n$ say $n = dq$ for some $q$ in $mathbbF_p[x]$. Consider the field $mathbbF_p[x]/(f(x))$ which has $p^d$ elements. Take an element $x+I$ from the field (here $I = (f(x))$) so we have: $(x+I)^p^n = (x+I)^p^dq$. As long as you keep factoring out $(x+I)$ with the $p^d$ power you will get $(x+I)$ so $x^p^n - x in (f(x))$.



I am having trouble getting to the other direction.







share|cite|improve this question


















  • 1




    You are, of course, talking of polynomials over finite fields (in fact, over the prime field $,Bbb F_p,$) and not merely $,R[x],$ , since otherwise there are counterexamples...
    – DonAntonio
    Oct 20 '12 at 22:23











  • Sorry about that I fixed it. I'm typing from a phone.
    – Student
    Oct 20 '12 at 22:25










  • Oh, dear! Then stop at once or you'll fall down (if walking), or even worse: you may crash your car if driving (and it is illegal)
    – DonAntonio
    Oct 20 '12 at 22:28






  • 2




    Is $f(x)$ supposed to be irreducible over $mathbbF_p$? Otherwise, $mathbbF_p[x]/(f(x))$ won't be a field.
    – Myath
    Feb 25 '16 at 1:31















up vote
2
down vote

favorite
1













Prove that $f(x)$ divides $x^p^n - x$ if and only if $d := deg f(x)$ divides $n$.




I believe that I have the backward direction covered: Let $d mid n$ say $n = dq$ for some $q$ in $mathbbF_p[x]$. Consider the field $mathbbF_p[x]/(f(x))$ which has $p^d$ elements. Take an element $x+I$ from the field (here $I = (f(x))$) so we have: $(x+I)^p^n = (x+I)^p^dq$. As long as you keep factoring out $(x+I)$ with the $p^d$ power you will get $(x+I)$ so $x^p^n - x in (f(x))$.



I am having trouble getting to the other direction.







share|cite|improve this question


















  • 1




    You are, of course, talking of polynomials over finite fields (in fact, over the prime field $,Bbb F_p,$) and not merely $,R[x],$ , since otherwise there are counterexamples...
    – DonAntonio
    Oct 20 '12 at 22:23











  • Sorry about that I fixed it. I'm typing from a phone.
    – Student
    Oct 20 '12 at 22:25










  • Oh, dear! Then stop at once or you'll fall down (if walking), or even worse: you may crash your car if driving (and it is illegal)
    – DonAntonio
    Oct 20 '12 at 22:28






  • 2




    Is $f(x)$ supposed to be irreducible over $mathbbF_p$? Otherwise, $mathbbF_p[x]/(f(x))$ won't be a field.
    – Myath
    Feb 25 '16 at 1:31













up vote
2
down vote

favorite
1









up vote
2
down vote

favorite
1






1






Prove that $f(x)$ divides $x^p^n - x$ if and only if $d := deg f(x)$ divides $n$.




I believe that I have the backward direction covered: Let $d mid n$ say $n = dq$ for some $q$ in $mathbbF_p[x]$. Consider the field $mathbbF_p[x]/(f(x))$ which has $p^d$ elements. Take an element $x+I$ from the field (here $I = (f(x))$) so we have: $(x+I)^p^n = (x+I)^p^dq$. As long as you keep factoring out $(x+I)$ with the $p^d$ power you will get $(x+I)$ so $x^p^n - x in (f(x))$.



I am having trouble getting to the other direction.







share|cite|improve this question















Prove that $f(x)$ divides $x^p^n - x$ if and only if $d := deg f(x)$ divides $n$.




I believe that I have the backward direction covered: Let $d mid n$ say $n = dq$ for some $q$ in $mathbbF_p[x]$. Consider the field $mathbbF_p[x]/(f(x))$ which has $p^d$ elements. Take an element $x+I$ from the field (here $I = (f(x))$) so we have: $(x+I)^p^n = (x+I)^p^dq$. As long as you keep factoring out $(x+I)$ with the $p^d$ power you will get $(x+I)$ so $x^p^n - x in (f(x))$.



I am having trouble getting to the other direction.









share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Aug 26 at 17:46









Jendrik Stelzner

7,63121037




7,63121037










asked Oct 20 '12 at 22:15









Student

21339




21339







  • 1




    You are, of course, talking of polynomials over finite fields (in fact, over the prime field $,Bbb F_p,$) and not merely $,R[x],$ , since otherwise there are counterexamples...
    – DonAntonio
    Oct 20 '12 at 22:23











  • Sorry about that I fixed it. I'm typing from a phone.
    – Student
    Oct 20 '12 at 22:25










  • Oh, dear! Then stop at once or you'll fall down (if walking), or even worse: you may crash your car if driving (and it is illegal)
    – DonAntonio
    Oct 20 '12 at 22:28






  • 2




    Is $f(x)$ supposed to be irreducible over $mathbbF_p$? Otherwise, $mathbbF_p[x]/(f(x))$ won't be a field.
    – Myath
    Feb 25 '16 at 1:31













  • 1




    You are, of course, talking of polynomials over finite fields (in fact, over the prime field $,Bbb F_p,$) and not merely $,R[x],$ , since otherwise there are counterexamples...
    – DonAntonio
    Oct 20 '12 at 22:23











  • Sorry about that I fixed it. I'm typing from a phone.
    – Student
    Oct 20 '12 at 22:25










  • Oh, dear! Then stop at once or you'll fall down (if walking), or even worse: you may crash your car if driving (and it is illegal)
    – DonAntonio
    Oct 20 '12 at 22:28






  • 2




    Is $f(x)$ supposed to be irreducible over $mathbbF_p$? Otherwise, $mathbbF_p[x]/(f(x))$ won't be a field.
    – Myath
    Feb 25 '16 at 1:31








1




1




You are, of course, talking of polynomials over finite fields (in fact, over the prime field $,Bbb F_p,$) and not merely $,R[x],$ , since otherwise there are counterexamples...
– DonAntonio
Oct 20 '12 at 22:23





You are, of course, talking of polynomials over finite fields (in fact, over the prime field $,Bbb F_p,$) and not merely $,R[x],$ , since otherwise there are counterexamples...
– DonAntonio
Oct 20 '12 at 22:23













Sorry about that I fixed it. I'm typing from a phone.
– Student
Oct 20 '12 at 22:25




Sorry about that I fixed it. I'm typing from a phone.
– Student
Oct 20 '12 at 22:25












Oh, dear! Then stop at once or you'll fall down (if walking), or even worse: you may crash your car if driving (and it is illegal)
– DonAntonio
Oct 20 '12 at 22:28




Oh, dear! Then stop at once or you'll fall down (if walking), or even worse: you may crash your car if driving (and it is illegal)
– DonAntonio
Oct 20 '12 at 22:28




2




2




Is $f(x)$ supposed to be irreducible over $mathbbF_p$? Otherwise, $mathbbF_p[x]/(f(x))$ won't be a field.
– Myath
Feb 25 '16 at 1:31





Is $f(x)$ supposed to be irreducible over $mathbbF_p$? Otherwise, $mathbbF_p[x]/(f(x))$ won't be a field.
– Myath
Feb 25 '16 at 1:31











2 Answers
2






active

oldest

votes

















up vote
2
down vote



accepted










Hints:



(i) Show that the splitting field of the polynomial $,p(x):=x^p^n-xinBbb F_p[x],$ over the prime field $,Bbb F_p,$ is the field $,Bbb F_p^n,$



(ii) One way to go: show that the set of roots of the above polynomial $,p(x),$ in some algebraic closure of $,Bbb F_p,$ is a field...



(iii) Prove that $,Bbb F_p^d,$ is a subfield of $,Bbb F_p^n,$ iff $,dmid n,$



Of course, take into account that $,f(x)mid p(x)Longrightarrow,$ all the roots of $,f(x),$ are also roots of $,p(x),$






share|cite|improve this answer




















  • I believe you are saying that $mathbbF_p[x]/(g)$ is isomorphic to $F_p(alpha)$ for $g$ an irreducible polynomial. $alpha$ can only be algebraic in this new extension field. I'm not so sure how to show (iii).
    – Student
    Oct 21 '12 at 7:26











  • The one part that I'm still wondering is that your $p(x)$ is reducible in $mathbbF_p[x]$ don't you mean that the splitting field of the irreducible factor (w/ the same degree n) of $mathbbF_p[x]$ over the prime field $F_p$ is the field $mathbbF_p^n$?
    – Student
    Oct 21 '12 at 7:37











  • "My: $,p(x), $ definitely isn't irreducible over any field: how could it if zero is one of its roots?! Yet its splitting field is what I wrote there. Splitting fields can, and do, exist for any kind of polynomials, not only irreducible.
    – DonAntonio
    Oct 22 '12 at 2:53










  • About proving (iii): show that $$(x^p^d-x)mid(x^p^n-x)Longleftrightarrow dmid n$$
    – DonAntonio
    Oct 22 '12 at 2:55


















up vote
0
down vote













This question is very old, but there is a more direct solution worth noting.



Proof.



Suppose $f(x)$ divides $h(x):=x^p^n -x$. Then since $h(x)$ splits over $mathbbF_p^n$, so does $f(x)$. Let $alpha in mathbbF_p^n$ be a root of $f(x)$. Then $mathbbF_p(alpha)subset mathbbF_p^n$, and $[mathbbF_p(alpha): mathbbF_p] = d$. Finally, we have that $n = [mathbbF_p^n: mathbbF_p]= [mathbbF_p^n: mathbbF_p(alpha)][mathbbF_p(alpha): mathbbF_p]$, completing the proof that $d | n$.






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: 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%2f217668%2fproving-that-fx-divides-xpn-x-iff-deg-fx-divides-n%23new-answer', 'question_page');

    );

    Post as a guest






























    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    2
    down vote



    accepted










    Hints:



    (i) Show that the splitting field of the polynomial $,p(x):=x^p^n-xinBbb F_p[x],$ over the prime field $,Bbb F_p,$ is the field $,Bbb F_p^n,$



    (ii) One way to go: show that the set of roots of the above polynomial $,p(x),$ in some algebraic closure of $,Bbb F_p,$ is a field...



    (iii) Prove that $,Bbb F_p^d,$ is a subfield of $,Bbb F_p^n,$ iff $,dmid n,$



    Of course, take into account that $,f(x)mid p(x)Longrightarrow,$ all the roots of $,f(x),$ are also roots of $,p(x),$






    share|cite|improve this answer




















    • I believe you are saying that $mathbbF_p[x]/(g)$ is isomorphic to $F_p(alpha)$ for $g$ an irreducible polynomial. $alpha$ can only be algebraic in this new extension field. I'm not so sure how to show (iii).
      – Student
      Oct 21 '12 at 7:26











    • The one part that I'm still wondering is that your $p(x)$ is reducible in $mathbbF_p[x]$ don't you mean that the splitting field of the irreducible factor (w/ the same degree n) of $mathbbF_p[x]$ over the prime field $F_p$ is the field $mathbbF_p^n$?
      – Student
      Oct 21 '12 at 7:37











    • "My: $,p(x), $ definitely isn't irreducible over any field: how could it if zero is one of its roots?! Yet its splitting field is what I wrote there. Splitting fields can, and do, exist for any kind of polynomials, not only irreducible.
      – DonAntonio
      Oct 22 '12 at 2:53










    • About proving (iii): show that $$(x^p^d-x)mid(x^p^n-x)Longleftrightarrow dmid n$$
      – DonAntonio
      Oct 22 '12 at 2:55















    up vote
    2
    down vote



    accepted










    Hints:



    (i) Show that the splitting field of the polynomial $,p(x):=x^p^n-xinBbb F_p[x],$ over the prime field $,Bbb F_p,$ is the field $,Bbb F_p^n,$



    (ii) One way to go: show that the set of roots of the above polynomial $,p(x),$ in some algebraic closure of $,Bbb F_p,$ is a field...



    (iii) Prove that $,Bbb F_p^d,$ is a subfield of $,Bbb F_p^n,$ iff $,dmid n,$



    Of course, take into account that $,f(x)mid p(x)Longrightarrow,$ all the roots of $,f(x),$ are also roots of $,p(x),$






    share|cite|improve this answer




















    • I believe you are saying that $mathbbF_p[x]/(g)$ is isomorphic to $F_p(alpha)$ for $g$ an irreducible polynomial. $alpha$ can only be algebraic in this new extension field. I'm not so sure how to show (iii).
      – Student
      Oct 21 '12 at 7:26











    • The one part that I'm still wondering is that your $p(x)$ is reducible in $mathbbF_p[x]$ don't you mean that the splitting field of the irreducible factor (w/ the same degree n) of $mathbbF_p[x]$ over the prime field $F_p$ is the field $mathbbF_p^n$?
      – Student
      Oct 21 '12 at 7:37











    • "My: $,p(x), $ definitely isn't irreducible over any field: how could it if zero is one of its roots?! Yet its splitting field is what I wrote there. Splitting fields can, and do, exist for any kind of polynomials, not only irreducible.
      – DonAntonio
      Oct 22 '12 at 2:53










    • About proving (iii): show that $$(x^p^d-x)mid(x^p^n-x)Longleftrightarrow dmid n$$
      – DonAntonio
      Oct 22 '12 at 2:55













    up vote
    2
    down vote



    accepted







    up vote
    2
    down vote



    accepted






    Hints:



    (i) Show that the splitting field of the polynomial $,p(x):=x^p^n-xinBbb F_p[x],$ over the prime field $,Bbb F_p,$ is the field $,Bbb F_p^n,$



    (ii) One way to go: show that the set of roots of the above polynomial $,p(x),$ in some algebraic closure of $,Bbb F_p,$ is a field...



    (iii) Prove that $,Bbb F_p^d,$ is a subfield of $,Bbb F_p^n,$ iff $,dmid n,$



    Of course, take into account that $,f(x)mid p(x)Longrightarrow,$ all the roots of $,f(x),$ are also roots of $,p(x),$






    share|cite|improve this answer












    Hints:



    (i) Show that the splitting field of the polynomial $,p(x):=x^p^n-xinBbb F_p[x],$ over the prime field $,Bbb F_p,$ is the field $,Bbb F_p^n,$



    (ii) One way to go: show that the set of roots of the above polynomial $,p(x),$ in some algebraic closure of $,Bbb F_p,$ is a field...



    (iii) Prove that $,Bbb F_p^d,$ is a subfield of $,Bbb F_p^n,$ iff $,dmid n,$



    Of course, take into account that $,f(x)mid p(x)Longrightarrow,$ all the roots of $,f(x),$ are also roots of $,p(x),$







    share|cite|improve this answer












    share|cite|improve this answer



    share|cite|improve this answer










    answered Oct 20 '12 at 22:34









    DonAntonio

    173k1485219




    173k1485219











    • I believe you are saying that $mathbbF_p[x]/(g)$ is isomorphic to $F_p(alpha)$ for $g$ an irreducible polynomial. $alpha$ can only be algebraic in this new extension field. I'm not so sure how to show (iii).
      – Student
      Oct 21 '12 at 7:26











    • The one part that I'm still wondering is that your $p(x)$ is reducible in $mathbbF_p[x]$ don't you mean that the splitting field of the irreducible factor (w/ the same degree n) of $mathbbF_p[x]$ over the prime field $F_p$ is the field $mathbbF_p^n$?
      – Student
      Oct 21 '12 at 7:37











    • "My: $,p(x), $ definitely isn't irreducible over any field: how could it if zero is one of its roots?! Yet its splitting field is what I wrote there. Splitting fields can, and do, exist for any kind of polynomials, not only irreducible.
      – DonAntonio
      Oct 22 '12 at 2:53










    • About proving (iii): show that $$(x^p^d-x)mid(x^p^n-x)Longleftrightarrow dmid n$$
      – DonAntonio
      Oct 22 '12 at 2:55

















    • I believe you are saying that $mathbbF_p[x]/(g)$ is isomorphic to $F_p(alpha)$ for $g$ an irreducible polynomial. $alpha$ can only be algebraic in this new extension field. I'm not so sure how to show (iii).
      – Student
      Oct 21 '12 at 7:26











    • The one part that I'm still wondering is that your $p(x)$ is reducible in $mathbbF_p[x]$ don't you mean that the splitting field of the irreducible factor (w/ the same degree n) of $mathbbF_p[x]$ over the prime field $F_p$ is the field $mathbbF_p^n$?
      – Student
      Oct 21 '12 at 7:37











    • "My: $,p(x), $ definitely isn't irreducible over any field: how could it if zero is one of its roots?! Yet its splitting field is what I wrote there. Splitting fields can, and do, exist for any kind of polynomials, not only irreducible.
      – DonAntonio
      Oct 22 '12 at 2:53










    • About proving (iii): show that $$(x^p^d-x)mid(x^p^n-x)Longleftrightarrow dmid n$$
      – DonAntonio
      Oct 22 '12 at 2:55
















    I believe you are saying that $mathbbF_p[x]/(g)$ is isomorphic to $F_p(alpha)$ for $g$ an irreducible polynomial. $alpha$ can only be algebraic in this new extension field. I'm not so sure how to show (iii).
    – Student
    Oct 21 '12 at 7:26





    I believe you are saying that $mathbbF_p[x]/(g)$ is isomorphic to $F_p(alpha)$ for $g$ an irreducible polynomial. $alpha$ can only be algebraic in this new extension field. I'm not so sure how to show (iii).
    – Student
    Oct 21 '12 at 7:26













    The one part that I'm still wondering is that your $p(x)$ is reducible in $mathbbF_p[x]$ don't you mean that the splitting field of the irreducible factor (w/ the same degree n) of $mathbbF_p[x]$ over the prime field $F_p$ is the field $mathbbF_p^n$?
    – Student
    Oct 21 '12 at 7:37





    The one part that I'm still wondering is that your $p(x)$ is reducible in $mathbbF_p[x]$ don't you mean that the splitting field of the irreducible factor (w/ the same degree n) of $mathbbF_p[x]$ over the prime field $F_p$ is the field $mathbbF_p^n$?
    – Student
    Oct 21 '12 at 7:37













    "My: $,p(x), $ definitely isn't irreducible over any field: how could it if zero is one of its roots?! Yet its splitting field is what I wrote there. Splitting fields can, and do, exist for any kind of polynomials, not only irreducible.
    – DonAntonio
    Oct 22 '12 at 2:53




    "My: $,p(x), $ definitely isn't irreducible over any field: how could it if zero is one of its roots?! Yet its splitting field is what I wrote there. Splitting fields can, and do, exist for any kind of polynomials, not only irreducible.
    – DonAntonio
    Oct 22 '12 at 2:53












    About proving (iii): show that $$(x^p^d-x)mid(x^p^n-x)Longleftrightarrow dmid n$$
    – DonAntonio
    Oct 22 '12 at 2:55





    About proving (iii): show that $$(x^p^d-x)mid(x^p^n-x)Longleftrightarrow dmid n$$
    – DonAntonio
    Oct 22 '12 at 2:55











    up vote
    0
    down vote













    This question is very old, but there is a more direct solution worth noting.



    Proof.



    Suppose $f(x)$ divides $h(x):=x^p^n -x$. Then since $h(x)$ splits over $mathbbF_p^n$, so does $f(x)$. Let $alpha in mathbbF_p^n$ be a root of $f(x)$. Then $mathbbF_p(alpha)subset mathbbF_p^n$, and $[mathbbF_p(alpha): mathbbF_p] = d$. Finally, we have that $n = [mathbbF_p^n: mathbbF_p]= [mathbbF_p^n: mathbbF_p(alpha)][mathbbF_p(alpha): mathbbF_p]$, completing the proof that $d | n$.






    share|cite|improve this answer
























      up vote
      0
      down vote













      This question is very old, but there is a more direct solution worth noting.



      Proof.



      Suppose $f(x)$ divides $h(x):=x^p^n -x$. Then since $h(x)$ splits over $mathbbF_p^n$, so does $f(x)$. Let $alpha in mathbbF_p^n$ be a root of $f(x)$. Then $mathbbF_p(alpha)subset mathbbF_p^n$, and $[mathbbF_p(alpha): mathbbF_p] = d$. Finally, we have that $n = [mathbbF_p^n: mathbbF_p]= [mathbbF_p^n: mathbbF_p(alpha)][mathbbF_p(alpha): mathbbF_p]$, completing the proof that $d | n$.






      share|cite|improve this answer






















        up vote
        0
        down vote










        up vote
        0
        down vote









        This question is very old, but there is a more direct solution worth noting.



        Proof.



        Suppose $f(x)$ divides $h(x):=x^p^n -x$. Then since $h(x)$ splits over $mathbbF_p^n$, so does $f(x)$. Let $alpha in mathbbF_p^n$ be a root of $f(x)$. Then $mathbbF_p(alpha)subset mathbbF_p^n$, and $[mathbbF_p(alpha): mathbbF_p] = d$. Finally, we have that $n = [mathbbF_p^n: mathbbF_p]= [mathbbF_p^n: mathbbF_p(alpha)][mathbbF_p(alpha): mathbbF_p]$, completing the proof that $d | n$.






        share|cite|improve this answer












        This question is very old, but there is a more direct solution worth noting.



        Proof.



        Suppose $f(x)$ divides $h(x):=x^p^n -x$. Then since $h(x)$ splits over $mathbbF_p^n$, so does $f(x)$. Let $alpha in mathbbF_p^n$ be a root of $f(x)$. Then $mathbbF_p(alpha)subset mathbbF_p^n$, and $[mathbbF_p(alpha): mathbbF_p] = d$. Finally, we have that $n = [mathbbF_p^n: mathbbF_p]= [mathbbF_p^n: mathbbF_p(alpha)][mathbbF_p(alpha): mathbbF_p]$, completing the proof that $d | n$.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Aug 26 at 17:05









        CuriousKid7

        1,573617




        1,573617



























             

            draft saved


            draft discarded















































             


            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f217668%2fproving-that-fx-divides-xpn-x-iff-deg-fx-divides-n%23new-answer', 'question_page');

            );

            Post as a guest













































































            這個網誌中的熱門文章

            tkz-euclide: tkzDrawCircle[R] not working

            How to combine Bézier curves to a surface?

            1st Magritte Awards