Proof of Peano's existence theorem for ODE using Picard iterations












0












$begingroup$


I am curious why one does not use the standard Picard iteration scheme in order to prove the Cauchy--Peano existence theorem for ODE. This seems to give a relatively easy proof, as one can easily show by induction that the sequence of Picard iterates is uniformly bounded and equicontinuous on some compact set.



All other proofs seem to use the Tonelli sequence, which is more complicated. So I am wondering whether I have missed something...



thanks!










share|cite|improve this question









$endgroup$

















    0












    $begingroup$


    I am curious why one does not use the standard Picard iteration scheme in order to prove the Cauchy--Peano existence theorem for ODE. This seems to give a relatively easy proof, as one can easily show by induction that the sequence of Picard iterates is uniformly bounded and equicontinuous on some compact set.



    All other proofs seem to use the Tonelli sequence, which is more complicated. So I am wondering whether I have missed something...



    thanks!










    share|cite|improve this question









    $endgroup$















      0












      0








      0





      $begingroup$


      I am curious why one does not use the standard Picard iteration scheme in order to prove the Cauchy--Peano existence theorem for ODE. This seems to give a relatively easy proof, as one can easily show by induction that the sequence of Picard iterates is uniformly bounded and equicontinuous on some compact set.



      All other proofs seem to use the Tonelli sequence, which is more complicated. So I am wondering whether I have missed something...



      thanks!










      share|cite|improve this question









      $endgroup$




      I am curious why one does not use the standard Picard iteration scheme in order to prove the Cauchy--Peano existence theorem for ODE. This seems to give a relatively easy proof, as one can easily show by induction that the sequence of Picard iterates is uniformly bounded and equicontinuous on some compact set.



      All other proofs seem to use the Tonelli sequence, which is more complicated. So I am wondering whether I have missed something...



      thanks!







      ordinary-differential-equations






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Jan 26 at 21:30









      user638579user638579

      31




      31






















          1 Answer
          1






          active

          oldest

          votes


















          1












          $begingroup$

          Because the sequence of Picard iterations may have no subsequence converging to a solution. There are converging subsequences, but the limits may not be solutions. Let
          $$
          f(t,x)=begin{cases}2,t &text{if }xle0\
          -2,t & text{if }xge t^2\
          lambda(2,t)+(1-lambda)(-2,t)&text{if }0<x<t^2
          end{cases}
          $$

          where $lambdain(0,1)$ is such that $(t,x)=lambda(t,0)+(1-lambda)(t,t^2)$; $f$ is continuous. Consider the problem $x'=f(t,x)$, $x(0)=0$. It has a unique solution, since $f$ is decreasing in $x$ for each fixed $t$. The Picard iterations starting with $x(t)equiv0$ are $t^2,-t^2,t^2,-t^2,dots$ and neither $t^2$ nor $-t^2$ are solutions.



          This example is due to M. Müller, Uber das Fundamentaltheorem in der Theorie der gewöhnlichen Differentialgleichungen, Math. Zeit, 26, 1927. It appears in the book Ecuaciones diferenzciales ordinarias by Miguel de Guzmán, Alhambra 1975. It was widely used as a textbook in Spain when I was an undergraduate student.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            many thanks for your response! I was initially confused as to what I must have done wrong in my proof, but I realise now that it is the presence of the $u_{n_k-1}$ in the iteration scheme which cause the limit not to solve the equation, as your great example shows. A follow up question: do you know of weaker conditions than locally Lipshitz which ensures convergence of the Picard iterates?
            $endgroup$
            – user638579
            Jan 28 at 16:36












          • $begingroup$
            No, I am not aware of weaker conditions. This does not mean that they do not exist.
            $endgroup$
            – Julián Aguirre
            Jan 28 at 17:50











          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%2f3088782%2fproof-of-peanos-existence-theorem-for-ode-using-picard-iterations%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$

          Because the sequence of Picard iterations may have no subsequence converging to a solution. There are converging subsequences, but the limits may not be solutions. Let
          $$
          f(t,x)=begin{cases}2,t &text{if }xle0\
          -2,t & text{if }xge t^2\
          lambda(2,t)+(1-lambda)(-2,t)&text{if }0<x<t^2
          end{cases}
          $$

          where $lambdain(0,1)$ is such that $(t,x)=lambda(t,0)+(1-lambda)(t,t^2)$; $f$ is continuous. Consider the problem $x'=f(t,x)$, $x(0)=0$. It has a unique solution, since $f$ is decreasing in $x$ for each fixed $t$. The Picard iterations starting with $x(t)equiv0$ are $t^2,-t^2,t^2,-t^2,dots$ and neither $t^2$ nor $-t^2$ are solutions.



          This example is due to M. Müller, Uber das Fundamentaltheorem in der Theorie der gewöhnlichen Differentialgleichungen, Math. Zeit, 26, 1927. It appears in the book Ecuaciones diferenzciales ordinarias by Miguel de Guzmán, Alhambra 1975. It was widely used as a textbook in Spain when I was an undergraduate student.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            many thanks for your response! I was initially confused as to what I must have done wrong in my proof, but I realise now that it is the presence of the $u_{n_k-1}$ in the iteration scheme which cause the limit not to solve the equation, as your great example shows. A follow up question: do you know of weaker conditions than locally Lipshitz which ensures convergence of the Picard iterates?
            $endgroup$
            – user638579
            Jan 28 at 16:36












          • $begingroup$
            No, I am not aware of weaker conditions. This does not mean that they do not exist.
            $endgroup$
            – Julián Aguirre
            Jan 28 at 17:50
















          1












          $begingroup$

          Because the sequence of Picard iterations may have no subsequence converging to a solution. There are converging subsequences, but the limits may not be solutions. Let
          $$
          f(t,x)=begin{cases}2,t &text{if }xle0\
          -2,t & text{if }xge t^2\
          lambda(2,t)+(1-lambda)(-2,t)&text{if }0<x<t^2
          end{cases}
          $$

          where $lambdain(0,1)$ is such that $(t,x)=lambda(t,0)+(1-lambda)(t,t^2)$; $f$ is continuous. Consider the problem $x'=f(t,x)$, $x(0)=0$. It has a unique solution, since $f$ is decreasing in $x$ for each fixed $t$. The Picard iterations starting with $x(t)equiv0$ are $t^2,-t^2,t^2,-t^2,dots$ and neither $t^2$ nor $-t^2$ are solutions.



          This example is due to M. Müller, Uber das Fundamentaltheorem in der Theorie der gewöhnlichen Differentialgleichungen, Math. Zeit, 26, 1927. It appears in the book Ecuaciones diferenzciales ordinarias by Miguel de Guzmán, Alhambra 1975. It was widely used as a textbook in Spain when I was an undergraduate student.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            many thanks for your response! I was initially confused as to what I must have done wrong in my proof, but I realise now that it is the presence of the $u_{n_k-1}$ in the iteration scheme which cause the limit not to solve the equation, as your great example shows. A follow up question: do you know of weaker conditions than locally Lipshitz which ensures convergence of the Picard iterates?
            $endgroup$
            – user638579
            Jan 28 at 16:36












          • $begingroup$
            No, I am not aware of weaker conditions. This does not mean that they do not exist.
            $endgroup$
            – Julián Aguirre
            Jan 28 at 17:50














          1












          1








          1





          $begingroup$

          Because the sequence of Picard iterations may have no subsequence converging to a solution. There are converging subsequences, but the limits may not be solutions. Let
          $$
          f(t,x)=begin{cases}2,t &text{if }xle0\
          -2,t & text{if }xge t^2\
          lambda(2,t)+(1-lambda)(-2,t)&text{if }0<x<t^2
          end{cases}
          $$

          where $lambdain(0,1)$ is such that $(t,x)=lambda(t,0)+(1-lambda)(t,t^2)$; $f$ is continuous. Consider the problem $x'=f(t,x)$, $x(0)=0$. It has a unique solution, since $f$ is decreasing in $x$ for each fixed $t$. The Picard iterations starting with $x(t)equiv0$ are $t^2,-t^2,t^2,-t^2,dots$ and neither $t^2$ nor $-t^2$ are solutions.



          This example is due to M. Müller, Uber das Fundamentaltheorem in der Theorie der gewöhnlichen Differentialgleichungen, Math. Zeit, 26, 1927. It appears in the book Ecuaciones diferenzciales ordinarias by Miguel de Guzmán, Alhambra 1975. It was widely used as a textbook in Spain when I was an undergraduate student.






          share|cite|improve this answer









          $endgroup$



          Because the sequence of Picard iterations may have no subsequence converging to a solution. There are converging subsequences, but the limits may not be solutions. Let
          $$
          f(t,x)=begin{cases}2,t &text{if }xle0\
          -2,t & text{if }xge t^2\
          lambda(2,t)+(1-lambda)(-2,t)&text{if }0<x<t^2
          end{cases}
          $$

          where $lambdain(0,1)$ is such that $(t,x)=lambda(t,0)+(1-lambda)(t,t^2)$; $f$ is continuous. Consider the problem $x'=f(t,x)$, $x(0)=0$. It has a unique solution, since $f$ is decreasing in $x$ for each fixed $t$. The Picard iterations starting with $x(t)equiv0$ are $t^2,-t^2,t^2,-t^2,dots$ and neither $t^2$ nor $-t^2$ are solutions.



          This example is due to M. Müller, Uber das Fundamentaltheorem in der Theorie der gewöhnlichen Differentialgleichungen, Math. Zeit, 26, 1927. It appears in the book Ecuaciones diferenzciales ordinarias by Miguel de Guzmán, Alhambra 1975. It was widely used as a textbook in Spain when I was an undergraduate student.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Jan 27 at 16:55









          Julián AguirreJulián Aguirre

          69.4k24197




          69.4k24197












          • $begingroup$
            many thanks for your response! I was initially confused as to what I must have done wrong in my proof, but I realise now that it is the presence of the $u_{n_k-1}$ in the iteration scheme which cause the limit not to solve the equation, as your great example shows. A follow up question: do you know of weaker conditions than locally Lipshitz which ensures convergence of the Picard iterates?
            $endgroup$
            – user638579
            Jan 28 at 16:36












          • $begingroup$
            No, I am not aware of weaker conditions. This does not mean that they do not exist.
            $endgroup$
            – Julián Aguirre
            Jan 28 at 17:50


















          • $begingroup$
            many thanks for your response! I was initially confused as to what I must have done wrong in my proof, but I realise now that it is the presence of the $u_{n_k-1}$ in the iteration scheme which cause the limit not to solve the equation, as your great example shows. A follow up question: do you know of weaker conditions than locally Lipshitz which ensures convergence of the Picard iterates?
            $endgroup$
            – user638579
            Jan 28 at 16:36












          • $begingroup$
            No, I am not aware of weaker conditions. This does not mean that they do not exist.
            $endgroup$
            – Julián Aguirre
            Jan 28 at 17:50
















          $begingroup$
          many thanks for your response! I was initially confused as to what I must have done wrong in my proof, but I realise now that it is the presence of the $u_{n_k-1}$ in the iteration scheme which cause the limit not to solve the equation, as your great example shows. A follow up question: do you know of weaker conditions than locally Lipshitz which ensures convergence of the Picard iterates?
          $endgroup$
          – user638579
          Jan 28 at 16:36






          $begingroup$
          many thanks for your response! I was initially confused as to what I must have done wrong in my proof, but I realise now that it is the presence of the $u_{n_k-1}$ in the iteration scheme which cause the limit not to solve the equation, as your great example shows. A follow up question: do you know of weaker conditions than locally Lipshitz which ensures convergence of the Picard iterates?
          $endgroup$
          – user638579
          Jan 28 at 16:36














          $begingroup$
          No, I am not aware of weaker conditions. This does not mean that they do not exist.
          $endgroup$
          – Julián Aguirre
          Jan 28 at 17:50




          $begingroup$
          No, I am not aware of weaker conditions. This does not mean that they do not exist.
          $endgroup$
          – Julián Aguirre
          Jan 28 at 17:50


















          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%2f3088782%2fproof-of-peanos-existence-theorem-for-ode-using-picard-iterations%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

          MongoDB - Not Authorized To Execute Command

          How to fix TextFormField cause rebuild widget in Flutter

          in spring boot 2.1 many test slices are not allowed anymore due to multiple @BootstrapWith