Is it true that no polynomial (with the exception of constant polynomial) have an inverse in $mathbb Z/pmathbb Z$ (where p is prime)? Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)What does the concept of a 'unit' mean in the set of polynomials?Should the sum of zero divisors also a zero divisor?commutative ring with no zero divisorsDoes Euclidean division not work for general polynomials?Showing that a divisor of zero in a commutative ring with unity can have no multiplicative inverse"Prove that no linear polynomial in $mathbb Z_10[x]$ is a unitThe polynomial ring $K[t_1,dots,t_n]$ of $n$ variables over the field $K$ has no zero divisorsDivision algorithm for polynomials in R[x], where R is a commutative ring with unity.What is meant by a polynomial that is “irreducible”? And a “prime” polynomial?Prove that each element of polynomial ring with irreducible characteristic has exactly one minimum polynomial.

Why are two-digit numbers in Jonathan Swift's "Gulliver's Travels" (1726) written in "German style"?

What is a more techy Technical Writer job title that isn't cutesy or confusing?

Order between one to one functions and their inverses

Why not use the yoke to control yaw, as well as pitch and roll?

Does the transliteration of 'Dravidian' exist in Hindu scripture? Does 'Dravida' refer to a Geographical area or an ethnic group?

Where and when has Thucydides been studied?

Are there any irrational/transcendental numbers for which the distribution of decimal digits is not uniform?

Does the Rock Gnome trait Artificer's Lore apply when you aren't proficient in History?

Putting class ranking in CV, but against dept guidelines

Google .dev domain strangely redirects to https

Did any compiler fully use 80-bit floating point?

Trying to understand entropy as a novice in thermodynamics

Why can't fire hurt Daenerys but it did to Jon Snow in season 1?

Why BitLocker does not use RSA

The test team as an enemy of development? And how can this be avoided?

Nose gear failure in single prop aircraft: belly landing or nose landing?

How to achieve cat-like agility?

Table formatting with tabularx?

By what mechanism was the 2017 UK General Election called?

latest version of QGIS fails to edit attribute table of GeoJSON file

Relating to the President and obstruction, were Mueller's conclusions preordained?

When does a function NOT have an antiderivative?

malloc in main() or malloc in another function: allocating memory for a struct and its members

Is this Kuo-toa homebrew race balanced?



Is it true that no polynomial (with the exception of constant polynomial) have an inverse in $mathbb Z/pmathbb Z$ (where p is prime)?



Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)What does the concept of a 'unit' mean in the set of polynomials?Should the sum of zero divisors also a zero divisor?commutative ring with no zero divisorsDoes Euclidean division not work for general polynomials?Showing that a divisor of zero in a commutative ring with unity can have no multiplicative inverse"Prove that no linear polynomial in $mathbb Z_10[x]$ is a unitThe polynomial ring $K[t_1,dots,t_n]$ of $n$ variables over the field $K$ has no zero divisorsDivision algorithm for polynomials in R[x], where R is a commutative ring with unity.What is meant by a polynomial that is “irreducible”? And a “prime” polynomial?Prove that each element of polynomial ring with irreducible characteristic has exactly one minimum polynomial.










0












$begingroup$


I was solving the following exercise:



Find the inverse of $p(x) = 1 + x$ in $R[x]$ over $mathbb Z/5mathbb Z$ or show that it does not exist.



and finding that it does not exist because if there is a polynomial $q(x)$ such that $p(x)q(x)=1$. Which will contradict the proposition:




Let $R$ be a commutative ring. For every pair of non-zero polynomials $p$ and $q$ in $R[x]$, if the leading coefficient of $p$ or $q$ is not a zero divisor in $R$ then $deg(pq)=deg(p)+deg(q)$




my question is it safe to assume that there does not exist an inverse of polynomial of $deg>0$ over $mathbb Z/pmathbb Z$ where $p$ is a prime number?










share|cite|improve this question











$endgroup$











  • $begingroup$
    I'm confused. You seem to have proved a statement while, at the same time, you are asking whether you can safely assume that the statment is true.
    $endgroup$
    – José Carlos Santos
    Apr 2 at 14:55










  • $begingroup$
    What does "inverse" mean here? Do you mean "reciprocal"? Then, sure. Do you mean "inverse function"? Well, then $q(x)=x-1$ works.
    $endgroup$
    – lulu
    Apr 2 at 15:02










  • $begingroup$
    @lulu I think it's clear from "$p(x)q(x)=1$" that OP means multiplicative inverse.
    $endgroup$
    – cansomeonehelpmeout
    Apr 2 at 15:03










  • $begingroup$
    @cansomeonehelpmeout Well, I think it's clear that the OP approached the problem from that point of view. But was that what was intended? Seems an odd phrasing. Why multiplicative inverse? Additive inverse is simpler.
    $endgroup$
    – lulu
    Apr 2 at 15:13
















0












$begingroup$


I was solving the following exercise:



Find the inverse of $p(x) = 1 + x$ in $R[x]$ over $mathbb Z/5mathbb Z$ or show that it does not exist.



and finding that it does not exist because if there is a polynomial $q(x)$ such that $p(x)q(x)=1$. Which will contradict the proposition:




Let $R$ be a commutative ring. For every pair of non-zero polynomials $p$ and $q$ in $R[x]$, if the leading coefficient of $p$ or $q$ is not a zero divisor in $R$ then $deg(pq)=deg(p)+deg(q)$




my question is it safe to assume that there does not exist an inverse of polynomial of $deg>0$ over $mathbb Z/pmathbb Z$ where $p$ is a prime number?










share|cite|improve this question











$endgroup$











  • $begingroup$
    I'm confused. You seem to have proved a statement while, at the same time, you are asking whether you can safely assume that the statment is true.
    $endgroup$
    – José Carlos Santos
    Apr 2 at 14:55










  • $begingroup$
    What does "inverse" mean here? Do you mean "reciprocal"? Then, sure. Do you mean "inverse function"? Well, then $q(x)=x-1$ works.
    $endgroup$
    – lulu
    Apr 2 at 15:02










  • $begingroup$
    @lulu I think it's clear from "$p(x)q(x)=1$" that OP means multiplicative inverse.
    $endgroup$
    – cansomeonehelpmeout
    Apr 2 at 15:03










  • $begingroup$
    @cansomeonehelpmeout Well, I think it's clear that the OP approached the problem from that point of view. But was that what was intended? Seems an odd phrasing. Why multiplicative inverse? Additive inverse is simpler.
    $endgroup$
    – lulu
    Apr 2 at 15:13














0












0








0





$begingroup$


I was solving the following exercise:



Find the inverse of $p(x) = 1 + x$ in $R[x]$ over $mathbb Z/5mathbb Z$ or show that it does not exist.



and finding that it does not exist because if there is a polynomial $q(x)$ such that $p(x)q(x)=1$. Which will contradict the proposition:




Let $R$ be a commutative ring. For every pair of non-zero polynomials $p$ and $q$ in $R[x]$, if the leading coefficient of $p$ or $q$ is not a zero divisor in $R$ then $deg(pq)=deg(p)+deg(q)$




my question is it safe to assume that there does not exist an inverse of polynomial of $deg>0$ over $mathbb Z/pmathbb Z$ where $p$ is a prime number?










share|cite|improve this question











$endgroup$




I was solving the following exercise:



Find the inverse of $p(x) = 1 + x$ in $R[x]$ over $mathbb Z/5mathbb Z$ or show that it does not exist.



and finding that it does not exist because if there is a polynomial $q(x)$ such that $p(x)q(x)=1$. Which will contradict the proposition:




Let $R$ be a commutative ring. For every pair of non-zero polynomials $p$ and $q$ in $R[x]$, if the leading coefficient of $p$ or $q$ is not a zero divisor in $R$ then $deg(pq)=deg(p)+deg(q)$




my question is it safe to assume that there does not exist an inverse of polynomial of $deg>0$ over $mathbb Z/pmathbb Z$ where $p$ is a prime number?







polynomials ring-theory finite-fields






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Apr 2 at 15:02









cansomeonehelpmeout

7,3323935




7,3323935










asked Apr 2 at 14:51









KbiirKbiir

696




696











  • $begingroup$
    I'm confused. You seem to have proved a statement while, at the same time, you are asking whether you can safely assume that the statment is true.
    $endgroup$
    – José Carlos Santos
    Apr 2 at 14:55










  • $begingroup$
    What does "inverse" mean here? Do you mean "reciprocal"? Then, sure. Do you mean "inverse function"? Well, then $q(x)=x-1$ works.
    $endgroup$
    – lulu
    Apr 2 at 15:02










  • $begingroup$
    @lulu I think it's clear from "$p(x)q(x)=1$" that OP means multiplicative inverse.
    $endgroup$
    – cansomeonehelpmeout
    Apr 2 at 15:03










  • $begingroup$
    @cansomeonehelpmeout Well, I think it's clear that the OP approached the problem from that point of view. But was that what was intended? Seems an odd phrasing. Why multiplicative inverse? Additive inverse is simpler.
    $endgroup$
    – lulu
    Apr 2 at 15:13

















  • $begingroup$
    I'm confused. You seem to have proved a statement while, at the same time, you are asking whether you can safely assume that the statment is true.
    $endgroup$
    – José Carlos Santos
    Apr 2 at 14:55










  • $begingroup$
    What does "inverse" mean here? Do you mean "reciprocal"? Then, sure. Do you mean "inverse function"? Well, then $q(x)=x-1$ works.
    $endgroup$
    – lulu
    Apr 2 at 15:02










  • $begingroup$
    @lulu I think it's clear from "$p(x)q(x)=1$" that OP means multiplicative inverse.
    $endgroup$
    – cansomeonehelpmeout
    Apr 2 at 15:03










  • $begingroup$
    @cansomeonehelpmeout Well, I think it's clear that the OP approached the problem from that point of view. But was that what was intended? Seems an odd phrasing. Why multiplicative inverse? Additive inverse is simpler.
    $endgroup$
    – lulu
    Apr 2 at 15:13
















$begingroup$
I'm confused. You seem to have proved a statement while, at the same time, you are asking whether you can safely assume that the statment is true.
$endgroup$
– José Carlos Santos
Apr 2 at 14:55




$begingroup$
I'm confused. You seem to have proved a statement while, at the same time, you are asking whether you can safely assume that the statment is true.
$endgroup$
– José Carlos Santos
Apr 2 at 14:55












$begingroup$
What does "inverse" mean here? Do you mean "reciprocal"? Then, sure. Do you mean "inverse function"? Well, then $q(x)=x-1$ works.
$endgroup$
– lulu
Apr 2 at 15:02




$begingroup$
What does "inverse" mean here? Do you mean "reciprocal"? Then, sure. Do you mean "inverse function"? Well, then $q(x)=x-1$ works.
$endgroup$
– lulu
Apr 2 at 15:02












$begingroup$
@lulu I think it's clear from "$p(x)q(x)=1$" that OP means multiplicative inverse.
$endgroup$
– cansomeonehelpmeout
Apr 2 at 15:03




$begingroup$
@lulu I think it's clear from "$p(x)q(x)=1$" that OP means multiplicative inverse.
$endgroup$
– cansomeonehelpmeout
Apr 2 at 15:03












$begingroup$
@cansomeonehelpmeout Well, I think it's clear that the OP approached the problem from that point of view. But was that what was intended? Seems an odd phrasing. Why multiplicative inverse? Additive inverse is simpler.
$endgroup$
– lulu
Apr 2 at 15:13





$begingroup$
@cansomeonehelpmeout Well, I think it's clear that the OP approached the problem from that point of view. But was that what was intended? Seems an odd phrasing. Why multiplicative inverse? Additive inverse is simpler.
$endgroup$
– lulu
Apr 2 at 15:13











2 Answers
2






active

oldest

votes


















2












$begingroup$

Yes it is true, this is because $deg(PQ)=deg(P)+deg(Q)$ for nonzero polynomials, so both summands must be $0$.






share|cite|improve this answer











$endgroup$




















    1












    $begingroup$

    Well, for any polynomials $f,gin R[x]$, where $R$ is an integral domain (i.e., has no zero divisors), the degree formula
    $$deg(fcdot g) = deg(f)+deg(g)$$
    holds, since the highest terms do not cancel.



    Thus if $f$ is a unit in $R[x]$, then $fcdot g =1$ for some $gin R[x]$.
    Then $0 =deg (1) = deg(fcdot g) =deg(f) + deg(g)$.
    Since the degrees are nonnegative it follows that $deg(f)=0$ and so $f$ is invertible in $R$. Done.






    share|cite|improve this answer









    $endgroup$













      Your Answer








      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%2f3171947%2fis-it-true-that-no-polynomial-with-the-exception-of-constant-polynomial-have-a%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









      2












      $begingroup$

      Yes it is true, this is because $deg(PQ)=deg(P)+deg(Q)$ for nonzero polynomials, so both summands must be $0$.






      share|cite|improve this answer











      $endgroup$

















        2












        $begingroup$

        Yes it is true, this is because $deg(PQ)=deg(P)+deg(Q)$ for nonzero polynomials, so both summands must be $0$.






        share|cite|improve this answer











        $endgroup$















          2












          2








          2





          $begingroup$

          Yes it is true, this is because $deg(PQ)=deg(P)+deg(Q)$ for nonzero polynomials, so both summands must be $0$.






          share|cite|improve this answer











          $endgroup$



          Yes it is true, this is because $deg(PQ)=deg(P)+deg(Q)$ for nonzero polynomials, so both summands must be $0$.







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Apr 2 at 15:02

























          answered Apr 2 at 14:55









          Jorge Fernández HidalgoJorge Fernández Hidalgo

          77.2k1394195




          77.2k1394195





















              1












              $begingroup$

              Well, for any polynomials $f,gin R[x]$, where $R$ is an integral domain (i.e., has no zero divisors), the degree formula
              $$deg(fcdot g) = deg(f)+deg(g)$$
              holds, since the highest terms do not cancel.



              Thus if $f$ is a unit in $R[x]$, then $fcdot g =1$ for some $gin R[x]$.
              Then $0 =deg (1) = deg(fcdot g) =deg(f) + deg(g)$.
              Since the degrees are nonnegative it follows that $deg(f)=0$ and so $f$ is invertible in $R$. Done.






              share|cite|improve this answer









              $endgroup$

















                1












                $begingroup$

                Well, for any polynomials $f,gin R[x]$, where $R$ is an integral domain (i.e., has no zero divisors), the degree formula
                $$deg(fcdot g) = deg(f)+deg(g)$$
                holds, since the highest terms do not cancel.



                Thus if $f$ is a unit in $R[x]$, then $fcdot g =1$ for some $gin R[x]$.
                Then $0 =deg (1) = deg(fcdot g) =deg(f) + deg(g)$.
                Since the degrees are nonnegative it follows that $deg(f)=0$ and so $f$ is invertible in $R$. Done.






                share|cite|improve this answer









                $endgroup$















                  1












                  1








                  1





                  $begingroup$

                  Well, for any polynomials $f,gin R[x]$, where $R$ is an integral domain (i.e., has no zero divisors), the degree formula
                  $$deg(fcdot g) = deg(f)+deg(g)$$
                  holds, since the highest terms do not cancel.



                  Thus if $f$ is a unit in $R[x]$, then $fcdot g =1$ for some $gin R[x]$.
                  Then $0 =deg (1) = deg(fcdot g) =deg(f) + deg(g)$.
                  Since the degrees are nonnegative it follows that $deg(f)=0$ and so $f$ is invertible in $R$. Done.






                  share|cite|improve this answer









                  $endgroup$



                  Well, for any polynomials $f,gin R[x]$, where $R$ is an integral domain (i.e., has no zero divisors), the degree formula
                  $$deg(fcdot g) = deg(f)+deg(g)$$
                  holds, since the highest terms do not cancel.



                  Thus if $f$ is a unit in $R[x]$, then $fcdot g =1$ for some $gin R[x]$.
                  Then $0 =deg (1) = deg(fcdot g) =deg(f) + deg(g)$.
                  Since the degrees are nonnegative it follows that $deg(f)=0$ and so $f$ is invertible in $R$. Done.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Apr 2 at 15:03









                  WuestenfuxWuestenfux

                  5,5911513




                  5,5911513



























                      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%2f3171947%2fis-it-true-that-no-polynomial-with-the-exception-of-constant-polynomial-have-a%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

                      Boston (Lincolnshire) Stedsbyld | Berne yn Boston | NavigaasjemenuBoston Borough CouncilBoston, Lincolnshire

                      Trouble understanding the speech of overseas colleaguesHow can I better understand manager or clients with strong accents?Adding more movement and speech at the fundamental level to a highly-sedentary job?Difficulty in understanding Manager's accent(language and communication)How to adjust yourself where your colleagues are not understanding to you?Understanding manager's expectationsForeigner and colleagues using slangHaving difficulty understanding meetingsHow do you breathe when giving a speech?Trouble Waking Up for Emergencies (On-Call)Problems with colleaguesColleagues feeling insecure when I do my work

                      Is the concept of a “numerable” fiber bundle really useful or an empty generalization?Non trivial vector bundle over non-paracompact contractible spaceExample of fiber bundle that is not a fibrationGlobalising fibrations by schedulesFiber bundle = principal bundle + fiber?Numerable covers from the point of view of Grothendieck topologiesGlobal sections for torus fiber bundleAre there analogs of smooth partitions of unity and good open covers for PL-manifolds?Two natural maps asssociated with the nerve of a coverDescent theory, fibrations, and bundlesIn which sense are Euler-Lagrange PDE's on fiber bundles quasi-linear?What is the local structure of a fibration?Complete proof of Homotopy invariance of a numerable fiber bundle based on CHPLocally trivial fibration over a suspension