A polynomial that is reducible under every finite field?












1












$begingroup$


Q: Prove that for any finite field $mathbb{F_q}$, the ring $mathbb{F_q}[x]/(x^9+x^5+x^3+x+1)$ cannot be a field.



Upon first glance I am really not sure where to start. Intuitively, it seems that I should be finding a way to show that $x^9+x^5+x^3+x+1$ is reducible over every finite field.



I have that:
$x^9+x^5+x^3+x+1 = (x^2-x+1)(x^7+x^6-x^4+x^2+2x+1)$ but I don't see where to go from here.



Am I even on the right track? Is there some well-known theorem I've blanked on that would help me out? Thanks in advance!










share|cite|improve this question









$endgroup$








  • 4




    $begingroup$
    You just factored it over $mathbb{Z}$. You are done. If it's reducible over $mathbb{Z}$ then it's reducible over $mathbb{F}_p$ for every prime $p$.
    $endgroup$
    – Ethan Alwaise
    Dec 9 '16 at 7:50






  • 4




    $begingroup$
    @EthanAlwaise: well, one must be a little careful: $3X^{2}+X$ is reducible as $X(3X+1)$ over $mathbb{Z}$, but is irreducible over $mathbb{F}_{3}$. But since both of the factors in the product above are monic, there are no issues of this kind.
    $endgroup$
    – Alex Wertheim
    Dec 9 '16 at 7:57






  • 1




    $begingroup$
    Ah right, good point.
    $endgroup$
    – Ethan Alwaise
    Dec 9 '16 at 19:23
















1












$begingroup$


Q: Prove that for any finite field $mathbb{F_q}$, the ring $mathbb{F_q}[x]/(x^9+x^5+x^3+x+1)$ cannot be a field.



Upon first glance I am really not sure where to start. Intuitively, it seems that I should be finding a way to show that $x^9+x^5+x^3+x+1$ is reducible over every finite field.



I have that:
$x^9+x^5+x^3+x+1 = (x^2-x+1)(x^7+x^6-x^4+x^2+2x+1)$ but I don't see where to go from here.



Am I even on the right track? Is there some well-known theorem I've blanked on that would help me out? Thanks in advance!










share|cite|improve this question









$endgroup$








  • 4




    $begingroup$
    You just factored it over $mathbb{Z}$. You are done. If it's reducible over $mathbb{Z}$ then it's reducible over $mathbb{F}_p$ for every prime $p$.
    $endgroup$
    – Ethan Alwaise
    Dec 9 '16 at 7:50






  • 4




    $begingroup$
    @EthanAlwaise: well, one must be a little careful: $3X^{2}+X$ is reducible as $X(3X+1)$ over $mathbb{Z}$, but is irreducible over $mathbb{F}_{3}$. But since both of the factors in the product above are monic, there are no issues of this kind.
    $endgroup$
    – Alex Wertheim
    Dec 9 '16 at 7:57






  • 1




    $begingroup$
    Ah right, good point.
    $endgroup$
    – Ethan Alwaise
    Dec 9 '16 at 19:23














1












1








1





$begingroup$


Q: Prove that for any finite field $mathbb{F_q}$, the ring $mathbb{F_q}[x]/(x^9+x^5+x^3+x+1)$ cannot be a field.



Upon first glance I am really not sure where to start. Intuitively, it seems that I should be finding a way to show that $x^9+x^5+x^3+x+1$ is reducible over every finite field.



I have that:
$x^9+x^5+x^3+x+1 = (x^2-x+1)(x^7+x^6-x^4+x^2+2x+1)$ but I don't see where to go from here.



Am I even on the right track? Is there some well-known theorem I've blanked on that would help me out? Thanks in advance!










share|cite|improve this question









$endgroup$




Q: Prove that for any finite field $mathbb{F_q}$, the ring $mathbb{F_q}[x]/(x^9+x^5+x^3+x+1)$ cannot be a field.



Upon first glance I am really not sure where to start. Intuitively, it seems that I should be finding a way to show that $x^9+x^5+x^3+x+1$ is reducible over every finite field.



I have that:
$x^9+x^5+x^3+x+1 = (x^2-x+1)(x^7+x^6-x^4+x^2+2x+1)$ but I don't see where to go from here.



Am I even on the right track? Is there some well-known theorem I've blanked on that would help me out? Thanks in advance!







abstract-algebra ring-theory field-theory finite-fields extension-field






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 9 '16 at 7:45









Jane DoeJane Doe

340113




340113








  • 4




    $begingroup$
    You just factored it over $mathbb{Z}$. You are done. If it's reducible over $mathbb{Z}$ then it's reducible over $mathbb{F}_p$ for every prime $p$.
    $endgroup$
    – Ethan Alwaise
    Dec 9 '16 at 7:50






  • 4




    $begingroup$
    @EthanAlwaise: well, one must be a little careful: $3X^{2}+X$ is reducible as $X(3X+1)$ over $mathbb{Z}$, but is irreducible over $mathbb{F}_{3}$. But since both of the factors in the product above are monic, there are no issues of this kind.
    $endgroup$
    – Alex Wertheim
    Dec 9 '16 at 7:57






  • 1




    $begingroup$
    Ah right, good point.
    $endgroup$
    – Ethan Alwaise
    Dec 9 '16 at 19:23














  • 4




    $begingroup$
    You just factored it over $mathbb{Z}$. You are done. If it's reducible over $mathbb{Z}$ then it's reducible over $mathbb{F}_p$ for every prime $p$.
    $endgroup$
    – Ethan Alwaise
    Dec 9 '16 at 7:50






  • 4




    $begingroup$
    @EthanAlwaise: well, one must be a little careful: $3X^{2}+X$ is reducible as $X(3X+1)$ over $mathbb{Z}$, but is irreducible over $mathbb{F}_{3}$. But since both of the factors in the product above are monic, there are no issues of this kind.
    $endgroup$
    – Alex Wertheim
    Dec 9 '16 at 7:57






  • 1




    $begingroup$
    Ah right, good point.
    $endgroup$
    – Ethan Alwaise
    Dec 9 '16 at 19:23








4




4




$begingroup$
You just factored it over $mathbb{Z}$. You are done. If it's reducible over $mathbb{Z}$ then it's reducible over $mathbb{F}_p$ for every prime $p$.
$endgroup$
– Ethan Alwaise
Dec 9 '16 at 7:50




$begingroup$
You just factored it over $mathbb{Z}$. You are done. If it's reducible over $mathbb{Z}$ then it's reducible over $mathbb{F}_p$ for every prime $p$.
$endgroup$
– Ethan Alwaise
Dec 9 '16 at 7:50




4




4




$begingroup$
@EthanAlwaise: well, one must be a little careful: $3X^{2}+X$ is reducible as $X(3X+1)$ over $mathbb{Z}$, but is irreducible over $mathbb{F}_{3}$. But since both of the factors in the product above are monic, there are no issues of this kind.
$endgroup$
– Alex Wertheim
Dec 9 '16 at 7:57




$begingroup$
@EthanAlwaise: well, one must be a little careful: $3X^{2}+X$ is reducible as $X(3X+1)$ over $mathbb{Z}$, but is irreducible over $mathbb{F}_{3}$. But since both of the factors in the product above are monic, there are no issues of this kind.
$endgroup$
– Alex Wertheim
Dec 9 '16 at 7:57




1




1




$begingroup$
Ah right, good point.
$endgroup$
– Ethan Alwaise
Dec 9 '16 at 19:23




$begingroup$
Ah right, good point.
$endgroup$
– Ethan Alwaise
Dec 9 '16 at 19:23










1 Answer
1






active

oldest

votes


















2












$begingroup$

From the comments above.





If $f(x) = x^9 + x^5 + x^3 + x + 1 in mathbb{Z}[x]$, then you have shown that $f = gh$, where $g(x) = x^2 - x + 1 in mathbb{Z}[x]$ and $h(x) = x^7 + x^6 - x^4 + x^2 + 2x + 1 in mathbb{Z}[x]$. Let $p$ be a prime and $bar{f}$, $bar{g}$ and $bar{h}$ denote the images of $f$, $g$ and $h$, respectively, under the canonical map $mathbb{Z} to mathbb{F}_p$. Then, $bar{f} = bar{g} bar{h}$ and $bar{g}$ and $bar{h}$ are nonconstant polynomials in $mathbb{F}_p[x]$. Hence, $bar{f}$ is irreducible over every finite field, as was needed to be shown.






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%2f2050823%2fa-polynomial-that-is-reducible-under-every-finite-field%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    2












    $begingroup$

    From the comments above.





    If $f(x) = x^9 + x^5 + x^3 + x + 1 in mathbb{Z}[x]$, then you have shown that $f = gh$, where $g(x) = x^2 - x + 1 in mathbb{Z}[x]$ and $h(x) = x^7 + x^6 - x^4 + x^2 + 2x + 1 in mathbb{Z}[x]$. Let $p$ be a prime and $bar{f}$, $bar{g}$ and $bar{h}$ denote the images of $f$, $g$ and $h$, respectively, under the canonical map $mathbb{Z} to mathbb{F}_p$. Then, $bar{f} = bar{g} bar{h}$ and $bar{g}$ and $bar{h}$ are nonconstant polynomials in $mathbb{F}_p[x]$. Hence, $bar{f}$ is irreducible over every finite field, as was needed to be shown.






    share|cite|improve this answer











    $endgroup$


















      2












      $begingroup$

      From the comments above.





      If $f(x) = x^9 + x^5 + x^3 + x + 1 in mathbb{Z}[x]$, then you have shown that $f = gh$, where $g(x) = x^2 - x + 1 in mathbb{Z}[x]$ and $h(x) = x^7 + x^6 - x^4 + x^2 + 2x + 1 in mathbb{Z}[x]$. Let $p$ be a prime and $bar{f}$, $bar{g}$ and $bar{h}$ denote the images of $f$, $g$ and $h$, respectively, under the canonical map $mathbb{Z} to mathbb{F}_p$. Then, $bar{f} = bar{g} bar{h}$ and $bar{g}$ and $bar{h}$ are nonconstant polynomials in $mathbb{F}_p[x]$. Hence, $bar{f}$ is irreducible over every finite field, as was needed to be shown.






      share|cite|improve this answer











      $endgroup$
















        2












        2








        2





        $begingroup$

        From the comments above.





        If $f(x) = x^9 + x^5 + x^3 + x + 1 in mathbb{Z}[x]$, then you have shown that $f = gh$, where $g(x) = x^2 - x + 1 in mathbb{Z}[x]$ and $h(x) = x^7 + x^6 - x^4 + x^2 + 2x + 1 in mathbb{Z}[x]$. Let $p$ be a prime and $bar{f}$, $bar{g}$ and $bar{h}$ denote the images of $f$, $g$ and $h$, respectively, under the canonical map $mathbb{Z} to mathbb{F}_p$. Then, $bar{f} = bar{g} bar{h}$ and $bar{g}$ and $bar{h}$ are nonconstant polynomials in $mathbb{F}_p[x]$. Hence, $bar{f}$ is irreducible over every finite field, as was needed to be shown.






        share|cite|improve this answer











        $endgroup$



        From the comments above.





        If $f(x) = x^9 + x^5 + x^3 + x + 1 in mathbb{Z}[x]$, then you have shown that $f = gh$, where $g(x) = x^2 - x + 1 in mathbb{Z}[x]$ and $h(x) = x^7 + x^6 - x^4 + x^2 + 2x + 1 in mathbb{Z}[x]$. Let $p$ be a prime and $bar{f}$, $bar{g}$ and $bar{h}$ denote the images of $f$, $g$ and $h$, respectively, under the canonical map $mathbb{Z} to mathbb{F}_p$. Then, $bar{f} = bar{g} bar{h}$ and $bar{g}$ and $bar{h}$ are nonconstant polynomials in $mathbb{F}_p[x]$. Hence, $bar{f}$ is irreducible over every finite field, as was needed to be shown.







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        answered Nov 30 '18 at 10:44


























        community wiki





        Brahadeesh































            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%2f2050823%2fa-polynomial-that-is-reducible-under-every-finite-field%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

            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