Contractions and Iterated Sequences
Fixed Points and Contraction Mappings
Fixed point
A fixed point of a function is a point that does not move:
Graphically, it is an intersection point of the graph of with the line . Solving an equation can always be turned into a fixed-point search, for instance by setting or : this change of viewpoint is what makes iteration possible.
Contraction mappings
A function defined on a subset of is a contraction — also called -contracting — if there exists a constant with such that
This is exactly the definition of a -Lipschitz function, with the additional and decisive requirement : the function brings points closer together, by a factor of at least each time it is applied.
The mean value inequality gives the practical criterion: if is differentiable on an interval with , then is -contracting on .
Examples and counterexamples
| Function | Domain | Contraction? |
|---|---|---|
| yes, | ||
| yes, | ||
| yes, | ||
| no, | ||
| no, reaches |
Let us detail the first row: on , , since sine is increasing on this interval. The cosine function is therefore a contraction there.
Classic pitfall
Confusing "contraction" with "strictly brings points closer". The condition
is weaker than being a contraction, and it is not enough. On , the function satisfies , so it strictly brings every pair of points closer — and yet it has no fixed point, since would require . What is missing is a uniform constant .

