irreducible polynomial has all its roots in $F_s$ and every element in $F_s$ satisfies such a polynomial












1














I'm currently trying to prove a certain statement( I will not post the whole statement because there is only one part, which is not clear to me).



Let us say that we have a finite field $F$ with $q$ elements. I was able to prove that $x^{q^s} - x $ is the product of all monic irreducible polynomials of degree
dividing $s$. but now I have to follow that every such irreducible polynomial has all its roots in $F_s$ (finite field with $q^s$ elements) and conversely that every element in $F_s$ satisfies such a polynomial. But I don't see why. Is there an easy way to prove both directions?






number-theory finite-fields







share|cite|improve this question





























    1














    I'm currently trying to prove a certain statement( I will not post the whole statement because there is only one part, which is not clear to me).



    Let us say that we have a finite field $F$ with $q$ elements. I was able to prove that $x^{q^s} - x $ is the product of all monic irreducible polynomials of degree
    dividing $s$. but now I have to follow that every such irreducible polynomial has all its roots in $F_s$ (finite field with $q^s$ elements) and conversely that every element in $F_s$ satisfies such a polynomial. But I don't see why. Is there an easy way to prove both directions?






    number-theory finite-fields







    share|cite|improve this question



























      1












      1








      1







      I'm currently trying to prove a certain statement( I will not post the whole statement because there is only one part, which is not clear to me).



      Let us say that we have a finite field $F$ with $q$ elements. I was able to prove that $x^{q^s} - x $ is the product of all monic irreducible polynomials of degree
      dividing $s$. but now I have to follow that every such irreducible polynomial has all its roots in $F_s$ (finite field with $q^s$ elements) and conversely that every element in $F_s$ satisfies such a polynomial. But I don't see why. Is there an easy way to prove both directions?






      number-theory finite-fields







      share|cite|improve this question















      I'm currently trying to prove a certain statement( I will not post the whole statement because there is only one part, which is not clear to me).



      Let us say that we have a finite field $F$ with $q$ elements. I was able to prove that $x^{q^s} - x $ is the product of all monic irreducible polynomials of degree
      dividing $s$. but now I have to follow that every such irreducible polynomial has all its roots in $F_s$ (finite field with $q^s$ elements) and conversely that every element in $F_s$ satisfies such a polynomial. But I don't see why. Is there an easy way to prove both directions?






      number-theory finite-fields




      number-theory finite-fields






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited 2 days ago









      Bernard

      118k639112




      118k639112










      asked 2 days ago









      RukiaKuchiki

      322211




      322211






















          1 Answer
          1






          active

          oldest

          votes


















          1














          For each $y in mathbb{F}_{q^s}$, note that $y^{q^s} = y$ [make sure you see why]. There are $q^s$ such $y$ (which is the degree of the polynomial $x^{q^s}-x$), so




          1. those are precisely the $q^s$ roots of $x^{q^s}-x$.


          2. let us write $x^{q^s}-x= prod_i p_i(x)$ where $p_i(x)$ are irreducible in $mathbb{F}_q[x]$. Suppose there exists a $y in mathbb{F}_{q^s}$ such that $p_i(y) not = 0$ for all such $i$. Then this would imply that $prod_i p_i(y) = y^{q^s}-y not = 0$, which contradicts
            what we observed already above: $y^{q^s} = y$ for each $y in mathbb{F}_{q^s}$.



          So 2 gives at least one of what you are trying to show, every $y in mathbb{F}_{q^s}$ satisfies $p(y)=0$ for some monic irreducible polynomial $p(x)$ dividing $x^{q^s}-x$; eqquivalently [as you had shown already] $p in mathbb{F}_q[x]$ irreducible and deg$(p)|s$.



          On the other hand: You had already shown that every monic irreducible polynomial $p in mathbb{F}_q[x]$ satisfying deg$(p) | s$, divides the polynomial $x^{q^s}-x$. As $x^{p^s}-x$ factors completely in $mathbb{F}_{q^s}$ (i.e., 1. above) it follows that $p$ must also factor completely in $mathbb{F}_{q^s}$.






          share|cite|improve this answer



















          • 1




            Thank you for your answer, Mike. :) I proved now that for each $ y in F_{q^s} $ it holds that $y^{q^s} = y$. Now I will deal with the rest of your answer.
            – RukiaKuchiki
            23 hours ago













          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%2f3060915%2firreducible-polynomial-has-all-its-roots-in-f-s-and-every-element-in-f-s-sat%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









          1














          For each $y in mathbb{F}_{q^s}$, note that $y^{q^s} = y$ [make sure you see why]. There are $q^s$ such $y$ (which is the degree of the polynomial $x^{q^s}-x$), so




          1. those are precisely the $q^s$ roots of $x^{q^s}-x$.


          2. let us write $x^{q^s}-x= prod_i p_i(x)$ where $p_i(x)$ are irreducible in $mathbb{F}_q[x]$. Suppose there exists a $y in mathbb{F}_{q^s}$ such that $p_i(y) not = 0$ for all such $i$. Then this would imply that $prod_i p_i(y) = y^{q^s}-y not = 0$, which contradicts
            what we observed already above: $y^{q^s} = y$ for each $y in mathbb{F}_{q^s}$.



          So 2 gives at least one of what you are trying to show, every $y in mathbb{F}_{q^s}$ satisfies $p(y)=0$ for some monic irreducible polynomial $p(x)$ dividing $x^{q^s}-x$; eqquivalently [as you had shown already] $p in mathbb{F}_q[x]$ irreducible and deg$(p)|s$.



          On the other hand: You had already shown that every monic irreducible polynomial $p in mathbb{F}_q[x]$ satisfying deg$(p) | s$, divides the polynomial $x^{q^s}-x$. As $x^{p^s}-x$ factors completely in $mathbb{F}_{q^s}$ (i.e., 1. above) it follows that $p$ must also factor completely in $mathbb{F}_{q^s}$.






          share|cite|improve this answer



















          • 1




            Thank you for your answer, Mike. :) I proved now that for each $ y in F_{q^s} $ it holds that $y^{q^s} = y$. Now I will deal with the rest of your answer.
            – RukiaKuchiki
            23 hours ago


















          1














          For each $y in mathbb{F}_{q^s}$, note that $y^{q^s} = y$ [make sure you see why]. There are $q^s$ such $y$ (which is the degree of the polynomial $x^{q^s}-x$), so




          1. those are precisely the $q^s$ roots of $x^{q^s}-x$.


          2. let us write $x^{q^s}-x= prod_i p_i(x)$ where $p_i(x)$ are irreducible in $mathbb{F}_q[x]$. Suppose there exists a $y in mathbb{F}_{q^s}$ such that $p_i(y) not = 0$ for all such $i$. Then this would imply that $prod_i p_i(y) = y^{q^s}-y not = 0$, which contradicts
            what we observed already above: $y^{q^s} = y$ for each $y in mathbb{F}_{q^s}$.



          So 2 gives at least one of what you are trying to show, every $y in mathbb{F}_{q^s}$ satisfies $p(y)=0$ for some monic irreducible polynomial $p(x)$ dividing $x^{q^s}-x$; eqquivalently [as you had shown already] $p in mathbb{F}_q[x]$ irreducible and deg$(p)|s$.



          On the other hand: You had already shown that every monic irreducible polynomial $p in mathbb{F}_q[x]$ satisfying deg$(p) | s$, divides the polynomial $x^{q^s}-x$. As $x^{p^s}-x$ factors completely in $mathbb{F}_{q^s}$ (i.e., 1. above) it follows that $p$ must also factor completely in $mathbb{F}_{q^s}$.






          share|cite|improve this answer



















          • 1




            Thank you for your answer, Mike. :) I proved now that for each $ y in F_{q^s} $ it holds that $y^{q^s} = y$. Now I will deal with the rest of your answer.
            – RukiaKuchiki
            23 hours ago
















          1












          1








          1






          For each $y in mathbb{F}_{q^s}$, note that $y^{q^s} = y$ [make sure you see why]. There are $q^s$ such $y$ (which is the degree of the polynomial $x^{q^s}-x$), so




          1. those are precisely the $q^s$ roots of $x^{q^s}-x$.


          2. let us write $x^{q^s}-x= prod_i p_i(x)$ where $p_i(x)$ are irreducible in $mathbb{F}_q[x]$. Suppose there exists a $y in mathbb{F}_{q^s}$ such that $p_i(y) not = 0$ for all such $i$. Then this would imply that $prod_i p_i(y) = y^{q^s}-y not = 0$, which contradicts
            what we observed already above: $y^{q^s} = y$ for each $y in mathbb{F}_{q^s}$.



          So 2 gives at least one of what you are trying to show, every $y in mathbb{F}_{q^s}$ satisfies $p(y)=0$ for some monic irreducible polynomial $p(x)$ dividing $x^{q^s}-x$; eqquivalently [as you had shown already] $p in mathbb{F}_q[x]$ irreducible and deg$(p)|s$.



          On the other hand: You had already shown that every monic irreducible polynomial $p in mathbb{F}_q[x]$ satisfying deg$(p) | s$, divides the polynomial $x^{q^s}-x$. As $x^{p^s}-x$ factors completely in $mathbb{F}_{q^s}$ (i.e., 1. above) it follows that $p$ must also factor completely in $mathbb{F}_{q^s}$.






          share|cite|improve this answer














          For each $y in mathbb{F}_{q^s}$, note that $y^{q^s} = y$ [make sure you see why]. There are $q^s$ such $y$ (which is the degree of the polynomial $x^{q^s}-x$), so




          1. those are precisely the $q^s$ roots of $x^{q^s}-x$.


          2. let us write $x^{q^s}-x= prod_i p_i(x)$ where $p_i(x)$ are irreducible in $mathbb{F}_q[x]$. Suppose there exists a $y in mathbb{F}_{q^s}$ such that $p_i(y) not = 0$ for all such $i$. Then this would imply that $prod_i p_i(y) = y^{q^s}-y not = 0$, which contradicts
            what we observed already above: $y^{q^s} = y$ for each $y in mathbb{F}_{q^s}$.



          So 2 gives at least one of what you are trying to show, every $y in mathbb{F}_{q^s}$ satisfies $p(y)=0$ for some monic irreducible polynomial $p(x)$ dividing $x^{q^s}-x$; eqquivalently [as you had shown already] $p in mathbb{F}_q[x]$ irreducible and deg$(p)|s$.



          On the other hand: You had already shown that every monic irreducible polynomial $p in mathbb{F}_q[x]$ satisfying deg$(p) | s$, divides the polynomial $x^{q^s}-x$. As $x^{p^s}-x$ factors completely in $mathbb{F}_{q^s}$ (i.e., 1. above) it follows that $p$ must also factor completely in $mathbb{F}_{q^s}$.







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited 2 days ago

























          answered 2 days ago









          Mike

          3,099211




          3,099211








          • 1




            Thank you for your answer, Mike. :) I proved now that for each $ y in F_{q^s} $ it holds that $y^{q^s} = y$. Now I will deal with the rest of your answer.
            – RukiaKuchiki
            23 hours ago
















          • 1




            Thank you for your answer, Mike. :) I proved now that for each $ y in F_{q^s} $ it holds that $y^{q^s} = y$. Now I will deal with the rest of your answer.
            – RukiaKuchiki
            23 hours ago










          1




          1




          Thank you for your answer, Mike. :) I proved now that for each $ y in F_{q^s} $ it holds that $y^{q^s} = y$. Now I will deal with the rest of your answer.
          – RukiaKuchiki
          23 hours ago






          Thank you for your answer, Mike. :) I proved now that for each $ y in F_{q^s} $ it holds that $y^{q^s} = y$. Now I will deal with the rest of your answer.
          – RukiaKuchiki
          23 hours ago




















          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.





          Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


          Please pay close attention to the following guidance:


          • 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.


          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%2f3060915%2firreducible-polynomial-has-all-its-roots-in-f-s-and-every-element-in-f-s-sat%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

          An IMO inspired problem

          Image
          14 4 This problem from IMO 1988 is said to be one of the most elegant ones in functional equations. Problem : The function $f$ is defined on the set of all positive integers as follows: begin{align} f(1) = 1, f(3) &= 3, f(2n) = f(n), \ f(4n+1) &= 2f(2n+1) - f(n), \ f(4n+3) &= 3 f(2n+1) - 2f(n) end{align} Find the number of $n$ with $f(n) = n, 1 leq n leq 1988$. The main idea towards the solution is realizing that these conditions stand for the fact that $f(n)$ just reverses the digits in the binary representation of the number $n$. So, essentially the solution is finding the number of binary pallindromes $leq 1988_{10}$. My question is the following : How to reformulate the problem so that $f(n)$ reverses the digits of $n$ in its ternary representation. Or even better, can we reformulate it for a
          Read more

          Management

          Image
          Management From Wikipedia, the free encyclopedia Jump to navigation Jump to search "Manager" redirects here. For other uses, see Management (disambiguation) and Manager (disambiguation). An organization chart for the United States Coast Guard shows the hierarchy of managerial roles in that organization. Business administration Management of a business Accounting Management accounting Financial accounting Financial audit Business entities Cooperative Corporation Limited liability company Partnership Sole proprietorship State-owned enterprise Corporate governance Annual general meeting Board of directors Supervisory board Advisory board Audit committee Corporate law Commercial law Constitutional documents Contract Corporate crime Corporate liability Insolvency law International trade law Mergers and acquisitions Economics Commodity Pu
          Read more

          Investment

          Image
          Investment From Wikipedia, the free encyclopedia Jump to navigation Jump to search This article is about investment in finance. For investment in macroeconomics, see Investment (macroeconomics). For other uses, see Investment (disambiguation). "Invest" redirects here. For the term in meteorology, see Invest (meteorology). This article needs additional citations for verification . Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. ( February 2017 ) (Learn how and when to remove this template message) In general, to invest is to distribute money in the expectation of some benefit in the future – for example, investment in durable goods, in real estate by the service industry, in factories for manufacturing, in product development, and in research and development. However, this article focuses specifically on investment in financial
          Read more