Skip to content

Extension of Solution

解的延拓 | Extension of Solution

For Cauchy problem

(1)dydx=f(x,y),y(x0)=y0.

it is clear that we are satisfied with the result of intervals in the previous chapter, especially when we have to shrink the interval of solution using Contraction Mapping Method.

So a naive idea is, can we use the Peano/Picard theorem repeatedly to extend the interval of parameter t? If so, in what cases can we extend it and to where can we extend?

Here comes the following theorem.

解的延拓定理 | Theorem of extension of solution

Assume f(x,y)C(G), where G is an open set(region). Then the solution of Cauchy problem 1 can extend to its boundary.

The proof is equivalent to prove that, for each closed set G1G and (x0,y0)G1, the solution Γ can extend to G \ G1.

We only consider positive extension, i.e. xx0.

Consider closed region G1G that has point (x0,y0) with the solution denoted by φ(x) that satisfies initial condition y(x0)=y0.

  • Use the property of Open Set.

Because G is an open set, the distance between G and G1 can not be zero, that is, δ0>0., s.t.

{(x,y):|xa|<δ0,|yb|<δ0,(a,b)G1}G

Here δ0 is a constaint condition that guarantees the extended interval of solution will not exceed the boundary of G1.

  • Using δ0 to generate extended intervals with length δ

For any closed region G1G, Denote

M=max(x,y)G1|f(xy)|+1<,Rδ0(x,y)={(x,y):|xx|δ0,|yy|δ0}

where (x,y)G1.

For Cauchy problem with initial condition y(x0)=y0 in region Rδ0(x0,y0), according to Peano Theorem, we can have a solution φ0(x) on interval [x0δ,x0+δ], where δ=min{δ0,δ0/M}. If there exists point on the curve (x,φ0(x))G\G1, then we prove it.

If not, then the furthest point on the right (x0+δ,φ0(x0+δ)) must be in G1. So consider cauchy problem with initial condition y(x0+δ)=φ0(x0+δ) in region Rδ0(x0+δ,φ0(x0+δ)), according to Peano Theorem, we can get another solution φ1(x) on interval x0,x0+2δ.

Repeat the above procedure, we can say the interval can be extended to [x0,x0+nδ]. If we denote the distance between (x0,y0) and G1 as D1, distance between (x0,y0) and G as D, then choose n such that nδ>D1 and in the same time nδ<D.

And we are done.