The contraction mapping theorem states that a contraction mapping on a nonempty complete metric space has a unique fixed point. Explicitly, if for all and one fixed , then the iterates converge to that fixed point from every . Both self-mapping and completeness are needed; the set need not be a vector space.
For , work on the closed subsetIt is a nonempty complete metric space because it is closed in the Banach space of continuous functions with the supremum norm. Define the Picard iteration operatorChoose so that and , omitting a bound whose constant is zero. Such a positive exists. The first inequality makes a self-map, since . The Lipschitz condition givesso the contraction mapping theorem yields a unique fixed point. The fundamental theorem of calculus makes it a differentiable solution of with ; conversely every solution staying in the rectangle satisfies the integral equation and is a fixed point. This is the local Picard-Lindelöf theorem construction. The interval-restricted space avoids treating functions defined on a shorter interval as elements of .
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 iterationproved inductively by integrating the preceding bound between and . ThusFor 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.
Where , . By the mean value theorem, the solution is strictly decreasing on every interval where it avoids . At , the derivative is zero, so a constant segment there is possible. Thus all solutions are nonincreasing, while strict decrease need not persist through an interval spent at that equilibrium.
For example, choose and around . On the rectangle, , so is continuous, and . The mean value theorem therefore supplies a Lipschitz constant . These choices even satisfy and .
While , separation of variables gives . Therefore the uniquely determined branch up to its first arrival at isIt reaches at , with derivative zero. The restriction is essential: extending the same quadratic beyond two would make its derivative positive and violate the original differential equation. Beyond that time the waiting-time continuation at a non-Lipschitz equilibrium is nonunique.
Two solutions for areFor the second, because ; both have value and derivative zero at two. They are distinct for every . Local Lipschitz continuity fails at the equilibrium, so the existence of these two continuations is compatible with the Picard-Lindelöf theorem.
For each departure time , defineEach branch satisfies the ordinary differential equation, and both joins have matching value and matching derivative zero. Thus is continuously differentiable and satisfies the same initial value problem. If , the solutions differ on , proving infinitely many solutions on every with .
The uniqueness hypotheses fail when the solution reaches . IndeedNo finite Lipschitz constant works on a rectangle containing that level in its interior. The local theorem still controls the earlier branch near zero; it cannot be extended through a point where its hypotheses fail. These are waiting-time continuations at a non-Lipschitz equilibrium.
Articles by others on the same topic
There are currently no matching articles.
