Theorem 3 (Fixed Point Theorem)

Theorem 3: Let [Maple Math] be a function which is continuous on [Maple Math] . Let [Maple Math] be an element of [Maple Math] for all [Maple Math] in the interval. Let the derivative of [Maple Math] exist on the open interval ( [Maple Math] ) with [Maple Math] and [Maple Math] , for all [Maple Math] in ( [Maple Math] ). Then, if [Maple Math] is any number in the interval [Maple Math] , the sequence defined by [Maple Math] , with [Maple Math] , converges to the unique fixed point [Maple Math] .

Proof:

By Theorem 2, a unique fixed point exits.

All elements in the sequence, [Maple Math] , lie in the interval [Maple Math]

Then

> expr:=abs(p[n]-p);

[Maple Math]

> expr=abs(g(p[n-1])-g(p));

[Maple Math]

> expr=abs(D(g)(zeta))*abs(p[n-1]-p);

[Maple Math]

> expr<=K*abs(p[n-1]-p);

[Maple Math]

with [Maple Math] a value in the interval [Maple Math] . Repeatedly applying this inequality yields

> expr<=K^n*abs(p[0]-p);

[Maple Math]

> lim(abs(p[n]-p),n=infinity)<=lim(K^n*abs(p[0]-p),n=infinity);

[Maple Math]

and thus

> lim(abs(p[n]-p),n=infinity)=0;

[Maple Math]

since [Maple Math] .

>

As a consequence, an upper bound on the error of the sequence of approximations [Maple Math] is given by [Maple Math] or [Maple Math] .

>

Alternatively, one can try to obtain an upper bound for the error which only uses calculated values. First notice that

> expr1:=abs(p[n+1]-p[n]);

[Maple Math]

> expr1=abs(g(p[n])-g(p[n-1]));

[Maple Math]

> expr1<=K*abs(p[n]-p[n-1]);

[Maple Math]

> expr1<=K^n*abs(p[1]-p[0]);

[Maple Math]

Then, for [Maple Math] , we have

> expr2:=abs(p[m]-p[n]);

[Maple Math]

> expr2=abs(`p[m]-p[m-1]+p[m-1]-...-p[n]`);

[Maple Math]

> expr2<=abs(p[m]-p[m-1])+abs(p[m-1]-p[m-2])+`...`+abs(p[n+1]-p[n]);

[Maple Math]

> expr2<=K^(m-1)*abs(p[1]-p[0])+K^(m-2)*abs(p[1]-p[0])+`...`+K^n*abs(p[1]-p[0]);

[Maple Math]

> expr2<=K^n*(1+K+`...`+K^(m-n-1))*abs(p[1]-p[0]);

[Maple Math]

so that with the limit of [Maple Math] going to [Maple Math] for [Maple Math] ,

> expr3:=abs(p-p[n]);

[Maple Math]

> expr3=lim(abs(p[m]-p[n]),m=infinity);

[Maple Math]

> expr3<=K^n*abs(p[1]-p[0])*Sum(K^i,i=0..infinity);

[Maple Math]

> expr3<=K^n*abs(p[1]-p[0])*sum(K^i,i=0..infinity);

[Maple Math]

The constant now is much smaller then previously and only uses values in the calculated sequence. This formula also shows that convergence will be very slow if [Maple Math] is close to 1.