## Return to Answer

2 added 90 characters in body

The Picard-Lindelof Theorem is not quite correctly stated in your question. Recall that it is usually referred to as the LOCAL existence and uniqueness theorem, and it only guarantees a solution on a certain maximal interval [0,T). It 0,T), and for as simple a system as $x'=x^2$ the maximal existence time T is finite. That said, it is correct (with caveats) that the Euler method approximating solutions will converge to this "true" solution at all points of this maximal interval. The detailed story, with all the error estimates, is too complicated to state here, but you can find a careful discussion of this not only for Euler's Method, but also for a number of other methods, in Chapter 5 (Numerical Methods) of the book Differential Equations, Mechanics, and Computation (which I wrote together with my son Bob). There is a website for the book at http://ode-math.com where you can download for free more than half the book. In particular clicking here:

http://ode-math.com/PDF_Files/ChapterFirstPages/First38PagesOFChapter5.pdf

will download the first 38 pages of chapter 5, where starting on page 144 you will find a careful discussion of the rate of convergence and stability properties etc, for Euler's method, starting from scratch.

1

The Picard-Lindelof Theorem is not quite correctly stated in your question. Recall that it is usually referred to as the LOCAL existence and uniqueness theorem, and it only guarantees a solution on a certain maximal interval [0,T). It is correct (with caveats) that the Euler method approximating solutions will converge to this "true" solution at all points of this maximal interval. The detailed story, with all the error estimates, is too complicated to state here, but you can find a careful discussion of this not only for Euler's Method, but also for a number of other methods, in Chapter 5 (Numerical Methods) of the book Differential Equations, Mechanics, and Computation (which I wrote together with my son Bob). There is a website for the book at http://ode-math.com where you can download for free more than half the book. In particular clicking here:

http://ode-math.com/PDF_Files/ChapterFirstPages/First38PagesOFChapter5.pdf

will download the first 38 pages of chapter 5, where starting on page 144 you will find a careful discussion of the rate of convergence and stability properties etc, for Euler's method, starting from scratch.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9072791337966919, "perplexity_flag": "head"}