next up previous contents
Next: Linear Contractions Up: Iterated Function Systems Previous: Self-similarity and sets of

Contractions and Fixed Points

The essential features of the linear maps that lead to fractals is that they reduce distances. These sort of maps are called contractions.

Definition: Let X be a metric space with distance function d(x,y). A transformation tex2html_wrap_inline7984 is called a contraction if there is a number s, tex2html_wrap_inline7988 , such that for any two points tex2html_wrap_inline6970 we have

  equation2023

s is called a contractivity factor of w. The smallest possible s that works is sometimes called the contractivity factor of w.

It's a crucial point that the factor s be strictly less than one. If we iterate our contraction,

align2029

Since tex2html_wrap_inline8002 as tex2html_wrap_inline8004 , we obtain a basic fact:

Theorem: If X is a complete metric space, then

displaymath8008

exists and is independent of the choice of tex2html_wrap_inline7076 . Moreover, tex2html_wrap_inline8012 is the unique fixed point of w.

A little more discussion of this theorem is in order. Choose any point tex2html_wrap_inline7076 . Then

displaymath8018

is certainly an infinite sequence of points in X. What does completeness mean? It means that any bounded sequence has a point of accumulation which we will call tex2html_wrap_inline4950 . We claim there is only one point of accumulation. Suppose there were another one tex2html_wrap_inline8024 . We will show this assumption is impossible.

We begin by noting that tex2html_wrap_inline8026 does not wander too far away from x, i.e. that this sequence is bounded. Suppose d(x,w(x))=t (which might be 0). Then tex2html_wrap_inline8032 by the contraction property. By the triangle inequality for the distance function,

align2037

using the formula for the sum of a geometric series. Since s<1, this is bounded above by tex2html_wrap_inline8036 . Therefore, all the terms in the sequence of iterates remain within a bounded distance of x. Let's call this maximum distance M.

Returning to our assumption that two points of accumulation tex2html_wrap_inline4950 and tex2html_wrap_inline4952 exist, suppose tex2html_wrap_inline8046 . There is an integer N such that tex2html_wrap_inline8050 . Our hypothesis implies there are tex2html_wrap_inline8052 such that tex2html_wrap_inline8054 and tex2html_wrap_inline8056 . On the other hand,

displaymath8058

By the triangle inequality,

align2047

This leads to an absurd inequality tex2html_wrap_inline8060 . We have now established that our sequence tex2html_wrap_inline8062 has precisely one point of accumulation tex2html_wrap_inline8012 , and that

displaymath8066

If we apply w (which is continuous, although that takes a little sorting through) to each term of the sequence, we obtain the same limit, which proves that tex2html_wrap_inline8070 . The contraction property may again be employed to show this is the only fixed point of w and all sequences of iterates of w converge to this fixed point. This shows that the limit of the sequence of iterates is completely independent of the seed point.


next up previous contents
Next: Linear Contractions Up: Iterated Function Systems Previous: Self-similarity and sets of

David J. Wright
Mon Aug 19 17:21:15 CDT 1996