Factorial estimate for Picard iteration Created 2026-10-25 Updated 2026-10-31
For Picard iteration , , assume and a Lipschitz constant on a rectangle containing every iterate. The first difference is at most . Integrating the preceding bound multiplied by proves the displayed estimate by mathematical induction. Its uniform bounds sum to a convergent exponential series for every finite , so the Weierstrass M-test gives uniform convergence without requiring .
For two arbitrary initial functions in a function set preserved by the Picard iteration operator , the same induction gives
Thus some iterate is a contraction mapping on any fixed finite interval for which every iterate stays in that set. The iterated contraction argument gives a unique fixed point of on a nonempty complete metric space, without requiring . For a rectangle with field bound and vertical radius , supplies the required self-mapping property.
Under , the same Picard iteration operator maps all of into itself. It need not be a contraction mapping in one step, since can exceed one. Instead repeated integration gives the factorial estimate for Picard iteration
proved inductively by integrating the preceding bound between and . Thus
For some the coefficient is less than one, so is a contraction. Its unique fixed point is also fixed by : and uniqueness forces . Conversely any fixed point of is one of . This iterated contraction argument gives a unique solution on the full interval , without the unjustified extra assumption .
The uniqueness statement is for solutions in the specified rectangle, where is given and controlled. The bound keeps the constructed solution inside that rectangle throughout the interval.
The contraction mapping theorem states that a contraction mapping on a nonempty complete metric space has a unique fixed point. Here contraction means that some satisfies for all .
For a proof, choose and iterate . Induction gives . For , the triangle inequality and a geometric series give
Thus the iterates form a Cauchy sequence, and completeness supplies a limit . A contraction mapping is continuous, so . If is another fixed point, , forcing . This proves existence and uniqueness.
For the exponential problem, use on the complete metric space . Its derivative is
Putting , the function has maximum at , as its derivative is . By the mean value theorem, , so is a contraction mapping on all of . Let be its unique fixed point. The compositions commute, so ; uniqueness of the fixed point of forces . Conversely every fixed point of is fixed by . Hence there is exactly one real solution of . It lies in because and then . This uses the iterated contraction argument without claiming that itself contracts on all of .
A contraction mapping on a metric space satisfies for all , with one constant . The contraction mapping theorem says that on a nonempty complete metric space such a map has a unique fixed point; successive iterates from any starting point converge to it. More precisely, if , then .
The Volterra integration operator maps continuous functions to continuous functions. In the uniform norm,
This constant cannot be decreased: for and , , and both uniform norms are one. Hence is not a contraction.
Changing the order of integration over the triangular region gives
Thus
is a contraction, with sharp constant . This is an example of an iterated contraction.