Factoring of polynomial over the rationals (quick question)Finding an irreducible polynomial over the...

How do we improve the relationship with a client software team that performs poorly and is becoming less collaborative?

What does "Puller Prush Person" mean?

Why are electrically insulating heatsinks so rare? Is it just cost?

Why, historically, did Gödel think CH was false?

In Japanese, what’s the difference between “Tonari ni” (となりに) and “Tsugi” (つぎ)? When would you use one over the other?

How is it possible to have an ability score that is less than 3?

Arthur Somervell: 1000 Exercises - Meaning of this notation

How much RAM could one put in a typical 80386 setup?

What typically incentivizes a professor to change jobs to a lower ranking university?

TGV timetables / schedules?

Can an x86 CPU running in real mode be considered to be basically an 8086 CPU?

How to format long polynomial?

Why doesn't H₄O²⁺ exist?

Accidentally leaked the solution to an assignment, what to do now? (I'm the prof)

Why can't I see bouncing of a switch on an oscilloscope?

Is it unprofessional to ask if a job posting on GlassDoor is real?

Python: next in for loop

Is it possible to do 50 km distance without any previous training?

Can a Warlock become Neutral Good?

Font hinting is lost in Chrome-like browsers (for some languages )

Is it legal for company to use my work email to pretend I still work there?

What does it mean to describe someone as a butt steak?

Maximum likelihood parameters deviate from posterior distributions

"to be prejudice towards/against someone" vs "to be prejudiced against/towards someone"



Factoring of polynomial over the rationals (quick question)


Finding an irreducible polynomial over the integers.What are the prime ideals of $mathbb{R}[x_1,x_2,x_3,…]$How to prove how many ireducible polynomials are in a polynomial ring over a finite field.$X^3+2$ is irreducible in $mathbb{F}_7[X]$Confused on notions of maximal ideal and some notationFind all the maximal ideals in the ring $mathbb{R}[x]$.Show that the polynomial $x^2+y^2-1$ is irreducible over $mathbb{Q}[x,y]$Extending a principal prime of $mathbb{Z}[X]$ to a maximal oneFactor a polynomial over a finite fieldMaximal ideals of $Bbb F_2[x]$













3












$begingroup$


Okay this might be a stupid question, but couldn't find any clear explanation on the internet, so here goes.



If I factor a polynomial into products of irreducible polynomials, are the products of these irreducible polynomials then again an irreducible polynomial?



For clarification, here is the problem im working on:



Let $J$ be the ideal of $mathbb{Q}[x]$ generated by two polynomials: $f(x)=(x+1)(x+2)(x^2 +1)$ $textit{and}$ $g(x)=(x+1)^2 (x+2)^2.$ Is the ideal $J$ prime? Is it maximal? Is it principal?



Clearly the common factors of $f$ and $g$ are $(x+1)(x+2)$, but would it be right to say that $p(x)=(x+1)(x+2)$ is an irreducible polynomial over $mathbb{Q}$?



If this is the right approach, I think I can handle the rest of the problem myself.



Thanks in advance :)










share|cite|improve this question









New contributor




aaalg is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$

















    3












    $begingroup$


    Okay this might be a stupid question, but couldn't find any clear explanation on the internet, so here goes.



    If I factor a polynomial into products of irreducible polynomials, are the products of these irreducible polynomials then again an irreducible polynomial?



    For clarification, here is the problem im working on:



    Let $J$ be the ideal of $mathbb{Q}[x]$ generated by two polynomials: $f(x)=(x+1)(x+2)(x^2 +1)$ $textit{and}$ $g(x)=(x+1)^2 (x+2)^2.$ Is the ideal $J$ prime? Is it maximal? Is it principal?



    Clearly the common factors of $f$ and $g$ are $(x+1)(x+2)$, but would it be right to say that $p(x)=(x+1)(x+2)$ is an irreducible polynomial over $mathbb{Q}$?



    If this is the right approach, I think I can handle the rest of the problem myself.



    Thanks in advance :)










    share|cite|improve this question









    New contributor




    aaalg is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
    Check out our Code of Conduct.







    $endgroup$















      3












      3








      3





      $begingroup$


      Okay this might be a stupid question, but couldn't find any clear explanation on the internet, so here goes.



      If I factor a polynomial into products of irreducible polynomials, are the products of these irreducible polynomials then again an irreducible polynomial?



      For clarification, here is the problem im working on:



      Let $J$ be the ideal of $mathbb{Q}[x]$ generated by two polynomials: $f(x)=(x+1)(x+2)(x^2 +1)$ $textit{and}$ $g(x)=(x+1)^2 (x+2)^2.$ Is the ideal $J$ prime? Is it maximal? Is it principal?



      Clearly the common factors of $f$ and $g$ are $(x+1)(x+2)$, but would it be right to say that $p(x)=(x+1)(x+2)$ is an irreducible polynomial over $mathbb{Q}$?



      If this is the right approach, I think I can handle the rest of the problem myself.



      Thanks in advance :)










      share|cite|improve this question









      New contributor




      aaalg is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.







      $endgroup$




      Okay this might be a stupid question, but couldn't find any clear explanation on the internet, so here goes.



      If I factor a polynomial into products of irreducible polynomials, are the products of these irreducible polynomials then again an irreducible polynomial?



      For clarification, here is the problem im working on:



      Let $J$ be the ideal of $mathbb{Q}[x]$ generated by two polynomials: $f(x)=(x+1)(x+2)(x^2 +1)$ $textit{and}$ $g(x)=(x+1)^2 (x+2)^2.$ Is the ideal $J$ prime? Is it maximal? Is it principal?



      Clearly the common factors of $f$ and $g$ are $(x+1)(x+2)$, but would it be right to say that $p(x)=(x+1)(x+2)$ is an irreducible polynomial over $mathbb{Q}$?



      If this is the right approach, I think I can handle the rest of the problem myself.



      Thanks in advance :)







      abstract-algebra polynomials irreducible-polynomials






      share|cite|improve this question









      New contributor




      aaalg is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.











      share|cite|improve this question









      New contributor




      aaalg is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      share|cite|improve this question




      share|cite|improve this question








      edited yesterday









      Martin Sleziak

      45k10122277




      45k10122277






      New contributor




      aaalg is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      asked yesterday









      aaalgaaalg

      182




      182




      New contributor




      aaalg is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.





      New contributor





      aaalg is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






      aaalg is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






















          2 Answers
          2






          active

          oldest

          votes


















          1












          $begingroup$


          If I factor a polynomial into products of irreducible polynomials, are the products of these irreducible polynomials then again an irreducible polynomial?




          No, quite the opposite in fact. In fact, that's basically what irreducible means: $f$ is irreducible if $f=gh$ implies one of $g,h$ are constant, i.e. there's no nontrivial factorization. So if you take irreducible $g,h$ (which requires them to be have degree at least one) and multiply them together, you get a polynomial $f$ whose factorization is $gh$ .



          Think of it like prime numbers - irreducible polynomials are like primes. Multiply two primes, you get a composite number, never, ever a prime number.




          Clearly the common factors of $f$ and $g$ are $(x+1)(x+2)$, but would it be right to say that $p(x)=(x+1)(x+2)$ is an irreducible polynomial over $mathbb{Q}$?




          It would not be irreducible by the previous discussion as a result.






          share|cite|improve this answer











          $endgroup$





















            2












            $begingroup$

            Simply $p(x)$ is not irreducible, because you have exhibited a factorisation. The factorisation you have given is a factorisation of $p(x)$ into irreducible factors.






            share|cite|improve this answer









            $endgroup$









            • 1




              $begingroup$
              Aha thank you! So i should think of it as $p(x)=x^2 +3x +2$ being reducible and then argue from there, right?
              $endgroup$
              – aaalg
              yesterday












            • $begingroup$
              @aaalg That's the way to go.
              $endgroup$
              – Mark Bennet
              yesterday












            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
            });


            }
            });






            aaalg is a new contributor. Be nice, and check out our Code of Conduct.










            draft saved

            draft discarded


















            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3175756%2ffactoring-of-polynomial-over-the-rationals-quick-question%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









            1












            $begingroup$


            If I factor a polynomial into products of irreducible polynomials, are the products of these irreducible polynomials then again an irreducible polynomial?




            No, quite the opposite in fact. In fact, that's basically what irreducible means: $f$ is irreducible if $f=gh$ implies one of $g,h$ are constant, i.e. there's no nontrivial factorization. So if you take irreducible $g,h$ (which requires them to be have degree at least one) and multiply them together, you get a polynomial $f$ whose factorization is $gh$ .



            Think of it like prime numbers - irreducible polynomials are like primes. Multiply two primes, you get a composite number, never, ever a prime number.




            Clearly the common factors of $f$ and $g$ are $(x+1)(x+2)$, but would it be right to say that $p(x)=(x+1)(x+2)$ is an irreducible polynomial over $mathbb{Q}$?




            It would not be irreducible by the previous discussion as a result.






            share|cite|improve this answer











            $endgroup$


















              1












              $begingroup$


              If I factor a polynomial into products of irreducible polynomials, are the products of these irreducible polynomials then again an irreducible polynomial?




              No, quite the opposite in fact. In fact, that's basically what irreducible means: $f$ is irreducible if $f=gh$ implies one of $g,h$ are constant, i.e. there's no nontrivial factorization. So if you take irreducible $g,h$ (which requires them to be have degree at least one) and multiply them together, you get a polynomial $f$ whose factorization is $gh$ .



              Think of it like prime numbers - irreducible polynomials are like primes. Multiply two primes, you get a composite number, never, ever a prime number.




              Clearly the common factors of $f$ and $g$ are $(x+1)(x+2)$, but would it be right to say that $p(x)=(x+1)(x+2)$ is an irreducible polynomial over $mathbb{Q}$?




              It would not be irreducible by the previous discussion as a result.






              share|cite|improve this answer











              $endgroup$
















                1












                1








                1





                $begingroup$


                If I factor a polynomial into products of irreducible polynomials, are the products of these irreducible polynomials then again an irreducible polynomial?




                No, quite the opposite in fact. In fact, that's basically what irreducible means: $f$ is irreducible if $f=gh$ implies one of $g,h$ are constant, i.e. there's no nontrivial factorization. So if you take irreducible $g,h$ (which requires them to be have degree at least one) and multiply them together, you get a polynomial $f$ whose factorization is $gh$ .



                Think of it like prime numbers - irreducible polynomials are like primes. Multiply two primes, you get a composite number, never, ever a prime number.




                Clearly the common factors of $f$ and $g$ are $(x+1)(x+2)$, but would it be right to say that $p(x)=(x+1)(x+2)$ is an irreducible polynomial over $mathbb{Q}$?




                It would not be irreducible by the previous discussion as a result.






                share|cite|improve this answer











                $endgroup$




                If I factor a polynomial into products of irreducible polynomials, are the products of these irreducible polynomials then again an irreducible polynomial?




                No, quite the opposite in fact. In fact, that's basically what irreducible means: $f$ is irreducible if $f=gh$ implies one of $g,h$ are constant, i.e. there's no nontrivial factorization. So if you take irreducible $g,h$ (which requires them to be have degree at least one) and multiply them together, you get a polynomial $f$ whose factorization is $gh$ .



                Think of it like prime numbers - irreducible polynomials are like primes. Multiply two primes, you get a composite number, never, ever a prime number.




                Clearly the common factors of $f$ and $g$ are $(x+1)(x+2)$, but would it be right to say that $p(x)=(x+1)(x+2)$ is an irreducible polynomial over $mathbb{Q}$?




                It would not be irreducible by the previous discussion as a result.







                share|cite|improve this answer














                share|cite|improve this answer



                share|cite|improve this answer








                edited yesterday









                Martin Sleziak

                45k10122277




                45k10122277










                answered yesterday









                Eevee TrainerEevee Trainer

                10k31740




                10k31740























                    2












                    $begingroup$

                    Simply $p(x)$ is not irreducible, because you have exhibited a factorisation. The factorisation you have given is a factorisation of $p(x)$ into irreducible factors.






                    share|cite|improve this answer









                    $endgroup$









                    • 1




                      $begingroup$
                      Aha thank you! So i should think of it as $p(x)=x^2 +3x +2$ being reducible and then argue from there, right?
                      $endgroup$
                      – aaalg
                      yesterday












                    • $begingroup$
                      @aaalg That's the way to go.
                      $endgroup$
                      – Mark Bennet
                      yesterday
















                    2












                    $begingroup$

                    Simply $p(x)$ is not irreducible, because you have exhibited a factorisation. The factorisation you have given is a factorisation of $p(x)$ into irreducible factors.






                    share|cite|improve this answer









                    $endgroup$









                    • 1




                      $begingroup$
                      Aha thank you! So i should think of it as $p(x)=x^2 +3x +2$ being reducible and then argue from there, right?
                      $endgroup$
                      – aaalg
                      yesterday












                    • $begingroup$
                      @aaalg That's the way to go.
                      $endgroup$
                      – Mark Bennet
                      yesterday














                    2












                    2








                    2





                    $begingroup$

                    Simply $p(x)$ is not irreducible, because you have exhibited a factorisation. The factorisation you have given is a factorisation of $p(x)$ into irreducible factors.






                    share|cite|improve this answer









                    $endgroup$



                    Simply $p(x)$ is not irreducible, because you have exhibited a factorisation. The factorisation you have given is a factorisation of $p(x)$ into irreducible factors.







                    share|cite|improve this answer












                    share|cite|improve this answer



                    share|cite|improve this answer










                    answered yesterday









                    Mark BennetMark Bennet

                    81.9k984183




                    81.9k984183








                    • 1




                      $begingroup$
                      Aha thank you! So i should think of it as $p(x)=x^2 +3x +2$ being reducible and then argue from there, right?
                      $endgroup$
                      – aaalg
                      yesterday












                    • $begingroup$
                      @aaalg That's the way to go.
                      $endgroup$
                      – Mark Bennet
                      yesterday














                    • 1




                      $begingroup$
                      Aha thank you! So i should think of it as $p(x)=x^2 +3x +2$ being reducible and then argue from there, right?
                      $endgroup$
                      – aaalg
                      yesterday












                    • $begingroup$
                      @aaalg That's the way to go.
                      $endgroup$
                      – Mark Bennet
                      yesterday








                    1




                    1




                    $begingroup$
                    Aha thank you! So i should think of it as $p(x)=x^2 +3x +2$ being reducible and then argue from there, right?
                    $endgroup$
                    – aaalg
                    yesterday






                    $begingroup$
                    Aha thank you! So i should think of it as $p(x)=x^2 +3x +2$ being reducible and then argue from there, right?
                    $endgroup$
                    – aaalg
                    yesterday














                    $begingroup$
                    @aaalg That's the way to go.
                    $endgroup$
                    – Mark Bennet
                    yesterday




                    $begingroup$
                    @aaalg That's the way to go.
                    $endgroup$
                    – Mark Bennet
                    yesterday










                    aaalg is a new contributor. Be nice, and check out our Code of Conduct.










                    draft saved

                    draft discarded


















                    aaalg is a new contributor. Be nice, and check out our Code of Conduct.













                    aaalg is a new contributor. Be nice, and check out our Code of Conduct.












                    aaalg is a new contributor. Be nice, and check out our Code of Conduct.
















                    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%2f3175756%2ffactoring-of-polynomial-over-the-rationals-quick-question%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

                    Cannot install PyQt5 The Next CEO of Stack OverflowCannot install tcpreplay 3.4.4cannot...

                    Kapp-Putsch Acontecimentos | Outros artigos | Menu de navegação

                    Why did early computer designers eschew integers? The Next CEO of Stack OverflowWhat register...