21.04.2015 Views

Lecture Notes in Differential Equations - Bruce E. Shapiro

Lecture Notes in Differential Equations - Bruce E. Shapiro

Lecture Notes in Differential Equations - Bruce E. Shapiro

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Lesson 12<br />

Existence of Solutions*<br />

In this section we will prove the fundamental existence theorem. We will<br />

defer the proof of the uniqueness until section 13. S<strong>in</strong>ce we will prove<br />

the theorem us<strong>in</strong>g the method of successive approximations, the follow<strong>in</strong>g<br />

statement of the fundamental existence theorem is really just a re-word<strong>in</strong>g<br />

of theorem 11.2 with the references to uniqueness and Picard iteration<br />

removed. By prov<strong>in</strong>g that the Picard iterations converge to the solution, we<br />

will, <strong>in</strong> effect, be prov<strong>in</strong>g that a solution exists, which is why the reference<br />

to Picard iteration is removed.<br />

Theorem 12.1 (Fundamental Existence Theorem). Suppose that<br />

f(t, y) and ∂f(t, y)/∂y are cont<strong>in</strong>uous <strong>in</strong> some rectangle R def<strong>in</strong>ed by<br />

Then the <strong>in</strong>itial value problem<br />

t 0 − a ≤ t ≤ t 0 + a (12.1)<br />

y 0 − b ≤ y ≤ y 0 + b (12.2)<br />

⎫<br />

dy<br />

= f(t, y) ⎬<br />

dt<br />

⎭<br />

y(t 0 ) = y 0<br />

(12.3)<br />

has a solution <strong>in</strong> some <strong>in</strong>terval<br />

t 0 − a ≤ t 0 − h ≤ t ≤ t 0 + h ≤ t 0 + a (12.4)<br />

∗ Most of the material <strong>in</strong> this section can be omitted without loss of cont<strong>in</strong>uity with<br />

the rema<strong>in</strong>der of the notes. Students should nevertheless familiarize themselves with the<br />

statement of theorem 12.1.<br />

99

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!