Taylor Series for $f(z)=frac{z}{2}+frac{z}{e^z-1}$.












3












$begingroup$


The question reads as follows:




Let the function $f$ be given by $f(z)=frac{z}{2}+frac{z}{e^z-1}$ if
$zneq0$ and $f(z)=1$ if $z=0$. Show that $f$ is analytic at $z=0$ and
that $f(z)=f(-z)$. Deduce that there is a Taylor series
$f(z)=a_0+a_2x^2+a_4x^4+...$ valid for $|z|<2pi$. Find $a_0,a_2,a_4$.




Clearly the function is analytic at $z=0$, and $f(z)$ is even for all $z$. Now, the singularities occur where $z=2nipi$ where $ninmathbb{Z}$. Given $|z|<2pi$, we have that $f(z)$ is analytic within this disk. Hence a Taylor series exists for $f(z)$ such that $z_0=0$. Thus $f(z)=a_0+a_1z+a_2x^2+a_3z^3+a_4x^4+....$ in $|z|<2pi$ where $a_n=frac{f^{n}(0)}{n!}$ where $ninmathbb{Z^+}$.



Since $f(z)$ is even this implies that only the even powers exist. Thus $f(z)=a_0+a_2x^2+a_4x^4+...$. I am having trouble finding the coefficients, $a_0,a_2,a_4$.



Thank you in advanced for you help.










share|cite|improve this question











$endgroup$

















    3












    $begingroup$


    The question reads as follows:




    Let the function $f$ be given by $f(z)=frac{z}{2}+frac{z}{e^z-1}$ if
    $zneq0$ and $f(z)=1$ if $z=0$. Show that $f$ is analytic at $z=0$ and
    that $f(z)=f(-z)$. Deduce that there is a Taylor series
    $f(z)=a_0+a_2x^2+a_4x^4+...$ valid for $|z|<2pi$. Find $a_0,a_2,a_4$.




    Clearly the function is analytic at $z=0$, and $f(z)$ is even for all $z$. Now, the singularities occur where $z=2nipi$ where $ninmathbb{Z}$. Given $|z|<2pi$, we have that $f(z)$ is analytic within this disk. Hence a Taylor series exists for $f(z)$ such that $z_0=0$. Thus $f(z)=a_0+a_1z+a_2x^2+a_3z^3+a_4x^4+....$ in $|z|<2pi$ where $a_n=frac{f^{n}(0)}{n!}$ where $ninmathbb{Z^+}$.



    Since $f(z)$ is even this implies that only the even powers exist. Thus $f(z)=a_0+a_2x^2+a_4x^4+...$. I am having trouble finding the coefficients, $a_0,a_2,a_4$.



    Thank you in advanced for you help.










    share|cite|improve this question











    $endgroup$















      3












      3








      3





      $begingroup$


      The question reads as follows:




      Let the function $f$ be given by $f(z)=frac{z}{2}+frac{z}{e^z-1}$ if
      $zneq0$ and $f(z)=1$ if $z=0$. Show that $f$ is analytic at $z=0$ and
      that $f(z)=f(-z)$. Deduce that there is a Taylor series
      $f(z)=a_0+a_2x^2+a_4x^4+...$ valid for $|z|<2pi$. Find $a_0,a_2,a_4$.




      Clearly the function is analytic at $z=0$, and $f(z)$ is even for all $z$. Now, the singularities occur where $z=2nipi$ where $ninmathbb{Z}$. Given $|z|<2pi$, we have that $f(z)$ is analytic within this disk. Hence a Taylor series exists for $f(z)$ such that $z_0=0$. Thus $f(z)=a_0+a_1z+a_2x^2+a_3z^3+a_4x^4+....$ in $|z|<2pi$ where $a_n=frac{f^{n}(0)}{n!}$ where $ninmathbb{Z^+}$.



      Since $f(z)$ is even this implies that only the even powers exist. Thus $f(z)=a_0+a_2x^2+a_4x^4+...$. I am having trouble finding the coefficients, $a_0,a_2,a_4$.



      Thank you in advanced for you help.










      share|cite|improve this question











      $endgroup$




      The question reads as follows:




      Let the function $f$ be given by $f(z)=frac{z}{2}+frac{z}{e^z-1}$ if
      $zneq0$ and $f(z)=1$ if $z=0$. Show that $f$ is analytic at $z=0$ and
      that $f(z)=f(-z)$. Deduce that there is a Taylor series
      $f(z)=a_0+a_2x^2+a_4x^4+...$ valid for $|z|<2pi$. Find $a_0,a_2,a_4$.




      Clearly the function is analytic at $z=0$, and $f(z)$ is even for all $z$. Now, the singularities occur where $z=2nipi$ where $ninmathbb{Z}$. Given $|z|<2pi$, we have that $f(z)$ is analytic within this disk. Hence a Taylor series exists for $f(z)$ such that $z_0=0$. Thus $f(z)=a_0+a_1z+a_2x^2+a_3z^3+a_4x^4+....$ in $|z|<2pi$ where $a_n=frac{f^{n}(0)}{n!}$ where $ninmathbb{Z^+}$.



      Since $f(z)$ is even this implies that only the even powers exist. Thus $f(z)=a_0+a_2x^2+a_4x^4+...$. I am having trouble finding the coefficients, $a_0,a_2,a_4$.



      Thank you in advanced for you help.







      complex-analysis analysis power-series taylor-expansion






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Nov 26 '18 at 16:30









      Shaun

      8,932113681




      8,932113681










      asked Oct 9 '13 at 9:18









      Gustavo Louis G. MontańoGustavo Louis G. Montańo

      86511022




      86511022






















          1 Answer
          1






          active

          oldest

          votes


















          3












          $begingroup$

          To find the first terms of the Taylor series of $f$, there are various possibilities. One can simply differentiate the function and use $a_n = frac{1}{n!}f^{(n)}(0)$ to obtain the coefficients, but that soon becomes unwieldy. Still, for the coefficients up to order $4$, it's doable.



          Another standard way, when one has such a quotient, is to expand the numerator (trivial here) and the denominator, and divide both by a suitable power of $z$ times a constant, so that the denominator has the form $1 - h(z)$, and expand $frac{1}{1-h(z)}$ in a geometric series. That leads to (ignoring the $frac{z}{2}$ summand)



          $$begin{align}
          frac{z}{e^z-1} &= frac{z}{z + frac{z^2}{2} + frac{z^3}{6} + dotsb}\
          &= frac{1}{1 + left(frac{z}{2} + frac{z^2}{6} + dotsbright)}\
          &= 1 - left(frac{z}{2} + frac{z^2}{6} + dotsbright) + left(frac{z}{2} + frac{z^2}{6} + dotsbright)^2 - dotsb\
          &= 1 - frac{z}{2} +left(frac14 - frac16right)z^2 + dotsb\
          &= 1 - frac{z}{2} + frac{z^2}{12} + dotsb
          end{align}$$



          The coefficients $a_0$ and $a_2$ are found in this way without much computation, but finding $a_4$ involves some more computation. It's still not too hard.



          Yet another way is to multiply the unknown expansion with the known expansion of the denominator to obtain a recurrence for the coefficients:



          $$begin{align}
          z &= frac{z}{e^z-1}(e^z-1)\
          &= left(sum_{k=0}^infty frac{b_k}{k!}z^kright)cdotleft(sum_{m=1}^infty frac{z^m}{m!}right)\
          &= sum_{n=1}^infty left(sum_{k=0}^{n-1}frac{b_k}{k!(n-k)!}right)z^n\
          &= sum_{n=1}^infty left(sum_{k=0}^{n-1} binom{n}{k}b_kright)frac{z^n}{n!}.
          end{align}$$



          Equating the coefficients yields $1 = binom{1}{0}b_0$, so $b_0 = 1$, and for $n > 1$, the recurrence



          $$sum_{k=0}^{n-1}binom{n}{k}b_k = 0.tag{1}$$



          For $n = 2$, we obtain $0 = binom{2}{0}b_0 + binom{2}{1}b_1 = 1 + 2b_1$, so $b_1 = -frac12$. For $n = 3$, it becomes



          $$0 = binom{3}{0}b_0 + binom{3}{1}b_1 + binom{3}{2}b_2 = 1 - frac{3}{2} + 3b_2 Rightarrow b_2 = frac16.$$



          Note that we have $a_k = frac{b_k}{k!}$, so this agrees with the result above.



          Using the fact that $b_{2k+1} = 0$ for $k > 0$ by the evenness of $f$, we need not compute $b_3$ and further odd coefficients, which saves some work. Computing $a_4$ with the recurrence $(1)$ is then not much work.






          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%2f519963%2ftaylor-series-for-fz-fracz2-fraczez-1%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown

























            1 Answer
            1






            active

            oldest

            votes








            1 Answer
            1






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            3












            $begingroup$

            To find the first terms of the Taylor series of $f$, there are various possibilities. One can simply differentiate the function and use $a_n = frac{1}{n!}f^{(n)}(0)$ to obtain the coefficients, but that soon becomes unwieldy. Still, for the coefficients up to order $4$, it's doable.



            Another standard way, when one has such a quotient, is to expand the numerator (trivial here) and the denominator, and divide both by a suitable power of $z$ times a constant, so that the denominator has the form $1 - h(z)$, and expand $frac{1}{1-h(z)}$ in a geometric series. That leads to (ignoring the $frac{z}{2}$ summand)



            $$begin{align}
            frac{z}{e^z-1} &= frac{z}{z + frac{z^2}{2} + frac{z^3}{6} + dotsb}\
            &= frac{1}{1 + left(frac{z}{2} + frac{z^2}{6} + dotsbright)}\
            &= 1 - left(frac{z}{2} + frac{z^2}{6} + dotsbright) + left(frac{z}{2} + frac{z^2}{6} + dotsbright)^2 - dotsb\
            &= 1 - frac{z}{2} +left(frac14 - frac16right)z^2 + dotsb\
            &= 1 - frac{z}{2} + frac{z^2}{12} + dotsb
            end{align}$$



            The coefficients $a_0$ and $a_2$ are found in this way without much computation, but finding $a_4$ involves some more computation. It's still not too hard.



            Yet another way is to multiply the unknown expansion with the known expansion of the denominator to obtain a recurrence for the coefficients:



            $$begin{align}
            z &= frac{z}{e^z-1}(e^z-1)\
            &= left(sum_{k=0}^infty frac{b_k}{k!}z^kright)cdotleft(sum_{m=1}^infty frac{z^m}{m!}right)\
            &= sum_{n=1}^infty left(sum_{k=0}^{n-1}frac{b_k}{k!(n-k)!}right)z^n\
            &= sum_{n=1}^infty left(sum_{k=0}^{n-1} binom{n}{k}b_kright)frac{z^n}{n!}.
            end{align}$$



            Equating the coefficients yields $1 = binom{1}{0}b_0$, so $b_0 = 1$, and for $n > 1$, the recurrence



            $$sum_{k=0}^{n-1}binom{n}{k}b_k = 0.tag{1}$$



            For $n = 2$, we obtain $0 = binom{2}{0}b_0 + binom{2}{1}b_1 = 1 + 2b_1$, so $b_1 = -frac12$. For $n = 3$, it becomes



            $$0 = binom{3}{0}b_0 + binom{3}{1}b_1 + binom{3}{2}b_2 = 1 - frac{3}{2} + 3b_2 Rightarrow b_2 = frac16.$$



            Note that we have $a_k = frac{b_k}{k!}$, so this agrees with the result above.



            Using the fact that $b_{2k+1} = 0$ for $k > 0$ by the evenness of $f$, we need not compute $b_3$ and further odd coefficients, which saves some work. Computing $a_4$ with the recurrence $(1)$ is then not much work.






            share|cite|improve this answer









            $endgroup$


















              3












              $begingroup$

              To find the first terms of the Taylor series of $f$, there are various possibilities. One can simply differentiate the function and use $a_n = frac{1}{n!}f^{(n)}(0)$ to obtain the coefficients, but that soon becomes unwieldy. Still, for the coefficients up to order $4$, it's doable.



              Another standard way, when one has such a quotient, is to expand the numerator (trivial here) and the denominator, and divide both by a suitable power of $z$ times a constant, so that the denominator has the form $1 - h(z)$, and expand $frac{1}{1-h(z)}$ in a geometric series. That leads to (ignoring the $frac{z}{2}$ summand)



              $$begin{align}
              frac{z}{e^z-1} &= frac{z}{z + frac{z^2}{2} + frac{z^3}{6} + dotsb}\
              &= frac{1}{1 + left(frac{z}{2} + frac{z^2}{6} + dotsbright)}\
              &= 1 - left(frac{z}{2} + frac{z^2}{6} + dotsbright) + left(frac{z}{2} + frac{z^2}{6} + dotsbright)^2 - dotsb\
              &= 1 - frac{z}{2} +left(frac14 - frac16right)z^2 + dotsb\
              &= 1 - frac{z}{2} + frac{z^2}{12} + dotsb
              end{align}$$



              The coefficients $a_0$ and $a_2$ are found in this way without much computation, but finding $a_4$ involves some more computation. It's still not too hard.



              Yet another way is to multiply the unknown expansion with the known expansion of the denominator to obtain a recurrence for the coefficients:



              $$begin{align}
              z &= frac{z}{e^z-1}(e^z-1)\
              &= left(sum_{k=0}^infty frac{b_k}{k!}z^kright)cdotleft(sum_{m=1}^infty frac{z^m}{m!}right)\
              &= sum_{n=1}^infty left(sum_{k=0}^{n-1}frac{b_k}{k!(n-k)!}right)z^n\
              &= sum_{n=1}^infty left(sum_{k=0}^{n-1} binom{n}{k}b_kright)frac{z^n}{n!}.
              end{align}$$



              Equating the coefficients yields $1 = binom{1}{0}b_0$, so $b_0 = 1$, and for $n > 1$, the recurrence



              $$sum_{k=0}^{n-1}binom{n}{k}b_k = 0.tag{1}$$



              For $n = 2$, we obtain $0 = binom{2}{0}b_0 + binom{2}{1}b_1 = 1 + 2b_1$, so $b_1 = -frac12$. For $n = 3$, it becomes



              $$0 = binom{3}{0}b_0 + binom{3}{1}b_1 + binom{3}{2}b_2 = 1 - frac{3}{2} + 3b_2 Rightarrow b_2 = frac16.$$



              Note that we have $a_k = frac{b_k}{k!}$, so this agrees with the result above.



              Using the fact that $b_{2k+1} = 0$ for $k > 0$ by the evenness of $f$, we need not compute $b_3$ and further odd coefficients, which saves some work. Computing $a_4$ with the recurrence $(1)$ is then not much work.






              share|cite|improve this answer









              $endgroup$
















                3












                3








                3





                $begingroup$

                To find the first terms of the Taylor series of $f$, there are various possibilities. One can simply differentiate the function and use $a_n = frac{1}{n!}f^{(n)}(0)$ to obtain the coefficients, but that soon becomes unwieldy. Still, for the coefficients up to order $4$, it's doable.



                Another standard way, when one has such a quotient, is to expand the numerator (trivial here) and the denominator, and divide both by a suitable power of $z$ times a constant, so that the denominator has the form $1 - h(z)$, and expand $frac{1}{1-h(z)}$ in a geometric series. That leads to (ignoring the $frac{z}{2}$ summand)



                $$begin{align}
                frac{z}{e^z-1} &= frac{z}{z + frac{z^2}{2} + frac{z^3}{6} + dotsb}\
                &= frac{1}{1 + left(frac{z}{2} + frac{z^2}{6} + dotsbright)}\
                &= 1 - left(frac{z}{2} + frac{z^2}{6} + dotsbright) + left(frac{z}{2} + frac{z^2}{6} + dotsbright)^2 - dotsb\
                &= 1 - frac{z}{2} +left(frac14 - frac16right)z^2 + dotsb\
                &= 1 - frac{z}{2} + frac{z^2}{12} + dotsb
                end{align}$$



                The coefficients $a_0$ and $a_2$ are found in this way without much computation, but finding $a_4$ involves some more computation. It's still not too hard.



                Yet another way is to multiply the unknown expansion with the known expansion of the denominator to obtain a recurrence for the coefficients:



                $$begin{align}
                z &= frac{z}{e^z-1}(e^z-1)\
                &= left(sum_{k=0}^infty frac{b_k}{k!}z^kright)cdotleft(sum_{m=1}^infty frac{z^m}{m!}right)\
                &= sum_{n=1}^infty left(sum_{k=0}^{n-1}frac{b_k}{k!(n-k)!}right)z^n\
                &= sum_{n=1}^infty left(sum_{k=0}^{n-1} binom{n}{k}b_kright)frac{z^n}{n!}.
                end{align}$$



                Equating the coefficients yields $1 = binom{1}{0}b_0$, so $b_0 = 1$, and for $n > 1$, the recurrence



                $$sum_{k=0}^{n-1}binom{n}{k}b_k = 0.tag{1}$$



                For $n = 2$, we obtain $0 = binom{2}{0}b_0 + binom{2}{1}b_1 = 1 + 2b_1$, so $b_1 = -frac12$. For $n = 3$, it becomes



                $$0 = binom{3}{0}b_0 + binom{3}{1}b_1 + binom{3}{2}b_2 = 1 - frac{3}{2} + 3b_2 Rightarrow b_2 = frac16.$$



                Note that we have $a_k = frac{b_k}{k!}$, so this agrees with the result above.



                Using the fact that $b_{2k+1} = 0$ for $k > 0$ by the evenness of $f$, we need not compute $b_3$ and further odd coefficients, which saves some work. Computing $a_4$ with the recurrence $(1)$ is then not much work.






                share|cite|improve this answer









                $endgroup$



                To find the first terms of the Taylor series of $f$, there are various possibilities. One can simply differentiate the function and use $a_n = frac{1}{n!}f^{(n)}(0)$ to obtain the coefficients, but that soon becomes unwieldy. Still, for the coefficients up to order $4$, it's doable.



                Another standard way, when one has such a quotient, is to expand the numerator (trivial here) and the denominator, and divide both by a suitable power of $z$ times a constant, so that the denominator has the form $1 - h(z)$, and expand $frac{1}{1-h(z)}$ in a geometric series. That leads to (ignoring the $frac{z}{2}$ summand)



                $$begin{align}
                frac{z}{e^z-1} &= frac{z}{z + frac{z^2}{2} + frac{z^3}{6} + dotsb}\
                &= frac{1}{1 + left(frac{z}{2} + frac{z^2}{6} + dotsbright)}\
                &= 1 - left(frac{z}{2} + frac{z^2}{6} + dotsbright) + left(frac{z}{2} + frac{z^2}{6} + dotsbright)^2 - dotsb\
                &= 1 - frac{z}{2} +left(frac14 - frac16right)z^2 + dotsb\
                &= 1 - frac{z}{2} + frac{z^2}{12} + dotsb
                end{align}$$



                The coefficients $a_0$ and $a_2$ are found in this way without much computation, but finding $a_4$ involves some more computation. It's still not too hard.



                Yet another way is to multiply the unknown expansion with the known expansion of the denominator to obtain a recurrence for the coefficients:



                $$begin{align}
                z &= frac{z}{e^z-1}(e^z-1)\
                &= left(sum_{k=0}^infty frac{b_k}{k!}z^kright)cdotleft(sum_{m=1}^infty frac{z^m}{m!}right)\
                &= sum_{n=1}^infty left(sum_{k=0}^{n-1}frac{b_k}{k!(n-k)!}right)z^n\
                &= sum_{n=1}^infty left(sum_{k=0}^{n-1} binom{n}{k}b_kright)frac{z^n}{n!}.
                end{align}$$



                Equating the coefficients yields $1 = binom{1}{0}b_0$, so $b_0 = 1$, and for $n > 1$, the recurrence



                $$sum_{k=0}^{n-1}binom{n}{k}b_k = 0.tag{1}$$



                For $n = 2$, we obtain $0 = binom{2}{0}b_0 + binom{2}{1}b_1 = 1 + 2b_1$, so $b_1 = -frac12$. For $n = 3$, it becomes



                $$0 = binom{3}{0}b_0 + binom{3}{1}b_1 + binom{3}{2}b_2 = 1 - frac{3}{2} + 3b_2 Rightarrow b_2 = frac16.$$



                Note that we have $a_k = frac{b_k}{k!}$, so this agrees with the result above.



                Using the fact that $b_{2k+1} = 0$ for $k > 0$ by the evenness of $f$, we need not compute $b_3$ and further odd coefficients, which saves some work. Computing $a_4$ with the recurrence $(1)$ is then not much work.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Oct 9 '13 at 12:20









                Daniel FischerDaniel Fischer

                173k16163285




                173k16163285






























                    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%2f519963%2ftaylor-series-for-fz-fracz2-fraczez-1%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

                    Biblatex bibliography style without URLs when DOI exists (in Overleaf with Zotero bibliography)

                    ComboBox Display Member on multiple fields

                    Is it possible to collect Nectar points via Trainline?