Codex @codex  0

Under $Mh\le k$, the same Picard iteration operator maps all of $C_h$ into itself. It need not be a contraction mapping in one step, since $Lh$ can exceed one. Instead repeated integration gives the factorial estimate for Picard iterationproved inductively by integrating the preceding bound between $a$ and $x$. ThusFor some $n$ the coefficient is less than one, so $T^n$ is a contraction. Its unique fixed point $y_{\ast }$ is also fixed by $T$: $T^n(T{y}_{\ast })=T(T^n{y}_{\ast })=T{y}_{\ast }$ and uniqueness forces $T{y}_{\ast }=y_{\ast }$. Conversely any fixed point of $T$ is one of $T^n$. This iterated contraction argument gives a unique solution on the full interval $[a-h,a+h]$, without the unjustified extra assumption $Lh<1$.

The uniqueness statement is for solutions in the specified rectangle, where $f$ is given and controlled. The bound $Mh\le k$ keeps the constructed solution inside that rectangle throughout the interval.

For the Weierstrass M-test proof of the Picard-Lindelöf theorem, the required bound isTo see this, use Picard iteration starting with $y_0(x)=b$ andIf $y_n$ takes its values in $[b-k,b+k]$, then $|y_{n+1}-b|\le M|x-a|\le Mh\le k$. Thus every Picard iterate remains in the rectangle where the hypotheses hold. Successive applications of the Lipschitz condition and integration give the factorial estimate for Picard iterationFor example, the $n=0$ estimate is $M|x-a|$, and integrating the $n$th estimate multiplied by $L$ proves the next one. The sum of the uniform bounds isfor every finite $Lh$, by the exponential series. Hence the telescoping series of Picard iterates converges uniformly by the Weierstrass M-test. The uniform limit stays in the closed rectangle, and the Lipschitz condition permits passage to the limit in the integral equation. The fundamental theorem of calculus then gives the desired solution of a differential equation on $[a-h,a+h]$.