Present $frac{1}{x^p-x}$ as a sum of simple fractions in $mathbb{Z}_p$












2












$begingroup$


I've done some (maybe incorrect) algebra, which has led me to a strange equality:
$$frac{1}{x^p-x}$$
$$frac{1}{(1+(x+p-1))^p+(p-1)x}$$
$$frac{1}{1+p(x+p-1)+cdots+p(x+p-1)^{p-1}+(x+p-1)^p+(p-1)x}$$
$p(x+p-1)+cdots+p(x+p-1)$ are $0$ in $mathbb{Z}_p$.
$$frac{1}{(x-1)^p +1 -x}$$
$$frac{1}{(x-1)^p -(x-1)}$$



Which gave me an idea to use induction on $x$ (I don't know if this idea is legal), but I'm struggling to find the base.



I also see that $frac{1}{x^p-x}=frac{1}{x(x^{p-1}-1)}$, but that doesn't seem to lead anywhere.



The answer in the book is $-sum_{a=0}^{p-1}frac{1}{x-a}$.



Hints or full answers, I will be very grateful for any help.



Thank you.










share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    What is the definition of a simple fraction?
    $endgroup$
    – Frpzzd
    Dec 4 '18 at 14:50










  • $begingroup$
    @Frpzzd $frac{r(x)}{q(x)}$ such that $q=(f(x))^k$, $f(x)$ is an irreducible polynomial (i.e.$f neq a cdot b$, where $a, b$ are polynomials), and degree of $r(x)<$ degree of $f(x)$.
    $endgroup$
    – fragileradius
    Dec 4 '18 at 14:53


















2












$begingroup$


I've done some (maybe incorrect) algebra, which has led me to a strange equality:
$$frac{1}{x^p-x}$$
$$frac{1}{(1+(x+p-1))^p+(p-1)x}$$
$$frac{1}{1+p(x+p-1)+cdots+p(x+p-1)^{p-1}+(x+p-1)^p+(p-1)x}$$
$p(x+p-1)+cdots+p(x+p-1)$ are $0$ in $mathbb{Z}_p$.
$$frac{1}{(x-1)^p +1 -x}$$
$$frac{1}{(x-1)^p -(x-1)}$$



Which gave me an idea to use induction on $x$ (I don't know if this idea is legal), but I'm struggling to find the base.



I also see that $frac{1}{x^p-x}=frac{1}{x(x^{p-1}-1)}$, but that doesn't seem to lead anywhere.



The answer in the book is $-sum_{a=0}^{p-1}frac{1}{x-a}$.



Hints or full answers, I will be very grateful for any help.



Thank you.










share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    What is the definition of a simple fraction?
    $endgroup$
    – Frpzzd
    Dec 4 '18 at 14:50










  • $begingroup$
    @Frpzzd $frac{r(x)}{q(x)}$ such that $q=(f(x))^k$, $f(x)$ is an irreducible polynomial (i.e.$f neq a cdot b$, where $a, b$ are polynomials), and degree of $r(x)<$ degree of $f(x)$.
    $endgroup$
    – fragileradius
    Dec 4 '18 at 14:53
















2












2








2





$begingroup$


I've done some (maybe incorrect) algebra, which has led me to a strange equality:
$$frac{1}{x^p-x}$$
$$frac{1}{(1+(x+p-1))^p+(p-1)x}$$
$$frac{1}{1+p(x+p-1)+cdots+p(x+p-1)^{p-1}+(x+p-1)^p+(p-1)x}$$
$p(x+p-1)+cdots+p(x+p-1)$ are $0$ in $mathbb{Z}_p$.
$$frac{1}{(x-1)^p +1 -x}$$
$$frac{1}{(x-1)^p -(x-1)}$$



Which gave me an idea to use induction on $x$ (I don't know if this idea is legal), but I'm struggling to find the base.



I also see that $frac{1}{x^p-x}=frac{1}{x(x^{p-1}-1)}$, but that doesn't seem to lead anywhere.



The answer in the book is $-sum_{a=0}^{p-1}frac{1}{x-a}$.



Hints or full answers, I will be very grateful for any help.



Thank you.










share|cite|improve this question









$endgroup$




I've done some (maybe incorrect) algebra, which has led me to a strange equality:
$$frac{1}{x^p-x}$$
$$frac{1}{(1+(x+p-1))^p+(p-1)x}$$
$$frac{1}{1+p(x+p-1)+cdots+p(x+p-1)^{p-1}+(x+p-1)^p+(p-1)x}$$
$p(x+p-1)+cdots+p(x+p-1)$ are $0$ in $mathbb{Z}_p$.
$$frac{1}{(x-1)^p +1 -x}$$
$$frac{1}{(x-1)^p -(x-1)}$$



Which gave me an idea to use induction on $x$ (I don't know if this idea is legal), but I'm struggling to find the base.



I also see that $frac{1}{x^p-x}=frac{1}{x(x^{p-1}-1)}$, but that doesn't seem to lead anywhere.



The answer in the book is $-sum_{a=0}^{p-1}frac{1}{x-a}$.



Hints or full answers, I will be very grateful for any help.



Thank you.







polynomials modular-arithmetic






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 4 '18 at 14:44









fragileradiusfragileradius

297114




297114








  • 1




    $begingroup$
    What is the definition of a simple fraction?
    $endgroup$
    – Frpzzd
    Dec 4 '18 at 14:50










  • $begingroup$
    @Frpzzd $frac{r(x)}{q(x)}$ such that $q=(f(x))^k$, $f(x)$ is an irreducible polynomial (i.e.$f neq a cdot b$, where $a, b$ are polynomials), and degree of $r(x)<$ degree of $f(x)$.
    $endgroup$
    – fragileradius
    Dec 4 '18 at 14:53
















  • 1




    $begingroup$
    What is the definition of a simple fraction?
    $endgroup$
    – Frpzzd
    Dec 4 '18 at 14:50










  • $begingroup$
    @Frpzzd $frac{r(x)}{q(x)}$ such that $q=(f(x))^k$, $f(x)$ is an irreducible polynomial (i.e.$f neq a cdot b$, where $a, b$ are polynomials), and degree of $r(x)<$ degree of $f(x)$.
    $endgroup$
    – fragileradius
    Dec 4 '18 at 14:53










1




1




$begingroup$
What is the definition of a simple fraction?
$endgroup$
– Frpzzd
Dec 4 '18 at 14:50




$begingroup$
What is the definition of a simple fraction?
$endgroup$
– Frpzzd
Dec 4 '18 at 14:50












$begingroup$
@Frpzzd $frac{r(x)}{q(x)}$ such that $q=(f(x))^k$, $f(x)$ is an irreducible polynomial (i.e.$f neq a cdot b$, where $a, b$ are polynomials), and degree of $r(x)<$ degree of $f(x)$.
$endgroup$
– fragileradius
Dec 4 '18 at 14:53






$begingroup$
@Frpzzd $frac{r(x)}{q(x)}$ such that $q=(f(x))^k$, $f(x)$ is an irreducible polynomial (i.e.$f neq a cdot b$, where $a, b$ are polynomials), and degree of $r(x)<$ degree of $f(x)$.
$endgroup$
– fragileradius
Dec 4 '18 at 14:53












2 Answers
2






active

oldest

votes


















4












$begingroup$

You cannot use induction on $x$, since in $mathbb Z_p[x]$, $x$ does not actually represent a number, let along an integer; it is merely a placeholder, or an algebraic object. You can only induct over things like integers or natural numbers, so this is out of the question.



Here is a more beneficial approach. Because $x^p-x$ equals $0$ for all $xinmathbb Z_p$, you may factor it as $x(x-1)...(x-p+1),$ which suggests (if you are familiar with partial fractions) that the decomposition is of the form
$$frac{a_0}{x}+frac{a_1}{x-1}+...+frac{a_{p-1}}{x-p+1}$$
But by symmetry (or, by substituting $xto x+1$), you can see that all of these coefficients must be equal. So instead, you have a decomposition in the form
$$a_0bigg(frac{1}{x}+frac{1}{x-1}+...+frac{1}{x-p+1}bigg)$$
In which case all you have to do is show that this constant $a_0$ is equal to $-1$. Does this help?






share|cite|improve this answer









$endgroup$





















    2












    $begingroup$

    I shall find the partial fraction decomposition of $$f(x):=frac{1}{x^q-x}$$
    over $mathbb{F}_q$, where $q=p^r$ for some prime natural number $p$ and for some positive integer $r$. In particular, when $r=1$, $mathbb{F}_q=mathbb{F}_p=mathbb{Z}_p$, which is what the OP asks for.



    Note that $x^q-xinmathbb{F}_q[x]$ factors into linear factors $prodlimits_{tinmathbb{F}_q},(x-t)$, with each linear factor occurring with multiplicity $1$. Therefore, the partial fraction decomposition of $f(x)$ is a sum of simple fractions
    $$f(x)=sum_{tinmathbb{F}_q},frac{s_t}{x-t}$$
    for some $s_tinmathbb{F}_q$ for each $tinmathbb{F}_q$.



    Now, $g_tau(x):=dfrac{1}{(x-tau),f(x)}$ is a polynomial in $mathbb{F}_q[x]$ for each $tauinmathbb{F}_q$. It can be easily seen that $g_tau(tau)$ is the (first) derivative of $x^q-x$ evaluated at $x:=tau$, which is $-1$. From
    $$frac{1}{g_tau(x)}=s_tau+sum_{tinmathbb{F}_qsetminus{tau}},frac{s_t(x-tau)}{x-t}text{ for all }tauinmathbb{F}_q,,$$
    we evaluate this expression at $x:=tau$ to get
    $$s_tau=-1text{ for every }tauinmathbb{F}_q,.$$
    This shows that
    $$frac{1}{x^q-x}=f(x)=-sum_{tinmathbb{F}_q},frac{1}{x-t},.$$






    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%2f3025671%2fpresent-frac1xp-x-as-a-sum-of-simple-fractions-in-mathbbz-p%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









      4












      $begingroup$

      You cannot use induction on $x$, since in $mathbb Z_p[x]$, $x$ does not actually represent a number, let along an integer; it is merely a placeholder, or an algebraic object. You can only induct over things like integers or natural numbers, so this is out of the question.



      Here is a more beneficial approach. Because $x^p-x$ equals $0$ for all $xinmathbb Z_p$, you may factor it as $x(x-1)...(x-p+1),$ which suggests (if you are familiar with partial fractions) that the decomposition is of the form
      $$frac{a_0}{x}+frac{a_1}{x-1}+...+frac{a_{p-1}}{x-p+1}$$
      But by symmetry (or, by substituting $xto x+1$), you can see that all of these coefficients must be equal. So instead, you have a decomposition in the form
      $$a_0bigg(frac{1}{x}+frac{1}{x-1}+...+frac{1}{x-p+1}bigg)$$
      In which case all you have to do is show that this constant $a_0$ is equal to $-1$. Does this help?






      share|cite|improve this answer









      $endgroup$


















        4












        $begingroup$

        You cannot use induction on $x$, since in $mathbb Z_p[x]$, $x$ does not actually represent a number, let along an integer; it is merely a placeholder, or an algebraic object. You can only induct over things like integers or natural numbers, so this is out of the question.



        Here is a more beneficial approach. Because $x^p-x$ equals $0$ for all $xinmathbb Z_p$, you may factor it as $x(x-1)...(x-p+1),$ which suggests (if you are familiar with partial fractions) that the decomposition is of the form
        $$frac{a_0}{x}+frac{a_1}{x-1}+...+frac{a_{p-1}}{x-p+1}$$
        But by symmetry (or, by substituting $xto x+1$), you can see that all of these coefficients must be equal. So instead, you have a decomposition in the form
        $$a_0bigg(frac{1}{x}+frac{1}{x-1}+...+frac{1}{x-p+1}bigg)$$
        In which case all you have to do is show that this constant $a_0$ is equal to $-1$. Does this help?






        share|cite|improve this answer









        $endgroup$
















          4












          4








          4





          $begingroup$

          You cannot use induction on $x$, since in $mathbb Z_p[x]$, $x$ does not actually represent a number, let along an integer; it is merely a placeholder, or an algebraic object. You can only induct over things like integers or natural numbers, so this is out of the question.



          Here is a more beneficial approach. Because $x^p-x$ equals $0$ for all $xinmathbb Z_p$, you may factor it as $x(x-1)...(x-p+1),$ which suggests (if you are familiar with partial fractions) that the decomposition is of the form
          $$frac{a_0}{x}+frac{a_1}{x-1}+...+frac{a_{p-1}}{x-p+1}$$
          But by symmetry (or, by substituting $xto x+1$), you can see that all of these coefficients must be equal. So instead, you have a decomposition in the form
          $$a_0bigg(frac{1}{x}+frac{1}{x-1}+...+frac{1}{x-p+1}bigg)$$
          In which case all you have to do is show that this constant $a_0$ is equal to $-1$. Does this help?






          share|cite|improve this answer









          $endgroup$



          You cannot use induction on $x$, since in $mathbb Z_p[x]$, $x$ does not actually represent a number, let along an integer; it is merely a placeholder, or an algebraic object. You can only induct over things like integers or natural numbers, so this is out of the question.



          Here is a more beneficial approach. Because $x^p-x$ equals $0$ for all $xinmathbb Z_p$, you may factor it as $x(x-1)...(x-p+1),$ which suggests (if you are familiar with partial fractions) that the decomposition is of the form
          $$frac{a_0}{x}+frac{a_1}{x-1}+...+frac{a_{p-1}}{x-p+1}$$
          But by symmetry (or, by substituting $xto x+1$), you can see that all of these coefficients must be equal. So instead, you have a decomposition in the form
          $$a_0bigg(frac{1}{x}+frac{1}{x-1}+...+frac{1}{x-p+1}bigg)$$
          In which case all you have to do is show that this constant $a_0$ is equal to $-1$. Does this help?







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Dec 4 '18 at 14:58









          FrpzzdFrpzzd

          22.8k840108




          22.8k840108























              2












              $begingroup$

              I shall find the partial fraction decomposition of $$f(x):=frac{1}{x^q-x}$$
              over $mathbb{F}_q$, where $q=p^r$ for some prime natural number $p$ and for some positive integer $r$. In particular, when $r=1$, $mathbb{F}_q=mathbb{F}_p=mathbb{Z}_p$, which is what the OP asks for.



              Note that $x^q-xinmathbb{F}_q[x]$ factors into linear factors $prodlimits_{tinmathbb{F}_q},(x-t)$, with each linear factor occurring with multiplicity $1$. Therefore, the partial fraction decomposition of $f(x)$ is a sum of simple fractions
              $$f(x)=sum_{tinmathbb{F}_q},frac{s_t}{x-t}$$
              for some $s_tinmathbb{F}_q$ for each $tinmathbb{F}_q$.



              Now, $g_tau(x):=dfrac{1}{(x-tau),f(x)}$ is a polynomial in $mathbb{F}_q[x]$ for each $tauinmathbb{F}_q$. It can be easily seen that $g_tau(tau)$ is the (first) derivative of $x^q-x$ evaluated at $x:=tau$, which is $-1$. From
              $$frac{1}{g_tau(x)}=s_tau+sum_{tinmathbb{F}_qsetminus{tau}},frac{s_t(x-tau)}{x-t}text{ for all }tauinmathbb{F}_q,,$$
              we evaluate this expression at $x:=tau$ to get
              $$s_tau=-1text{ for every }tauinmathbb{F}_q,.$$
              This shows that
              $$frac{1}{x^q-x}=f(x)=-sum_{tinmathbb{F}_q},frac{1}{x-t},.$$






              share|cite|improve this answer











              $endgroup$


















                2












                $begingroup$

                I shall find the partial fraction decomposition of $$f(x):=frac{1}{x^q-x}$$
                over $mathbb{F}_q$, where $q=p^r$ for some prime natural number $p$ and for some positive integer $r$. In particular, when $r=1$, $mathbb{F}_q=mathbb{F}_p=mathbb{Z}_p$, which is what the OP asks for.



                Note that $x^q-xinmathbb{F}_q[x]$ factors into linear factors $prodlimits_{tinmathbb{F}_q},(x-t)$, with each linear factor occurring with multiplicity $1$. Therefore, the partial fraction decomposition of $f(x)$ is a sum of simple fractions
                $$f(x)=sum_{tinmathbb{F}_q},frac{s_t}{x-t}$$
                for some $s_tinmathbb{F}_q$ for each $tinmathbb{F}_q$.



                Now, $g_tau(x):=dfrac{1}{(x-tau),f(x)}$ is a polynomial in $mathbb{F}_q[x]$ for each $tauinmathbb{F}_q$. It can be easily seen that $g_tau(tau)$ is the (first) derivative of $x^q-x$ evaluated at $x:=tau$, which is $-1$. From
                $$frac{1}{g_tau(x)}=s_tau+sum_{tinmathbb{F}_qsetminus{tau}},frac{s_t(x-tau)}{x-t}text{ for all }tauinmathbb{F}_q,,$$
                we evaluate this expression at $x:=tau$ to get
                $$s_tau=-1text{ for every }tauinmathbb{F}_q,.$$
                This shows that
                $$frac{1}{x^q-x}=f(x)=-sum_{tinmathbb{F}_q},frac{1}{x-t},.$$






                share|cite|improve this answer











                $endgroup$
















                  2












                  2








                  2





                  $begingroup$

                  I shall find the partial fraction decomposition of $$f(x):=frac{1}{x^q-x}$$
                  over $mathbb{F}_q$, where $q=p^r$ for some prime natural number $p$ and for some positive integer $r$. In particular, when $r=1$, $mathbb{F}_q=mathbb{F}_p=mathbb{Z}_p$, which is what the OP asks for.



                  Note that $x^q-xinmathbb{F}_q[x]$ factors into linear factors $prodlimits_{tinmathbb{F}_q},(x-t)$, with each linear factor occurring with multiplicity $1$. Therefore, the partial fraction decomposition of $f(x)$ is a sum of simple fractions
                  $$f(x)=sum_{tinmathbb{F}_q},frac{s_t}{x-t}$$
                  for some $s_tinmathbb{F}_q$ for each $tinmathbb{F}_q$.



                  Now, $g_tau(x):=dfrac{1}{(x-tau),f(x)}$ is a polynomial in $mathbb{F}_q[x]$ for each $tauinmathbb{F}_q$. It can be easily seen that $g_tau(tau)$ is the (first) derivative of $x^q-x$ evaluated at $x:=tau$, which is $-1$. From
                  $$frac{1}{g_tau(x)}=s_tau+sum_{tinmathbb{F}_qsetminus{tau}},frac{s_t(x-tau)}{x-t}text{ for all }tauinmathbb{F}_q,,$$
                  we evaluate this expression at $x:=tau$ to get
                  $$s_tau=-1text{ for every }tauinmathbb{F}_q,.$$
                  This shows that
                  $$frac{1}{x^q-x}=f(x)=-sum_{tinmathbb{F}_q},frac{1}{x-t},.$$






                  share|cite|improve this answer











                  $endgroup$



                  I shall find the partial fraction decomposition of $$f(x):=frac{1}{x^q-x}$$
                  over $mathbb{F}_q$, where $q=p^r$ for some prime natural number $p$ and for some positive integer $r$. In particular, when $r=1$, $mathbb{F}_q=mathbb{F}_p=mathbb{Z}_p$, which is what the OP asks for.



                  Note that $x^q-xinmathbb{F}_q[x]$ factors into linear factors $prodlimits_{tinmathbb{F}_q},(x-t)$, with each linear factor occurring with multiplicity $1$. Therefore, the partial fraction decomposition of $f(x)$ is a sum of simple fractions
                  $$f(x)=sum_{tinmathbb{F}_q},frac{s_t}{x-t}$$
                  for some $s_tinmathbb{F}_q$ for each $tinmathbb{F}_q$.



                  Now, $g_tau(x):=dfrac{1}{(x-tau),f(x)}$ is a polynomial in $mathbb{F}_q[x]$ for each $tauinmathbb{F}_q$. It can be easily seen that $g_tau(tau)$ is the (first) derivative of $x^q-x$ evaluated at $x:=tau$, which is $-1$. From
                  $$frac{1}{g_tau(x)}=s_tau+sum_{tinmathbb{F}_qsetminus{tau}},frac{s_t(x-tau)}{x-t}text{ for all }tauinmathbb{F}_q,,$$
                  we evaluate this expression at $x:=tau$ to get
                  $$s_tau=-1text{ for every }tauinmathbb{F}_q,.$$
                  This shows that
                  $$frac{1}{x^q-x}=f(x)=-sum_{tinmathbb{F}_q},frac{1}{x-t},.$$







                  share|cite|improve this answer














                  share|cite|improve this answer



                  share|cite|improve this answer








                  edited Dec 4 '18 at 15:29

























                  answered Dec 4 '18 at 14:59









                  BatominovskiBatominovski

                  1




                  1






























                      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%2f3025671%2fpresent-frac1xp-x-as-a-sum-of-simple-fractions-in-mathbbz-p%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

                      Le Mesnil-Réaume

                      Ida-Boy-Ed-Garten

                      web3.py web3.isConnected() returns false always