Prime ideals in certain quadratic ring












1












$begingroup$


Let's consider the quadratic ring $mathbb{Z}[sqrt{-5}]$ and the principal ideals $(29)$ and $(11)$. Tell whether or not these ideals are prime.



My approach: In order to solve this theorem I am using the following fact:



Fact: If $R$ - commutative ring with $1_R$. Ideal $I$ in $R$ is prime iff factor-ring $R/I$ is integral domain.



Using the fact that $mathbb{Z}[sqrt{-5}]cong mathbb{Z}[x]/(x^2+5)$ I have derived the following the following results:



$$mathbb{Z}[sqrt{-5}]/(29)cong mathbb{Z}_{29}[x]/(x^2+5) quad text{and} quad mathbb{Z}[sqrt{-5}]/(11)cong mathbb{Z}_{11}[x]/(x^2+5).$$



How to show are these quotient-rings are integral domain or not?



Is there any method except computational one?



Would be very grateful for help!



EDIT: For the second example I know that $x^2+5$ is irreducible over $mathbb{Z}_{11}$. Hence this quotient-ring is field. Hence it is an integral domain.



But what about the first one?










share|cite|improve this question











$endgroup$

















    1












    $begingroup$


    Let's consider the quadratic ring $mathbb{Z}[sqrt{-5}]$ and the principal ideals $(29)$ and $(11)$. Tell whether or not these ideals are prime.



    My approach: In order to solve this theorem I am using the following fact:



    Fact: If $R$ - commutative ring with $1_R$. Ideal $I$ in $R$ is prime iff factor-ring $R/I$ is integral domain.



    Using the fact that $mathbb{Z}[sqrt{-5}]cong mathbb{Z}[x]/(x^2+5)$ I have derived the following the following results:



    $$mathbb{Z}[sqrt{-5}]/(29)cong mathbb{Z}_{29}[x]/(x^2+5) quad text{and} quad mathbb{Z}[sqrt{-5}]/(11)cong mathbb{Z}_{11}[x]/(x^2+5).$$



    How to show are these quotient-rings are integral domain or not?



    Is there any method except computational one?



    Would be very grateful for help!



    EDIT: For the second example I know that $x^2+5$ is irreducible over $mathbb{Z}_{11}$. Hence this quotient-ring is field. Hence it is an integral domain.



    But what about the first one?










    share|cite|improve this question











    $endgroup$















      1












      1








      1





      $begingroup$


      Let's consider the quadratic ring $mathbb{Z}[sqrt{-5}]$ and the principal ideals $(29)$ and $(11)$. Tell whether or not these ideals are prime.



      My approach: In order to solve this theorem I am using the following fact:



      Fact: If $R$ - commutative ring with $1_R$. Ideal $I$ in $R$ is prime iff factor-ring $R/I$ is integral domain.



      Using the fact that $mathbb{Z}[sqrt{-5}]cong mathbb{Z}[x]/(x^2+5)$ I have derived the following the following results:



      $$mathbb{Z}[sqrt{-5}]/(29)cong mathbb{Z}_{29}[x]/(x^2+5) quad text{and} quad mathbb{Z}[sqrt{-5}]/(11)cong mathbb{Z}_{11}[x]/(x^2+5).$$



      How to show are these quotient-rings are integral domain or not?



      Is there any method except computational one?



      Would be very grateful for help!



      EDIT: For the second example I know that $x^2+5$ is irreducible over $mathbb{Z}_{11}$. Hence this quotient-ring is field. Hence it is an integral domain.



      But what about the first one?










      share|cite|improve this question











      $endgroup$




      Let's consider the quadratic ring $mathbb{Z}[sqrt{-5}]$ and the principal ideals $(29)$ and $(11)$. Tell whether or not these ideals are prime.



      My approach: In order to solve this theorem I am using the following fact:



      Fact: If $R$ - commutative ring with $1_R$. Ideal $I$ in $R$ is prime iff factor-ring $R/I$ is integral domain.



      Using the fact that $mathbb{Z}[sqrt{-5}]cong mathbb{Z}[x]/(x^2+5)$ I have derived the following the following results:



      $$mathbb{Z}[sqrt{-5}]/(29)cong mathbb{Z}_{29}[x]/(x^2+5) quad text{and} quad mathbb{Z}[sqrt{-5}]/(11)cong mathbb{Z}_{11}[x]/(x^2+5).$$



      How to show are these quotient-rings are integral domain or not?



      Is there any method except computational one?



      Would be very grateful for help!



      EDIT: For the second example I know that $x^2+5$ is irreducible over $mathbb{Z}_{11}$. Hence this quotient-ring is field. Hence it is an integral domain.



      But what about the first one?







      abstract-algebra ring-theory






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Dec 8 '18 at 20:11







      ZFR

















      asked Dec 8 '18 at 20:03









      ZFRZFR

      5,26831440




      5,26831440






















          3 Answers
          3






          active

          oldest

          votes


















          1












          $begingroup$

          It will suffice to show whether or note $x^2+5$ is irreducible over $Bbb Z_{29}$. As a quadratic this only factors if there is some $x$ such that $x^2 = -5 mod 29$. This can be done by brute force (trying $x = 0, 1, ldots, 29$) as a last resort.



          The techniques of number theory can fairly efficiently compute this question too (whether or not $-5$ is what is known as a quadratic residue mod $29$). However, this requires some familiarity with the Lagrange symbol and quadratic reciprocity.



          An alternate approach might be to try to directly find a primitive root mod $29$, ie some nonzero value of $z$ such that $z^i ne 1$ unless $i$ is a multiple of 28. Then the values of $z^i$ will consist of all values of $Bbb Z_{29}$. Then you can see if the congruence class of $-5$ is an even power of $z$ or an odd power ($x^2+5$ would be reducible only if $-5$ is an even power of $z$). I don't think this will save effort compared to just computing the squares mod $29$ directly, though.






          share|cite|improve this answer









          $endgroup$





















            1












            $begingroup$

            To go the next step beyond @RolfHeyer’s answer, I noticed that $6cdot29=174=13^2+5$. Thus $(13-sqrt{-5},)(13+sqrt{-5},)in(29)$, so $(29)$ isn’t a prime ideal.






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              No need to pull $,large -5equiv 13^2,$ out of a hat since $,,large -5cdot 2^2equiv 3^2pmod{29},,$ see my answer.
              $endgroup$
              – Bill Dubuque
              Dec 9 '18 at 3:41





















            1












            $begingroup$

            First it is easy to check that $-5$ is not a square $!bmod{11}$ by Euler's criterion, i.e.



            $!bmod 11!: left[a^{large 2} equiv -5right]^{large 5}!Rightarrow, a^{large 10}equiv -5(25)^{large 2} equiv -5(3)^{large 2} equiv -1,$ contra little Fermat.



            Therefore $ x^{large 2}equiv -5,$ is unsolvable so $,x^2+5,$ has no root so is irreducible $bmod {11}.,$ Otoh



            $!!begin{align}
            bmod 29!:, {-}5cdot 2^{large 2} &equiv 3^{large 2} \[.3em]
            Rightarrow color{#c00}{{-}5} &equiv left(dfrac{3}2right)^{large 2}!!equiv left(dfrac{-26}2right)^{large 2}!! equiv color{#c00}{13^{large 2}}\[.3em]
            Rightarrow x^{large 2}+color{#c00}{5}&equiv x^{large 2}color{#c00}{-13^2}equiv (x-13)(x+13)
            end{align}$



            Remark $ $ Here we don't actually need to calculate the value of $,3/2,$ since we only need to know that $-5$ is a square to infer that $,x^2+5,$ is reducible. But it was easy to do so here so we did it.






            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%2f3031568%2fprime-ideals-in-certain-quadratic-ring%23new-answer', 'question_page');
              }
              );

              Post as a guest















              Required, but never shown

























              3 Answers
              3






              active

              oldest

              votes








              3 Answers
              3






              active

              oldest

              votes









              active

              oldest

              votes






              active

              oldest

              votes









              1












              $begingroup$

              It will suffice to show whether or note $x^2+5$ is irreducible over $Bbb Z_{29}$. As a quadratic this only factors if there is some $x$ such that $x^2 = -5 mod 29$. This can be done by brute force (trying $x = 0, 1, ldots, 29$) as a last resort.



              The techniques of number theory can fairly efficiently compute this question too (whether or not $-5$ is what is known as a quadratic residue mod $29$). However, this requires some familiarity with the Lagrange symbol and quadratic reciprocity.



              An alternate approach might be to try to directly find a primitive root mod $29$, ie some nonzero value of $z$ such that $z^i ne 1$ unless $i$ is a multiple of 28. Then the values of $z^i$ will consist of all values of $Bbb Z_{29}$. Then you can see if the congruence class of $-5$ is an even power of $z$ or an odd power ($x^2+5$ would be reducible only if $-5$ is an even power of $z$). I don't think this will save effort compared to just computing the squares mod $29$ directly, though.






              share|cite|improve this answer









              $endgroup$


















                1












                $begingroup$

                It will suffice to show whether or note $x^2+5$ is irreducible over $Bbb Z_{29}$. As a quadratic this only factors if there is some $x$ such that $x^2 = -5 mod 29$. This can be done by brute force (trying $x = 0, 1, ldots, 29$) as a last resort.



                The techniques of number theory can fairly efficiently compute this question too (whether or not $-5$ is what is known as a quadratic residue mod $29$). However, this requires some familiarity with the Lagrange symbol and quadratic reciprocity.



                An alternate approach might be to try to directly find a primitive root mod $29$, ie some nonzero value of $z$ such that $z^i ne 1$ unless $i$ is a multiple of 28. Then the values of $z^i$ will consist of all values of $Bbb Z_{29}$. Then you can see if the congruence class of $-5$ is an even power of $z$ or an odd power ($x^2+5$ would be reducible only if $-5$ is an even power of $z$). I don't think this will save effort compared to just computing the squares mod $29$ directly, though.






                share|cite|improve this answer









                $endgroup$
















                  1












                  1








                  1





                  $begingroup$

                  It will suffice to show whether or note $x^2+5$ is irreducible over $Bbb Z_{29}$. As a quadratic this only factors if there is some $x$ such that $x^2 = -5 mod 29$. This can be done by brute force (trying $x = 0, 1, ldots, 29$) as a last resort.



                  The techniques of number theory can fairly efficiently compute this question too (whether or not $-5$ is what is known as a quadratic residue mod $29$). However, this requires some familiarity with the Lagrange symbol and quadratic reciprocity.



                  An alternate approach might be to try to directly find a primitive root mod $29$, ie some nonzero value of $z$ such that $z^i ne 1$ unless $i$ is a multiple of 28. Then the values of $z^i$ will consist of all values of $Bbb Z_{29}$. Then you can see if the congruence class of $-5$ is an even power of $z$ or an odd power ($x^2+5$ would be reducible only if $-5$ is an even power of $z$). I don't think this will save effort compared to just computing the squares mod $29$ directly, though.






                  share|cite|improve this answer









                  $endgroup$



                  It will suffice to show whether or note $x^2+5$ is irreducible over $Bbb Z_{29}$. As a quadratic this only factors if there is some $x$ such that $x^2 = -5 mod 29$. This can be done by brute force (trying $x = 0, 1, ldots, 29$) as a last resort.



                  The techniques of number theory can fairly efficiently compute this question too (whether or not $-5$ is what is known as a quadratic residue mod $29$). However, this requires some familiarity with the Lagrange symbol and quadratic reciprocity.



                  An alternate approach might be to try to directly find a primitive root mod $29$, ie some nonzero value of $z$ such that $z^i ne 1$ unless $i$ is a multiple of 28. Then the values of $z^i$ will consist of all values of $Bbb Z_{29}$. Then you can see if the congruence class of $-5$ is an even power of $z$ or an odd power ($x^2+5$ would be reducible only if $-5$ is an even power of $z$). I don't think this will save effort compared to just computing the squares mod $29$ directly, though.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Dec 8 '18 at 21:26









                  Rolf HoyerRolf Hoyer

                  11.3k31629




                  11.3k31629























                      1












                      $begingroup$

                      To go the next step beyond @RolfHeyer’s answer, I noticed that $6cdot29=174=13^2+5$. Thus $(13-sqrt{-5},)(13+sqrt{-5},)in(29)$, so $(29)$ isn’t a prime ideal.






                      share|cite|improve this answer









                      $endgroup$













                      • $begingroup$
                        No need to pull $,large -5equiv 13^2,$ out of a hat since $,,large -5cdot 2^2equiv 3^2pmod{29},,$ see my answer.
                        $endgroup$
                        – Bill Dubuque
                        Dec 9 '18 at 3:41


















                      1












                      $begingroup$

                      To go the next step beyond @RolfHeyer’s answer, I noticed that $6cdot29=174=13^2+5$. Thus $(13-sqrt{-5},)(13+sqrt{-5},)in(29)$, so $(29)$ isn’t a prime ideal.






                      share|cite|improve this answer









                      $endgroup$













                      • $begingroup$
                        No need to pull $,large -5equiv 13^2,$ out of a hat since $,,large -5cdot 2^2equiv 3^2pmod{29},,$ see my answer.
                        $endgroup$
                        – Bill Dubuque
                        Dec 9 '18 at 3:41
















                      1












                      1








                      1





                      $begingroup$

                      To go the next step beyond @RolfHeyer’s answer, I noticed that $6cdot29=174=13^2+5$. Thus $(13-sqrt{-5},)(13+sqrt{-5},)in(29)$, so $(29)$ isn’t a prime ideal.






                      share|cite|improve this answer









                      $endgroup$



                      To go the next step beyond @RolfHeyer’s answer, I noticed that $6cdot29=174=13^2+5$. Thus $(13-sqrt{-5},)(13+sqrt{-5},)in(29)$, so $(29)$ isn’t a prime ideal.







                      share|cite|improve this answer












                      share|cite|improve this answer



                      share|cite|improve this answer










                      answered Dec 8 '18 at 23:09









                      LubinLubin

                      45.2k44687




                      45.2k44687












                      • $begingroup$
                        No need to pull $,large -5equiv 13^2,$ out of a hat since $,,large -5cdot 2^2equiv 3^2pmod{29},,$ see my answer.
                        $endgroup$
                        – Bill Dubuque
                        Dec 9 '18 at 3:41




















                      • $begingroup$
                        No need to pull $,large -5equiv 13^2,$ out of a hat since $,,large -5cdot 2^2equiv 3^2pmod{29},,$ see my answer.
                        $endgroup$
                        – Bill Dubuque
                        Dec 9 '18 at 3:41


















                      $begingroup$
                      No need to pull $,large -5equiv 13^2,$ out of a hat since $,,large -5cdot 2^2equiv 3^2pmod{29},,$ see my answer.
                      $endgroup$
                      – Bill Dubuque
                      Dec 9 '18 at 3:41






                      $begingroup$
                      No need to pull $,large -5equiv 13^2,$ out of a hat since $,,large -5cdot 2^2equiv 3^2pmod{29},,$ see my answer.
                      $endgroup$
                      – Bill Dubuque
                      Dec 9 '18 at 3:41













                      1












                      $begingroup$

                      First it is easy to check that $-5$ is not a square $!bmod{11}$ by Euler's criterion, i.e.



                      $!bmod 11!: left[a^{large 2} equiv -5right]^{large 5}!Rightarrow, a^{large 10}equiv -5(25)^{large 2} equiv -5(3)^{large 2} equiv -1,$ contra little Fermat.



                      Therefore $ x^{large 2}equiv -5,$ is unsolvable so $,x^2+5,$ has no root so is irreducible $bmod {11}.,$ Otoh



                      $!!begin{align}
                      bmod 29!:, {-}5cdot 2^{large 2} &equiv 3^{large 2} \[.3em]
                      Rightarrow color{#c00}{{-}5} &equiv left(dfrac{3}2right)^{large 2}!!equiv left(dfrac{-26}2right)^{large 2}!! equiv color{#c00}{13^{large 2}}\[.3em]
                      Rightarrow x^{large 2}+color{#c00}{5}&equiv x^{large 2}color{#c00}{-13^2}equiv (x-13)(x+13)
                      end{align}$



                      Remark $ $ Here we don't actually need to calculate the value of $,3/2,$ since we only need to know that $-5$ is a square to infer that $,x^2+5,$ is reducible. But it was easy to do so here so we did it.






                      share|cite|improve this answer











                      $endgroup$


















                        1












                        $begingroup$

                        First it is easy to check that $-5$ is not a square $!bmod{11}$ by Euler's criterion, i.e.



                        $!bmod 11!: left[a^{large 2} equiv -5right]^{large 5}!Rightarrow, a^{large 10}equiv -5(25)^{large 2} equiv -5(3)^{large 2} equiv -1,$ contra little Fermat.



                        Therefore $ x^{large 2}equiv -5,$ is unsolvable so $,x^2+5,$ has no root so is irreducible $bmod {11}.,$ Otoh



                        $!!begin{align}
                        bmod 29!:, {-}5cdot 2^{large 2} &equiv 3^{large 2} \[.3em]
                        Rightarrow color{#c00}{{-}5} &equiv left(dfrac{3}2right)^{large 2}!!equiv left(dfrac{-26}2right)^{large 2}!! equiv color{#c00}{13^{large 2}}\[.3em]
                        Rightarrow x^{large 2}+color{#c00}{5}&equiv x^{large 2}color{#c00}{-13^2}equiv (x-13)(x+13)
                        end{align}$



                        Remark $ $ Here we don't actually need to calculate the value of $,3/2,$ since we only need to know that $-5$ is a square to infer that $,x^2+5,$ is reducible. But it was easy to do so here so we did it.






                        share|cite|improve this answer











                        $endgroup$
















                          1












                          1








                          1





                          $begingroup$

                          First it is easy to check that $-5$ is not a square $!bmod{11}$ by Euler's criterion, i.e.



                          $!bmod 11!: left[a^{large 2} equiv -5right]^{large 5}!Rightarrow, a^{large 10}equiv -5(25)^{large 2} equiv -5(3)^{large 2} equiv -1,$ contra little Fermat.



                          Therefore $ x^{large 2}equiv -5,$ is unsolvable so $,x^2+5,$ has no root so is irreducible $bmod {11}.,$ Otoh



                          $!!begin{align}
                          bmod 29!:, {-}5cdot 2^{large 2} &equiv 3^{large 2} \[.3em]
                          Rightarrow color{#c00}{{-}5} &equiv left(dfrac{3}2right)^{large 2}!!equiv left(dfrac{-26}2right)^{large 2}!! equiv color{#c00}{13^{large 2}}\[.3em]
                          Rightarrow x^{large 2}+color{#c00}{5}&equiv x^{large 2}color{#c00}{-13^2}equiv (x-13)(x+13)
                          end{align}$



                          Remark $ $ Here we don't actually need to calculate the value of $,3/2,$ since we only need to know that $-5$ is a square to infer that $,x^2+5,$ is reducible. But it was easy to do so here so we did it.






                          share|cite|improve this answer











                          $endgroup$



                          First it is easy to check that $-5$ is not a square $!bmod{11}$ by Euler's criterion, i.e.



                          $!bmod 11!: left[a^{large 2} equiv -5right]^{large 5}!Rightarrow, a^{large 10}equiv -5(25)^{large 2} equiv -5(3)^{large 2} equiv -1,$ contra little Fermat.



                          Therefore $ x^{large 2}equiv -5,$ is unsolvable so $,x^2+5,$ has no root so is irreducible $bmod {11}.,$ Otoh



                          $!!begin{align}
                          bmod 29!:, {-}5cdot 2^{large 2} &equiv 3^{large 2} \[.3em]
                          Rightarrow color{#c00}{{-}5} &equiv left(dfrac{3}2right)^{large 2}!!equiv left(dfrac{-26}2right)^{large 2}!! equiv color{#c00}{13^{large 2}}\[.3em]
                          Rightarrow x^{large 2}+color{#c00}{5}&equiv x^{large 2}color{#c00}{-13^2}equiv (x-13)(x+13)
                          end{align}$



                          Remark $ $ Here we don't actually need to calculate the value of $,3/2,$ since we only need to know that $-5$ is a square to infer that $,x^2+5,$ is reducible. But it was easy to do so here so we did it.







                          share|cite|improve this answer














                          share|cite|improve this answer



                          share|cite|improve this answer








                          edited Dec 9 '18 at 3:40

























                          answered Dec 9 '18 at 3:19









                          Bill DubuqueBill Dubuque

                          212k29195654




                          212k29195654






























                              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%2f3031568%2fprime-ideals-in-certain-quadratic-ring%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