Series Solution to Legendre Equation












0












$begingroup$


My professor taught us the series solution to ODE's method today in class, and one of our homework problems was to solve the Legendre Equation.



$$text{Legendre Equation:} frac{d^2y}{dx^2}(1-x^2) -2xfrac{dy}{dx} + alpha(alpha + 1)y = 0$$



By making a series expansion at $k = 0$:



$$y = sum_{k=0}^infty{a_nx^n}$$ $$y' = sum_{k=0}^infty{na_nx^{n-1}} $$ $$ y'' = sum_{k=0}^infty{n(n-1)a_nx^{n-2}}$$ Plugging in:
$$sum_{k=0}^infty{n(n-1)a_nx^{n-2}}(1-x^2) -2xsum_{k=0}^infty{na_nx^{n-1}} + alpha(alpha + 1)sum_{k=0}^infty{a_nx^n} = 0$$ $$sum_{n=0}^infty{n(n-1)a_nx^{n-2}}-sum_{n=0}^infty{n(n-1)a_nx^n} -2xsum_{n=0}^infty{na_nx^{n-1}}+alpha(alpha+1)sum_{n=0}^infty{a_nx^n}=0 $$



$$sum_{n=0}^infty{n(n-1)a_nx^{n-2}}-sum_{n=0}^infty{n(n-1)a_nx^n} -2sum_{n=0}^infty{na_nx^{n}}+alpha(alpha+1)sum_{n=0}^infty{a_nx^n}=0$$



$$sum_{n=0}^infty{(n+2)(n+1)a_{n+2}x^{n}}-sum_{n=0}^infty{n(n-1)a_nx^n} -2sum_{n=0}^infty{na_nx^{n}}+alpha(alpha+1)sum_{n=0}^infty{a_nx^n}=0$$



$$
sum_{n=0}^infty{(n+1)(n+2)a_{n+2}+[-n(n-1)-2n+alpha(alpha+1)]a_n}=0, $$



Each term must cancel so: $$(n+1)(n+2)a_{n+2} + [-n(n+1) + alpha(alpha +1)]a_n = 0$$



$$a_{n+2} = frac{n(n+1)-alpha(alpha+1)}{(n+1)(n+2)}a_n$$
$$ = frac{[alpha + (n+1)](alpha -n)}{(n+1)(n+2)}$$



Therefore:
$$a_2 = frac{-alpha(alpha+1)}{1·2}a_0 $$ $$a_4 = -frac{(alpha-2)(alpha+3)}{3·4}a_2$$ $$ a_4= (-1)^2frac{[(alpha-2)alpha][(alpha+1)(alpha+3)]}{1·2·3·4}a_0$$



So the even solution is: $$
y_1(x)=1+sum_{n=1}^infty{(-1)^nfrac{[(alpha-2n+2)...(alpha-2)alpha][(alpha+1)(alpha+3)...(alpha+2n-1)]}{(2n)!}x^{2n}}. $$
Then, the odd solution is: $$
y_2(x)=x+sum_{n=1}^infty{(-1)^nfrac{[(alpha-2n+1)...(alpha-3)(alpha-1)][(alpha+2)(alpha+4)...(alpha+2n)]}{(2n+1)!}x^{2n+1}}. $$



Does this look right? This is my first attempt at the series solution method, so I would really appreciate any help. Thanks in advance!










share|cite|improve this question











$endgroup$

















    0












    $begingroup$


    My professor taught us the series solution to ODE's method today in class, and one of our homework problems was to solve the Legendre Equation.



    $$text{Legendre Equation:} frac{d^2y}{dx^2}(1-x^2) -2xfrac{dy}{dx} + alpha(alpha + 1)y = 0$$



    By making a series expansion at $k = 0$:



    $$y = sum_{k=0}^infty{a_nx^n}$$ $$y' = sum_{k=0}^infty{na_nx^{n-1}} $$ $$ y'' = sum_{k=0}^infty{n(n-1)a_nx^{n-2}}$$ Plugging in:
    $$sum_{k=0}^infty{n(n-1)a_nx^{n-2}}(1-x^2) -2xsum_{k=0}^infty{na_nx^{n-1}} + alpha(alpha + 1)sum_{k=0}^infty{a_nx^n} = 0$$ $$sum_{n=0}^infty{n(n-1)a_nx^{n-2}}-sum_{n=0}^infty{n(n-1)a_nx^n} -2xsum_{n=0}^infty{na_nx^{n-1}}+alpha(alpha+1)sum_{n=0}^infty{a_nx^n}=0 $$



    $$sum_{n=0}^infty{n(n-1)a_nx^{n-2}}-sum_{n=0}^infty{n(n-1)a_nx^n} -2sum_{n=0}^infty{na_nx^{n}}+alpha(alpha+1)sum_{n=0}^infty{a_nx^n}=0$$



    $$sum_{n=0}^infty{(n+2)(n+1)a_{n+2}x^{n}}-sum_{n=0}^infty{n(n-1)a_nx^n} -2sum_{n=0}^infty{na_nx^{n}}+alpha(alpha+1)sum_{n=0}^infty{a_nx^n}=0$$



    $$
    sum_{n=0}^infty{(n+1)(n+2)a_{n+2}+[-n(n-1)-2n+alpha(alpha+1)]a_n}=0, $$



    Each term must cancel so: $$(n+1)(n+2)a_{n+2} + [-n(n+1) + alpha(alpha +1)]a_n = 0$$



    $$a_{n+2} = frac{n(n+1)-alpha(alpha+1)}{(n+1)(n+2)}a_n$$
    $$ = frac{[alpha + (n+1)](alpha -n)}{(n+1)(n+2)}$$



    Therefore:
    $$a_2 = frac{-alpha(alpha+1)}{1·2}a_0 $$ $$a_4 = -frac{(alpha-2)(alpha+3)}{3·4}a_2$$ $$ a_4= (-1)^2frac{[(alpha-2)alpha][(alpha+1)(alpha+3)]}{1·2·3·4}a_0$$



    So the even solution is: $$
    y_1(x)=1+sum_{n=1}^infty{(-1)^nfrac{[(alpha-2n+2)...(alpha-2)alpha][(alpha+1)(alpha+3)...(alpha+2n-1)]}{(2n)!}x^{2n}}. $$
    Then, the odd solution is: $$
    y_2(x)=x+sum_{n=1}^infty{(-1)^nfrac{[(alpha-2n+1)...(alpha-3)(alpha-1)][(alpha+2)(alpha+4)...(alpha+2n)]}{(2n+1)!}x^{2n+1}}. $$



    Does this look right? This is my first attempt at the series solution method, so I would really appreciate any help. Thanks in advance!










    share|cite|improve this question











    $endgroup$















      0












      0








      0





      $begingroup$


      My professor taught us the series solution to ODE's method today in class, and one of our homework problems was to solve the Legendre Equation.



      $$text{Legendre Equation:} frac{d^2y}{dx^2}(1-x^2) -2xfrac{dy}{dx} + alpha(alpha + 1)y = 0$$



      By making a series expansion at $k = 0$:



      $$y = sum_{k=0}^infty{a_nx^n}$$ $$y' = sum_{k=0}^infty{na_nx^{n-1}} $$ $$ y'' = sum_{k=0}^infty{n(n-1)a_nx^{n-2}}$$ Plugging in:
      $$sum_{k=0}^infty{n(n-1)a_nx^{n-2}}(1-x^2) -2xsum_{k=0}^infty{na_nx^{n-1}} + alpha(alpha + 1)sum_{k=0}^infty{a_nx^n} = 0$$ $$sum_{n=0}^infty{n(n-1)a_nx^{n-2}}-sum_{n=0}^infty{n(n-1)a_nx^n} -2xsum_{n=0}^infty{na_nx^{n-1}}+alpha(alpha+1)sum_{n=0}^infty{a_nx^n}=0 $$



      $$sum_{n=0}^infty{n(n-1)a_nx^{n-2}}-sum_{n=0}^infty{n(n-1)a_nx^n} -2sum_{n=0}^infty{na_nx^{n}}+alpha(alpha+1)sum_{n=0}^infty{a_nx^n}=0$$



      $$sum_{n=0}^infty{(n+2)(n+1)a_{n+2}x^{n}}-sum_{n=0}^infty{n(n-1)a_nx^n} -2sum_{n=0}^infty{na_nx^{n}}+alpha(alpha+1)sum_{n=0}^infty{a_nx^n}=0$$



      $$
      sum_{n=0}^infty{(n+1)(n+2)a_{n+2}+[-n(n-1)-2n+alpha(alpha+1)]a_n}=0, $$



      Each term must cancel so: $$(n+1)(n+2)a_{n+2} + [-n(n+1) + alpha(alpha +1)]a_n = 0$$



      $$a_{n+2} = frac{n(n+1)-alpha(alpha+1)}{(n+1)(n+2)}a_n$$
      $$ = frac{[alpha + (n+1)](alpha -n)}{(n+1)(n+2)}$$



      Therefore:
      $$a_2 = frac{-alpha(alpha+1)}{1·2}a_0 $$ $$a_4 = -frac{(alpha-2)(alpha+3)}{3·4}a_2$$ $$ a_4= (-1)^2frac{[(alpha-2)alpha][(alpha+1)(alpha+3)]}{1·2·3·4}a_0$$



      So the even solution is: $$
      y_1(x)=1+sum_{n=1}^infty{(-1)^nfrac{[(alpha-2n+2)...(alpha-2)alpha][(alpha+1)(alpha+3)...(alpha+2n-1)]}{(2n)!}x^{2n}}. $$
      Then, the odd solution is: $$
      y_2(x)=x+sum_{n=1}^infty{(-1)^nfrac{[(alpha-2n+1)...(alpha-3)(alpha-1)][(alpha+2)(alpha+4)...(alpha+2n)]}{(2n+1)!}x^{2n+1}}. $$



      Does this look right? This is my first attempt at the series solution method, so I would really appreciate any help. Thanks in advance!










      share|cite|improve this question











      $endgroup$




      My professor taught us the series solution to ODE's method today in class, and one of our homework problems was to solve the Legendre Equation.



      $$text{Legendre Equation:} frac{d^2y}{dx^2}(1-x^2) -2xfrac{dy}{dx} + alpha(alpha + 1)y = 0$$



      By making a series expansion at $k = 0$:



      $$y = sum_{k=0}^infty{a_nx^n}$$ $$y' = sum_{k=0}^infty{na_nx^{n-1}} $$ $$ y'' = sum_{k=0}^infty{n(n-1)a_nx^{n-2}}$$ Plugging in:
      $$sum_{k=0}^infty{n(n-1)a_nx^{n-2}}(1-x^2) -2xsum_{k=0}^infty{na_nx^{n-1}} + alpha(alpha + 1)sum_{k=0}^infty{a_nx^n} = 0$$ $$sum_{n=0}^infty{n(n-1)a_nx^{n-2}}-sum_{n=0}^infty{n(n-1)a_nx^n} -2xsum_{n=0}^infty{na_nx^{n-1}}+alpha(alpha+1)sum_{n=0}^infty{a_nx^n}=0 $$



      $$sum_{n=0}^infty{n(n-1)a_nx^{n-2}}-sum_{n=0}^infty{n(n-1)a_nx^n} -2sum_{n=0}^infty{na_nx^{n}}+alpha(alpha+1)sum_{n=0}^infty{a_nx^n}=0$$



      $$sum_{n=0}^infty{(n+2)(n+1)a_{n+2}x^{n}}-sum_{n=0}^infty{n(n-1)a_nx^n} -2sum_{n=0}^infty{na_nx^{n}}+alpha(alpha+1)sum_{n=0}^infty{a_nx^n}=0$$



      $$
      sum_{n=0}^infty{(n+1)(n+2)a_{n+2}+[-n(n-1)-2n+alpha(alpha+1)]a_n}=0, $$



      Each term must cancel so: $$(n+1)(n+2)a_{n+2} + [-n(n+1) + alpha(alpha +1)]a_n = 0$$



      $$a_{n+2} = frac{n(n+1)-alpha(alpha+1)}{(n+1)(n+2)}a_n$$
      $$ = frac{[alpha + (n+1)](alpha -n)}{(n+1)(n+2)}$$



      Therefore:
      $$a_2 = frac{-alpha(alpha+1)}{1·2}a_0 $$ $$a_4 = -frac{(alpha-2)(alpha+3)}{3·4}a_2$$ $$ a_4= (-1)^2frac{[(alpha-2)alpha][(alpha+1)(alpha+3)]}{1·2·3·4}a_0$$



      So the even solution is: $$
      y_1(x)=1+sum_{n=1}^infty{(-1)^nfrac{[(alpha-2n+2)...(alpha-2)alpha][(alpha+1)(alpha+3)...(alpha+2n-1)]}{(2n)!}x^{2n}}. $$
      Then, the odd solution is: $$
      y_2(x)=x+sum_{n=1}^infty{(-1)^nfrac{[(alpha-2n+1)...(alpha-3)(alpha-1)][(alpha+2)(alpha+4)...(alpha+2n)]}{(2n+1)!}x^{2n+1}}. $$



      Does this look right? This is my first attempt at the series solution method, so I would really appreciate any help. Thanks in advance!







      sequences-and-series differential-equations proof-verification legendre-polynomials






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Jan 7 at 0:55







      Aniruddh Venkatesan

















      asked Jan 7 at 0:45









      Aniruddh VenkatesanAniruddh Venkatesan

      137110




      137110






















          1 Answer
          1






          active

          oldest

          votes


















          1












          $begingroup$

          I do not understand the concept of odd and even solutions.



          Since the equation is of second order, there will be two arbitraty constants $a_0$ and $a_1$.
          You properly established that
          $$a_{n+2} = frac{n(n+1)-alpha(alpha+1)}{(n+1)(n+2)}a_ntag 1$$ and to me, this is enough.



          The solution is then
          $$y=a_0+a_1x+sum_{n=2}^infty a_n x^n$$
          For sure, you could write it as
          $$y=a_0+a_1x+sum_{n=1}^infty a_{2n} x^{2n}+sum_{n=1}^infty a_{2n+1} x^{2n+1}$$ and using $(1)$ make the coefficients totally explicit solving the recurrence equation given by $(1)$.



          Even if this will look more elegant, it would not be very efficient from a computing point of view. You would have quite complex formulae (I wrote them) including gamma functions (as you wrote) that you will need to recompute every time while using the recurrence equation will make the evaluation very unexpensive.



          In any manner, you did a good job and $to +1$.






          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%2f3064558%2fseries-solution-to-legendre-equation%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









            1












            $begingroup$

            I do not understand the concept of odd and even solutions.



            Since the equation is of second order, there will be two arbitraty constants $a_0$ and $a_1$.
            You properly established that
            $$a_{n+2} = frac{n(n+1)-alpha(alpha+1)}{(n+1)(n+2)}a_ntag 1$$ and to me, this is enough.



            The solution is then
            $$y=a_0+a_1x+sum_{n=2}^infty a_n x^n$$
            For sure, you could write it as
            $$y=a_0+a_1x+sum_{n=1}^infty a_{2n} x^{2n}+sum_{n=1}^infty a_{2n+1} x^{2n+1}$$ and using $(1)$ make the coefficients totally explicit solving the recurrence equation given by $(1)$.



            Even if this will look more elegant, it would not be very efficient from a computing point of view. You would have quite complex formulae (I wrote them) including gamma functions (as you wrote) that you will need to recompute every time while using the recurrence equation will make the evaluation very unexpensive.



            In any manner, you did a good job and $to +1$.






            share|cite|improve this answer









            $endgroup$


















              1












              $begingroup$

              I do not understand the concept of odd and even solutions.



              Since the equation is of second order, there will be two arbitraty constants $a_0$ and $a_1$.
              You properly established that
              $$a_{n+2} = frac{n(n+1)-alpha(alpha+1)}{(n+1)(n+2)}a_ntag 1$$ and to me, this is enough.



              The solution is then
              $$y=a_0+a_1x+sum_{n=2}^infty a_n x^n$$
              For sure, you could write it as
              $$y=a_0+a_1x+sum_{n=1}^infty a_{2n} x^{2n}+sum_{n=1}^infty a_{2n+1} x^{2n+1}$$ and using $(1)$ make the coefficients totally explicit solving the recurrence equation given by $(1)$.



              Even if this will look more elegant, it would not be very efficient from a computing point of view. You would have quite complex formulae (I wrote them) including gamma functions (as you wrote) that you will need to recompute every time while using the recurrence equation will make the evaluation very unexpensive.



              In any manner, you did a good job and $to +1$.






              share|cite|improve this answer









              $endgroup$
















                1












                1








                1





                $begingroup$

                I do not understand the concept of odd and even solutions.



                Since the equation is of second order, there will be two arbitraty constants $a_0$ and $a_1$.
                You properly established that
                $$a_{n+2} = frac{n(n+1)-alpha(alpha+1)}{(n+1)(n+2)}a_ntag 1$$ and to me, this is enough.



                The solution is then
                $$y=a_0+a_1x+sum_{n=2}^infty a_n x^n$$
                For sure, you could write it as
                $$y=a_0+a_1x+sum_{n=1}^infty a_{2n} x^{2n}+sum_{n=1}^infty a_{2n+1} x^{2n+1}$$ and using $(1)$ make the coefficients totally explicit solving the recurrence equation given by $(1)$.



                Even if this will look more elegant, it would not be very efficient from a computing point of view. You would have quite complex formulae (I wrote them) including gamma functions (as you wrote) that you will need to recompute every time while using the recurrence equation will make the evaluation very unexpensive.



                In any manner, you did a good job and $to +1$.






                share|cite|improve this answer









                $endgroup$



                I do not understand the concept of odd and even solutions.



                Since the equation is of second order, there will be two arbitraty constants $a_0$ and $a_1$.
                You properly established that
                $$a_{n+2} = frac{n(n+1)-alpha(alpha+1)}{(n+1)(n+2)}a_ntag 1$$ and to me, this is enough.



                The solution is then
                $$y=a_0+a_1x+sum_{n=2}^infty a_n x^n$$
                For sure, you could write it as
                $$y=a_0+a_1x+sum_{n=1}^infty a_{2n} x^{2n}+sum_{n=1}^infty a_{2n+1} x^{2n+1}$$ and using $(1)$ make the coefficients totally explicit solving the recurrence equation given by $(1)$.



                Even if this will look more elegant, it would not be very efficient from a computing point of view. You would have quite complex formulae (I wrote them) including gamma functions (as you wrote) that you will need to recompute every time while using the recurrence equation will make the evaluation very unexpensive.



                In any manner, you did a good job and $to +1$.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Jan 7 at 5:16









                Claude LeiboviciClaude Leibovici

                119k1157132




                119k1157132






























                    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%2f3064558%2fseries-solution-to-legendre-equation%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

                    Mario Kart Wii

                    The Binding of Isaac: Rebirth/Afterbirth

                    What does “Dominus providebit” mean?