Let Ψ be a consistent one-step method
Assume increment function ψ is Lipschitz continuous with respect to y
So exists positive constant Lψ such that
∣∣ψ(x,y,h,f)−ψ(x,z,h,f)∣∣≤Lψ∣∣y−z∣∣ for (x,y),(x,z) in R
for all 0≤h≤h0 and for the same R from Picard’s Theorem
Then assuming (xn,yn) remains R then
e≤(Lψexp(Lψ(xN−x0))−1)n=0,⋯,N−1max∣∣τ(xn,yn,h,f)∣∣
For generic n∈{1,⋯,N−1}
en+1=∣∣y(xn+1)−yn+1∣∣=∣∣y(xn+1)−Ψ(xn,yn,h,f)∣∣=∣∣y(xn+1)−Ψ(xn,y(xn),h,f)+Ψ(xn,y(xn),h,f)−Ψ(xn,yn,h,f)∣∣≤∣∣y(xn+1)−Ψ(xn,y(xn),h,f)∣∣+∣∣Ψ(xn,y(xn),h,f)−Ψ(xn,yn,h,f)∣∣=h∣∣τ(xn,y(xn),h,f)∣∣+∣∣(y(xn)+hψ(x,y(xn),h,f))−(yn+hψ(x,yn,h,f))∣∣≤h∣∣τ(xn,y(xn),h,f)∣∣+∣∣y(xn)−yn∣∣+h∣∣ψ(x,y(xn),h,f)−ψ(x,yn,h,f)∣∣=h∣∣τ(xn,y(xn),h,f)∣∣+en+h∣∣ψ(x,y(xn),h,f)−ψ(x,yn,h,f)∣∣≤h∣∣τ(xn,y(xn),h,f)∣∣+en+hLψ∣∣y(xn)−yn∣∣,=h∣∣τ(xn,y(xn),h,f)∣∣+(1+hLψ)en
Iterating recursively then implying (with e0=0)
en+1≤(1+hLψ)n+1e0+hk=0∑n(1+hLψ)km=0,⋯,nmax∣∣τ(xm,y(xm),h,f)∣∣=Lψ(1+hLψ)n+1−1m=0,⋅,snmax∣∣τ(xm,y(xm),h,f)∣∣
And as 1+hLψ≤exphLψ then result follows